Zobrazeno 1 - 10
of 247
pro vyhledávání: '"Edge chasing"'
Publikováno v:
Journal of Visual Languages & Computing. 42:23-30
Mobile agents environment is a new application paradigm with unique features such as mobility and autonomy. Traditional deadlock detection algorithms in distributed computing systems do not work well in mobile agent systems due to the unique feature
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bb6e98fd3095303dfb8ab536aee9166
https://doi.org/10.1016/j.jvlc.2017.08.002
https://doi.org/10.1016/j.jvlc.2017.08.002
Publikováno v:
IFAC-PapersOnLine. 50:5849-5854
This paper studies algorithmic aspects of deadlock analysis for parameterized networks of discrete-event systems. A parameterized network consists of interacting finite-state subsystems, including finite but arbitrarily large numbers of subsystems wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b54d21e7dece2c5c124d0affc550ac8
https://doi.org/10.1016/j.ifacol.2017.08.543
https://doi.org/10.1016/j.ifacol.2017.08.543
Publikováno v:
Software Quality Journal. 26:991-1013
Deadlock detection in a distributed system without shared memory is important to ensure the reliability of the system. It becomes more complex when multiple deadlock detection algorithm instances execute concurrently in the system. In addition, the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::411b4f31b2c44a8c57dd8c6ed1a4b233
https://doi.org/10.1007/s11219-017-9379-1
https://doi.org/10.1007/s11219-017-9379-1
Publikováno v:
International Journal of u- and e- Service, Science and Technology. 9:353-362
Deadlock Avoidance remains to be a significant aspect of deadlock research. Modeling approaches based on Graph Theory provide effective strategy to solve this problem. We built avoidance model of directed graph and adjacent matrix via resource alloca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d800bab5e37b5241cbce6a4e8c9f10d1
https://doi.org/10.14257/ijunesst.2016.9.2.34
https://doi.org/10.14257/ijunesst.2016.9.2.34
Autor:
MengChu Zhou, Maria Pia Fanti
LIST OF CONTRIBUTORS PREFACE INTRODUCTION TO DEADLOCK RESEARCH IN COMPUTER-INTEGRATED SYSTEMS M.P. Fanti and M.C. Zhou DEADLOCK AVOIDANCE IN AUTOMATED MANUFACTURING SYSTEMS USING FINITE AUTOMATA AND STATE SPACE SEARCH A. Yalcin, T. Tai, and T.O. Bouc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e97f3a64e25e9f45bc6e8436b85a2a31
https://doi.org/10.1201/9781315214665
https://doi.org/10.1201/9781315214665
Autor:
Bo Liu
Publikováno v:
Applied Mechanics and Materials. 743:575-580
Distributed system has the characteristic of high concurrency, which often leads to deadlock due to the execution of concurrent process. By applying Petri nets model can effectively solve this problem. In this paper, based on Petri nets model, we pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f502144e861005bae2c65ca3f67d96c
https://doi.org/10.4028/www.scientific.net/amm.743.575
https://doi.org/10.4028/www.scientific.net/amm.743.575
Publikováno v:
PPOPP
20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2015)
20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2015)
We present Armus, a verification tool for dynamically detecting or avoiding barrier deadlocks. The core design of Armus is based on phasers, a generalisation of barriers that supports split-phase synchronisation, dynamic membership, and optional-wait
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d54acf337760f62a233ad940855e266
https://doi.org/10.1145/2858788.2688519
https://doi.org/10.1145/2858788.2688519
Publikováno v:
Lecture Notes on Software Engineering. 3:285-289
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76dc4da617fff93b22b4620403bd7849
https://doi.org/10.7763/lnse.2015.v3.205
https://doi.org/10.7763/lnse.2015.v3.205
Publikováno v:
International Journal of Computer Applications. 92:11-17
A P system is a computational model in computer science abstracted from the structure of real living cell that preforms some calculations under a certain conditions. They are distributed, parallel and run in a non-deterministic manner. This paper pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02167123c1e96aa7839b6e338d7d4dd0
https://doi.org/10.5120/16043-5161
https://doi.org/10.5120/16043-5161
Publikováno v:
International Journal of Communication Systems. 27:852-870
To detect deadlock in distributed systems, the initiator should construct an efficient explicit or implicit global wait-for graph. In this paper, we present an unstructured deadlock detection algorithm using a gossip protocol in cloud computing envir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c202761d57a924f3834fd0d4a0fa97f
https://doi.org/10.1002/dac.2638
https://doi.org/10.1002/dac.2638