Article

Fast Address Sequence Generation for Data-Parallel Programs Using Integer Lattices

Authors:

Ashwath Thirumalai,

J. RamanujamAuthors Info & Claims

LCPC '95: Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing

Pages 191 - 208

Published: 10 August 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Guo MPan YLiu Z(2003)Symbolic Communication Set Generation for Irregular Parallel ApplicationsThe Journal of Supercomputing10.1023/A:102426261020125:3(199-214)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1023/A%3A1024262610201
Petitet ADongarra J(1999)Algorithmic Redistribution Methods for Block-Cyclic DecompositionsIEEE Transactions on Parallel and Distributed Systems10.1109/71.81994410:12(1201-1216)Online publication date: 1-Dec-1999
https://dl.acm.org/doi/10.1109/71.819944
Desprez FRandriamaro CDongarra JPetitet ARobert Y(1998)Scheduling Block-Cyclic Array RedistributionIEEE Transactions on Parallel and Distributed Systems10.1109/71.6639459:2(192-205)Online publication date: 1-Feb-1998
https://dl.acm.org/doi/10.1109/71.663945
Show More Cited By

Recommendations

Compiling data-parallel programs for clusters of SMPs: Research Articles
Compilers for Parallel Computers

Clusters of shared-memory multiprocessors (SMPs) have become the most promising parallel computing platforms for scientific computing. However, SMP clusters significantly increase the complexity of user application development when using the low-level ...
A parallel macro partitioning framework for solving mixed integer programs
CPAIOR'08: Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems

Mixed Integer Programs are a class of optimization problems which have a vast range of applications in engineering, business, science, health care, and other areas. For many applications, however, problems of realistic size can take a an impractical ...
Extending the QCR method to general mixed-integer programs

Let (MQP) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (MQP), i.e. we reformulate (MQP) into an equivalent program, with ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

LCPC '95: Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing

August 1995

597 pages

ISBN:354060765X

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 10 August 1995

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Guo MPan YLiu Z(2003)Symbolic Communication Set Generation for Irregular Parallel ApplicationsThe Journal of Supercomputing10.1023/A:102426261020125:3(199-214)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1023/A%3A1024262610201
Petitet ADongarra J(1999)Algorithmic Redistribution Methods for Block-Cyclic DecompositionsIEEE Transactions on Parallel and Distributed Systems10.1109/71.81994410:12(1201-1216)Online publication date: 1-Dec-1999
https://dl.acm.org/doi/10.1109/71.819944
Desprez FRandriamaro CDongarra JPetitet ARobert Y(1998)Scheduling Block-Cyclic Array RedistributionIEEE Transactions on Parallel and Distributed Systems10.1109/71.6639459:2(192-205)Online publication date: 1-Feb-1998
https://dl.acm.org/doi/10.1109/71.663945
Wang LStichnoth JChatterjee SClayton B(1996)Runtime performance of parallel array assignmentProceedings of the 1996 ACM/IEEE conference on Supercomputing10.1145/369028.369036(4-es)Online publication date: 17-Nov-1996
https://dl.acm.org/doi/10.1145/369028.369036
Sips Hvan Reeuwijk KDenissen WYew P(1996)Analysis of local enumeration and storage schemes in HPFProceedings of the 10th international conference on Supercomputing10.1145/237578.237580(10-17)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237578.237580
van Reeuwijk KDenissen WSips HPaalvast E(1996)An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/71.5369357:9(897-914)Online publication date: 1-Sep-1996
https://dl.acm.org/doi/10.1109/71.536935

Abstract

Cited By

Recommendations

Compiling data-parallel programs for clusters of SMPs: Research Articles

A parallel macro partitioning framework for solving mixed integer programs

Extending the QCR method to general mixed-integer programs

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations