1534 search results - page 204 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
PPOPP
2006
ACM
14 years 4 months ago
2006
ACM
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...
ICCAD
2007
IEEE
14 years 4 months ago
2007
IEEE
— This paper describes the FAST methodology that enables a single FPGA to accelerate the performance of cycle-accurate computer system simulators modeling modern, realistic SoCs,...
SPAA
2010
ACM
14 years 3 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
IEEEPACT
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper describes a compiler for stream programs that efficiently schedules computational kernels and stream memory operations, and allocates on-chip storage. Our compiler uses...
PPOPP
2005
ACM
14 years 3 months ago
2005
ACM
Recently, system architects have built low-power, high-performance clusters, such as Green Destiny. The idea behind these clusters is to improve the energy efficiency of nodes. H...