Sciweavers

615 search results - page 59 / 123
» Design and Implementation of Parallel Algorithms for Gene-Fi...
Sort
View
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
TPDS
2008
124views more  TPDS 2008»
13 years 7 months ago
Efficient Breadth-First Search on the Cell/BE Processor
Multicore processors are an architectural paradigm shift that promises a dramatic increase in performance. But, they also bring an unprecedented level of complexity in algorithmic ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
IFIP
2003
Springer
14 years 29 days ago
Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays
Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design ...
Mitali Singh, Viktor K. Prasanna, José D. P...
PPOPP
2011
ACM
12 years 10 months ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
IFIP
2010
Springer
13 years 2 months ago
Rialto 2.0: A Language for Heterogeneous Computations
Modern embedded systems are often heterogeneous in that their design requires several description paradigms, based on different models of computation and concurrency (MoCCs). In th...
Johan Lilius, Andreas Dahlin, Lionel Morel