ACM Home Page
Please provide us with feedback. Feedback
A closer look at coscheduling approaches for a network of workstations
Full text PdfPdf (1.38 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures table of contents
Saint Malo, France
Pages: 96 - 105  
Year of Publication: 1999
ISBN:1-58113-124-0
Authors
Shailabh Nagar  Department of Computer Science & Engineering, The Pennsylvania State University, University Park, PA
Ajit Banerjee  Department of Computer Science & Engineering, The Pennsylvania State University, University Park, PA
Anand Sivasubramaniam  Department of Computer Science & Engineering, The Pennsylvania State University, University Park, PA
Chita R. Das  Department of Computer Science & Engineering, The Pennsylvania State University, University Park, PA
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Citation Count: 13
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/305619.305630
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
A. C. Arpaci-Dusseau and D. E. Culler. Extending Proportional Share Scheduling to a Network of Workstations. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, June 1997.
4
 
5
A. Banerjee. Implementation and Evaluation of MPI over Myrinet. Master's thesis, Dept. of Computer Science and Engineering, Penn State University, University Park, PA 16802, May 1999.
 
6
 
7
M. Buchanan and A. Chien. Coordinated Thread Scheduling for Workstation Clusters under Windows NT. In Proceedings of the USENIX Windows NT Workshop, August 1997.
 
8
 
9
D. G. Feitelson and L. Rudolph. Gang Scheduling Performance Benefits for Fine-Grained Synchronization. Journal of Parallel and Distributed Computing, 16(4):306-318, December 1992.
 
10
 
11
 
12
13
 
14
Message Passing interface (MPI) Forum. Document for a standard Message Passing interface, 1994.
 
15
S. Nagar, A. Banerjee, A. Sivasubramaniam, and C. R. Das. An Experimental Study of Scheduling Strategies for a Network of Workstations. Technical Report CSE-98-009, Dept. of Computer Science and Engineering, The Pennsylvania State University, July 1998.
 
16
J. K. Ousterhout. Scheduling Techniques for Concurrent Systems. In Proceedings of the 3rd International Conference on Distributed Computing Systems, pages 22-30, May 1982.
17
18
 
19
 
20
 
21
 
22
23
24
 
25
E Wong, D. Culler, and B. Saphir. MPI Performance on AM- II and GAM. http://now.CS.Berkeley.EDU/Fastcomm/MPI.
26

CITED BY  13

Collaborative Colleagues:
Shailabh Nagar: colleagues
Ajit Banerjee: colleagues
Anand Sivasubramaniam: colleagues
Chita R. Das: colleagues