Wang, Chien-MinChien-MinWangHsu, Chun-ChenChun-ChenHsuPANGFENG LIUChen, Hsi-MinHsi-MinChenWu J.-J.2009-05-062018-07-052009-05-062018-07-05200709208542http://ntur.lib.ntu.edu.tw//handle/246246/155131https://www.scopus.com/inward/record.uri?eid=2-s2.0-34948850378&doi=10.1007%2fs11227-007-0118-4&partnerID=40&md5=19963cf55fadd240d1815c3705a45b53In this paper, we address some problems related to server placement in Grid environments. Given a hierarchical network with requests from clients and constraints on server capability, the minimum server placement problem attempts to place the minimum number of servers that satisfy requests from clients. Instead of using a heuristic approach, we propose an optimal algorithm based on dynamic programming to solve the problem. We also consider the balanced server placement problem, which tries to place a given number of servers appropriately so that their workloads are as balanced as possible. We prove that an optimal server placement can be achieved by combining the above algorithm with a binary search on workloads. This approach can be further extended to deal with constrains on network capability. The simulation results clearly show the improvement in the number of servers and the maximum workload. Furthermore, as the maximum workload is reduced, the waiting time is reduced accordingly. © 2007 Springer Science+Business Media, LLC.application/pdf888506 bytesapplication/pdfen-USFile replication; Grids; Queueing systems; Server placement; Waiting time; WorkloadDynamic programming; Grid computing; Heuristic methods; Optimization; Problem solving; File replication; Queueing systems; Server placement; Waiting time; Workload; Hierarchical systemsjournal article10.1007/s11227-007-0118-42-s2.0-34948850378http://ntur.lib.ntu.edu.tw/bitstream/246246/155131/1/09.pdf