Analysis of Fork-Join Program Response Times on Multiprocessors

Models for two processor sharing policies called task scheduling processor sharing and job scheduling processor sharing are developed and analyzed. The first policy schedules each task independently and allows parallel execution of an individual program, whereas the second policy schedules each job as a unit, thereby not allowing parallel execution of an individual program. It is found that task scheduling performs better than job scheduling for most system parameter values. The performance of the task scheduling processor sharing is compared to a first come first serve policy. First come first serve performs better than processor sharing over a wide range of system parameters. Processor sharing performs best when the task service time variability is high. The performance of processor sharing and first come first serve is studied with two classes of jobs, and for when a specific number of processors is statically assigned to each of the classes. >

[1]  M. L. Chaudhry,et al.  A first course in bulk queues , 1983 .

[2]  Arnold O. Allen Probability, Statistics, and Queueing Theory , 1978 .

[3]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

[4]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[5]  Don Towsley,et al.  Bounds for Two Server Fork-Join Queueing Systems , 1987 .

[6]  Anita Osterhaug Guide to parallel programming on Sequent computer systems , 1989 .

[7]  Ashok K. Agrawala,et al.  Analysis of the Fork-Join Queue , 1989, IEEE Trans. Computers.

[8]  Leonard Kleinrock,et al.  Analysis of A time‐shared processor , 1964 .

[9]  Armand M. Makowski,et al.  Simple computable bounds for the fork-join queue , 1985 .

[10]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

[11]  Philip Heidelberger Statistical analysis of parallel simulations , 1986, WSC '86.

[12]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[13]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[14]  Per Brinch Hansen,et al.  The programming language Concurrent Pascal , 1975, IEEE Transactions on Software Engineering.

[15]  Shikharesh Majumdar,et al.  Scheduling in multiprogrammed parallel systems , 1988, SIGMETRICS 1988.

[16]  Don Towsley,et al.  Analysis of Fork-Join Jobs Using Processor-Sharing , 1987 .

[17]  Asser N. Tantawi,et al.  Performance Analysis of Parallel Processing Systems , 1988, IEEE Trans. Software Eng..

[18]  P. Brinch-Hansen,et al.  The programming language Concurrent Pascal , 1975 .

[19]  Asser N. Tantawi,et al.  Approximate Analysis of Fork/Join Synchronization in Parallel Queues , 1988, IEEE Trans. Computers.

[20]  David D. Yao Some results for the queues Mx /M/c and GIx/ G/c , 1985 .

[21]  Donald F. Towsley,et al.  Acyclic fork-join queuing networks , 1989, JACM.

[22]  S. J. Young,et al.  The ADA programming language: Pyle, I C, Prentice-Hall International (1981) pp 293, £8.95 , 1982, Microprocessors and microsystems.

[23]  Robert B. Cooper,et al.  An Introduction To Queueing Theory , 2016 .

[24]  P. Hilfinger Review of "The Ada programming language by Ian C. Pyle", Prentice-Hall, Inc., Englewood Cliffs, N.J., 1981. , 1982, ALET.