SIGN IN
SIGN UP
Preemptive scheduling of parallel jobs on multiprocessors
Full Text:
PDF
Buy this Article
Authors:
Xiaotie Deng
Dept. of CS, York University, North York, Canada, M3J 1P3
Nian Gu
Dept. of CS, York University, North York, Canada M3J 1P3
Tim Brecht
Dept. of CS, York University, North York, Canada M3J 1P3
KaiCheng Lu
Dept. of CS, TsingHua University, Beijing, China, 100084
1996 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 19
· Downloads (cumulative): 399
· Citation Count: 14
Published in:
· Proceeding
SODA '96
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Pages 159-167
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1996
table of contents
ISBN:0-89871-366-8
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
parallelism and concurrency
performance
reliability
scheduling
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