Beyond loop partitioning: data assignment and overlap to reduce communication overhead
Pages 172 - 182
References
[1]
BBN Advanced Computers, Inc., 10 Fawcett St., Cambridge, MA, 02138. Inside the TC2000 Computer, 1990.
[2]
L. Brochard and A. Freau. Designing algorithms on hierarchical memory multiprocessors. In Proceedings of the ACM international Conference of Supercomputing, pages 414-427, 1990.
[3]
D. Callahan, J. Cooke, and K. Kennedy. Estimating interlock and improving balance for pipelined architectures. In Int. Conf. on Parallel Processing, pages 295-304, 1987.
[4]
K. Gallivan, W. Jalby, and D. Gannon. On the problem of optimizing data transfers for compllex memory systems. In Proceedings of the CM International Conference on Supercomputing, pages 238-253, St Malo, France, 1988.
[5]
Dennis Gannon, William Jalby, and Kyle Gallivan. Strategies for cache and local memory management ljy global program transformation. Journal of Parallel and Distributed Computing, 5(5):587-616, October 1988.
[6]
E. H. Gornish, E. D. Cranston, and A. V. Vei- .denbaum. Compiler-directed data prefetching m multiprocessors with memory hierarchies. In Proceedings of the A CM International Conference o/5~percomputzng, pages 354-368, 1990.
[7]
D. E. Hudak and S. G. Abraham. Compiler techniques for data partitioning of sequentially iterated parallel loops. In Proceedings of the International Conference on Supercomputing, pages 187-200, 1990.
[8]
F. irigoin and R. Triolet. Supernode partitioning. In Proceedings of the I5th Annual A CM SIGA CT-SIGPLAN Symposium on Principles of Programming Languages, pages 319- 329. ACM, 1988.
[9]
W. H. Mangione-Smith, S. G. Abraham, and E. S. Davidson. The effects of memory latency and fine-grain parallelism on Astronautics ZS- 1 performance. In Proc. Twenty- Third Hawaii International Conference on System Sciences, pages 288-296, 1990.
[10]
C. Melear. The design of the 88000 RISC family. IEEE Micro, pages 26-38, April 1989.
[11]
K. Pingali and A. Rogers. Compiling for locality. In Proceedings of the International Conference on Parallel Processing, pages 142-146, 1990.
[12]
D. A. Reed, L. M. Adams, and M. L. Patrick. Stencils and problem partitionings: Their influence on the performance of muRiple processor systems. IEEE Transactions on Computers, C- 36(7):845-858, July 1987.
[13]
B. G. Schunk. Image flow segmentation and estimation by constraint line clustering. IEEE Transactions on Pattern Analysis and-Machine Intelligence, 11(10):1010-1027, October 1989.
[14]
D. Vrsalovic, E. F. Gehringer, Z. Z. Segall, and D. P. Sieworek. The influence of parallel decomposition strategies on the performance of multiprocessor systems. In Proceedings of the l'21h Annual International Symposium on Computer Architecture, volume 13, pages 396-405, June 1985.
[15]
M. Wolfe. Optimizing Supercompilers for Supercomputers. PhD thesis, University of Illinois at Urbana-Champaign, 1982.
Index Terms
- Beyond loop partitioning: data assignment and overlap to reduce communication overhead
Recommendations
Outer-loop vectorization: revisited for short SIMD architectures
PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniquesVectorization has been an important method of using data-level parallelism to accelerate scientific workloads on vector machines such as Cray for the past three decades. In the last decade it has also proven useful for accelerating multi-media and ...
Scheduling and partitioning for multiple loop nests
ISSS '01: Proceedings of the 14th international symposium on Systems synthesisThis paper presents the multiple loop partition scheduling technique, which combines the loop partition and prefetching. It can exploit the data locality better than the traditional loop partition, which only focus on a singleton nested loop, and loop ...
Loop striping: maximize parallelism for nested loops
EUC'06: Proceedings of the 2006 international conference on Embedded and Ubiquitous ComputingThe majority of scientific and Digital Signal Processing (DSP) applications are recursive or iterative. Transformation techniques are generally applied to increase parallelism for these nested loops. Most of the existing loop transformation techniques ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1991 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1991
Check for updates
Qualifiers
- Article
Conference
ICS91
Sponsor:
ICS91: ACM SIGARCH International Conference on Supercomputing
June 17 - 21, 1991
Cologne, West Germany
Acceptance Rates
Overall Acceptance Rate 629 of 2,180 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 203Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)1
Reflects downloads up to 17 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in