Open AccessPosted Content
Deterministic Consistency: A Programming Model for Shared Memory Parallelism
Amittai Aviram,Bryan Ford +1 more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Efficient System-Enforced Deterministic Parallelism
TL;DR: This work introduces a new parallel programming model addressing issues of misbehaved software, and uses Determinator, a proof-of-concept OS, to demonstrate the model's practicality.
175
Determinating timing channels in compute clouds
Amittai Aviram,Sen Hu,Bryan Ford,Ramakrishna Gummadi +3 more
- 08 Oct 2010
TL;DR: In this article, the authors propose a new approach to timing channel control, using provider-enforced deterministic execution instead of resource partitioning to eliminate timing channels within a shared cloud domain.
122
Conversion: multi-version concurrency control for main memory segments
Timothy Merrifield,Jakob Eriksson +1 more
- 15 Apr 2013
TL;DR: Conversion, a multi-version concurrency control system for main memory segments, provides isolation between processes that each operate on their own working copy and is well suited to a wide variety of concurrent applications.
44
•Posted Content
Determinating Timing Channels in Compute Clouds
TL;DR: This work proposes a new approach to timing channel control, using provider-enforced deterministic execution instead of resource partitioning to eliminate timing channels within a shared cloud domain, and experiments suggest that such an approach may be practical and efficient.
Efficient system-enforced deterministic parallelism
TL;DR: Determinator as discussed by the authors is a proof-of-concept OS that uses a microkernel application programming interface (API) with shared-nothing address spaces and deterministic interprocess communication primitives to make execution of all unprivileged code precisely repeatable.
References
Practical Byzantine fault tolerance
Miguel Castro,Barbara Liskov +1 more
- 22 Feb 1999
TL;DR: A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
The PARSEC benchmark suite: characterization and architectural implications
Christian Bienia,Sanjeev Kumar,Jaswinder Pal Singh,Kai Li +3 more
- 25 Oct 2008
TL;DR: This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs), and shows that the benchmark suite covers a wide spectrum of working sets, locality, data sharing, synchronization and off-chip traffic.
Implementing fault-tolerant services using the state machine approach: a tutorial
TL;DR: The state machine approach is a general method for implementing fault-tolerant services in distributed systems and protocols for two different failure models—Byzantine and fail stop are described.
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
TL;DR: Many large sequential computers execute operations in a different order than is specified by the program, and a correct execution by each processor does not guarantee the correct execution of the entire program.
Transactional memory: architectural support for lock-free data structures
Maurice Herlihy,J. Eliot B. Moss +1 more
- 01 May 1993
TL;DR: Simulation results show that transactional memory matches or outperforms the best known locking techniques for simple benchmarks, even in the absence of priority inversion, convoying, and deadlock.