๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient compilation for queue size constrained queue processors

โœ Scribed by Arquimedes Canedo; Ben A. Abderazek; Masahiro Sowa

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
259 KB
Volume
35
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A constrained optimization problem for a
A constrained optimization problem for a processor sharing queue
โœ Peter De Waal ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 765 KB

In this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or reject

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