A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Provide a New Mapping for Deadlock Detection and Resolution Modeling of Distributed Database to Colored Petri Net
2014
International Journal of Computer Applications
Preserved Fulltext
Deadlock problem for a distributed database system that uses locking as a concurrency control algorithm, as there are inherent. ...
In the model proposed the new rules for mapping TWFG with colored Petri nets for modeling the deadlocks detection and resolve. ...
Kawazu Algorithm This algorithm [8] is based on two-phase locking protocol. In first phase local deadlock and in second phase global in the absence of local deadlock are diagnosed. ...
doi:10.5120/16587-6289
fatcat:awwkcbzl5jfehod6bdlq5h2e4y
Modeling and Verification of Deadlock Potentials of a Concurrency Control Mechanism in Distributed Databases Using Hierarchical Colored Petri Net
2012
International Journal of Information and Education Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, a novel model of CCM based on two phase locking (2PL) using CPN has presented. ...
Colored Petri net (CPN) has high modeling capabilities and is one of the best methods for formal analysis and verification of CCMs. ...
Modeling two phase commit protocol for transaction management in distributed environment is studied using time Petri net [5] . ...
doi:10.7763/ijiet.2012.v2.86
fatcat:ysir5ybdbvcvnlf2b6zfsxni7q
Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs
2008
USENIX Symposium on Operating Systems Design and Implementation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Existing approaches to deadlock impose onerous burdens on developers, entail high runtime performance overheads, or offer no help for unmodified legacy code. ...
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. ...
Finally we thank our shepherd, Remzi Arpaci-Dusseau, and the anonymous OSDI reviewers for many helpful suggestions. ...
dblp:conf/osdi/WangKKLM08
fatcat:7k4vgpinlfbc3nsvzxgoghhsji
An efficient deadlock prevention approach for service oriented transaction processing
2012
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A general algorithm is designed for both local and global deadlock prevention. The experimental results demonstrate the effectiveness and efficiency of our deadlock prevention approach. ...
Locking resources is widely used in distributed transaction management (e.g., two phase commit, 2PC) to keep the system consistent. ...
[12] proposed a Petri net based deadlock prevention policy based on the liveness or the reachability of Petri nets. ...
doi:10.1016/j.camwa.2011.07.063
fatcat:tj7xxky2irdehp4yu54msf45dm
The theory of deadlock avoidance via discrete control
2008
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our method furthermore guarantees that the control logic is maximally permissive: it postpones lock acquisitions only when necessary to prevent deadlocks, and therefore permits maximal runtime concurrency ...
At run time, the control logic avoids deadlocks by postponing lock acquisitions. Discrete Control Theory guarantees that the program instrumented with our synthesized control logic cannot deadlock. ...
Acknowledgments We thank Eric Anderson, Hans Boehm, Pramod Joisha, Hongwei Liao, Spyros Reveliotis, and the anonymous reviewers for many helpful comments. ...
doi:10.1145/1480881.1480913
dblp:conf/popl/WangLKKM09
fatcat:s6t3pn53mfdxrnllmaguxxvqpa
The theory of deadlock avoidance via discrete control
2009
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our method furthermore guarantees that the control logic is maximally permissive: it postpones lock acquisitions only when necessary to prevent deadlocks, and therefore permits maximal runtime concurrency ...
At run time, the control logic avoids deadlocks by postponing lock acquisitions. Discrete Control Theory guarantees that the program instrumented with our synthesized control logic cannot deadlock. ...
Acknowledgments We thank Eric Anderson, Hans Boehm, Pramod Joisha, Hongwei Liao, Spyros Reveliotis, and the anonymous reviewers for many helpful comments. ...
doi:10.1145/1594834.1480913
fatcat:ecuks66hanfyrbjmo75sffzxse
Using Petri nets to introduce operating system concepts
1991
Proceedings of the twenty-second SIGCSE technical symposium on Computer science education - SIGCSE '91
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Examples of models for the concept of deadlocks, for the deadlock detection algorithm, and the fork/'oin and parbegin/parend concurrency constructs are shown, In addition, discussion of how Petri net models ...
In this paper the use of the graphical aspects of Petri net theory as a tool to introduce operating system concepts is given. ...
For the graphical "does the net deadlock?" A Petri net is deadlocked if no transitions are enabled. ...
doi:10.1145/107004.107074
dblp:conf/sigcse/Jeffrey91
fatcat:f6nywmrfyvgczm2554mw6dqp3a
Using Petri nets to introduce operating system concepts
1991
ACM SIGCSE Bulletin
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Examples of models for the concept of deadlocks, for the deadlock detection algorithm, and the fork/'oin and parbegin/parend concurrency constructs are shown, In addition, discussion of how Petri net models ...
In this paper the use of the graphical aspects of Petri net theory as a tool to introduce operating system concepts is given. ...
For the graphical "does the net deadlock?" A Petri net is deadlocked if no transitions are enabled. ...
doi:10.1145/107005.107074
fatcat:tx3poabnq5bhhejnni323uuj3u
Simulation analysis of multithreaded programs under deadlock-avoidance control
2011
Proceedings of the 2011 Winter Simulation Conference (WSC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The programs are modeled by a special class of Petri nets, called Gadara nets. We propose a formal simulation methodology for Gadara nets. ...
We discuss the implications of the above results on the practical implementation of control strategies that prevent deadlocks in multithreaded programs. ...
Ricardo Lüders, and the anonymous reviewers for many helpful comments. ...
doi:10.1109/wsc.2011.6147798
dblp:conf/wsc/LiaoZL11
fatcat:nrapjujwyra5loesoe3mtimdmy
Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We provide a distributed scheduling algorithm for implementing a system that allows distributed probabilistic choice. ...
We use the model of Petri nets to demonstrate the modeling and implementation problem. The proposed solution involves adding sequential observers called agents to the Petri net structure. ...
The authors thank Barbara Jobstmann and Gadi Taubenfeld for valuable discussions. ...
doi:10.1007/978-3-642-37036-6_23
fatcat:mbzbnkiwhff3vm77wwzumbbmre
A pipeline-based approach for long transaction processing in web service environments
2011
International Journal of Web and Grid Services
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we design a time-stamp-based deadlock A pipeline-based approach for long transaction processing 191 prevention mechanism for the control of multiple concurrent transactions. ...
In web service environments, long transactions need to lock resources -often database services -for a long time during their long execution duration. ...
His research interests are in the areas of protocol design and performance analysis for communication networks, with a special emphasis on wireless ad hoc and sensor networks.
Acknowledgements ...
doi:10.1504/ijwgs.2011.040448
fatcat:fih32a5pqrhq5bs22zsye3il5y
Model-Based Adaptation of Behavioral Mismatching Components
2008
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Urbano for their participation to the implementation of Adaptor, as well as Bernard Berthomieu, Frédéric Lang, Massimo Tivoli, and François Vernadat for their help on external tool support, interesting ...
The authors are also grateful to the anonymous referees whose comments helped a lot to improve this article. This work is partially supported by the ...
The first one is based on synchronous products, and the second one is based on Petri net encodings. ...
doi:10.1109/tse.2008.31
fatcat:5dsjw7lrjjglzjv5dwl2j5lv2a
Design, Validation, Simulation and Parametric Evaluation of a Novel Protocol for Locating Mobile Agents in Multiregion Environment
2008
Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique named as Broadcasting with Search by Path Chase (BSPC). We used the tool time Petri net analyzer TINA to model, analyze and to simulate BSPC. ...
The cost of location management strategies mainly depends on the cost of search and update. We concentrated on reducing the cost of update and improving the speed of processing of the agents. ...
For Petri nets, these abstractions help prevent combinatorial explosion, relying on partial order techniques such as covering steps and/or persistent sets. ...
doi:10.3844/jcssp.2008.256.271
fatcat:xoraqmew7fbndhfr4bupkbsymy
Timestamp-based orphan elimination
1989
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The method ensures that orphans are detected and eliminated in a timely manner, and it prevents them from observing inconsistent states. ...
This paper proposes a new method for managing orphans created by crashes and by aborts. ...
The refresh protocol is a two-phase protocol similar to the two-phase commit protocol [6]. ...
doi:10.1109/32.29482
fatcat:5ejeax6birgqfksn4pufuhsete
The Unfolding: Origins, Techniques, and Applications within Discrete Event Systems
2022
Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we aim to provide a comprehensive review on the history of net unfoldings, the methods that are based on these unfoldings, and how they are used in discrete event systems for automatic verification ...
Based on the findings of concurrency theory, interleaving semantics are replaced with a unique partially ordered occurrence net. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/math11010047
fatcat:fewzzrpkljesfldsttbbvjnnay
« Previous
Showing results 1 — 15 out of 321 results