Guided self-scheduling: A practical scheduling scheme for parallel supercomputers
IEEE Transactions on Computers
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
On Runtime Parallel Scheduling for Processor Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations
IEEE Transactions on Parallel and Distributed Systems
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Affinity scheduling of unbalanced workloads
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Programming a Hypercube Multicomputer
IEEE Software
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Loop scheduling for heterogeneity
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
Modeling and characterizing parallel computing performance on heterogeneous networks of workstations
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Dynamic task scheduling for irregular network topologies
Parallel Computing - Heterogeneous computing
On the load distribution and performance of meta-computing systems
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
| Hi-index | 0.00 |
A network of workstations (NOWs) may be employed for high performance computing where execution time of a target job is to be minimized. Job arrival rate and size are "random" on a NOWs. In such an environment, partitioning (load balancing) a target job based on only the first order moments (means) of system parameters is not optimal. In this paper, it is proposed to consider the second order moments (standard deviations) also in load balancing in order to minimize execution time of a target job on a set of workstations where the round-robin job scheduling policy is adopted. It has been verified through computer simulation that the proposed static and dynamic load balancing schemes can significantly reduce execution time of a target job in a NOWs environment, compared to cases where only the means of the parameters are used.