567 search results - page 104 / 114 » Program Optimization and Parallelization Using Idioms |
HPCA
1999
IEEE
14 years 3 months ago
1999
IEEE
Much research has been done in fast communication on clusters and in protocols for supporting software shared memory across them. However, the end performance of applications that...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
IPPS
2009
IEEE
14 years 5 months ago
2009
IEEE
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
ICDCS
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
SC
2003
ACM
14 years 4 months ago
2003
ACM
The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application, strided memory accesses fo...