6105 search results - page 890 / 1221 » A Parallel Algorithm for Bound-Smoothing |
155
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
256
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
196
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
199
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The multi-level storage architecture has been widely adopted in servers and data centers. However, while prefetching has been shown as a crucial technique to exploit the sequentia...
218
click to vote
PODC
2006
ACM
16 years 20 days ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...