Parallel depth first vs. work stealing schedulers on CMP architectures

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Vasileios Liaskovitis Carnegie Mellon University
Shimin Chen Intel Research Pittsburgh
Phillip B. Gibbons Intel Research Pittsburgh
Anastassia Ailamaki Carnegie Mellon University
Guy E. Blelloch Carnegie Mellon University
Babak Falsafi Carnegie Mellon University
Limor Fix Intel Research Pittsburgh
Nikos Hardavellas Carnegie Mellon University
Michael Kozuch Intel Research Pittsburgh
Todd C. Mowry Carnegie Mellon University and Intel Research Pittsburgh
Chris Wilkerson Intel Microprocessor Research Lab
Parallel depth first vs. work stealing schedulers on CMP architectures Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 34
· Downloads (cumulative): 523
· Citation Count: 1

Published in:
Cover Image
 
· Proceeding
SPAA '06 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Pages 330 - 330
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-452-9 doi>10.1145/1148109.1148167

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