Lock Mechanism for Data Objects in a Cluster of Peers
A new approach for caching data objects and locks by a centroid from a server in a cluster of peers using ad hoc transactions is presented. A cluster of peers is formed by a set of mobile hosts, which are clustered around a single mobile host called a centroid. A set of mobile hosts are called peers...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A new approach for caching data objects and locks by a centroid from a server in a cluster of peers using ad hoc transactions is presented. A cluster of peers is formed by a set of mobile hosts, which are clustered around a single mobile host called a centroid. A set of mobile hosts are called peers. A centroid is formed as a temporary work group for processing and exchanging information. In life cycle of a mobile transaction processing system, data is cached from the server and a centroid is disconnected from the server to create its own cluster of peers. A dynamically configurable data processing space, called an envelope repository, is created to process various transactions at the centroid. The processed data is kept in an envelope at the private work space of the centroid and is brought to the envelope repository whenever required. |
---|---|
DOI: | 10.1109/ARTCom.2009.138 |