Sciweavers

1517 search results - page 140 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
ICS
2011
Tsinghua U.
14 years 8 months ago
High performance linpack benchmark: a fault tolerant implementation without checkpointing
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
Teresa Davies, Christer Karlsson, Hui Liu, Chong D...
ICDE
2012
IEEE
267views Database» more  ICDE 2012»
13 years 7 months ago
Scalable and Numerically Stable Descriptive Statistics in SystemML
—With the exponential growth in the amount of data that is being generated in recent years, there is a pressing need for applying machine learning algorithms to large data sets. ...
Yuanyuan Tian, Shirish Tatikonda, Berthold Reinwal...
BMCBI
2010
124views more  BMCBI 2010»
15 years 4 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
PPAM
2007
Springer
15 years 10 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
CCGRID
2008
IEEE
15 years 6 months ago
Fault Tolerance in Cluster Federations with O2P-CF
Fault tolerance is one of the key issues for large scale applications executed on high performance computing systems. In a cluster federation, clusters are gathered to provide hug...
Thomas Ropars, Christine Morin