Optimizing read convoys in main-memory query processing
Author:
Open Access
- 7 June 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 27-33
Abstract
Concurrent read-only scans of memory-resident fact tables can form convoys, which generally help performance because cache misses are amortized over several members of the convoy. Nevertheless, we identify two performance hazards for such convoys. One hazard is underutilization of the memory bandwidth because all members of the convoy hit the same cache lines at the same time, rather than reading several different lines concurrently. The other hazard is a form of interference that occurs on the Sun Niagara T1 and T2 machines under certain workloads. We propose solutions to these hazards, including a local shuffle method that reduces interference, preserves the beneficial aspects of convoy behavior, and increases the effective bandwidth by allowing different members of a convoy to concurrently access different cache lines. We provide experimental validation of the methods on several modern architectures.Keywords
Funding Information
- Division of Information and Intelligent Systems (IIS-0534389IIS-0915956)
This publication has 5 references indexed in Scilit:
- Automatic contention detection and amelioration for data-intensive operations2010
- Main-memory scan sharing for multi-core CPUsProceedings of the VLDB Endowment, 2008
- Integrating compression and execution in column-oriented database systems2006
- Buffering databse operations for enhanced instruction cache performance2004
- The convoy phenomenonACM SIGOPS Operating Systems Review, 1979