This Article 
 Bibliographic References 
 Add to: 
Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System
October 1993 (vol. 4 no. 10)
pp. 1147-1164

The authors model a parallel processing system comprising several homogeneouscomputers interconnected by a communication network. Jobs arriving to this system havea linear fork-join structure. Each fork of the job gives rise to a random number of tasksthat can be processed independently on any of the computers. Since exact analysis offork-join models is known to be intractable, the authors resort to obtaining analyticalbounds to the mean job response time of the fork-join job. For jobs with a single fork-joinand, probabilistic allocation of tasks of the job to the N processors, they obtain upperand lower bounds to the mean job response time. Upper bounds are obtained using theconcept of associated random variables and are found to be a good approximation to themean job response time. A simple lower bound is obtained by neglecting queueing delays. They also find two lower bounds that include queueing delays. For multiple fork-join jobs, they study an approximation based on associated random variables. Finally, two versions of the join-the-shortest-queue (JSQ) allocation policy (i.e., JSQ by batch and JSQ by task) are studied and compared, via simulations and diffusion limits.

[1] T. Aven, "Upper(lower) bounds on the mean of the maximum(minimum) of a number of random variables,"J. Appl. Prob., vol. 22, pp. 723-728, 1985.
[2] F. Baccelli, "Two parallel queues created by arrivals with two demands: The M/G/2 symmetrical case," Report INRIA, no. 426, July 1985.
[3] F. Baccelli and A. Makowski, "Simple computable bounds for the fork-join queue," inProc. Conf. Inform. Sci. Syst., John Hopkins Univ., Baltimore, MD, Mar. 1985, pp. 436-441.
[4] F. Baccelli and A. Makowski, "Multidimentional stochastic ordering and associated random variables,"Oper. Res., vol. 37, no. 3, May-June, 1989, pp. 478-487.
[5] F. Baccelli, A. M. Makowski, and A. Shwartz, "Simple computable bounds and approximations for the fork-join queue," inProc. Int. Workshop Comput. Performance Evaluation, Tokyo, Japan, Sept. 1985, pp. 437-450.
[6] F. Baccelli, W. A. Massey, and D. Towsley, "Acyclic fork/join queueing networks,"J. ACM, vol. 36, pp. 615-642, 1989.
[7] R. E. Barlow and F. Proschan,Statistical Theory Of Reliability and Life Testing: Probability Models. New York: Holt, Rinehart and Winston, 1975.
[8] D. Bersekas and R. Gallager,Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[9] J. D. Esary, F. Proschan, and D. W. Walkup, "Association of random variables, with applications,"Ann. Math. Statist., 38, pp. 1466-1474.
[10] L. Flatto and S. Hahn, "Two parallel queues created by arrivals with two demands,"SIAM. J. Appl. Math., vol. 44, pp. 1041-1053, 1984.
[11] S. Halfin, "Batch delays versus customer delays," Bell Labs. Tech. Memo., to be published.
[12] P. B. Hansen, "The programming language Concurrent Pascal,"IEEE Trans. Software Eng., vol. SE-1, pp. 199-207, June 1975.
[13] L. Kleinrock,Queueing Systems, Vol. 1: Theory. New York: Wiley, 1975.
[14] C. Kruskal and A. Weiss, "Allocating independence subtasks on parallel processors,"IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1001-1015, Oct. 1985.
[15] J. Kuri and A. Kumar, "On the optimal allocation of customers that must depart in sequence,"Operations Res. Lett., to be published.
[16] J. Kuri and A. Kumar, "Optimal control of arrivals to queues with delayed queue length information," inProc. 31st IEEE Conf. Decision and Control, Tucson, AZ, Dec. 1992.
[17] R. Mirchandaney, D. Towsley, and J. A. Stankovic, "Analysis of the effects of delays on load sharing,"IEEE Trans. Comput., vol. 38, no. 11, pp. 1513-1525, Nov. 1989.
[18] R. D. Nelson and T. K. Philips, "An approximation for the mean response time for shortest queue routing with general interarrival and service times," Research Report, IBM, RC 15429(# 68659).
[19] R. Nelson, D. Towsley, and A. N. Tantawi, "Performance analysis of parallel processing systems,"IEEE Trans. Software Eng., vol. 14, no. 4, pp. 532-539, Apr. 1988.
[20] R. Nelson and A. N. Tantawi, "Approximate analysis of fork/join synchronization in parallel queues,"IEEE Trans. Comput., vol. 37, no. 6, pp. 739-743, June 1988.
[21] M. F. Neuts, "Queues solvable without Rouche's theorem,"Oper. Res., vol. 27, no. 4, July-Aug. 1979.
[22] M. Reiman, "Some diffusion approximations with state space collapse," inLecture Notes on Control and Information Science.
[23] S. M. Ross,Stochastic Processes. New York: Wiley, 1983.
[24] E. C. Russell, Building Simulation Models with SIMSCRIPT II.5, CACI, 1983.
[25] R. Shorey, "Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system," M.Sc(Engineering) thesis, Dep. Elec. Commu. Eng., Indian Institute of Science, Bangalore, Oct., 1990.
[26] K. Sigman, "Queues as Harris Recurrent Markov Chains,"Queueing Syst., vol. 3, pp. 179-198, 1988.
[27] D. R. Smith and W. Whitt, "Resource sharing for efficiency in traffic systems,"Bell Syst. Tech. J., vol. 60, no. 1, Jan. 1981.
[28] D. Stoyan,Comparison Methods for Queues and other Stochastic Models (English Translation), D. J. Daley, Ed. New York: Wiley.
[29] Takagi, Ed.,Stochastic Analysis of Computer and Communication Systems. Amsterdam: North-Holland, 1990, pp. 57-129.
[30] D. Towsley, J. A. Rommel, and J. A. Stankovic, "The performance of processor sharing scheduling fork-join in multiprocessors," inHigh-Performance Computer Systems, E. Gelenbe, Ed. Amsterdam: North-Holland, 1988, pp. 146-156.
[31] J. P. Tremblay and R. Manohar,Discrete Mathematical Structures with Applications to Computer Science, New York: McGraw-Hill, 1987.
[32] R. R. Weber, "On the optimal assignment of customers to parallel servers,"J. Appl. Prob., vol. 15, pp. 406-413, 1978.
[33] R. W. Wolff,Stochastic Modeling and the Theory of Queues. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[34] R. W. Wolff, "An upper bound for multi-channel queues,"J. Appl. Prob., vol. 14, pp. 884-888, 1977.

Index Terms:
Index Termsperformance analysis; scheduling; stochastic fork-join jobs; multicomputer system;parallel processing system; exact analysis; probabilistic allocation of tasks; lower bounds;upper bounds; associated random variables; queueing delays; simulations; diffusion limits; delays; digital simulation; parallel processing; performance evaluation; queueing theory; scheduling; stochastic processes
A. Kumar, R. Shorey, "Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 10, pp. 1147-1164, Oct. 1993, doi:10.1109/71.246075
Usage of this product signifies your acceptance of the Terms of Use.