79 search results - page 4 / 16 » Queues, stores, and tableaux |
IBMRD
2006
13 years 8 months ago
2006
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and nu...
WDAG
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
CATS
2007
13 years 10 months ago
2007
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...
HPCA
2011
IEEE
13 years 8 days ago
2011
IEEE
Queues are commonly used in multithreaded programs for synchronization and communication. However, because software queues tend to be too expensive to support finegrained paralle...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We study a sensor node with an energy harvesting source. The generated energy can be stored in a buffer. The sensor node periodically senses a random field and generates a packet....