808 search results - page 111 / 162 » Data Communication and Parallel Computing on Twisted Hypercu... |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
HPDC
2008
IEEE
13 years 7 months ago
2008
IEEE
Efficiently executing large-scale, data-intensive workflows such as Montage must take into account the volume and pattern of communication. When orchestrating data-centric workflo...
IPPS
2000
IEEE
14 years 1 days ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
HPCA
2000
IEEE
14 years 1 days ago
2000
IEEE
Efficiency of synchronization mechanisms can limit the parallel performance of many shared-memory applications. In addition, the ever increasing performance gap between processor...
IPPS
2000
IEEE
14 years 1 days ago
2000
IEEE
Abstract. Parallel processing is based on utilizing a group of processors to efficiently solve large problems faster than is possible on a single processor. To accomplish this, the...