A methodology for programming scalable architectures
By
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.
BibTeX
@article{journals/jpdc/PanwarA94,
author = "Panwar, Rajendra and Agha, Gul",
title = "A Methodology for Programming Scalable Architectures",
ee = "http://dx.doi.org/10.1006/jpdc.1994.1105",
journal = "J. Parallel Distrib. Comput",
number = "3",
pages = "479-487",
volume = "22",
year = "1994",
}