Results 1 - 10 of 457

Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology

by Sandhya Dwarkadas, Pete Keleher, Alan L. Cox, Willy Zwaenepoel
"... We evaluate the effect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine five different protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy invalidat ..."
Abstract - Cited by 467 (43 self) - Add to MetaCart
We evaluate the effect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine five different protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy

Abstract Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology

by Hya Dwarkadas, Pete Keleher, Alan L. Cox, Willy Zwaenepoel
"... Weevaluate the e ect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine ve di erent protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy invalidate, an ..."
Abstract - Add to MetaCart
Weevaluate the e ect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine ve di erent protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy invalidate

Improving Release-Consistent Shared Virtual Memory using Automatic Update

by Liviu Iftode , Cezary Dubnicki, Edward W. Felten, Kai Li - IN THE 2ND IEEE SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE , 1996
"... Shared virtual memory is a software technique to provide shared memory on a network of computers without special hardware support. Although several relaxed consistency models and implementations are quite effective, there is still a considerable performance gap between the "software-only" ..."
Abstract - Cited by 89 (21 self) - Add to MetaCart
Automatic Update Release Consistency (AURC), that uses automatic update to propagate and merge shared memory modifications. We compare the performance of this protocol against a software-only LRC implementation on several Splash2 applications and show that the AURC approach can substantially improve

Implementation and performance of Munin

by John B. Carter, John K. Bennett, Willy Zwaenepoel - IN PROCEEDINGS OF THE 13TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , 1991
"... Munin is a distributed shared memory (DSM) system that allows shared memory parallel programs to be executed efficiently on distributed memory multiprocessors. Munin is unique among existing DSM systems in its use of multiple consistency protocols and in its use of release consistency. In Munin, sha ..."
Abstract - Cited by 587 (22 self) - Add to MetaCart
to keep memory consistent. Munin's multiprotocol release consistency is implemented in software using a delayed update queue that buffers and merges pending outgoing writes. A sixteen-processor prototype of Munin is currently operational. We evaluate its implementation and describe the execution

Fast approximate nearest neighbors with automatic algorithm configuration

by Marius Muja, David G. Lowe - In VISAPP International Conference on Computer Vision Theory and Applications , 2009
"... nearest-neighbors search, randomized kd-trees, hierarchical k-means tree, clustering. For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high-dimensional problems ..."
Abstract - Cited by 455 (2 self) - Add to MetaCart
nearest-neighbors search, randomized kd-trees, hierarchical k-means tree, clustering. For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high

Automatically validating temporal safety properties of interfaces

by Thomas Ball, Sriram K. Rajamani , 2001
"... We present a process for validating temporal safety properties of software that uses a well-defined interface. The process requires only that the user state the property of interest. It then automatically creates abstractions of C code using iterative refinement, based on the given property. The pro ..."
Abstract - Cited by 433 (21 self) - Add to MetaCart
We present a process for validating temporal safety properties of software that uses a well-defined interface. The process requires only that the user state the property of interest. It then automatically creates abstractions of C code using iterative refinement, based on the given property

Improving the Performance of Software Distributed Shared Memory with Speculation

by Michael Kistler, Lorenzo Alvisi - IEEE Trans. on Parallel & Distributed Systems , 2005
"... We study the performance benefits of speculation in a release consistent software distributed shared memory system. We propose a new protocol, Speculative Home-based Release Consistency, that speculatively updates data at remote nodes to reduce the latency of remote memory accesses. Our protocol emp ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We study the performance benefits of speculation in a release consistent software distributed shared memory system. We propose a new protocol, Speculative Home-based Release Consistency, that speculatively updates data at remote nodes to reduce the latency of remote memory accesses. Our protocol

Collusion-Secure Fingerprinting for Digital Data

by Dan Boneh, James Shaw - IEEE Transactions on Information Theory , 1996
"... This paper discusses methods for assigning codewords for the purpose of fingerprinting digital data (e.g., software, documents, and images). Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy and trac ..."
Abstract - Cited by 353 (1 self) - Add to MetaCart
This paper discusses methods for assigning codewords for the purpose of fingerprinting digital data (e.g., software, documents, and images). Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy

Lazy Release Consistency for Distributed Shared Memory

by Peter Keleher, Peter Keleher , 1995
"... A software distributed shared memory (DSM) system allows shared memory parallel programs to execute on networks of workstations. This thesis presents a new class of protocols that has lower communication requirements than previous DSM protocols, and can consequently achieve higher performance. The l ..."
Abstract - Cited by 104 (0 self) - Add to MetaCart
. The lazy release consistent protocols achieve this reduction in communication by piggybacking consistency information on top of existing synchronization transfers. Some of the protocols also improve performance by speculatively moving data. We evaluate the impact of these features by comparing

An Evaluation of Software-Based Release Consistent Protocols

by Pete Keleher, Alan L. Cox, Sandhya Dwarkadas, Hya Dwarkadas, Willy Zwaenepoel - Journal of Parallel and Distributed Computing , 1995
"... This paper presents an evaluation of three software implementations of release consistency. Release consistent protocols allow data communication to be aggregated, and multiple writers to simultaneously modify a single page. We evaluated an eager invalidate protocol that enforces consistency when sy ..."
Abstract - Cited by 28 (5 self) - Add to MetaCart
This paper presents an evaluation of three software implementations of release consistency. Release consistent protocols allow data communication to be aggregated, and multiple writers to simultaneously modify a single page. We evaluated an eager invalidate protocol that enforces consistency when
Results 1 - 10 of 457