Transactional Cluster Computing
نویسندگان
چکیده
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional operating systems are complex and difficult to program. As an alternative the distributed memory idea simplifies and unifies memory access, but performance drawbacks caused by expensive distributed locking mechanisms obviated this approach for cluster computing. To avoid these slowdowns more and more weak consistency models try to avoid these slowdowns by burdening the programmer with explicit synchronization. Our research group has developed a fast transaction system for a distributed heap that guarantees semantically correct access to shared memory.
منابع مشابه
Experimental Evaluation of Horizontal and Vertical Scalability of Cluster-Based Application Servers for Transactional Workloads
The scalability of the application servers is an essential issue to guarantee the quality of the services provided by any company that sell its products and services through Internet in business-to-business (B2B) environments. This paper deals with the selection of a proper transactional load to evaluate the scalability, in order to obtain representative results that can provide useful insights...
متن کاملDistributed Clustering and Scheduling of Object-Oriented Virtual Machines
This report presents an overview of several approaches to provide a Single System Image view of a cluster, particularly concerning the view of a single address space. The main focus of our work is to understand the current approaches for clustering a regular multithreaded and non-cluster-aware Java application, as well as the current techniques and metrics for scheduling threads in a heterogene...
متن کاملDesigning a Software Transactional Memory for Peer-to-Peer Systems
Transactional memory is a rather novel approach to concurrency control in parallel computing, that has just recently found its way into distributed systems research. However, the research concentrates mainly on single processor solutions or cluster environment. In this paper we argue, that peer-to-peer systems would require a different design of transactional memory because of the increased fai...
متن کاملDistributed Software Transactional Memory
This report describes an implementation of a distributed software transactional memory (DSTM) system in PLT Scheme. The system is built using PLT Scheme’s Unit construct to encapsulate the various concerns of the system, and allow for multiple communication layer backends. The front-end API exposes true parallel processing to PLT Scheme programmers, as well as cluster-based computing using a sh...
متن کاملDetermining the Best K for Clustering Transactional Datasets: A Coverage Density-based Approach
The problem of determining the optimal number of clusters is important but mysterious in cluster analysis. In this paper, we propose a novel method to find a set of candidate optimal number Ks of clusters in transactional datasets. Concretely, we propose Transactional-cluster-modes Dissimilarity based on the concept of coverage density as an intuitive transactional inter-cluster dissimilarity m...
متن کاملDetermining the Best K for Clustering Transactional Datasets: A Coverage Density-based Approach
The problem of determining the optimal number of clusters is important but mysterious in cluster analysis. In this paper, we propose a novel method to find a set of candidate optimal number Ks of clusters in transactional datasets. Concretely, we propose Transactional-cluster-modes Dissimilarity based on the concept of coverage density as an intuitive transactional inter-cluster dissimilarity m...
متن کامل