论文信息 - A Comparative Study of Load Sharing on Networks of Workstations

A Comparative Study of Load Sharing on Networks of Workstations

Networks of workstations (NOWs) can be used for parallel processing by using public domain software like PVM. There are significant differences between a real parallel system and a NOW-based system. As a result, load sharing on a NOW can be different from that on a parallel machine. Therefore, it is important to understand the factors that influence the performance of load sharing algorithms on NOWs. To gain this understanding, we study performance of a matrix multiplication application on a network of heterogeneous workstations that uses the PVM. We report performance of five load sharing algorithms that use fixed, variable, and adaptive task granularity.

Sivarama P. Dandamudi | A. Piotrowski | S. Dandamudi | A. Piotrowski

[1] Jack J. Dongarra,et al. A message passing standard for MPP and workstations , 1996, CACM.

[2] Miron Livny,et al. The Available Capacity of a Privately Owned Workstation Environmont , 1991, Perform. Evaluation.

[3] Edith Schonberg,et al. Factoring: a method for scheduling parallel loops , 1992 .

[4] Sivarama P. Dandamudi,et al. Performance of a Parallel Application on a Network of Workstations , 1997 .

[5] Sivarama P. Dandamudi,et al. A hierarchical processor scheduling policy for distributed-memory multicomputer systems , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[6] Al Geist,et al. Network-based concurrent computing on the PVM system , 1992, Concurr. Pract. Exp..

[7] David E. Culler,et al. A case for NOW (networks of workstation) , 1995, PODC '95.

[8] Geoffrey C. Fox,et al. Hierarchical Scheduling of Dynamic Parallel Computaion on Hypercube Multicomputers , 1994, J. Parallel Distributed Comput..

[9] CONSTANTINE D. POLYCHRONOPOULOS,et al. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers , 1987, IEEE Transactions on Computers.