✦ LIBER ✦

Randomized Priority Queues for Fast Parallel Access

✍ Scribed by Peter Sanders

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 167 KB
Volume: 49
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1429

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Circuit Model for Multi-State

A Parallel Circuit Model for Multi-State Resistive-Switching Random Access Memory

✍ Albert B. K. Chen; Byung Joon Choi; Xiang Yang; I.-Wei Chen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 797 KB

A fast and simple randomized parallel al

A fast and simple randomized parallel algorithm for the maximal independent set problem

✍ Noga Alon; László Babai; Alon Itai 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 920 KB

A proposal for a fast random-access comp

A proposal for a fast random-access computer store based on the superconducting device known as the Crowe cell

✍ J.M. Lock; D.H. Parkinson; Lois M. Roberts 📂 Article 📅 1962 🏛 Elsevier Science 🌐 English ⚖ 980 KB

Optimal Mappings of q-ary and Binomial T

Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates

✍ Sajal K. Das; M.Cristina Pinotti 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 444 KB

The main memory access latency can significantly slow down the overall performance of a computer system due to the fact that average cycle time of the main memory is typically a factor of 5 10 times higher than that of a processor. To cope with this problem, in addition to the use of caches, the mai