Sciweavers

130 search results - page 20 / 26
» A Parallel Priority Queue with Constant Time Operations
Sort
View
IPPS
2002
IEEE
15 years 4 months ago
Implementing Associative Search and Responder Resolution
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
Meiduo Wu, Robert A. Walker, Jerry L. Potter
ICDCS
2011
IEEE
13 years 11 months ago
Competitive and Fair Medium Access Despite Reactive Jamming
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...
Andréa W. Richa, Christian Scheideler, Stef...
119
Voted
CLUSTER
2010
IEEE
14 years 3 months ago
Middleware support for many-task computing
Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes highperformance co...
Ioan Raicu, Ian T. Foster, Mike Wilde, Zhao Zhang,...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 3 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ASPLOS
1994
ACM
15 years 3 months ago
Reactive Synchronization Algorithms for Multiprocessors
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...
Beng-Hong Lim, Anant Agarwal