Dynamic Memory Adjustment for External Mergesort.
Weiye Zhang, Per-Åke Larson:
Dynamic Memory Adjustment for External Mergesort.
VLDB 1997: 376-385@inproceedings{DBLP:conf/vldb/ZhangL97,
author = {Weiye Zhang and
Per-{\AA}ke Larson},
editor = {Matthias Jarke and
Michael J. Carey and
Klaus R. Dittrich and
Frederick H. Lochovsky and
Pericles Loucopoulos and
Manfred A. Jeusfeld},
title = {Dynamic Memory Adjustment for External Mergesort},
booktitle = {VLDB'97, Proceedings of 23rd International Conference on Very
Large Data Bases, August 25-29, 1997, Athens, Greece},
publisher = {Morgan Kaufmann},
year = {1997},
isbn = {1-55860-470-7},
pages = {376-385},
ee = {db/conf/vldb/ZhangL97.html},
crossref = {DBLP:conf/vldb/97},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
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 being
processed concurrently.
Copyright © 1997 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Matthias Jarke, Michael J. Carey, Klaus R. Dittrich, Frederick H. Lochovsky, Pericles Loucopoulos, Manfred A. Jeusfeld (Eds.):
VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece.
Morgan Kaufmann 1997, ISBN 1-55860-470-7
Contents BibTeX
Electronic Edition
From CS Dept.,
University Trier (Germany)
References
- [DG94]
- Diane L. Davison, Goetz Graefe:
Memory-Contention Responsive Hash Joins.
VLDB 1994: 379-390 BibTeX
- [Gra93]
- Goetz Graefe:
Query Evaluation Techniques for Large Databases.
ACM Comput. Surv. 25(2): 73-170(1993) BibTeX
- [Knu73]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
- [NBC+94]
- Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray, David B. Lomet:
AlphaSort: A RISC Machine Sort.
SIGMOD Conference 1994: 233-242 BibTeX
- [PCL93a]
- HweeHwa Pang, Michael J. Carey, Miron Livny:
Memory-Adaptive External Sorting.
VLDB 1993: 618-629 BibTeX
- [PCL93b]
- HweeHwa Pang, Michael J. Carey, Miron Livny:
Partially Preemptive Hash Joins.
SIGMOD Conference 1993: 59-68 BibTeX
- [Raa95]
- ...
- [ZG90]
- Hansjörg Zeller, Jim Gray:
An Adaptive Hash Join Algorithm for Multiuser Environments.
VLDB 1990: 186-197 BibTeX
Referenced by
- Weiye Zhang, Per-Åke Larson:
Buffering and Read-Ahead Strategies for External Mergesort.
VLDB 1998: 523-533
- Jeffrey Scott Vitter:
External Memory Algorithms.
PODS 1998: 119-128
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings: Copyright © by VLDB Endowment,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:46:17 2009
