6105 search results - page 837 / 1221 » A Parallel Algorithm for Bound-Smoothing |
181
click to vote
PPOPP
2006
ACM
16 years 22 days ago
2006
ACM
We present two new nonblocking and contention-free implementations of synchronous queues, concurrent transfer channels in which producers wait for consumers just as consumers wait...
142
Voted
ICDCS
2005
IEEE
16 years 12 days ago
2005
IEEE
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
181
Voted
ICPP
2005
IEEE
16 years 11 days ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
193
click to vote
IPPS
2005
IEEE
16 years 11 days ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
186
Voted
IPPS
2005
IEEE
16 years 11 days ago
2005
IEEE
We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an exam...