Details
| Original language | English |
|---|---|
| Title of host publication | ARCS 2016 - 29th International Conference on Architecture of Computing Systems |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1-4 |
| Number of pages | 4 |
| ISBN (electronic) | 9783800741571 |
| Publication status | Published - 27 Jun 2016 |
| Event | 29th International Conference on Architecture of Computing Systems, ARCS 2016 - Nuremberg, Germany Duration: 4 Apr 2016 → 7 Apr 2016 |
Abstract
The adaptation of sequential algorithms for High Performance Computing (HPC) systems is determined by a tradeoff between algorithmic effectiveness (software) and communication frequency (hardware) of the parallel implementation (efficiency). To get a better understanding of the correlation, we define simple models for both, software and hardware, in order to dynamically find the best mapping parameters for the execution of the algorithm on the parallel system. For the evaluation of our method we look at population-based algorithms like the Particle Swarm Optimization Algorithm (PSO) for the solution of optimization problems. Different goals like best quality of the solution of the optimization problem for a given execution time or best execution time to find the optimum are defined by the user. Our method enables us to find the best parameters for the mapping which then results in an efficient and effective parallel implementation to achieve the user-defined goals on a High Performance Computing Cluster (HPCC).
Keywords
- High Performance Computing, Optimization algorithms, Particle Swarm Optimization
ASJC Scopus subject areas
- Computer Science(all)
- Computer Science Applications
- Computer Science(all)
- Hardware and Architecture
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
ARCS 2016 - 29th International Conference on Architecture of Computing Systems. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1-4.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Towards an Algorithm and Communication Cost Model for the Parallel Particle Swarm Optimization
AU - Shuka, Romeo
AU - Niemann, Sebastian
AU - Brehm, Jürgen
AU - Müller-Schloer, Christian
PY - 2016/6/27
Y1 - 2016/6/27
N2 - The adaptation of sequential algorithms for High Performance Computing (HPC) systems is determined by a tradeoff between algorithmic effectiveness (software) and communication frequency (hardware) of the parallel implementation (efficiency). To get a better understanding of the correlation, we define simple models for both, software and hardware, in order to dynamically find the best mapping parameters for the execution of the algorithm on the parallel system. For the evaluation of our method we look at population-based algorithms like the Particle Swarm Optimization Algorithm (PSO) for the solution of optimization problems. Different goals like best quality of the solution of the optimization problem for a given execution time or best execution time to find the optimum are defined by the user. Our method enables us to find the best parameters for the mapping which then results in an efficient and effective parallel implementation to achieve the user-defined goals on a High Performance Computing Cluster (HPCC).
AB - The adaptation of sequential algorithms for High Performance Computing (HPC) systems is determined by a tradeoff between algorithmic effectiveness (software) and communication frequency (hardware) of the parallel implementation (efficiency). To get a better understanding of the correlation, we define simple models for both, software and hardware, in order to dynamically find the best mapping parameters for the execution of the algorithm on the parallel system. For the evaluation of our method we look at population-based algorithms like the Particle Swarm Optimization Algorithm (PSO) for the solution of optimization problems. Different goals like best quality of the solution of the optimization problem for a given execution time or best execution time to find the optimum are defined by the user. Our method enables us to find the best parameters for the mapping which then results in an efficient and effective parallel implementation to achieve the user-defined goals on a High Performance Computing Cluster (HPCC).
KW - High Performance Computing
KW - Optimization algorithms
KW - Particle Swarm Optimization
UR - http://www.scopus.com/inward/record.url?scp=85045898877&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85045898877
SP - 1
EP - 4
BT - ARCS 2016 - 29th International Conference on Architecture of Computing Systems
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 29th International Conference on Architecture of Computing Systems, ARCS 2016
Y2 - 4 April 2016 through 7 April 2016
ER -