Themis: Enforcing Titanium Consistency on the NOW
نویسندگان
چکیده
Titanium is a single program, multiple data (SPMD) programming language based on Java. Titanium defines a data consistency model equivalent to the Java specification. This consistency model calls for locally sequential consistency, with global consistency attained at synchronization points and arbitrary write reordering. The Titanium language is targeted at homogeneous multiprocessors on distributed memory architectures. Accesses to distant memory locations may result in communication over a network. The Themis system builds a Titaniumcompliant consistency interface for Active Messages running on a NOW. This paper examines several methods for designing a Themis system that performs well for Titanium applications. Microbenchmark tests and a Conjugate Gradient Method test show the viability of each of these designs. One of the methods, a caching mechanism called OrderCache, displays promise for reducing communication loads and exploiting the locality of data within applications.
منابع مشابه
Box Consistency through Weak Box Consistency
Interval constraint solvers use local consistencies— among which one worth mentioning is box consistency— for computing verified solutions of real constraint systems. Though among the most efficient ones, the algorithm for enforcing box consistency suffers from the use of timeconsuming operators. This paper first introduces boxφ consistency, a weakening of box consistency; this new notion then ...
متن کاملCORROSION BEHAVIOR OF BIOACTIVATED TITANIUM DENTAL IMPLANT USING DIFFERENT CHEMICAL METHODS
At the past, damaged tissue was removed from the body of patients. But now tissue regeneration using scaffolds and implants are used to repair the damaged tissue and organs. Besides of the mechanical properties of metallic biomaterials, they suffer from bioinertness. Using some surface treatment techniques, the bioactivity and also corrosion resistance of titanium implants could be improved. In...
متن کاملExploiting Structure in Constraint Propagation
Local consistency properties and algorithms for enforcing them are central to the success of Constraint Processing. In this paper, we explore how to exploit the structure of the problem on the performance of the algorithm for enforcing consistency. We propose various strategies for managing the propagation queue of an algorithm for enforcing consistency, and empirically compare their effectiven...
متن کاملBound Consistency on Linear Constraints in Finite Domain Constraint
This paper discusses the complexity of bound consistency on n-ary linear constraint system and investigates the relationship between equivalent binary equation systems from the perspective of bound consistency techniques. We propose an efficient bound consistency enforcing algorithm whose complexity is .In addition, by transforming a binary equation system into solved form, an efficient consist...
متن کاملEnforcing Routing Consistency in Structured Peer-to-Peer Overlays: Should We and Could We?
In this paper, we argue that enforcing routing consistency in keybased routing (KBR) protocols can simplify P2P application design and make structured P2P overlays suitable for more applications. We define two levels of routing consistency semantics, namely weakly consistent KBR and strongly consistent KBR. We focus on an algorithm that provides strong consistency based on group membership serv...
متن کامل