Abstract
In a shared-disk parallel I/O system, several processes may be accessing the disks concurrently. An important example is concurrent external merging arising in database management systems with multiple independent sort queries. Such a system may exhibit instability, with one of the processes racing ahead of the others and monopolizing I/O resources. This race can lead to serialization of the processes and poor disk utilization, even when the static load on the disks is balanced. The phenomenon can be avoided by proper layout of data on the disks, as well as through other I/O management strategies. This has implications for both data placement in multiple disk systems and task partitioning for parallel processing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, A., and Vitter, J.S., “Input/Output Complexity of Sorting and Related Problems,” Comm. ACM, September 1988., pp. 1116–1127.
Cormen, T.H., “Fast Permuting on Disk Arrays,” J. Parallel and Distributed Computing, 1993, pp. 41–57.
Nodine, M.-H., and Vitter, J.-S., “Large-Scale Sorting in Parallel Memories,” Proc. ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 29–39.
Nodine, M.-H., and Vitter, J.-S., “Optimal Deterministic Sorting in Large-Scale Parallel Memories,” Proc. ACM Symposium on Parallel Algorithms and Architectures, 1992.
Pai, V.S., Schäffer, A.A., and Varman, P.J., “Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging”, Theoretical Computer Science, June 1994, pp. 211–239.
Sinclair, J.B., Tang J., Varman, P.J., and Iyer, B., “Impact of Data Placement on Parallel I/O Systems,” Proc. Int. Conference on Parallel Processing, August 1993, pp. 276–279.
Vitter, J.S., and Shriver, E.A.M., “Optimal Disk I/O with Parallel Block Transfer,” Proc. ACM Symposium on Theory of Computing, 1990, pp. 159–169.
Zheng, L.Q., and Larson, P.-A., “Speeding Up External Mergesort,” Tech. Rept. CS-92–40, Dept. of Computer Science, University of Waterloo, August 1992.
Corbett, PR, Feitelson, D.G., Prost, J.-P, and Baylor, S.J., “Parallel Access to Files in the Vesta File System,” Supercomputing 1993, November 1993, pp. 472–481.
DeWitt, DJ., and Gray, J., “Parallel Database Systems: The Future of High Performance Database Systems,” Comm. ACM, June 1992, pp. 85–98.
Tang, J., “Performance Study of Parallel I/O Systems,” Masters Thesis, Dept. of Electrical and Computer Engineering, Rice University, 1993.
Kwan, S.C., and Baer, J.-L., “The I/O Performance of Multiway Mergesort and Tag Sort,” IEEE Trans. Computers, April 1985, pp. 383–387.
Pai, VS., and Varman, P.J., “Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis,” Proc. 8th Intl. Conference on Data Engineering, 1992, pp. 273–282.
Lee, K., and Varman, P.J., “Prefetching and I/O Parallelism in Multiple Disk Systems,” Proc. Int. Conference on Parallel Processing, August 1995.
Knuth, D.E., The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Sinclair, J.B., Tang, J., Varman, P.J. (1996). Placement-Related Problems in Shared Disk I/O. In: Jain, R., Werth, J., Browne, J.C. (eds) Input/Output in Parallel and Distributed Computer Systems. The Kluwer International Series in Engineering and Computer Science, vol 362. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1401-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1401-1_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8607-3
Online ISBN: 978-1-4613-1401-1
eBook Packages: Springer Book Archive