Dynamic coscheduling on workstation clusters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1459, Issue , 1998, Pages 231-256

  Sobalvarro, Patrick G ^a   Pakin, Scott ^b   Weihl, William E ^a   Chien, Andrew A ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLOCK SYNCHRONIZATION; COMMUNICATING PROCESS; DYNAMIC COSCHEDULING; EMPIRICAL - COMPARISONS; HIGH PERFORMANCE NETWORKS; ORDERS OF MAGNITUDE; PARALLEL SCHEDULING; WORKSTATION CLUSTERS;

SCHEDULING;

EID: 84948964005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053990     Document Type: Conference Paper

References (22)

1. Nanette J. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, and Wen-King Su. Myrinet—a gigabit-persecond local-area network. IEEE Micro, 15(1):29-36, February 1995. Available from http://www.myri.cora/research/publications/Hot.ps.
2. [2] Rohit Chandra, Scott Devine, Ben Verghese, Anoop Gupta, and Mendel Rosenblum. Scheduling and page migration for multiprocessor compute servers. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 12-24, San Jose, California, 1994.
3. Andrea C. Dusseau, Remzi H. Arpaci, and David E. Culler. Effective distributed scheduling of parallel workloads. In ACM SIGMETRICS '96 Conference on the Measurement and Modeling of Computer Systems, 1996. Available from http://www.cs.berkeley.edu/~dusseau/Papers/sigmetrics96.ps.
4. [4] Dror G. Feitelson and Larry Rudolph. Distributed hierarchical control for parallel processing. IEEE Computer, 23(5):65-77, May 1990.
5. [5] Dror G. Feitelson and Larry Rudolph. Gang Scheduling Performance Benefits for Fine-Grained Synchronization. Journal of Parallel and Distributed Computing, 16(4):306--18, December 1992.
6. [6] Dror G. Feitelson and Larry Rudolph. Coscheduling based on run-time identification of activity working sets. International Journal of Parallel Programming, 23(2):135-160, April 1995.
7. Richard B. Qillett. Memory Channel network for PCI. IEEE Micro, 16(1):12-18, February 1996. Available from http://www.computer.org/pubs/micro/web/mlgil.pdf.
8. Anoop Gupta, Andrew Tucker, and Shigeru Urushibara. The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications. In ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 120-132, May 1991. Available from http://xenon.stanford.edu/~tucker/papers/sigmetrics.ps.
9. [9] D. B. Gustavson. The scalable coherent interface and related standards projects. IEEE Micro, 12(1), Feb. 1992.
10. [10] Sun Microsystems Inc. ts_dptbl(4) manual page. SunOS 5.4 Manual. Section 4.
11. [11] Mario Lauria and Andrew Chien. MPI-FM: High performance MPI on workstation clusters. Submitted to the Journal of Parallel and Distributed Computing. Available from http://www-csag.cs.uiuc.edu/papers/mpi-fm.ps.
12. [12] John K. Ousterhout. Scheduling techniques for concurrent systems. In Proceedings of the 3rd International Conference on Distributed Computing Systems, pages 22-30, October 1982.
13. [13] Scott Pakin, Vijay Karamcheti, and Andrew A. Chien. Fast Messages (FM): Efficient, portable communication for workstation clusters and massively-parallel processors. IEEE Concurrency, 1997.
14. [14] Scott Pakin, Mario Lauria, Matt Buchanan, Kay Hane, Louis Giannini, Jane Prusakova, and Andrew Chien. Fast Messages 2.0 User Documentation, October 1996.
15. [15] Scott Pakin, Mario Lauria, and Andrew Chien. High performance messaging on workstations: Illinois Fast Messages (FM) for Myrinet. In Supercomputing, December 1995. Available from http://www-csag.cs.uiuc.edu/papers/myrinet-fm-sc95.ps.
16. Patrick G. Sobalvarro. Demand-based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors. PhD thesis, Massachusetts Institute of Technology, 1997. MIT/LCS/TR-710.
17. Patrick G. Sobalvarro and William E. Weihl. Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors. In Proceedings of the Parallel Job Scheduling Workshop at IPPS '95, 1995. Available from http://www.psg.lcs.mit.edu/~pgs/papers/jsw-for-springer.ps. Also appears in Springer-Verlag Lecture Notes in Computer Science, Vol. 949.
18. [18] Andrew Tucker. Efficient scheduling on multiprogrammed shared-memory multiprocessors. Technical Report CSL-TR-94-601, Stanford University Department of Computer Science, November 1993. Available from http://elib.stanford.edu/Dienst/UI/2.0/Describe/stanford.cs/CSL-TR-94-601.
19. Andrew Tucker and Anoop Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proceedings of the 12th ACM SIGOPS Symposium on Operating Systems Principles, pages 159-186, 1989. Available from http://xenon.stanford.edu/~tucker/papers/sosp.ps.
20. [20] T. von Eicken, D. Culler, S. Goldstein, and K. Schauser. Active Messages: a mechanism for integrated communication and computation. In Proceedings of the International Symposium on Computer Architecture, 1992.
21. Thorsten von Eicken, Anindya Basu, Vineet Buch, and Werner Vogels. U-Net: A user-level network interface for parallel and distributed computing. In Proceedings of the 15th ACM Symposium on Operating Systems Principles, December 1995. Available from http://www.cs.cornel1.edu/Info/Projects/ATM/sosp.ps.
22. Carl A. Waldspurger. Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. PhD thesis, Massachusetts Institute of Technology, 1995. MIT/LCS/TR-667.