Abstract
In this paper, we give experimental results of runtime partitioning of arbitrary order loop with pointer-based structures. Arbitrary order loops are those loops whose iterations can be executed in any order, typically iterating over a bag, list, or set. Such iterations are often used in algorithm texts for iterating over adjacency lists and other collections, and are similar to Linda's bags.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Ahuja, N. Carriero, and David Gelertner. Linda and friends. Computer, 19(8):26–34, August, 1986.
Robert Alverson, David Callahan, Daniel Cummings, Brian Koblenz, Allan Porterfield, and Burton Smith. The tera computer system. In Proceedings of Supercomputing '90, pages 1–6. ACM, 1990.
U. Banerjee. Speedup of ordinary programs. Technical report, University of Illinois, 1979.
William J. Dally, Linda Chao, Andrew Chien, Soha Hassoun, Waldemar Horwat, Jon Kaplan, Paul Song, Brian Totty, and Scott Wills. Architecture of a message-driven processor. 14th Annual Symposium on Computer Architecture, June, 1987.
Henry Dietz and David Klappholz. Refined C: A sequential language for parallel processing. ICCP, pages 442–449, August, 1985.
Andrew V. Goldberg, Serge A. Plotkin, and Gregory E. Shannon. Parallel symmetry-breaking in sparse graphs. pages 315–324, 1987.
Laurie J. Hendren and Alexandru Nicolau. Parallelizing programs with recursive data structures. In International Conference on Parallel Processing, 1989.
James R. Larus. Restructuring symbolic programs for concurrent execution on multiprocessors. Technical Report UCB/CSD 89/502, University of California, May 1989.
Thomas J. LeBlanc and John M. Mellor-Crummey. Debugging parallel programs with instant replay. TOC, C-36(4):471–482, April 1987.
A. Nicolau. Parallelism, memory anti-aliasing and correctness for trace scheduling compilers. Technical report, Yale University, June 1984.
David A. Padua and Michael J. Wolfe. Advanced compiler optimizations for supercomputers. CACM, 29(12), DEC, 1986.
Joel H. Saltz, Ravi Mirchandaney, and Kay Crowley. Run-time parallelization and scheduling of loops. IEEE Trans. on Computer, 40(5):603–612, May 1991.
Jacob T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with sets: an introduction to SETL. Springer-Verlag, New York, New York, 1986. set 1 book.
Burton J. Smith. Architecture and applications of the HEP multiprocessor computer system. Real Time Signal Processing IV, Proceedings of SPIE, 298:241–248, 1981.
Jon A. Solworth. The Microflow architecture. In International Conference on Parallel Processing, volume 1, pages 113–117, St. Charles, Ill., August 15–20 1988. IEEE.
Jon A. Solworth. Programming language constructs for highly parallel operations on lists. The Journal of Supercomputing, 2:331–347, 1988.
Jon A. Solworth. The PARSEQ project: An interim report. In Languages and Compilers for Parallel Computing, pages 490–510. Pittman/MIT, 1990.
Jon A. Solworth. On the performance of parallel lists. In Advances in Languages and Compilers for Parallel Computing, pages 152–171. Pittman/MIT, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solworth, J. (1993). On the feasibility of dynamic partitioning of pointer structures. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1992. Lecture Notes in Computer Science, vol 757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57502-2_41
Download citation
DOI: https://doi.org/10.1007/3-540-57502-2_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57502-3
Online ISBN: 978-3-540-48201-7
eBook Packages: Springer Book Archive