Results 91 to 100 of about 5,171 (123)

Bivariate Distributions of Maximum Remaining Service Times in Fork-Join Infinite-Server Queues

Problems of Information Transmission, 2020
A V Gorbunova, Lebedev A V
exaly   +3 more sources

Efficient Response Time Approximations for Multiclass Fork and Join Queues in Open and Closed Queuing Networks

IEEE Transactions on Parallel and Distributed Systems, 2014
Daniel A Menasce
exaly   +2 more sources

Analysis of the fork-join queue

IEEE Transactions on Computers, 1989
We consider a fork-join queue as a typical model of parallel processing systems with arrival and departure synchronizations. This paper presents an approach for obtaining the transient and the steady-state solutions of the fork-join queue in terms of the virtual waiting times which can be used to obtain the response time, the delay between the fork and
Kim C., Agrawala A.K.
openaire   +1 more source

Performability Analysis of Fork–join Queueing Systems

Journal of the Operational Research Society, 1995
Summary: Fork-join queueing systems offer a natural modelling paradigm for parallel processing systems and for assembly operations in automated manufacturing. The analysis of fork-join queueing systems has been an important subject of research in recent years.
Narahari, Y, Sundarrajan, P
openaire   +2 more sources

Symmetric n-Dimensional Fork-Join Queues

2022
exaly   +2 more sources

Throughput Scalability Analysis of Fork-Join Queueing Networks

Operations Research, 2018
Parallel and distributed processing systems have expanded in size as technology advances in cloud computing and big data analytics. A critical issue concerns throughput scalability: whether throughput decreases to zero as the systems scale in size and capabilities. We model parallel and distributed processing systems as fork and join queueing networks
Yun Zeng, Augustin Chaintreau, Don Towsley, Cathy H. Xia   +3 more
openaire   +2 more sources

Analysis of Fork/Join and Related Queueing Systems

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.
openaire   +1 more source

A control policy for fork-join queueing network

Proceedings of 1995 34th IEEE Conference on Decision and Control, 2002
This paper considered the fork-join queueing network. A control policy was developed based on its max-algebra model. By controlling the epochs at which the external source tasks enter the system, this policy makes the network to operate at its ideal maximum output rate and at the same time, the buffers in the network have minimum capacity.
null Liu Ruihua, null Tu Fengsheng
openaire   +1 more source

Scalability of fork/join queueing networks with blocking

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 2007
This paper investigates how the through put of a general fork-join queueing network with blocking behaves as the number of nodes increases to infinity while the processing speed and buffer space of each node stay unchanged. The problem is motivated by applications arising from distributed systems and computer networks.
Cathy H. Xia, Zhen Liu, Don Towsley, Marc Lelarge   +3 more
openaire   +1 more source

Analysis of balanced fork-join queueing networks

ACM SIGMETRICS Performance Evaluation Review, 1996
This paper presents an analysis of closed, balanced, fork-join queueing networks with exponential service time distributions. The fork-join queue is mapped onto two non-parallel networks, namely, a serial-join model and a state-dependent model. Using these models, it is proven that the proportion of the number of jobs in the different subsystems of the
Elizabeth Varki, Lawrence W. Dowdy
openaire   +1 more source