✦ LIBER ✦

Permuting machines and priority queues

✍ Scribed by R.E.L. Aldred; M.D. Atkinson; H.P. van Ditmarsch; C.C. Handley; D.A. Holton; D.J. McCaughan

Book ID: 108281092
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 202 KB
Volume: 349
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Priority queues on parallel machines

✍ G.S. Brodal 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 547 KB

We present time and work optimal priority queues for the CREW PRAM, supporting FIND I NDMIN IN in constant time with one processor and MAKE AKEQUEUE UEUE, INSERT NSERT, MELD ELD, FIND-IND-MIN I N, EXTRACT XTRACT MIN IN, DELETE ELETE and DECREASE ECREASEKEY EY in constant time with Olog n processors.

The permutational power of a priority qu

The permutational power of a priority queue

✍ M. D. Atkinson; Murali Thiyagarajah 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 298 KB

Labelled trees and pairs of input-output

Labelled trees and pairs of input-output permutations in priority queues

✍ M. Golin; S. Zaks 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 912 KB

A sequence of priority queue operations can transform a permutation 72 of n elements to some, but not necessarily all, permutations 6. A recent result of Atkinson and Thiyagarajah (1993) states that the number of distinct transformation pairs (TC., a) is (n + l)"-'. By Cayley's theorem this is also

Rank order filters and priority queues

✍ Anne Kaldewaij; Jan Tijmen Udding 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 692 KB

Restricted permutations and queue jumpin

Restricted permutations and queue jumping

✍ M.H. Albert; R.E.L. Aldred; M.D. Atkinson; H.P. van Ditmarsch; C.C. Handley; D.A 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Portable distributed priority queues wit

Portable distributed priority queues with MPI

✍ MANS, BERNARD 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

This paper analyzes the performance of portable distributed priority queues by examining the theoretical features required and comparing various implementations. In spite of intrinsic bottlenecks and induced hot-spots, we argue that tree topologies are attractive to manage the naturally centralized