Sciweavers

1113 search results - page 52 / 223
» Performance under Failures of DAG-based Parallel Computing
Sort
View
HPDC
1997
IEEE
15 years 6 months ago
Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols
This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a techn...
Roy Friedman, Robbert van Renesse
110
Voted
IPPS
2010
IEEE
14 years 11 months ago
Initial characterization of parallel NFS implementations
Parallel NFS (pNFS) is touted as an emergent standard protocol for parallel I/O access in various storage environments. Several pNFS prototypes have been implemented for initial v...
Weikuan Yu, Jeffrey S. Vetter
87
Voted
IPPS
2006
IEEE
15 years 8 months ago
An advanced performance analysis of self-stabilizing protocols: stabilization time with transient faults during convergence
A self-stabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended b...
Yoshihiro Nakaminami, Hirotsugu Kakugawa, Toshimit...
124
Voted
IPPS
2010
IEEE
14 years 11 months ago
MMT: Exploiting fine-grained parallelism in dynamic memory management
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...
Devesh Tiwari, Sanghoon Lee, James Tuck, Yan Solih...
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
14 years 5 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...