SIGN IN
SIGN UP
Allocating weighted jobs in parallel
Full Text:
PDF
Buy this Article
Authors:
Petra Berenbrink
Heinz Nixdorf Institute and Dept. of Computer Science, University Paderborn, D-33102 Paderborn, Germany
Friedhelm Meyer auf der Heide
Heinz Nixdorf Institute and Dept. of Computer Science, University Paderborn, D-33102 Paderborn, Germany
Klaus Schröder
Heinz Nixdorf Institute and Dept. of Computer Science, University Paderborn, D-33102 Paderborn, Germany
Published in:
· Proceeding
SPAA '97
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Pages 302-310
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-890-8
doi>
10.1145/258492.258522
1997 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 242
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithm design and analysis
algorithms
allocation/deallocation strategies
design
measurement
parallelism and concurrency
performance
standardization
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