Infinite parallel job allocation (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Petra Berenbrink Dept. of Mathematics & Computer Science, Paderborn University, D-33095 Paderborn, Germany
Artur Czumaj Department of Computer and Information Science, New Jersey Institute of Technology, University Heights, Newark, NJ
Tom Friedetzky Institut für Informatik, Technische Universität München, D-80290 München, Germany
Nikita D. Vvedenskaya Institute of Information Transmission Problems, Russian Academy of Science, Moscow 101447, Russia
Infinite parallel job allocation (extended abstract) Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 202
· Citation Count: 2

Published in:
Cover Image
 
· Proceeding
SPAA '00 Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Pages 99-108
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-185-2 doi>10.1145/341800.341813

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