DocumentCode :
2219372
Title :
Stochastic bounds for parallel program execution times with processor constraints
Author :
Li, Keqin
Author_Institution :
Dept. of Math. & Comput. Sci., State Univ. of New York, New Paltz, NY, USA
fYear :
1995
fDate :
25-28 Oct 1995
Firstpage :
208
Lastpage :
213
Abstract :
We develop some stochastic lower and upper bounds for parallel program execution times when there are limited processors. Such analysis can provide important information for job scheduling and resource allocation. For several typical classes of parallel programs, we derive very accurate closed form approximations for the bounds. Examples are also given to demonstrate the quality of the bounds
Keywords :
computational complexity; parallel programming; resource allocation; scheduling; software performance evaluation; closed form approximations; job scheduling; parallel program execution; parallel programs; processor constraints; resource allocation; Computer science; Concurrent computing; Mathematics; Operating systems; Parallel processing; Processor scheduling; Resource management; Stochastic processes; Time factors; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on
Conference_Location :
San Antonio, TX
ISSN :
1063-6374
Print_ISBN :
0-81867195-5
Type :
conf
DOI :
10.1109/SPDP.1995.530686
Filename :
530686
Link To Document :
بازگشت