This Article 
 Bibliographic References 
 Add to: 
Analysis of Fork-Join Program Response Times on Multiprocessors
July 1990 (vol. 1 no. 3)
pp. 286-303

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] A. Allen,Probability, Statistics and Queueing Theory.New York: Academic, 1978.
[2] F. Baccelli and A. Makowski, "Simple computable bounds for the fork-join queue," inProc. Conf. Inform. Sci. Syst., 1985.
[3] F. Baccelli, W. A. Massey, and D. Towsley, "Acyclic fork/join queueing networks,"J. ACM, vol. 36, pp. 615-642, 1989.
[4] Chaudhry and Templeton,First Course in Bulk Queues.New York: Wiley, 1983.
[5] Gross and Harris,Introduction to Queueing Theory.New York: Wiley, 1976.
[6] P. Brinch Hansen, "The programming language Concurrent Pascal,"IEEE Trans. Software Eng., vol. SE 1, pp. 199-207, June 1975.
[7] P. Heidelberger, "Statistical analysis of parallel simulations," inProc. 1986 Winter Simulation Conf., to be published.
[8] C.A.R. Hoare,Communicating Sequential Processes, Prentice Hall, Englewood, N.J., 1985.
[9] C. Kim and A. K. Agrawala, "Analysis of a fork-join queue,"IEEE Trans. Comput., vol. 38, no. 2, pp. 250-255, Feb. 1989.
[10] L. Kleinrock, "Analysis of a time-shared processor,"Naval Res. Logist. Quarterly, vol. 11, 1964.
[11] L. Kleinrock,Queueing Systems Vol. II: Computer Applications. New York: Wiley, 1976.
[12] S.S. Lavenberg,Computer Performance Modeling Handbook, Academic Press, New York, 1983.
[13] S. Majumdar, D.L. Eager, and R. Bunt, "Scheduling in multiprogrammed parallel systems,"ACM SIGMETRICS, pp. 104-113, 1988.
[14] R. Nelson and A. N. Tantawi, "Approximate analysis of fork/join synchronization in parallel queues,"IEEE Trans. Comput., vol. 37, pp. 739-743, 1988.
[15] R. Nelson, D. Towsley, and A. Tantawi, "Performance analysis of parallel processing systems,"IEEE Trans. Software Eng., vol. 14, pp. 532-540, Apr. 1988.
[16] A. Osterhaug,Guide to Parallel Programming on Sequent Com puter Systems, Sequent Computer Systems, Beaverton, Ore., 1986.
[17] I. C. Pyle,The Ada Programming Language. London, UK: Prentice-Hall, 1981.
[18] C. G. Rommel, D. Towsley, and J. Stankovic, "Analysis of fork-join jobs using processor-sharing," COINS Tech. Rep. 87-52, Univ. of Massachusetts, 1987.
[19] S. M. Ross,Stochastic Processes. New York: Wiley, 1983.
[20] D. Towsley and S. P. Yu, "Bounds on the performance of two server fork-join queueing systems," COINS Tech. Rep. 87-123, Nov. 1987.
[21] D. D. Yao, "Some results for queues Mx/M/cand GlX/G/c," Oper. Res. Lett., vol. 4, 1985.

Index Terms:
Index Termsfork-join program response times; multiprocessors; task scheduling processor sharing; job scheduling processor sharing; system parameter values; performance; multiprocessing systems; performance evaluation
D. Towsley, C.G. Rommel, J.A. Stankovic, "Analysis of Fork-Join Program Response Times on Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 286-303, July 1990, doi:10.1109/71.80157
Usage of this product signifies your acceptance of the Terms of Use.