Abstract
This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic polices are considered for scheduling multiple tasks at each of the single-server queues to maintain effective server utilization. The paper presents an exact matrix-analytic analysis of generalized parallel-server fork-join queueing systems, for small instances of the stochastic model, and presents an approximate matrix-analytic analysis and fixed-point solution, for larger instances of the model.
Similar content being viewed by others
References
Asmussen, S., Nerman, O., & Olsson, M. (1996). Fitting phase-type distributions via the EM algorithm. Scandinavian Journal of Statistics, 23, 419–441.
Baccelli, F., Makowski, A. M., & Shwartz, A. (1989). The fork-join queue and related systems with synchronization constraints: Stochastic ordering and computable bounds. Advances in Applied Probability, 21, 629–660.
Bright, L., & Taylor, P. (1995). Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes. Stochastic Models, 11, 497–526.
Bright, L., & Taylor, P. (1997). Equilibrium distributions for level-dependent quasi-birth-and-death processes. In S. R. Chakravarthy & A. S. Alfa (Eds.), Lecture notes in pure and applied mathematics : Vol. 183. Matrix-analytic methods in stochastic models (pp. 359–375). New York: Dekker.
Chapin, S. J., Cirne, W., Feitelson, D. G., Jones, J. P., Leutenegger, S. T., Schwiegelshohn, U., Smith, W., & Talby, D. (1999). Benchmarks and standards for the evaluation of parallel job schedulers. In D. G. Feitelson & L. Rudolph (Eds.), Lecture notes in computer science : Vol. 1659. Job scheduling strategies for parallel processing (pp. 67–90). Berlin: Springer.
Chen, R. J. (2001). A hybrid solution of fork/join synchronization in parallel queues. IEEE Transactions on Parallel and Distributed Systems, 12, 829–845.
Dusseau, A. C., Arpaci, R. H., & Culler, D. E. (1996). Effective distributed scheduling of parallel workloads. In Proceedings of the ACM SIGMETRICS 1996 conference on measurement and modeling of computer systems (pp. 25–36).
Feldmann, A., & Whitt, W. (1998). Fitting mixtures of exponentials to long-tail distributions to analyze network performance models. Performance Evaluation, 31, 245–279.
Gamarnik, D., Jengte, N., Lu, Y., Ramachandran, B., Squillante, M. S., Radovanovic, A., Benayon, J., & Szaloky, V. (2006). Analysis of business processes using queueing analytics. Preprint.
Islam, N., Prodromidis, A., & Squillante, M. S. (1996). Dynamic partitioning in different distributed-memory environments. In D. G. Feitelson & L. Rudolph (Eds.), Lecture notes in computer science : Vol. 1162. Job scheduling strategies for parallel processing (pp. 244–270). Berlin: Springer.
Kelly, F. P. (1991). Loss networks. Annals of Applied Probability, 1(3), 319–378.
Ko, S.-S., & Serfozo, R. F. (2004). Response times in M/M/s fork-join networks. Advances in Applied Probability, 36(3), 854–871.
Latouche, G., & Ramaswami, V. (1993). A logarithmic reduction algorithm for quasi-birth-and-death processes. Journal of Applied Probability, 30, 650–674.
Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modeling. Philadelphia: ASA-SIAM.
Latouche, G., & Taylor, P. (2000). Advances in algorithmic methods for stochastic models. Neshanic Station: Notable.
Little, J. D. C. (1961). A proof of the queuing formula L=λ W. Operations Research, 9, 383–387.
Nagar, S., Banerjee, A., Sivasubramaniam, A., & Das, C. R. (1999a). A closer look at coscheduling approaches for a network of workstations. In Proceedings of the eleventh annual ACM symposium on parallel algorithms and architectures (pp. 96–105).
Nagar, S., Banerjee, A., Sivasubramaniam, A., & Das, C. R. (1999b). Alternatives to coscheduling a network of workstations. Journal of Parallel and Distributed Computing, 59(2), 302–327.
Naik, V. K., Setia, S. K., & Squillante, M. S. (1997). Processor allocation in multiprogrammed, distributed-memory parallel computer systems. Journal of Parallel and Distributed Computing, 46(1), 28–47.
Nelson, R. D., & Squillante, M. S. (2006). Parallel-server stochastic systems with dynamic affinity scheduling and load balancing. Preprint.
Nelson, R. D., & Tantawi, A. N. (1988). Approximate analysis of fork/join synchronization in parallel queues. IEEE Transactions on Computers, 37(6), 739–743.
Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: an algorithmic approach. Baltimore: Johns Hopkins Press.
Neuts, M. F. (1989). Structured stochastic matrices of M/G/1 type and their applications. New York: Dekker.
Riska, A., Squillante, M. S., Yu, S.-Z., Liu, Z., & Zhang, L. (2002). Matrix-analytic analysis of a MAP/PH/1 queue fitted to Web server data. In G. Latouche & P. Taylor (Eds.), Matrix-analytic methods: theory and applications (pp. 333–356). Singapore: World Scientific.
Riska, A., Diev, V., & Smirni, E. (2004). An EM-based technique for approximating long-tailed data sets with PH distributions. Performance Evaluation, 55(1–2), 147–164.
Sobalvarro, P. G. (1997). Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors. Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, January 1997.
Squillante, M. S. (2007). Stochastic analysis of multiserver systems. Performance Evaluation Review, 34(4), 44–51.
Squillante, M. S., & Nelson, R. D. (1991). Analysis of task migration in shared-memory multiprocessors. In Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems (pp. 143–155). New York: ACM.
Tan, X., & Knessl, C. (1996). A fork-join queueing model: Diffusion approximation, integral representations and asymptotics. Queueing Systems Theory and Applications, 22, 287–322.
Varma, S., & Makowski, A. M. (1994). Interpolation approximations for symmetric fork-join queues. Performance Evaluation, 20, 245–265.
Zhang, Y., Sivasubramaniam, A., Moreira, J., & Franke, H. (2000). A simulation-based study of scheduling mechanisms for a dynamic cluster environment. In Proceedings of the ACM 2000 international conference on supercomputing (pp. 100–109).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Squillante, M.S., Zhang, Y., Sivasubramaniam, A. et al. Generalized parallel-server fork-join queues with dynamic task scheduling. Ann Oper Res 160, 227–255 (2008). https://doi.org/10.1007/s10479-008-0312-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0312-7