Sciweavers

130 search results - page 16 / 26
» A Parallel Priority Queue with Constant Time Operations
Sort
View
74
Voted
DATE
2008
IEEE
165views Hardware» more  DATE 2008»
15 years 3 months ago
TinyTimber, Reactive Objects in C for Real-Time Embedded Systems
Embedded systems are often operating under hard real-time constraints. Such systems are naturally described as time-bound reactions to external events, a point of view made manife...
Per Lindgren, Johan Eriksson, Simon Aittamaa, Joha...
FSTTCS
1995
Springer
15 years 1 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
77
Voted
PPOPP
2010
ACM
15 years 4 months ago
Load balancing on speed
To fully exploit multicore processors, applications are expected to provide a large degree of thread-level parallelism. While adequate for low core counts and their typical worklo...
Steven Hofmeyr, Costin Iancu, Filip Blagojevic
IANDC
2006
77views more  IANDC 2006»
14 years 9 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
CLUSTER
2006
IEEE
14 years 9 months ago
Deferred Assignment Scheduling in Cluster-Based Servers
This paper proposes a new scheduling policy for cluster-based servers called DAS (Deferred Assignment Scheduling). The main idea in DAS is to defer scheduling as much as possible,...
Victoria Ungureanu, Benjamin Melamed, Michael N. K...