Minimizing the stretch when scheduling flows of biological requests

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Arnaud Legrand Laboratoire ID-IMAG, France
Alan Su Google Inc., Cambridge, MA
Frédéric Vivien INRIA - LIP, ENS Lyon, France
Published in:
Cover Image
 
· Proceeding
SPAA '06 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Pages 103 - 112
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-452-9 doi>10.1145/1148109.1148124
Minimizing the stretch when scheduling flows of biological requests Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 24
· Downloads (cumulative): 1,619
· Citation Count: 4


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