Sciweavers

1415 search results - page 152 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
ICDCS
2009
IEEE
15 years 11 months ago
Fault-Tolerant Consensus in Unknown and Anonymous Networks
This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from cr...
Carole Delporte-Gallet, Hugues Fauconnier, Andreas...
EUROPAR
2001
Springer
15 years 6 months ago
Polynomial Preconditioning for Specially Structured Linear Systems of Equations
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...
Y. Liang, Jim Weston, Marek Szularz
IPPS
2006
IEEE
15 years 8 months ago
Optimizing bandwidth limited problems using one-sided communication and overlap
This paper demonstrates the one-sided communication used in languages like UPC can provide a significant performance advantage for bandwidth-limited applications. This is shown t...
Christian Bell, Dan Bonachea, Rajesh Nishtala, Kat...
CLUSTER
2002
IEEE
15 years 2 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
HPDC
2005
IEEE
15 years 7 months ago
Collective caching: application-aware client-side file caching
Parallel file subsystems in today’s high-performance computers adopt many I/O optimization strategies that were designed for distributed systems. These strategies, for instance...
Wei-keng Liao, Kenin Coloma, Alok N. Choudhary, Le...