Data placement in Bubba
George P. Copeland, William Alexander, Ellen E. Boughter et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1988
This paper examines the problem of data placement in Bubba, a highly-parallel system for data-intensive applications being developed at MCC. “Highly-parallel” implies that load balancing is a critical performance issue. “Data-intensive” means data is so large that operations should be executed where the data resides. As a result, data placement becomes a critical performance issue.
Cited by 151 works. doi:10.1145/50202.50213 Open-access PDF
Authors
References
- Notes on data base operating systems
- Computer architecture and parallel processing
- GAMMA—a high performance dataflow database machine
- Quantitative System Performance.
- The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time
- Optimum data base reorganization points
- Optimal reorganization of distributed space disk files
- Process and dataflow control in distributed data-intensive systems
- Site Initialization, Recovery, and Backup in a Distributed Database System
- Process and dataflow control in distributed data-intensive systems