Results 1 -
5 of
5
Towards the integration of distributed transactional memories in application servers’ clusters. In: The Third International Workshop on Advanced Architectures and Algorithms for Internet DElivery and Applications
- In: Proc. of the Symposium on Reliable Distributed Systems (SRDS
, 2002
"... Abstract. The transition to multicore architectures has raised the urge to identify novel programming paradigms aimed at simplifying the development of parallel programs. Transactional Memories (TM) are regarded as one of the most promising approaches to address this issue, as highlighted by the hug ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Abstract. The transition to multicore architectures has raised the urge to identify novel programming paradigms aimed at simplifying the development of parallel programs. Transactional Memories (TM) are regarded as one of the most promising approaches to address this issue, as highlighted by the huge interest garnered in the research community over the last years. Distributed Transactional Memories (DTMs) represent a very recent branching of the research line on TMs, aimed at enhancing their scalability and dependability. In this paper, we review some of our recent results and research directions focused on the integration of DTMs in clusters of web application servers and on the design of scalable and fault-tolerant DTM algorithms. 1
An Efficient Weak Mutual Exclusion Algorithm
, 2009
"... The Weak Mutual Exclusion (WME) is a recently proposed abstraction which, analogously to classical Distributed Mutual Exclusion (DME), permits to serialize concurrent accesses to a shared resource. Unlike DME, however, the WME abstractionregulates the access to a replicated shared resource and is so ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
The Weak Mutual Exclusion (WME) is a recently proposed abstraction which, analogously to classical Distributed Mutual Exclusion (DME), permits to serialize concurrent accesses to a shared resource. Unlike DME, however, the WME abstractionregulates the access to a replicated shared resource and is solvable in the presence of less restrictive synchrony assumptions, i.e. in an asynchronous system augmented with an eventually perfect failure detector. This paper presents an efficient WME algorithm which outperforms previous solutions in terms of both communication latency and message complexity, while relying on minimal synchrony assumptions.
1 Distributed Software Transactional Memories: A Summary of Research @ IST/INESC-ID
"... Distributed Transactional Memory (DTM) aims at introducing a novel programming paradigm combining the simplicity of Transactional Memory (TM)[11] with the scalability and failure resiliency achievable by exploiting the resource redundancy ..."
Abstract
- Add to MetaCart
(Show Context)
Distributed Transactional Memory (DTM) aims at introducing a novel programming paradigm combining the simplicity of Transactional Memory (TM)[11] with the scalability and failure resiliency achievable by exploiting the resource redundancy