Problem and machine sensitive communication optimization
Pages 117 - 124
References
[1]
S.P. Amarasinghe and M. S. Lam. Communication Optimization and Code Generation for Distributed Memory Machines. In Proc. A CM SIGPLAN'93 Conf. on Programming Language Design and Implementation, Albuquerque, NM, June 1993.
[2]
S. Benkner et al. Vienna Fortran Compilation System - Version 2.0- User's Guide, October 1995.
[3]
S. Chakrabarti, M. Gupta, and J.-D. Choi. Global Communication Analysis and Optimization. In A CM SIGPLAN'96 Conference on Programming Language Design and Implementation (PLDI), Philadelphia, PA, May 1996.
[4]
T. Fahringer. Automatic Performance Prediction of Parallel Programs. Kluwer Academic Publishers, Boston, USA, iSBN 0-7923-9708-8, March 1996.
[5]
T. Fahringer. Efficient Symbolic Analysis for Parallelizing Compilers and Performance Estimators. accepted for publication in the Journal of Supercomputing, Kluwer Academic Publishers, to appear in 1998.
[6]
T. Fahringer, M. Haines, and P. Mehrotra. On the Utility of Threads for Data Parallel Programming. In 9th ACM International Conference on Supercomputing, Barcelona, Spain, July 1995.
[7]
T. Fahringer and E. Mehofer. Buffer-Safe Communication Optimization based on Data Flow Analysis and Performance Prediction. In Proc. of the 1997 International Conference on Parallel Architectures and Compilation Techniques (PACT'97), pages 189-200, San Francisco, USA, November 11-15 1997.
[8]
M. Gupta, E. Schonberg, and H. Srinivasan. A unified framework for optimizing communication in data-parallel programs. IEEE Transactions on Parallel and Distributed Systems, pages 7(7):689-704, July 1996.
[9]
Hanxleden, R.v. and Kennedy, K. Give-N-Take-a balanced code placement framework. In A CM SIGPLAN'9d Conference on Program Language Design and Implementation, Orlando, FL, June, 20-24 1994.
[10]
K. Kennedy and A. Sethi. Resource-Based Communication Placement Analysis . In Proc. of the 9th Workshop on Language and Compilers for Parallel Computing, San Jose, CA, August 1996.
[11]
C.-W. Tseng. Compiler optimizations for eliminating barrier synchronization. In A CM Sigplan Symposium on Principles and Practice of Parallel Programming (PPoPP), Santa Barbara, CA, July 1995.
Index Terms
- Problem and machine sensitive communication optimization
Recommendations
An improved ant colony optimization for the communication network routing problem
Ant colony optimization (ACO) is a population-based meta-heuristic for combinatorial optimization problems such as the communication network routing problem (CNRP). This paper proposes an improved ant colony optimization (IACO) technique, which adapts a ...
Solving the multi-stage portfolio optimization problem with a novel particle swarm optimization
Research highlights We propose a drift particle swarm optimization (DPSO) algorithm. DPSO is applied to solve multi-stage portfolio optimization (MSPO) problems. MSPO problems with data from S&P 100 index are tested by DPSO and other algorithms. DPSO ...
Discrete optimization problem solving with three variants of hybrid binary particle swarm optimization
BADS '11: Proceedings of the 3rd workshop on Biologically inspired algorithms for distributed systemsBinary Particle Swarm Optimization (BPSO) is a population based stochastic algorithm for discrete optimization inspired by social behavior of bird flocking or fish schooling that has been successfully applied in different areas. However, its potential ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1998 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
- SIGARCH: ACM Special Interest Group on Computer Architecture
- IEEE-CS: Computer Society
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 July 1998
Check for updates
Qualifiers
- Article
Conference
ICS98
Sponsor:
- SIGARCH
- IEEE-CS
Acceptance Rates
Overall Acceptance Rate 629 of 2,180 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 274Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)9
Reflects downloads up to 23 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in