543 search results - page 80 / 109 » A Randomized Parallel Sorting Algorithm with an Experimental... |
116
click to vote
JCO
2010
15 years 19 days ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
147
Voted
ICPPW
2007
IEEE
15 years 8 months ago
2007
IEEE
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
120
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
129
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider unicast-based pipelined broadcast schemes for clusters connected by multiple Ethernet switches. By splitting a large broadcast message into segments and broadcasting t...
129
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...