Strong convexity results for queueing systems
Operations Research
Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems
IEEE Transactions on Computers
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
IEEE Transactions on Parallel and Distributed Systems
Grid Computing: Making the Global Infrastructure a Reality
Grid Computing: Making the Global Infrastructure a Reality
Rate-Based and Queue-Based Dynamic Load Balancing Algorithms in Distributed Systems
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Resource Allocation in the Grid Using Reinforcement Learning
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
On the Distribution of Sequential Jobs in Random Brokering for Heterogeneous Computational Grids
IEEE Transactions on Parallel and Distributed Systems
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
A novel server-side proxy caching strategy for large-scale multimedia applications
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Scheduling stochastic workloads is a difficult task. We analyze minimum average response time of computational grids composed of nodes with multiple processors when stochastic workloads are scheduled to the grids. We propose an algorithm to achieve minimum average response time of grids. We compare the minimum average response time of grids with the average response time of grids with load balancing scheduling in different cases. Specifically, we analyze the impact of differential processor speeds, the number of processors per node, and utilization rate of the grids on the difference between these two scheduling strategies. These analysis provide deeper understanding of average response time of grids, which will allow us to design more efficient algorithms for Grid workload scheduling.