Sciweavers

847 search results - page 56 / 170
» Counting Polyominoes: A Parallel Implementation for Cluster ...
Sort
View
SIAMSC
2008
129views more  SIAMSC 2008»
13 years 7 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
ISHPC
2000
Springer
13 years 11 months ago
Partitioned Parallel Radix Sort
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
SC
2003
ACM
14 years 1 months ago
Dyn-MPI: Supporting MPI on Non Dedicated Clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
IPPS
2006
IEEE
14 years 1 months ago
A proactive fault-detection mechanism in large-scale cluster systems
To improve the whole dependability of large-scale cluster systems, an online fault detection mechanism is proposed in this paper. This mechanism can detect the fault in time befor...
Linping Wu, Dan Meng, Wen Gao, Jianfeng Zhan
HPCS
2002
IEEE
14 years 22 days ago
CoStore: A Reliable and Highly Available Storage System Using Clusters
The CoStore cluster architecture has been proposed to construct a reliable and highly available storage system. A prototype CoStore has been implemented and its performance has be...
Yong Chen, Lionel M. Ni, Cheng-Zhong Xu, Mingyao Y...