A comparative evaluation of implicit coscheduling strategies for networks of workstations

Proceedings of the IEEE International Symposium on High Performance Distributed Computing

Volumn 2000-January, Issue , 2000, Pages 221-228

  Anglano, C ^a  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

Communication system control; Computer networks; Concurrent computing; Delay; Dynamic scheduling; Network servers; Processor scheduling; Throughput; Time sharing computer systems; Workstations

Indexed keywords

COMPLEX NETWORKS; COMPUTER CONTROL SYSTEMS; COMPUTER NETWORKS; CONCURRENCY CONTROL; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; SCHEDULING; SERVERS; THROUGHPUT; TIME SHARING SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; COMPUTER WORKSTATIONS; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION;

COMMUNICATION SYSTEM CONTROL; CONCURRENT COMPUTING; DELAY; DYNAMIC SCHEDULING; NETWORK SERVER; PROCESSOR SCHEDULING; TIME-SHARING;

COMPUTER WORKSTATIONS; COMPUTER NETWORKS;

IMPLICIT COSCHEDULING STRATEGY; NETWORKS OF WORKSTATIONS;

EID: 0033681596     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPDC.2000.868653     Document Type: Conference Paper

References (17)

1. R. Arpaci, A. Dusseau., A. Vahdat, L. Liu, T. Anderson, and D. Patterson. The Interaction of Parallel and Sequential Workloads on a Network of Workstations. In Proceedings of ACM SIGMETRICS'95, pages 267-278, May 1995.
2. M. Atallah, C. Black, D. Marinescu, H. Siegel, and T. Casavant. Models and Algorithms for Co-scheduling Compute-Intensive Tasks on a Network of Workstations. Journal of Parallel and Distrbuted Computing, 16:319-327, 1992.
3. D. Bailey, T. Harris, R. D. Wigngaart, W. S. W. Woo, and M. Yarrow. The NAS Parallel Benchmarks 2.0. Technical Report NAS-95-010, NASA Ames Research Center, 1995.
4. M. Devarakonda and R. Iyer. Predictability of Process Resource Usage: A Measurement-Based Study on Unix. IEEE Trans. on Software Engineering, 15(12), December 1989.
5. A. Downey and M.Harchol-Balter. Exploiting Process Lifetime Distributions for Dynamic Load Balancing. ACM Trans. on Computer Systems, 15(3):253-385, August 1997.
6. A. Dusseau, R. Arpaci, and D. Culler. Effective Distributed Scheduling of Parallel Workloads. In Proceedings of ACM SIGMETRICS'96, 1996.
7. A. Dusseau-Arpaci, D. Culler, and A. Mainwaring. Scheduling with Implicit Information in Distributed Systems. In Proceedings of ACM SIGMETRICS'98, 1998.
8. D. G. Feitelson and L. Rudolph. Gang Scheduling Performance Benefits for Fine-Grained Synchronization. Journal of Parallel and Distributed Computing, 16(4):306-18, December 1992.
9. GAMMA homepage. http://www.disi.unige.it/project/gamma.
10. M. Harchol-Balter, M. Crovella, and C. Murta. On Choosing a Task Assignment Policy for a Distributed Server System. Journal of Parallel and Distributed Computing, 59:204-228, 1999.
11. A. Karlin, M. Manasse, L. McGeoch, and S. Owicki. Competitive Randomized Algorithms for Nonuniform Problems. Algorithmica, 11(6):542-571, June 1994.
12. W. Leland and T. Ott. Load-Balancing Heuristics and Process Behavior. In Proceedings of ACM SIGMETRICS '86, pages 54-69, 1986.
13. S. Nagar, A. Banerjee, A. Sivasubramaniam, and C. Das. Alternatives to Coscheduling a Network of Workstations. Journal of Parallel and Distributed Computing, 59:302-327, 1999.
14. J. K. Ousterhout. Scheduling Techniques for Concurrent Systems. In Third International Conference on Distributed Computing Systems, pages 22-30, May 1982.
15. P. Sobalvarro, S. Pakin, W. Weihl, and A. Chien. Dynamic Coscheduling on Workstation Clusters. In Proceedings of IPPS '98 Workshop on Job Scheduling Strategies for Parallel Processing, 1998.
16. SUN Microsystems. Solaris 2.6 Software Developer Collection Vol 1: System Interface Guide, 1997.
17. U. Vahalia. Unix Internals: The New Frontiers. Prentice Hall, 1996.