On the complexity of list scheduling algorithms for distributed-memory systems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Andrei Rădulescu Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands
Arjan J. C. van Gemund Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands
Published in:
Cover Image
 
· Proceeding
ICS '99 Proceedings of the 13th international conference on Supercomputing
Pages 68-75
ACM New York, NY, USA ©1999
table of contents ISBN:1-58113-164-X doi>10.1145/305138.305162
On the complexity of list scheduling algorithms for distributed-memory systems Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 16
· Downloads (cumulative): 494
· Citation Count: 10


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder