Sciweavers

3886 search results - page 359 / 778
» Implementing Fault-Tolerant Distributed Applications
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 5 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
IPPS
2003
IEEE
15 years 10 months ago
RMIX: A Multiprotocol RMI Framework for Java
With the increasing adoption of Java for parallel and distributed computing, there is a strong motivation for enhancing the expressive elegance of the RMI paradigm with flexible ...
Dawid Kurzyniec, Tomasz Wrzosek, Vaidy S. Sunderam...
ISORC
2007
IEEE
15 years 11 months ago
Real-Time Dynamic Guarantee in Component-Based Middleware
This paper describes an extension to the componentbased programming model to support real-time dynamic guarantee for distributed applications. The extended model aims to include a...
Cássia Yuri Tatibana, Carlos Montez, R&ocir...
IPPS
2006
IEEE
15 years 11 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...
PPOPP
2005
ACM
15 years 10 months ago
Performance modeling and optimization of parallel out-of-core tensor contractions
The Tensor Contraction Engine (TCE) is a domain-specific compiler for implementing complex tensor contraction expressions arising in quantum chemistry applications modeling elect...
Xiaoyang Gao, Swarup Kumar Sahoo, Chi-Chung Lam, J...