Article

Free access

Problem space promotion and its evaluation as a technique for efficient parallel computation

Authors:

Bradford L. Chamberlain,

E. Christopher Lewis,

Lawrence SnyderAuthors Info & Claims

ICS '99: Proceedings of the 13th international conference on Supercomputing

Pages 311 - 318

https://doi.org/10.1145/305138.305208

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

R. C. Agarwal, S. M. Balle, F. G. Gustavson, M. Joshi, and P. Palker. A three-dimensional approach to parallel matrix multiplication. IBM Journal of Research and Development, 39(5):575-82, September 1995.

Digital Library

Google Scholar

[2]

Alok Aggarwal, Ashok K. Chandra, and Marc Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71(1):3-28, March 1990.

Digital Library

Google Scholar

[3]

Selim G. Akl. The Design and Analysis of Parallel Algorithms. Prentice Hall, Englewood Cliffs, New Jersey, 1989.

Digital Library

Google Scholar

[4]

Timothy A. Budd. An APL compiler for a vector processor. A CM Transactions on Programming Languages and Systems, 6(3):297-313, July 1984.

Digital Library

Google Scholar

[5]

Bradford L. Chamberlain, Sung-Eun Choi, E Christopher Lewis, Calvin Lin, Lawrence Snyder, and W. Derrick Weathersby. ZPL's WYSIWYG performance model. In Third International Workshop on High-Level Parallel Programming Models and Supportive Environments, pages 50-61. IEEE Computer Society Press, March 1998.

Digital Library

Google Scholar

[6]

Bradford L. Chamberlain, Sung-Eun Choi, E Christopher Lewis, Lawrence Snyder, W. Derrick Weathersby, and Calvin Lin. The case for high-level parallel programming in ZPL. iEEE Computational Science and Engineering, 5(3):76-85, July-September 1998.

Digital Library

Google Scholar

[7]

Bradford L. Chamberlain, E Christopher Lewis, Calvin Lin, and Lawrence Snyder. Regions: An abstraction for expressing array computations. Technical Report UW-CSE-98-10- 02, Department of Computer Science and Engineering, University of Washington, October 1998.

Google Scholar

[8]

Wai-Mee Ching and Alex Katz. An experimental APL compier for a distributed memory parallel machine. In Supercomputing '94, pages 59---68, November 1994.

Digital Library

Google Scholar

[9]

Sung-Eun Choi and Lawrence Snyder. Quantifying the effect of communication optimizations. In International Conference on Parallel Processing, August 1997.

Digital Library

Google Scholar

[10]

David Culler, Richard Karp, David Patterson, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian, and Thorsten von Eicken. LogP: Towards a realistic model of parallel computation. In Fourth ACM SIGPLAN Symposium on the Principles and Practice of Parallel Programming, May 1993.

Digital Library

Google Scholar

[11]

H. El. Demuth. Electronic Data Sorting. PhD thesis, Stanford University, October 1956.

Google Scholar

[12]

Andrea C. Dusseau, David Culler, Klaus Erik Schauser, and Richard P. Martin. Fast parallel sorting under LogP: Experience with the CM-5. IEEE Transactions on Parallel and Distributed Systems, 7(8):791-805, August 1996.

Digital Library

Google Scholar

[13]

R. Greenlaw and L. Snyder. Achieving speedups for APL on an SIMD distributed memory machine. International Journal of Parallel Programming, 19(2):111-127, April 1990.

Digital Library

Google Scholar

[14]

High Performance Fortran Forum. High Performance Fortran Language Specificaaon, Version 2. O. January 1997.

Google Scholar

[15]

Kenneth E. Iverson. A Programming Language. John Wiley and Sons, 1962.

Digital Library

Google Scholar

[16]

E Christopher Lewis, Calvin Lin, and Lawrence Snyder. The implementation and evaluation of fusion and contraction in array languages. In SiGPLAN Conference on Programming Language Design and implementation, pages 50-59, June 1998.

Digital Library

Google Scholar

[17]

C. Lin, L. Snyder, R. Anderson, B. Chamberlain, S. Choi, G. Forman, E. Lewis, and W. D. Weathersby. ZPL vs. HPF: A comparison of performance and programming style. Technical Report 95-11--05, Department of Computer Science and Engineering, University of Washington, 1995.

Google Scholar

[18]

Calvin Lin and Lawrence Snyder. SIMPLE performance results in ZPL. In Keshav Pingali, Utpal Banerjee, David Gelernter, Alexandru Nicotau, and David Padua, editors, Workshop on Languages and Compilers for Parallel Computing, pages 361-375. Springer-Verlag, 1994.

Digital Library

Google Scholar

[19]

Ton A. Ngo. The Role of Performance Models in Parallel Programming and Languages. PhD thesis, University of Washington, Department of Computer Science and Engineering, 1997.

Digital Library

Google Scholar

[20]

Lawrence Snyder. A Programmer's Guide to ZPL. MIT Press, Cambridge, Massachusetts, 1999.

Digital Library

Google Scholar

[21]

Robert van de Geijn and Jerrell Watts. SUMMA: Scalable universal matrix multiplication algorithm. Concurrency.' Practice and Experience, 9(4):255-274, April t997.

Google Scholar

[22]

Biing-Feng Wang, Gen-Huey Chen, and Ferng-Ching Lin. Constant time sorting on a processor array with a reconfigurable bus system. Information Processing Letters, 34(4): 187-192, April 1990.

Digital Library

Google Scholar

[23]

ZPL Project. ZPL project homepage. hnp : /www. cs. washington.edu/research/zpt.

Google Scholar

Cited By

View all

Snyder LRyder BHailpern B(2007)The design and development of ZPLProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238852(8-1-8-37)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238852
Deitz SChamberlain BChoi SSnyder L(2003)The design and implementation of a parallel array operator for the arbitrary remapping of dataACM SIGPLAN Notices10.1145/966049.78152638:10(155-166)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/966049.781526
Deitz SChamberlain BChoi SSnyder LEigenmann RRinard M(2003)The design and implementation of a parallel array operator for the arbitrary remapping of dataProceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/781498.781526(155-166)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/781498.781526
Show More Cited By

Index Terms

Problem space promotion and its evaluation as a technique for efficient parallel computation

Recommendations

Note. Optimal Promotion Strategies: A Demand-Sided Characterization

We generalize Narasimhan's Narasimhan, Chakravarthi. 1988. Competitive promotional strategies. J. Bus.614 427-449. model of retail promotion to include multiple products and general demand functions. Doing so allows us to further characterize optimal ...
Fault-Tolerant and Efficient Parallel Computation
Performance Evaluation of Practical Parallel Computation Model LogPQ
ISPAN '99: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks

Massively parallel computers consisting of a large number of processing elements have been developed and expected as high performance computers in advanced science and technology. Practical parallel computation model has been required to analyze ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '99: Proceedings of the 13th international conference on Supercomputing

June 1999

509 pages

ISBN:158113164X

DOI:10.1145/305138

Chairmen:
Theodore Papatheodorou
Univ. of Patras, Patras, Greece
,
Mateo Valero
Univ. Politècnica de Catalunya, Barcelona, Spain
,
Constantine D. Polychronopoulos
Univ. of Illinois
,
Yoichi Muraoka
Waseda Univ.
,
Jesus Labarta
Univ. Politècnica de Catalunya, Barcelona, Spain

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS99

Sponsor:

SIGARCH

ICS99: The 13th ACM International Conference on Supercomputing

June 20 - 25, 1999

Rhodes, Greece

Acceptance Rates

ICS '99 Paper Acceptance Rate 57 of 180 submissions, 32%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
223
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Snyder LRyder BHailpern B(2007)The design and development of ZPLProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238852(8-1-8-37)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238852
Deitz SChamberlain BChoi SSnyder L(2003)The design and implementation of a parallel array operator for the arbitrary remapping of dataACM SIGPLAN Notices10.1145/966049.78152638:10(155-166)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/966049.781526
Deitz SChamberlain BChoi SSnyder LEigenmann RRinard M(2003)The design and implementation of a parallel array operator for the arbitrary remapping of dataProceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/781498.781526(155-166)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/781498.781526
Hiroyuki SShaw EShaw L(2001)Array form representation of idiom recognition system for numerical programsProceedings of the 2001 conference on APL: an arrays odyssey10.1145/570407.570418(87-98)Online publication date: 25-Jul-2001
https://dl.acm.org/doi/10.1145/570407.570418
Chamberlain BSnyder LFurnari MGallopoulos E(2001)Array language support for parallel sparse computationProceedings of the 15th international conference on Supercomputing10.1145/377792.377820(133-145)Online publication date: 17-Jun-2001
https://dl.acm.org/doi/10.1145/377792.377820
Hiroyuki S(2000)Array form representation of idiom recognition system for numerical programsACM SIGAPL APL Quote Quad10.1145/570406.57041831:2(87-98)Online publication date: 1-Dec-2000
https://dl.acm.org/doi/10.1145/570406.570418

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Note. Optimal Promotion Strategies: A Demand-Sided Characterization

Fault-Tolerant and Efficient Parallel Computation

Performance Evaluation of Practical Parallel Computation Model LogPQ