A Methodology for Programming Scalable Architectures |
| |
| Affiliation: | 1. Otto-von-Guericke University Magdeburg, Magdeburg, Germany and Monash University Malaysia, Selangor, Malaysia;2. University of Southern Alabama, Mobile, AL, USA;3. Universiti Putra Malaysia, Serdang, Malaysia;4. University of Cologne, Germany;5. Hamburg University of Technology (TUHH), Hamburg, Germany, and the University of Waikato, Hamilton, New Zealand;1. School of Minerals Processing and Bioengineering, Central South University, Changsha 410083, China;2. Key Laboratory for Mineral Materials and Application of Hunan Province, Central South University, Changsha 410083, China |
| |
| Abstract: | In scalable concurrent architectures, the performance of a parallel algorithm depends on the resource management policies used. Such policies determine, for example, how data is partitioned and distributed and how processes are scheduled. In particular, the performance of a parallel algorithm obtained by using a particular policy can be affected by increasing the size of the architecture or the input. In order to support scalability, we are developing a methodology for modular specification of partition and distribution strategies (PDSs). As a consequence, a PDS may be changed without modifying the code specifying the logic of a parallel algorithm. We illustrate our methodology for parallel algorithms that use dynamic data structures. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
