Sciweavers

93 search results - page 3 / 19
» Fast and Efficient Total Exchange on Two Clusters
Sort
View
ISPDC
2007
IEEE
15 years 3 months ago
Towards Data Partitioning for Parallel Computing on Three Interconnected Clusters
We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can...
Brett A. Becker, Alexey L. Lastovetsky
KES
2004
Springer
15 years 2 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
NCA
2005
IEEE
15 years 3 months ago
Slingshot: Time-Critical Multicast for Clustered Applications
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
Mahesh Balakrishnan, Stefan Pleisch, Ken Birman
ASAP
2000
IEEE
90views Hardware» more  ASAP 2000»
15 years 2 months ago
Subword Permutation Instructions for Two-Dimensional Multimedia Processing in MicroSIMD Architectures
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
Ruby B. Lee
RT
1998
Springer
15 years 1 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion