A Performance Study of Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System.
Kun-Lung Wu, Philip S. Yu, Jen-Yao Chung, James Z. Teng:
A Performance Study of Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System.
VLDB 1995: 100-109@inproceedings{DBLP:conf/vldb/WuYCT95,
author = {Kun-Lung Wu and
Philip S. Yu and
Jen-Yao Chung and
James Z. Teng},
editor = {Umeshwar Dayal and
Peter M. D. Gray and
Shojiro Nishio},
title = {A Performance Study of Workfile Disk Management for Concurrent
Mergesorts in a Multiprocessor Database System},
booktitle = {VLDB'95, Proceedings of 21th International Conference on Very
Large Data Bases, September 11-15, 1995, Zurich, Switzerland},
publisher = {Morgan Kaufmann},
year = {1995},
isbn = {1-55860-379-4},
pages = {100-109},
ee = {db/conf/vldb/WuYCT95.html},
crossref = {DBLP:conf/vldb/95},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
This paper studies the impacts of work- file disk allocation and data striping on the performance of concurrent mergesorts in a multiprocessor database system.
We examine through detailed simulations an approach where workfile disks are logically partitioned into equal-sized groups and an arriving sort job selects one group to do the mergesort.
The results show that (1) without data striping, the best performance is achieved by using the entire workfile disks as a single partition if there are abundant workfile disks (or system workload is light); (2) however, ifthere are limited workfile disks (or system workload is heavy), the workfile disks should be partitioned into multiple groups and the optimal partition size is workload dependent; (3) data striping is beneficial only if the striping unit size is properly chosen.
Copyright © 1995 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 ...
Printed Edition
Umeshwar Dayal, Peter M. D. Gray, Shojiro Nishio (Eds.):
VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, September 11-15, 1995, Zurich, Switzerland.
Morgan Kaufmann 1995, ISBN 1-55860-379-4
Contents 
References
- [AV88]
- Alok Aggarwal, Jeffrey Scott Vitter:
The Input/Output Complexity of Sorting and Related Problems.
Commun. ACM 31(9): 1116-1127(1988)
- [B+94]
- Steven Berson, Shahram Ghandeharizadeh, Richard R. Muntz, Xiangyu Ju:
Staggered Striping in Multimedia Information Systems.
SIGMOD Conference 1994: 79-90
- [CD85]
- Hong-Tai Chou, David J. DeWitt:
An Evaluation of Buffer Management Strategies for Relational Database Systems.
VLDB 1985: 127-141
- [DBBW83]
- Dina Bitton, Haran Boral, David J. DeWitt, W. Kevin Wilkinson:
Parallel Algorithms for the Execution of Relational Database Operations.
ACM Trans. Database Syst. 8(3): 324-353(1983)
- [FNS91]
- Christos Faloutsos, Raymond T. Ng, Timos K. Sellis:
Predictive Load Control for Flexible Buffer Allocation.
VLDB 1991: 265-274
- [ID90]
- Balakrishna R. Iyer, Daniel M. Dias:
System Issues in Parallel Sorting for Database Systems.
ICDE 1990: 246-255
- [KB85]
- Sai Choi Kwan, Jean-Loup Baer:
The I/O Performance of Multiway Mergesort and Tag Sort.
IEEE Trans. Computers 34(4): 383-387(1985)
- [Knu73]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
- [Lav83]
- ...
- [NFS91]
- Raymond T. Ng, Christos Faloutsos, Timos K. Sellis:
Flexible Buffer Allocation Based on Marginal Gains.
SIGMOD Conference 1991: 387-396
- [PGK88]
- David A. Patterson, Garth A. Gibson, Randy H. Katz:
A Case for Redundant Arrays of Inexpensive Disks (RAID).
SIGMOD Conference 1988: 109-116
- [PV92]
- Vinay S. Pai, Peter J. Varman:
Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis.
ICDE 1992: 273-282
- [RB89]
- A. L. Narasimha Reddy, Prithviraj Banerjee:
An Evaluation of Multiple-Disk I/O Systems.
IEEE Trans. Computers 38(12): 1680-1690(1989)
- [RMW93]
- ...
- [Sal89]
- Betty Salzberg:
Merging Sorted Runs Using Large Main Memory.
Acta Inf. 27(3): 195-215(1989)
- [SGM86]
- Kenneth Salem, Hector Garcia-Molina:
Disk Striping.
ICDE 1986: 336-342
- [SS86]
- Giovanni Maria Sacco, Mario Schkolnick:
Buffer Management in Relational Database Systems.
ACM Trans. Database Syst. 11(4): 473-498(1986)
- [sys94]
- ...
- [Ten92]
- ...
- [TG84]
- James Z. Teng, Robert A. Gumaer:
Managing IBM Database 2 Buffers to Maximize Performance.
IBM Systems Journal 23(2): 211-218(1984)
- [Wol89]
- Joel L. Wolf:
The Placement Optimization Program: A Practical Solution to the Disk File Assignment Problem.
SIGMETRICS 1989: 1-10
- [WYT93]
- Kun-Lung Wu, Philip S. Yu, James Z. Teng:
Performance Comparison of Thrashing Control Policies for Concurrent Mergesorts with Parallel Prefetching.
SIGMETRICS 1993: 171-182
- [WYT94]
- Kun-Lung Wu, Philip S. Yu, James Z. Teng:
Data Placement and Buffer Management for Concurrent Mergesorts with Parallel Prefetching.
ICDE 1994: 418-427
- [YC93]
- Philip S. Yu, Douglas W. Cornell:
Buffer Management Based on Return on Consumption in a Multi-Query Environment.
VLDB J. 2(1): 1-37(1993)
Copyright © Tue Mar 16 02:22:04 2010
by Michael Ley (ley@uni-trier.de)
