Sciweavers

123 search results - page 14 / 25
» jpdc 2006
Sort
View
JPDC
2006
104views more  JPDC 2006»
14 years 9 months ago
Performance analysis of different checkpointing and recovery schemes using stochastic model
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...
Partha Sarathi Mandal, Krishnendu Mukhopadhyaya
JPDC
2006
134views more  JPDC 2006»
14 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
JPDC
2006
106views more  JPDC 2006»
14 years 9 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
JPDC
2006
123views more  JPDC 2006»
14 years 9 months ago
Data redistribution and remote method invocation for coupled components
With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity o...
Felipe Bertrand, Randall Bramley, David E. Bernhol...
JPDC
2000
47views more  JPDC 2000»
14 years 9 months ago
Time-Step Optimal Broadcasting in 3-D Meshes with Minimum Total Communication Distance
In this paper we propose a new minimum total communication distance T CD algorithm and an optimal T CD algorithm for broadcast in a 3-dimensional mesh 3-D mesh. The former generat...
Songluan Cang, Jie Wu