Sciweavers

197 search results - page 2 / 40
» Robust Parallel Computations through Randomization
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Enhancing application robustness through adaptive fault tolerance
As the scale of high performance computing (HPC) continues to grow, application fault resilience becomes crucial. To address this problem, we are working on the design of an adapt...
Zhiling Lan, Yawei Li, Ziming Zheng, Prashasta Guj...
PARA
2004
Springer
14 years 1 months ago
Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
Keita Teranishi, Padma Raghavan
ICDCN
2011
Springer
12 years 12 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
PDCAT
2005
Springer
14 years 2 months ago
LRC-RED: A Self-tuning Robust and Adaptive AQM Scheme
In this paper, we propose a novel active queue management (AQM) scheme based on the Random Early Detection (RED) of the loss ratio and the total sending rate control, called LRC-R...
Naixue Xiong, Yan Yang, Xavier Défago, Yanx...
SPDP
1991
IEEE
14 years 17 hour ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari