Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
The input/output complexity of sorting and related problems
Communications of the ACM
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Merging sorted runs using large main memory
Acta Informatica
IBM Systems Journal
Flexible buffer allocation based on marginal gains
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Buffer management based on return on consumption in a multi-query environment
The VLDB Journal — The International Journal on Very Large Data Bases
System Issues in Parallel Sorting for Database Systems
Proceedings of the Sixth International Conference on Data Engineering
Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis
Proceedings of the Eighth International Conference on Data Engineering
Predictive Load Control for Flexible Buffer Allocation
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A study of integrated prefetching and caching strategies
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ACM Transactions on Computer Systems (TOCS)
Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System
Distributed and Parallel Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
We study the performance of various run-time thrashing control policies for the merge phase of concurrent mergesorts using parallel prefetching, where initial sorted runs are stored on multiple disks and the final sorted run is written back to another dedicated disk. Parallel prefetching via multiple disks can be attractive in reducing the response times for concurrent mergesorts. However, severe thrashing may develop due to imbalances between input and output rates, thus a large number of prefetched pages in the buffer can be replaced before referenced. We evaluate through detailed simulations three run-time thrashing control policies: (a) disabling prefetching, (b) forcing synchronous writes and (c) lowering the prefetch quantity in addition to forcing synchronous writes. The results show that (1) thrashing resulted from parallel prefetching can severely degrade the system response time; (2) though effective in reducing the degree of thrashing, disabling prefetching may worsen the response time since more synchronous reads are needed; (3) forcing synchronous writes can both reduce thrashing and improve the response time; (4) lowering the prefetch quantity in addition to forcing synchronous writes is most effective in reducing thrashing and improving the response time.