SIGN IN
SIGN UP
Parallel processor scheduling with delay constraints
Full Text:
Pdf
Buy this Article
Authors:
Daniel W. Engels
MIT Laboratory for Computer Science, Cambridge, MA
Jon Feldman
MIT Laboratory for Computer Science, Cambridge, MA
David R. Karger
MIT Laboratory for Computer Science, Cambridge, MA
Matthias Ruhl
MIT Laboratory for Computer Science, Cambridge, MA
2001 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Citation Count: 1
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2001
table of contents
ISBN:0-89871-490-7
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
general
parallelism and concurrency
reliability
sequencing and scheduling
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder