5448 search results - page 864 / 1090 » Breakpoints and Time in Distributed Computations |
145
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
118
Voted
HPCA
2006
IEEE
16 years 4 months ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...
121
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
119
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Block-level continuous data protection (CDP) logs every disk block update so that disk updates within a time window are undoable. Standard file servers and DBMS servers can enjoy...
170
Voted
CCGRID
2008
IEEE
15 years 11 months ago
2008
IEEE
—Current data-centers employ admission control mechanism to maintain low response time and high throughput under overloaded scenarios. Existing mechanisms use internal (on the ov...