A geometric model for multiple processor performance analysis

Author

Ullah, Nasr ; Gonzalez, Mario J., Jr.

Author_Institution

Dept. of Electr. & Compound. Eng., Texas Univ., Austin, TX, USA

Volume

i

fYear

1990

fDate

2-5 Jan 1990

Firstpage

232

Abstract

A theoretical model is proposed to investigate the effect of a job´s parallel software structure on multiple-processor performance. Jobs are represented in terms of their software structure using a geometric model known as a job profile. Using three performance indices-efficiency, execution time, and speedup-a methodology is developed to evaluate the performance of processors executing a job modeled as a job profile. Equations for efficiency, execution time, and speedup are derived for an M-processor machine executing a job represented by a generalized job profile. These equations are analyzed for a specific job profile to determine what bounds are placed on performance by a job´s software structure. The results indicate that the processor-sharing and processor-sweeping scheduling disciplines provide upper and lower bounds on the performance of a multiple-processor machine using a work-conserving scheduling policy

Keywords

multiprocessing systems; performance evaluation; M-processor machine; execution time; geometric model; job profile; multiple processor performance analysis; parallel software structure; performance indices; processor-sharing; processor-sweeping scheduling; software structure; work-conserving scheduling policy; Concurrent computing; Distributed computing; Equations; Hardware; Packaging; Parallel processing; Performance analysis; Processor scheduling; Software performance; Solid modeling;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on

Conference_Location

Kailua-Kona, HI

Type

conf

DOI

10.1109/HICSS.1990.205121

Filename

205121