SIGN IN
SIGN UP
Approximation algorithms for data placement on parallel disks
Full Text:
PDF
Get this Article
Authors:
L. Golubchik
Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD
S. Khanna
Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA and Bell Laboratories, Murray Hill, NJ
S. Khuller
Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD
R. Thurimella
Department of Computer Science, The University of Denver, Denver, CO and University of Maryland
A. Zhu
Computer Science Department, Stanford University, Stanford, CA and Department of Computer Science at the University of Maryland
2000 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 4
· Downloads (cumulative): 320
· Citation Count: 23
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pages 223-232
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2000
table of contents
ISBN:0-89871-453-2
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
approximation
approximation algorithms analysis
concurrency
design
file systems management
mathematical optimization
measurement
multimedia information systems
parallel computing models
performance
theory
verification
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder