Results 91 to 100 of about 149 (130)

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
A K Agrawala
exaly   +2 more sources

Power control in saturated fork-join queueing systems

Performance Evaluation, 2017
Abstract The analysis of fork-join queueing systems has played an important role for the performance evaluation of distributed systems where parallel computations associated with the same job are carried out and a job is considered served only when all the parallel tasks it consists of are served and then joined.
Andrea Marin, Sabina Rossi
exaly   +2 more sources

Analytic approximations of fork-join queues

2015 IEEE 8th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), 2015
Fork-join queues characterize a network of parallel servers where an arriving job splits into subtasks, and are serviced in parallel. Exact analytic results are known for the mean response time of a two server system. For more than two parallel servers, approximations for the mean response time of both homogeneous and heterogeneous servers have been ...
exaly   +2 more sources

Approximate analysis of fork/join synchronization in parallel queues

IEEE Transactions on Computers, 1988
An approximation technique, called scaling approximation, is introduced and applied to the analysis of homogeneous fork/join queuing systems consisting of K>or=2 servers. The development of the scaling approximation technique is guided by both experimental and theoretical considerations.
A N Tantawi
exaly   +2 more sources

A fork-join queueing model: Diffusion approximation, integral representations and asymptotics

Queueing Systems, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles Knessl, Knessl Charles
exaly   +3 more sources

Dynamic Resource Allocation in Fork-Join Queues

ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2020
<?tight?>Fork-join systems play a pivotal role in the analysis of distributed systems, telecommunication infrastructures, and storage systems. In this article, we consider a fork-join system consisting of K parallel servers, each of which works on one of the K tasks that form each job ...
Andrea Marin, Sabina Rossi, Matteo Sottana   +2 more
openaire   +1 more source

Speed scaling in fork-join queues

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools, 2020
Frequency scaling plays an important power-saving role in computer systems. In fork-join systems, dynamic adaptation of the server speeds can significantly reduce system power consumption while maintaining high throughput. In previous work, we studied a rate adaptation policy that dynamically chooses server speeds based on the difference in join-queue ...
Andrea Marin, Sabina Rossi, Carey Williamson   +2 more
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