2003•Unpublished venueRequires access

Optimal-processor-set speedup of SMP cluster

Jiahua He, Guoliang Chen, Jiulong Shan

Open publisher page 0 citations

Abstract

The SMP cluster becomes more and more important in high performance computing and speedup is the main performance criterion of parallel and distributed algorithms. But the traditional definition of speedup is not fit for the SMP cluster architecture. How can we measure speedup of the SMP cluster? We analyze the nonequivalence of n-processor sets in the SMP cluster based on the introduction to traditional and node-oriented speedup definitions, propose a corresponding speedup definition, optimal-processor-set speedup, in both theoretical and practical views, and illustrate its benefits by an example executing on two SMP clusters.

About this research paper

What this paper is about

The SMP cluster becomes more and more important in high performance computing and speedup is the main performance criterion of parallel and distributed algorithms. But the traditional definition of speedup is not fit for the SMP cluster architecture. How can we measure speedup of the SMP cluster? We analyze the nonequivalence of n-processor sets in the SMP cluster based on the introduction to traditional and node-oriented speedup definitions, propose a corresponding speedup definition, optimal-processor-set speedup, in both theoretical and practical views, and illustrate its benefits by an example executing on two SMP clusters.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The SMP cluster becomes more and more important in high performance computing and speedup is the main performance criterion of parallel and distributed algorithms. But the traditional definition of speedup is not fit for the SMP cluster architecture. How can we measure speedup of the SMP cluster? We analyze the nonequivalence of n-processor sets in the SMP cluster based on the introduction to traditional and node-oriented speedup definitions, propose a corresponding speedup definition, optimal-processor-set speedup, in both theoretical and practical views, and illustrate its benefits by an example executing on two SMP clusters.

Key concepts: Speedup, Computer science, Parallel computing, Cluster (spacecraft), Set (abstract data type), Node (physics), Operating system, Programming language

Related papers

Back to paper searchBrowse research topicsOriginal source
Optimal-processor-set speedup of SMP cluster — Research Paper | ScholarLens