Abstract
In this paper we present a paradigm for solving external-memory problems, and illustrate it by algorithms for matrix multiplication, sorting and list ranking. Our paradigm is based on the use of BSP algorithms. The correspondence is almost perfect, and especially the notion of x-optimality carries over to algorithms designed according to our paradigm.
The advantages of the approach are similar to the advantages of BSP algorithms for parallel computing: scalability, portability, predictability. The performance measure here is the total work, not only the number of I/O operations as in previous approaches. So the predicted performances are more useful for practical applications.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., J.S. Vitter, ‘The Input/Output Complexity of Sorting and Related Problems,’ Communications of the ACM, 31(9) pp. 1116–1127, 1988.
Bilardi, G., F.P. Preparata, ‘Horizons of Parallel Computation,’ Journal of Parallel and Distributed Computing, 27, pp. 172–182, 1995.
Chiang, Y-J, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter, ‘External-Memory Graph Algorithms,’ Proc. 6th Symposium on Discrete Algorithms, pp. 139–149, ACM-SIAM, 1995.
Cormen, T.H., Virtual Memory for Data Parallel Computing, Ph. D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992.
Cole, C., ‘Parallel Merge Sort,’ SIAM Journal of Computing, 17(4), pp. 770–785, 1988.
JáJá, J., An Introduction to Parallel Algorithms, Addison-Wesley, 1992.
Leighton, F.T., ‘Tight Bounds on the Complexity of Parallel Sorting,’ IEEE Transactions on Computers, C-34(4), pp. 344–354, 1985.
McColl, W.F., 'scalable Computing,’ Computer Science Today: Recent Trends and Developments, J. van Leeuwen (Ed.), LNCS 1000, pp. 46–61, Springer-Verlag, 1995.
McColl, W.F., ‘Universal Computing,’ Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 25–36, Springer-Verlag, 1996.
Patt, Y.N., ‘The I/O Subsystem — A Candidate for Improvement,’ IEEE Computer, 27(3), pp. 15–16, 1994.
Sibeyn, J.F., ‘Deterministic Routing and Sorting on Rings,’ Proc. 8th International Parallel Processing Symposium, pp. 406–410, IEEE, 1994.
Sibeyn, J.F., ‘Better Trade-offs for Parallel List Ranking,’ submitted to Algorithmica, 1996.
Sibeyn, J.F., T. Harris, ‘Exploiting Locality in LT-RAM Computation,’ Proc. 4th Scandinavian Workshop on Algorithm Theory, LNCS 824, pp. 338–349, Springer-Verlag, 1994.
Tishkin, A., ‘The Bulk-Synchronous Parallel Random Access Machine,’ Proc. 2nd Euro-Par Conference, LNCS 1124, pp. 327–338, Springer-Verlag, 1996.
Valiant, L.G., ‘A Bridging Model for Parallel Computation,’ Communications of the ACM, 33(8), pp. 103–111, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sibeyn, J.F., Kaufmann, M. (1997). BSP-like external-memory computation. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_75
Download citation
DOI: https://doi.org/10.1007/3-540-62592-5_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62592-6
Online ISBN: 978-3-540-68323-0
eBook Packages: Springer Book Archive