Semi-traces and Their Application in Concurrency Control Problem
نویسنده
چکیده
The theory of traces was originated by A. Mazurkiewicz to model non-sequential behaviour of a distributed system. The normal form of a trace shows us an optimal way to execute a process occurred on the system. Nevertheless, the independence of actions in many systems is not static and depends on the history of the systems. To describe this fact, D. Kuske and R. Morin proposed a notion of local independence. Basing on the local independence, we introduce a notion of semi-trace, analyze its structure and the relationship between traces and semi-traces. Furthermore, we investigate some applications of semitraces in concurrency control problem. © 2009 Springer Berlin Heidelberg. Author
منابع مشابه
A Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملارائه الگوریتم پویا برای تنظیم همروندی فرایندهای کسبوکار
Business process management systems (BPMS) are vital complex information systems to compete in the global market and to increase economic productivity. Workload balancing of resources in BPMS is one of the challenges have been long studied by researchers. Workload balancing of resources increases the system stability, improves the efficiency of the resources and enhances the quality of their pr...
متن کاملOn the Synchronization of Semi-Traces
The synchronization of two or more semi-traces describes the possible evaluation of a concurrent system, which consists of two or more concurrent subsystems in a modular way, where communication between the subsystems restricts the order of the actions. In this paper we give criteria, which tell us for given semi-traces in given semicommutation systems, whether they are synchronizable and wheth...
متن کاملWorking Paper Alfred P. Sloan School of Management Hierarchical Timestamping Algorithm Hierarchical Timestamping Algorithm Oct 2 1987 Received Hierarchical Timestamping Algorithm
The Hierarchical Timestamping Algorithm is proposed for handling database concurrency control. By analyzing transaction conflicts and partitioning the database into hierarchical partitions to which transactions will access discriminantly using different synchronization protocols, the algorithm can offer significant performance gain. It also reduces the need for transactions to leave traces (e.g...
متن کامل