Benchmarking Parallel Machines via a Software Architecture

Authors

Srikanth Kambhatla
Jon InouyeFollow
Jonathan Walpole, Portland State UniversityFollow

Document Type

Technical Report

Publication Date

1-1990

Subjects

Computer architecture -- Design, Parallel computers -- Evaluation, Software architecture

Abstract

The diversity in parallel architectures and the programming styles induced thereof, make benchmarking of parallel machines a hard problem. Current benchmarking techniques are limited in applicability due to the issues of portability. We present a different approach to benchmarking parallel machines, which would make the resulting benchmarks portable, easy to use and widely applicable. The approach involves the use of a software architecture to mask the diversities of the underlying architectures. The benchmarks are based on the Linda Tuple Space, and is called BeLinda. In this report, we motivate the use of a software architecture, give a specification of the benchmark suite, discuss its implementation on three radically different architectures, and present the results of the benchmark.

Description

Oregon Graduate Institute Technical Report CS/E 090-002, January 1990.

Persistent Identifier

http://archives.pdx.edu/ds/psu/10397

Citation Details

Kambhatla, S., Inouye, J. W., & Walpole, J. (1990). Benchmarking Parallel Machines Via a Software Architecture. Oregon Graduate Center.