Dynamic memory adjustment for external mergesort (1997) [11 citations — 0 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zhang97dynamicmemory,author = {Weiye Zhang and Per- Ake Larson},
title = {Dynamic memory adjustment for external mergesort},
booktitle = {In VLDB},
year = {1997},
pages = {25--29},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Abstract:
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory space varies, static memory allocation either wastes memory space or fails to make full use of memory to speed up sorting. This paper presents a method for run-time adjustment of in-memory work space for external mergesort and a policy for allocating memory among concurrent, competing sorts. Experimental results confirm that the new method enables sorts to adapt their memory usage gracefully to the actual input size and available memory space. When multiple sorts compete for memory resources, we found that sort throughput and response time are improved significantly by our policy for memory allocation combined with limiting the number of sorts processed concurrently.
Citations
| 521 | Query evaluation techniques for large databases – Graefe - 1993 |
| 221 | Sorting and Searching, volume 3 of The Art of Computer Programming – Knuth - 1998 |
| 38 | An Adaptive Hash Join Algorithm for Multiuser Environments – Zeller, Gray - 1990 |
| 19 | Memory-adaptive external sorting – Pang, Carey, et al. |
| 17 | Partially preemptible hash joins – Pang, Carey - 1993 |
| 9 | Memory-Contention Responsive Hash Joins – Davison, Graefe - 1994 |
| 1 | TPC Benchmark(tm) D (Decision Support), Working Draft 9.1. Transaction Processing Performance Council – Raab - 1995 |
