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 spawn K tasks that are …

A simple queueing system, known as the fork-join queue, is considered with basic
performance measure defined as the delay between the fork and join dates. Simple lower …

Common random numbers (CRN) is a widely-used technique for reducing variance in
comparing stochastic systems through simulation. Its popularity derives from its intuitive …

Aggregation of resources is a means to improve performance and efficiency in statistically
shared systems in general, and communication networks in particular. One approach to this …

The authors consider queueing that occur naturally in the study of a class of resource-
sharing problems under synchronization constraints such as resequencing and fork-join …

Abstract Assembly/Disassembly Networks are networks of queues in which assembly or
disassembly (often called join or fork) take place. This paper describes and analyzes a class …

Even with the increase in the number and variety of computer resources available to
research scientists today, it is still challenging to construct scalable distributed applications …

There is a growing interest in the development of in-network dispersed computing
paradigms that leverage the computing capabilities of heterogeneous resources dispersed …

Most models of multilevel production and distribution systems assume unlimited production
capacity at each site. When capacity limits are introduced, an ineffective policy may lead to …

In modern distributed computing systems, unpredictable and unreliable infrastructures result
in high variability of computing resources. Meanwhile, there is significantly increasing …