Scalability of parallel algorithm implementation

  • Xingfu Wu*
  • , Wei Li
  • *Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper, we discuss scalability of parallel systems from three aspects and point out some of the weakness of several existing main schemes for scalability. As an extension to the isoefficiency metric and isospeed metric, we present and define scalability of parallel algorithm implementation, and analyze some relevant theoretical perspectives.

Original languageEnglish
Pages559-561
Number of pages3
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
Duration: 12 Jun 199614 Jun 1996

Conference

ConferenceProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
CityBeijing, China
Period12/06/9614/06/96

Fingerprint

Dive into the research topics of 'Scalability of parallel algorithm implementation'. Together they form a unique fingerprint.

Cite this