Sciweavers

1517 search results - page 229 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
145
Voted
CCGRID
2009
IEEE
15 years 10 months ago
Natively Supporting True One-Sided Communication in
As high-end computing systems continue to grow in scale, the performance that applications can achieve on such large scale systems depends heavily on their ability to avoid explic...
Gopalakrishnan Santhanaraman, Pavan Balaji, K. Gop...
152
Voted
CLUSTER
2005
IEEE
15 years 9 months ago
Near Overhead-free Heterogeneous Thread-migration
Thread migration moves a single call-stack to another machine to improve either load balancing or locality. Current approaches for checkpointing and thread migration are either no...
Ronald Veldema, Michael Philippsen
113
Voted
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
15 years 5 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
152
Voted
CLUSTER
2009
IEEE
15 years 1 months ago
Design alternatives for implementing fence synchronization in MPI-2 one-sided communication for InfiniBand clusters
Scientific computing has seen an immense growth in recent years. The Message Passing Interface (MPI) has become the de-facto standard for parallel programming model for distribute...
Gopalakrishnan Santhanaraman, Tejus Gangadharappa,...
127
Voted
BMCBI
2006
117views more  BMCBI 2006»
15 years 3 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...