This Article 
 Bibliographic References 
 Add to: 
Stochastic Bounds for Parallel Program Execution Times with Processor Constraints
May 1997 (vol. 46 no. 5)
pp. 630-636

Abstract—A parallel program can be modeled as an acyclic directed graph, where a node represents a task, which is the smallest grain of computation to be assigned to a processor, and arcs stand for precedence (synchronization) constraints among the tasks. Due to different input data and unpredictable dynamic run time environments, the execution times of tasks as well as the entire program can be treated as random variables. In this paper, 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 derived.

[1] H.A. David, Order Statistics, second edition. John Wiley&Sons, 1981.
[2] G.H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures, second edition. Addison-Wesley, 1991.
[3] K.K. Jain and V. Rajaraman, "Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 879-886, Aug. 1994.
[4] C.P. Kruskal and A. Weiss, "Allocating Independent Subtasks on Parallel Processors," IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1,001-1,016, Oct. 1985.
[5] K. Li, "Probabilistic Performance Analysis of Scheduling Parallel Tasks with Precedence Constraints on Mesh Connected Multicomputers," Proc. 15th IEEE Int'l Phoenix Conf. Computers and Comm., pp. 358-365, Mar. 1996.
[6] K. Li, "Stochastic Performance Bounds for Scheduling Random Parallel Task Systems on Hypercubes," Proc. High Performance Computing Symp., pp. 199-205 Apr. 1996.
[7] K. Li and Y. Pan, "On Scheduling Precedence Constrained Parallel Tasks on Multiprocessors," Proc. Int'l Conf. Modeling and Simulation, pp. 63-75, Apr. 1996.
[8] S. Madala and J.B. Sinclair, "Performance of Synchronous Parallel Algorithms with Regular Structures," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 105-116, Jan. 1991.
[9] C.V. Ramamoorthy, K.M. Chandy, and M.J. Gonzalez Jr., "Optimal Scheduling Strategies in a Multiprocessor System," IEEE Trans. Computers, vol. 21, no. 2, pp. 137-146, Feb. 1972.
[10] J.T. Robinson, "Some Analysis Techniques for Asynchronous Multiprocessor Algorithms," IEEE Trans. Software Eng., vol. 5, no. 1, pp. 24-31, Jan. 1979.
[11] N. Yazici-Pekergin and J.-M. Vincent, "Stochastic Bounds on Execution Times of Parallel Programs," IEEE Trans. Software Eng., vol. 17, no. 10, pp. 1,005-1,012, Oct. 1991.

Index Terms:
Execution time, parallel program, processor allocation, stochastic bound, task scheduling.
Keqin Li, "Stochastic Bounds for Parallel Program Execution Times with Processor Constraints," IEEE Transactions on Computers, vol. 46, no. 5, pp. 630-636, May 1997, doi:10.1109/12.589243
Usage of this product signifies your acceptance of the Terms of Use.