Abstract

PurposeThe 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/approachClassical 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.FindingsThe 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/valueThe 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.