Maximizing data locality in distributed systems

Journal of Computer and System Sciences

Volumn 72, Issue 8, 2006, Pages 1309-1316

  Chung, Fan ^a   Graham, Ronald ^a   Bhagwan, Ranjita ^b   Savage, Stefan ^a   Voelker, Geoffrey M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Bin packing; Combinatorial algorithms; Distributed systems

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DISTRIBUTED DATABASE SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; BIN PACKING; COMBINATORIAL ALGORITHMS; DATA OBJECTS;

DATA STRUCTURES;

EID: 33750488747     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.07.001     Document Type: Article

References (14)

1. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, B. Zhao, OceanStore: An architecture for global-scale persistent storage, in: Proceedings of ACM ASPLOS, 2000
2. F. Dabek, M. Kaashoek, D. Karger, R. Morris, I. Stoica, Wide-area cooperative storage with CFS, in: Proceedings of the 18th ACM Symposium on Operating System Principles, SOSP, 2001
3. A. Rowstron, P. Druschel, Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility, in: Proceedings of ACM Symposium on Operating Systems Principles, SOSP '01, 2001
4. A. Muthitacharoen, R. Morris, T. M. Gil, B. Chen, IVY: A read/write peer-to-peer file system, in: Proceedings of 5th Symposium on Operating Systems Design and Implementation, 2002
5. In: Foster I., and Kesselman C. (Eds). The Grid: Blueeprint for a New Computing Infrastructure (1999), Morgan Kaufmann
6. Search for extra-terrestrial intelligence (SETI). http://setiathome.ssl.berkeley.edu/
7. Berkeley open infrastructure for network computing (BOINC). http://boinc.ssl.berkeley.edu/
8. F. Junqueira, R. Bhagwan, A. Hevia, K. Marzullo, G.M. Voelker, Surviving internet catastrophes, in: Proceedings of the USENIX Annual Technical Conference, 2005
9. Coffman Jr. E.G., Garey M.R., and Johnson D.S. Approximation algorithms for bin packing-A survey. Approximation Algorithms for NP-Hard Problems (1996), PWS Publications, Boston 46-96
10. Coffman Jr. E.G., and Lueker G. Approximation algorithms for extensible bin-packing. J. Sched. 9 (2006) 77-84
11. Coffman Jr. E.G., Courcoubetis C., Garey M.R., Johnson D.S., Shor P.W., Weber R.R., and Yannakakis M. Perfect packing theorems and the average-case behavior of optimal and online bin packing. SIAM J. Discrete Math. 13 (2000) 384-402
12. Seiden S.S. On the online bin packing problem. J. ACM 49 (2002) 640-671
13. Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972), Plenum Press, New York 85-103
14. Garey M.R., and Johnson D.S. Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4 (1975) 397-411