ARTÍCULO
TITULO

Envelope Transaction Mechanism for A Cluster of Peers

Sushil T. Kulkarni    
Mukund A. Sanglikar    

Resumen

A new approach for mobile transaction processing is presented in a cluster of peers. A cluster is a dynamic collection of mobile hosts called peers and are clustered around a single mobile host called a centroid to form a temporary work group for processing and exchanging information. All peers are connected to the centroid using a short range wireless network. All peers and the centroid are members of a peer connected set. The centroid is chosen in such a way that it has a strong connection to the mobile support station. After collecting data from a server, the centroid is free to disconnect from the server and ready to create its own cluster of peers. To process various transactions at the centroid, a dynamically configurable data processing space is created called the envelope repository. Processed data is kept at a private work space of the centroid in an envelope and brought to the envelope repository whenever required. A peer initiates a jumping transaction to fetch data objects to the centroid. The jumping transaction initiates an envelope transaction to acquire the necessary locks on data objects at envelope repository. After getting the locks, intension transaction processes the data objects to give the result stored in an envelope. Envelope intension write protocol is designed to make jumping transactions globally serialized.

 Artículos similares

       
 
Qianwen Zhou, Changqing Zhu and Na Ren    
With the increasing ease of building information modeling data usage, digital watermarking technology has become increasingly crucial for BIM data copyright protection. In response to the problem that existing robust watermarking methods mainly focus on ... ver más
Revista: Applied Sciences

 
Dominic Windisch, Christian Kaever, Guido Juckeland and André Bieberle    
In this article, we introduce a parallel algorithm for connected-component analysis (CCA) on GPUs which drastically reduces the volume of data to transfer from GPU to the host. CCA algorithms targeting GPUs typically store the extracted features in array... ver más
Revista: Algorithms

 
Abiodun M. Ikotun and Absalom E. Ezugwu    
Automatic clustering problems require clustering algorithms to automatically estimate the number of clusters in a dataset. However, the classical K-means requires the specification of the required number of clusters a priori. To address this problem, met... ver más
Revista: Applied Sciences

 
Matteo Taroni, Jacopo Selva and Jiancang Zhuang    
The use of the tapered Gutenberg-Richter distribution in earthquake source models is rapidly increasing, allowing overcoming the definition of a hard threshold for the maximum magnitude. Here, we expand the classical maximum likelihood estimation method ... ver más
Revista: Applied Sciences

 
Darshana T. Dassanayake, Alessandro Antonini, Athanasios Pappas, Alison Raby, James Mark William Brownjohn and Dina D?Ayala    
The survivability analysis of offshore rock lighthouses requires several assumptions of the pressure distribution due to the breaking wave loading (Raby et al. (2019), Antonini et al. (2019). Due to the peculiar bathymetries and topographies of rock pinn... ver más