
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ray Jinzhu Chen, "A Hybrid Solution of Fork/Join Synchronization in Parallel Queues," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 8, pp. 829845, August, 2001.  
BibTex  x  
@article{ 10.1109/71.946659, author = {Ray Jinzhu Chen}, title = {A Hybrid Solution of Fork/Join Synchronization in Parallel Queues}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {8}, issn = {10459219}, year = {2001}, pages = {829845}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.946659}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Hybrid Solution of Fork/Join Synchronization in Parallel Queues IS  8 SN  10459219 SP829 EP845 EPD  829845 A1  Ray Jinzhu Chen, PY  2001 KW  Fork/join queuing system KW  modeling and analysis KW  dynamicbubblesort analysis KW  upper bounds KW  parallel queues KW  synchronization. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—A new analysis technique, dynamicbubblesort analysis, is introduced for general
[1] F. Baccelli, A. Makowski, and A. Shwartz, “The ForkJoin Queue and Related Systems with Synchronization Constraints: Stochastic Ordering, and Computable Bounds,” Advances in Applied Probability, vol. 21, pp. 629660, Sept. 1989.
[2] F. Baccelli, W.A. Massey, and D. Towsley, "Acyclic ForkJoin Queueing Network", J. ACM, vol. 36, no. 3, July 1989.
[3] R.J. Chen, “Analysis and Simulation of Parallel ForkJoin System,” PhD dissertation, Dept. of Computer Science and Eng., Univ. of Connecticut, May 1998.
[4] R.J. Chen and H. Sholl, “100Queue Simulation Report I for `Hybrid Solution of Fork/Join Synchronization in Parallel Queues',” Technique Report BRC/CSETR2001, Univ. of Connecticut, 2000.
[5] S. Chen and D. Towsley, “Design and Modeling Policies for Two Server Fork/Join Queueing Systems,” COINS Technical Report 9193, Univ. of Massachusetts, 1991.
[6] Y. Ding, L. Lipsky, and S. Kim, “On the Departure Process of a ForkJoin Queueing System,” Proc. ISMM Int'l Symp. Parallel and Distributed Computing, and Systems, Oct. 1990.
[7] L. Flatto and S. Hahn, “Two Parallel Queues Created by Arrivals with Two Demands I,” SIAM J. Applied Math., vol. 44, pp. 10411053, Oct. 1984.
[8] L. Flatto, “Two Parallel Queues Created by Arrivals with Two Demands II,” SIAM J. Applied Math., vol. 45, pp. 861878, Oct. 1985.
[9] P. Heidelberger and K.S. Trivedi, “Queueing Network Models for Parallel Processing with Asynchronous Tasks,” IEEE Trans. Computers, vol. 31, no. 11, pp. 10991109, Nov. 1982.
[10] P. Heidelberger and K.S. Trivedi, “Analytic Queueing Models for Programs with Internal Concurrency,” IEEE Trans. Computers, vol. 32, no. 11, pp. 7382, Nov. 1983.
[11] C. Kim and A.K. Agrawala, "Analysis of the ForkJoin Queue," IEEE Trans. Computers, vol. 38, pp. 250255, no. 2, 1989.
[12] L. Kleinrock, Queueing Systems Vol. I: Theory. John Wiley and Sons, 1975.
[13] P. Konstantopoulos and J. Walrand, “Stationary and Stability of ForkJoin Networks,” J. Applied Probability, vol. 25, pp. 604614, 1989.
[14] C.P. Kruskal and A. Weiss, "Allocating Independent Subtasks on Parallel Processors," IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1,0011,016, Oct. 1985.
[15] A. Kumar and R. Shorey, "Performance Analysis and Scheduling of Stochastic ForkJoin Jobs in a Mutilcomputer System," IEEE Trans. Parallel and Distributed. Systems, vol. 4, no. 10, pp. 1,1471,164, Oct. 1993.
[16] L. Lipsky, Queueing Theorem, A Linear Algebraic Approach. New York: Macmillan, 1992.
[17] Y.C. Liu and H.G. Perros, “A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System,” IEEE Trans. Computers, vol. 40, no. 3, pp. 365370, Mar. 1991.
[18] R.R. Muntz and J.C.S. Lui, “Bounding the Response Time of a Minimum Expected Delay Routing System,” IEEE Trans. Computers, vol. 44, no. 5, pp. 13711382, Dec. 1995.
[19] J.C.S. Lui, R.R. Muntz, and D. Towsley, “Computing Performance Bounds of ForkJoin Parallel Programs under a Multiprocessing Environment,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 295311, Mar. 1998.
[20] S. Varma and A.M. Makowski, "Interpolation Approximations for Symmetric ForkJoin Queues," Proc. Performance '93, pp. 245273,Rome, 1993.
[21] R.R. Muntz, E. De Souza, E Silva, and A. Goyal, "Bounding Availability of Repairable Computer Systems," Proc. 1989 ACM SIGMETRICS and PERFORMANCE '89. Also in special issue of IEEE Trans. Computers, vol. 38, no. 12, pp. 1930, Dec. 1989.
[22] R. Nelson and A. Tantawi, “Approximate Analysis of Fork/Join Synchronization in Parallel Queues,” IEEE Trans. Computers, vol. 37, pp. 739–743, June 1988.
[23] R. Nelson, D. Towsley, and A. Tantawi, “Performance Analysis of Parallel Processing Systems,” IEEE Trans. Software Engineering, vol. 14, pp. 532–539, Apr. 1988.
[24] H. Sholl, R.J. Chen, and J. Moriarty, “RealTime NQueue Dynamic Schedule for M/G/1 System,” Technical Report BRC/CSETR9412, Univ. of Connecticut, Storrs, pp. 114, 1992.
[25] A. Thomasian and A. Tantawi, "Approximate Solutions for M/G/1 ForkJoin Synchronization," Proc. Winter Simulation Conf., pp. 361368,Orlando, Fla., Dec. 1994.