Results 1 - 10 of 5,528

Manetho: Transparent Rollback-Recovery with Low Overhead, Limited Rollback and Fast Output Commit

by Elmootazbellah N. Elnozahy, Willy Zwaenepoel - IEEE TRANSACTIONS ON COMPUTERS , 1992
"... Manetho is a new transparent rollback-recovery protocol for long-running distributed computations. It uses a novel combination of antecedence graph maintenance, uncoordinated checkpointing, and sender-based message logging. Manetho simultaneously achieves the advantages of pessimistic message loggin ..."
Abstract - Cited by 209 (11 self) - Add to MetaCart
logging, namely limited rollback and fast output commit, and the advantage of optimistic message logging, namely low failure-free overhead. These advantages come at the expense of a complex recovery scheme.

Using Message Semantics for Fast-Output Commit in Checkpointing-and-Rollback Recovery

by Luís Moura, Silva João, Gabriel Silva
"... Checkpointing is a very effective technique to ensure the continuity of long-running applications in the occurrence of failures. However, one of the handicaps of coordinated checkpointing is the high latency for committing output from the application to the external world. Enhancing the checkpointin ..."
Abstract - Add to MetaCart
Checkpointing is a very effective technique to ensure the continuity of long-running applications in the occurrence of failures. However, one of the handicaps of coordinated checkpointing is the high latency for committing output from the application to the external world. Enhancing

Fast and accurate short read alignment with Burrows-Wheeler transform

by Heng Li, Richard Durbin - BIOINFORMATICS, 2009, ADVANCE ACCESS , 2009
"... Motivation: The enormous amount of short reads generated by the new DNA sequencing technologies call for the development of fast and accurate read alignment programs. A first generation of hashtable based methods has been developed, including MAQ, which is accurate, feature rich and fast enough to a ..."
Abstract - Cited by 2096 (24 self) - Add to MetaCart
Motivation: The enormous amount of short reads generated by the new DNA sequencing technologies call for the development of fast and accurate read alignment programs. A first generation of hashtable based methods has been developed, including MAQ, which is accurate, feature rich and fast enough

Inflation Forecast Targeting: Implementing and Monitoring Inflation Targets

by Lars E. O. Svensson, Hans Dillén, Neil Ericsson, Jon Faust, Stanley Fischer, Marvin Goodfriend, Andrew Haldane, Hans Lindberg, David Mayes, Stefan Mellin, Frederic Mishkin, Stefan Palmqvist, Torsten Persson , 1996
"... Inflation targeting is shown to imply inflation forecast targeting: the central bank's inflation forecast becomes an explicit intermediate target. Inflation forecast targeting simplifies both implementation and monitoring of monetary policy. The weight on output stabilization determines how qui ..."
Abstract - Cited by 679 (48 self) - Add to MetaCart
Inflation targeting is shown to imply inflation forecast targeting: the central bank's inflation forecast becomes an explicit intermediate target. Inflation forecast targeting simplifies both implementation and monitoring of monetary policy. The weight on output stabilization determines how

The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding

by Thomas J. Richardson, Rüdiger L. Urbanke , 2001
"... In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract - Cited by 574 (9 self) - Add to MetaCart
In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly

X-means: Extending K-means with Efficient Estimation of the Number of Clusters

by Dau Pelleg, Andrew Moore - In Proceedings of the 17th International Conf. on Machine Learning , 2000
"... Despite its popularity for general clustering, K-means suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy for the t ..."
Abstract - Cited by 418 (5 self) - Add to MetaCart
) measure. The innovations include two new ways of exploiting cached sufficient statistics and a new very efficient test that in one K-means sweep selects the most promising subset of classes for refinement. This gives rise to a fast, statistically founded algorithm that outputs both the number of classes

The RC5 Encryption Algorithm

by Ronald L. Rivest , 1995
"... Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of data-dependent rotations. RC5 has a variable word size, a variable number of rounds, and a variable-lengt ..."
Abstract - Cited by 363 (7 self) - Add to MetaCart
Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of data-dependent rotations. RC5 has a variable word size, a variable number of rounds, and a variable

High performance messaging on workstations: Illinois Fast Messages (FM) for Myrinet

by Scott Pakin, Mario Lauria, Andrew Chien - In Supercomputing , 1995
"... In most computer systems, software overhead dominates the cost of messaging, reducing delivered performance, especially for short messages. Efficient software messaging layers are needed to deliver the hardware performance to the application level and to support tightly-coupled workstation clusters. ..."
Abstract - Cited by 311 (15 self) - Add to MetaCart
. Illinois Fast Messages (FM) 1.0 is a high speed messaging layer that delivers low latency and high bandwidth for short messages. For 128-byte packets, FM achieves bandwidths of 16.2 MB/s and one-way latencies 32 s on Myrinet-connected SPARCstations (user-level to user-level). For shorter packets, we have

External Memory Algorithms and Data Structures

by Jeffrey Scott Vitter , 1998
"... Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this paper, we surve ..."
Abstract - Cited by 349 (23 self) - Add to MetaCart
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this paper, we

Logtm: Log-based transactional memory

by Kevin E. Moore, Jayaram Bobba, Michelle J. Moravan, Mark D. Hill, David A. Wood - in HPCA , 2006
"... Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in isolation. Implementing these properties includes providing data version management for the simultaneous storage of both new (visible if the transaction commits) and old (r ..."
Abstract - Cited by 282 (11 self) - Add to MetaCart
(retained if the transaction aborts) values. Most (hardware) TM systems leave old values “in place” (the target memory address) and buffer new values elsewhere until commit. This makes aborts fast, but penalizes (the much more frequent) commits. In this paper, we present a new implementation
Results 1 - 10 of 5,528