Analysis of Fork/Join and Related Queueing Systems
Alexander Thomasian · ACM Computing Surveys · 2014
Fork/join (F/J) requests arise in contexts such as parallel computing, query processing in parallel databases, and parallel disk access in RAID. F/J requests spawnKtasks that are sent toKparallel servers, and the completion of allKtasks marks the completion of an F/J request. The exact formula for the mean response time ofK= 2-way F/J requests derived under Markovian assumptions (RF/J2) served as the starting point for an approximate expression forRF/JKfor 2