APPROXIMATE ANALYSIS OF FORK JOIN SYNCHRONIZATION IN PARALLEL QUEUES

被引:177
作者
NELSON, R
TANTAWI, AN
机构
[1] IBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USA
关键词
COMPUTER SYSTEMS; DIGITAL - Synchronization - MATHEMATICAL TECHNIQUES - Approximation Theory;
D O I
10.1109/12.2213
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
An approximation technique, called scaling approximation, is introduced and applied to the analysis of homogeneous fork/join queuing systems consisting of K greater than equivalent to 2 servers. The development of the scaling approximation technique is guided by both experimental and theoretical considerations. The approximation is based on the observation that there exist upper and lower bounds on the mean response time that grow at the same rate as a function of K. Simple, closed-form approximate expressions for the mean response time are derived and compared to simulation results. The relative error in the approximation is less than 5% for K less than equivalent to 32.
引用
收藏
页码:739 / 743
页数:5
相关论文
共 8 条
[1]  
BACCELLI F, 1985, P J HOPKINS C INF SC
[2]  
BARLOW RE, 1975, STATISTICAL THEORY R
[3]   2 PARALLEL QUEUES CREATED BY ARRIVALS WITH 2 DEMANDS .1. [J].
FLATTO, L ;
HAHN, S .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1984, 44 (05) :1041-1053
[4]   2 PARALLEL QUEUES CREATED BY ARRIVALS WITH 2 DEMANDS .2. [J].
FLATTO, L .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1985, 45 (05) :861-878
[5]  
HEIDELBERGER P, 1982, IEEE T COMPUT, V31, P1099, DOI 10.1109/TC.1982.1675926
[6]  
HEIDELBERGER P, 1983, IEEE T COMPUT, V32, P73, DOI 10.1109/TC.1983.1676125
[7]  
Kleinrock L., 1975, THEORY
[8]   ANALYSIS OF A REPLICATED DATA-BASE [J].
NELSON, RD ;
IYER, BR .
PERFORMANCE EVALUATION, 1985, 5 (03) :133-148