✦ LIBER ✦

Efficient Algorithms for Tandem Queueing system simulation

✍ Scribed by S.M. Ermakov; N.K. Krivulin

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 366 KB
Volume: 7
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(94)90092-2

No coin nor oath required. For personal study only.

✦ Synopsis

Serial and parallel algorithms for simulation of tandem queueing systems with infinite buffers are presented, and their performance are examined. It is shown that the algorithms which are based on a simple computational procedure involve low time and memory requirements.

📜 SIMILAR VOLUMES

An efficient algorithm for concurrent pr

An efficient algorithm for concurrent priority queue heaps

✍ Galen C. Hunt; Maged M. Michael; Srinivasan Parthasarathy; Michael L. Scott 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 628 KB

We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to , but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to

Tandem behavior of a finite capacity G/M

Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm

✍ Behnam Pourbabai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 381 KB

Parameter optimization of tandem queue s

Parameter optimization of tandem queue systems with finite intermediate buffers via fuzzy simulation

✍ A. Azadeh; R. Mohammad Ebrahim; H. Eivazy 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 400 KB

An efficient computation algorithm for a

An efficient computation algorithm for a multiserver feedback retrial queue with a large queueing capacity

✍ Tien Van Do 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Algorithms for second moments in batch-m

Algorithms for second moments in batch-movement queueing systems

✍ E Hunt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Some recent papers in the literature detail how mean-value analysis may be applied to an important class of batch-movement queueing systems and stochastic Petri nets. The techniques may be applied, inter alia, to the analysis of circuit-switched networks and slotted-ring networks. The present paper

Efficient parallel algorithms for molecu

Efficient parallel algorithms for molecular dynamics simulations

✍ Ravi Murty; Daniel Okunbor 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

The study of many-particle systems has increased signi®cantly over the past decade, because of the increasing number of useful applications it supports. Numerical experiences have shown that the force calculation contributes 90% of the total simulation time. This is an O(N 2 ) algorithm, mainly due