Online from: 1982
Subject Area: Electrical & Electronic Engineering
Options: To add Favourites and Table of Contents Alerts please take a Emerald profile
|Title:||Petri net-based modeling and performance analysis of transaction scheduling in grid database|
|Author(s):||Yaojun Han, (Shanghai International Studies University, Shanghai, China), Changjun Jiang, (Tongji University, Shanghai, China), Xuemei Luo, (Shanghai International Studies University, Shanghai, China)|
|Citation:||Yaojun Han, Changjun Jiang, Xuemei Luo, (2009) "Petri net-based modeling and performance analysis of transaction scheduling in grid database", COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, Vol. 28 Iss: 6, pp.1458 - 1470|
|Keywords:||Algorithm, Grid database, Modeling, Transaction scheduling|
|Article type:||Research paper|
|DOI:||10.1108/03321640910992010 (Permanent URL)|
|Publisher:||Emerald Group Publishing Limited|
Purpose – The purpose of this paper is to present a scheduling model, scheduling algorithms, and formal model and analysis techniques for concurrency transaction in grid database environment.
Design/methodology/approach – Classical transaction models and scheduling algorithms developed for homogeneous distributed architecture will not work in the grid architecture and should be revisited for this new and evolving architecture. The conventional model is improved by three-level transaction scheduling model and the scheduling algorithms for concurrency transaction is improved by considering transmission time of a transaction, user's priority, and the number of database sites accessed by the transaction as a priority of the transaction. Aiming at the problems of analysis and modeling of the transaction scheduling in grid database, colored dynamic time Petri nets (CDTPN) model are proposed. Then the reachability of the transaction scheduling model is analyzed.
Findings – The three-level transaction scheduling model not only supports the autonomy of grid but also lightens the pressure of communication. Compared with classical transaction scheduling algorithms, the algorithms not only support the correctness of the data but also improve the effectiveness of the system. The CDTPN model is convenient for modeling and analyzing dynamic performance of grid transaction. Some important results such as abort-ratio and turnover-time are gotten by analyzing reachability of CDTPN.
Originality/value – The three-level transaction scheduling model and improved scheduling algorithms with more complex priority are presented in the paper. The paper gives a CDTPN model for modeling transaction scheduling in grid database. In CDTPN model, the time interval of a transition is a function of tokens in input places of the transition.
To purchase this item please login or register.
Complete and print this form to request this document from your librarian