A methodology for programming scalable architectures

Rajemdra Panwar, Gul Agha

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)479-487
Number of pages9
JournalJournal of Parallel and Distributed Computing
Issue number3
StatePublished - Sep 1994

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'A methodology for programming scalable architectures'. Together they form a unique fingerprint.

Cite this