6181 search results - page 658 / 1237 » Transactional Cluster Computing |
153
Voted
CLUSTER
2008
IEEE
16 years 1 months ago
2008
IEEE
—High-speed interconnects are frequently used to provide scalable communication on increasingly large high-end computing systems. Often, these networks are nonblocking, where the...
186
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
188
click to vote
CLUSTER
2007
IEEE
16 years 1 months ago
2007
IEEE
— Achieving high performance for out-of-core applications typically involves explicit management of the movement of data between the disk and the physical memory. We are developi...
208
click to vote
CLUSTER
2007
IEEE
16 years 1 months ago
2007
IEEE
— SuperMatrix out-of-order scheduling leverages el abstractions and straightforward data dependency analysis to provide a general-purpose mechanism for obtaining parallelism from...
159
Voted
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The advent of the Beowulf cluster in 1994 provided dedicated compute cycles, i.e., supercomputing for the masses, as a cost-effective alternative to large supercomputers, i.e., su...