Minimizing migrations in fair multiprocessor scheduling of persistent tasks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Tracy Kimbrel IBM T.J. Watson Research Center, Yorktown, Heights, NY
Baruch Schieber IBM T.J. Watson Research Center, Yorktown, Heights, NY
Maxim Sviridenko IBM T.J. Watson Research Center, Yorktown, Heights, NY
Published in:
· Proceeding
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 982-991
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2004
table of contents ISBN:0-89871-558-X
Minimizing migrations in fair multiprocessor scheduling of persistent tasks 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 14
· Downloads (cumulative): 368
· Citation Count: 2


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