Paper Info
Title
Simulation & Analysis of a Mean Response Time Upper-bound for Homogeneous Fork/Join Queues
Abstract
In this paper, we study general K-queue first-in-first-out homogeneous fork/join queueing (HFJ) systems for any K ≥ 2. We simulate and analyze an upper-bound for the mean response time that we denote by T[K]. The upper-bound uses a relatively tiny-scale system to predict the performance of a huge-scale system. It is evaluated for 10-million queues on a regular HP-PC with Intel i7-860 for three different HFJ cases. The maximum time is 16 minutes, which is only about 0.01% of the full system simulation time. We show that it is fast, close, economical and consistent by comparison and analysis.
Year
DOI
Venue
2011
10.1109/UKSIM.2011.88
UKSim
Keywords
Field
DocType
mean response time,homogeneous fork,regular hp-pc,full system simulation time,mean response time upper-bound,10-million queue,join queues,tiny-scale system,different hfj case,maximum time,huge-scale system,computational modeling,computer model,synchronization,upper bound,queueing theory,first in first out
Fork (system call),Discrete mathematics,Synchronization,Mean and predicted response,Computer science,Upper and lower bounds,Parallel computing,Queue,Queueing theory,Fork–join queue,Performance prediction
Conference
Citations 
PageRank 
References 
0
0.34
21
Authors
3
Name
Order
Citations
PageRank
Ray Jinzhu Chen1171.74
Kevin Scott Reschke221.43
Muchenxuan Tong3181.64