Architecture independent massive parallelization of divide-and-conquer algorithms-Reference-Cited by-同舟云学术

Architecture independent massive parallelization of divide-and-conquer algorithms

Published:1995 Issue: Volume: Page:97-127
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Achatz Klaus,Schulte Wolfram

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60117-1_7.pdf

Reference33 articles.

1. T. Axford and M. Joy. List processing primitives for parallel computation. Computer Languages, 19(1):1–12, 1993.

2. S. G. Akl. The Design and Analysis of Parallel Algorithms. Prentice-Hall, 1989.

3. K. Achatz and W. Schulte. Architecture independent massive parallelization of devide-and-conquer algorithms. Technical Report 05-95, Universität Ulm, Fakultät für Informatik, April 1995.

4. T. Axford. Crystal: The divide-and conquer paradigm as a basis for parallel language design. In L. Kronsjo and D. Shumsheruddin, editors, Advances in Parallel Algorithms, chapter 2. Blackwell, 1992.

5. K. E. Batcher. Sorting networks and their applications. AFIPS Spring Joint Computer Conference, pages 307–314, 1968.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Transforming powerlist-based divide-and-conquer programs for an improved execution model;The Journal of Supercomputing;2019-03-25

2. Transformation of divide & conquer to nested parallel loops;Lecture Notes in Computer Science;1997

3. Systematic efficient parallelization of scan and other list homomorphisms;Lecture Notes in Computer Science;1996

4. Systematic extraction and implementation of divide-and-conquer parallelism;Lecture Notes in Computer Science;1996

5. Architecture independent massive parallelization of divide-and-conquer algorithms;Lecture Notes in Computer Science;1995