Relevant bibliographies by topics / Deadlock

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Deadlock'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Deadlock.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Deadlock"

1

FLATEBO, MITCHELL, and AJOY KUMAR DATTA. "DISTRIBUTED DEADLOCK DETECTION ALGORITHMS." Parallel Processing Letters 02, no. 01 (March 1992): 21–30. http://dx.doi.org/10.1142/s0129626492000143.

Full text
Abstract:
A distributed system consists of a set of loosely connected state machines which do not share a global memory. The global state of the system depends on the state of each process in the system. The set of global states can be split up into two categories, legal and illegal. This paper deals with methods of detecting deadlocks in distributed systems. One way that has been used to detect deadlocks is by sending probes around the system. If a process thinks that it may be deadlocked, it initiates a probe. If the probe is received by the initiator, the initiator declares deadlock. This paper uses the idea of states of processes In order to detect the deadlock. The algorithm runs continually and does not have to be initiated. This paper presents deadlock detection algorithms for single and multiple outstanding requests. A method for deadlock resolution is also discussed. The algorithms detect all deadlocks and do not detect false deadlocks.
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Yi Sheng, and Ter Chan Row. "A Channelized Deadlock Prevention Policy for Flexible Manufacturing Systems Using Petri Net Models." Advanced Materials Research 284-286 (July 2011): 1498–501. http://dx.doi.org/10.4028/www.scientific.net/amr.284-286.1498.

Full text
Abstract:
Deadlock prevention, deadlock detection and deadlock avoidance strategies are used to solve the deadlock problems of flexible manufacturing systems (FMSs). The conventional prevention policies were always attempt to prevent the system entering the deadlocked situation by using a few control places. On can know that one prohibits the deadlocked markings, some dead markings will be sacrificed. Therefore, the reachability states will become less than the initial net. However, our goal is to preserve all the reachability states of the initial net. Under our control policy, the deadlocks or deadlock zone will be channelized to live markings such that all the dead markings in reachability states will be conserved. Finally, an example is performed and can obtain the maximal permissiveness of a Petri net model. The other examples are all getting the same result. To our knowledge, this is the first work that employs the channelized method to prevent the deadlock problem for FMSs.
APA, Harvard, Vancouver, ISO, and other styles
3

Askari, Mohsen, and Rozita Jamili Oskouei. "An Improved Multi-Cycle Deadlock Detection and Resolution Algorithm for Distributed Systems." Computer Engineering and Applications Journal 3, no. 3 (September 30, 2014): 111–20. http://dx.doi.org/10.18495/comengapp.v3i3.89.

Full text
Abstract:
Distributed systems exhibit a high degree of resource and data sharing creating a state in which deadlocks might make their appearance. Since deadlock detection and resolution  is one of the important concerns in distributed systems which lead to minimizing available resources, therefore instigating  the  system  throughput decrease.  Our  proposed algorithm detects and resolves  the  multi-cycle  deadlocks, whether the initiator is involved in the deadlock cycle directly or indirectly. Also the chance  of  phantom  deadlock  detection is minimized. This  algorithm  not  only  can manage the simultaneous execution of it but also detects the multi-cycle deadlocks in  the  distributed  systems. Our  algorithm introduces a modified probe and victim message  structure. Moreover,  no  extra  storage  required  to  store  prob message  in each node which is known as memory overhead in the distributed systems.
APA, Harvard, Vancouver, ISO, and other styles
4

Tunç, Hünkar Can, Umang Mathur, Andreas Pavlogiannis, and Mahesh Viswanathan. "Sound Dynamic Deadlock Prediction in Linear Time." Proceedings of the ACM on Programming Languages 7, PLDI (June 6, 2023): 1733–58. http://dx.doi.org/10.1145/3591291.

Full text
Abstract:
Deadlocks are one of the most notorious concurrency bugs, and significant research has focused on detecting them efficiently. Dynamic predictive analyses work by observing concurrent executions, and reason about alternative interleavings that can witness concurrency bugs. Such techniques offer scalability and sound bug reports, and have emerged as an effective approach for concurrency bug detection, such as data races. Effective dynamic deadlock prediction, however, has proven a challenging task, as no deadlock predictor currently meets the requirements of soundness, high-precision, and efficiency. In this paper, we first formally establish that this tradeoff is unavoidable, by showing that (a) sound and complete deadlock prediction is intractable, in general, and (b) even the seemingly simpler task of determining the presence of potential deadlocks, which often serve as unsound witnesses for actual predictable deadlocks, is intractable. The main contribution of this work is a new class of predictable deadlocks, called sync(hronization)-preserving deadlocks. Informally, these are deadlocks that can be predicted by reordering the observed execution while preserving the relative order of conflicting critical sections. We present two algorithms for sound deadlock prediction based on this notion. Our first algorithm SPDOffline detects all sync-preserving deadlocks, with running time that is linear per abstract deadlock pattern, a novel notion also introduced in this work. Our second algorithm SPDOnline predicts all sync-preserving deadlocks that involve two threads in a strictly online fashion, runs in overall linear time, and is better suited for a runtime monitoring setting. We implemented both our algorithms and evaluated their ability to perform offline and online deadlock-prediction on a large dataset of standard benchmarks. Our results indicate that our new notion of sync-preserving deadlocks is highly effective, as (i) it can characterize the vast majority of deadlocks and (ii) it can be detected using an online, sound, complete and highly efficient algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Murdalov, Deni Ruslanovich. "Vertical deadlock in public corporations." Юридические исследования, no. 6 (June 2020): 56–64. http://dx.doi.org/10.25136/2409-7136.2020.6.33454.

Full text
Abstract:
This work explores the problem of directorial board execution of the competency of voiding a contract with the registrar in public commercial corporate legal entities. The author provides a number of arguments that allow designating the aforementioned authority of the public joint-stock company as a deadlock situation. Based on the latter, classification is carried out on the deadlocks by level of their emergence into horizontal and vertical, describing characteristic traits of the vertical deadlock. The subject of this research is comprised on the norms that regulate the competence of the members of the oversight committee of corporations in civil law, pertinent law enforcement practice, as well as theoretical positions of various experts. The scientific novelty of this research consists in the analysis of the relevant practical issues associated with emergence of deadlock situations due to the activity of the directorial board. Detailed study and analysis is conducted on the case law of the courts dealing the problems of horizontal deadlock situations. The results of this work include proposed classification of deadlocks by the level of their emergence into horizontal and vertical; definitions of the horizontal and vertical deadlocks; examination of the mechanisms of resolution of horizontal deadlocks.
APA, Harvard, Vancouver, ISO, and other styles
6

Pan, Yen-Liang. "One Computational Innovation Transition-Based Recovery Policy for Flexible Manufacturing Systems Using Petri nets." Applied Sciences 10, no. 7 (March 29, 2020): 2332. http://dx.doi.org/10.3390/app10072332.

Full text
Abstract:
In the third and fourth industrial revolutions, smart or artificial intelligence flexible manufacturing systems (FMS) seem to be the key machine equipment for capacity of factory production. However, deadlocks could hence appear due to resources competition between robots. Therefore, how to prevent deadlocks of FMS occurring is a very important and hot issue. Based on Petri nets (PN) theory, in existing literature almost all research adopts control places as their deadlock prevention mean. However, under this strategy the real optimal reachable markings are not achieved even if they claimed that their control policy is maximally permissive. Accordingly, in this paper, the author propose one novel transition-based control policy to solve the deadlock problem of FMS. The proposed control policy could also be viewed as deadlock recovery since it can recover all initial deadlock and quasi-deadlock markings. Furthermore, control transitions can be calculated and obtained once the proposed three-dimension matrix, called generating and comparing aiding matrix (GCAM) in this paper, is built. Finally, an iteration method is used until all deadlock markings become live ones. Experimental results reveal that our control policy seems still the best one among all existing methods in the literature regardless of whether these methods belong to places or transitions based.
APA, Harvard, Vancouver, ISO, and other styles
7

MANI, NARIMAN, VAHID GAROUSI, and BEHROUZ H. FAR. "SEARCH-BASED TESTING OF MULTI-AGENT MANUFACTURING SYSTEMS FOR DEADLOCKS BASED ON MODELS." International Journal on Artificial Intelligence Tools 19, no. 04 (August 2010): 417–37. http://dx.doi.org/10.1142/s0218213010000261.

Full text
Abstract:
Multi-Agent Systems (MAS) have been extensively used in the automation of manufacturing systems. However, similar to other distributed systems, autonomous agents' interaction in the Automated Manufacturing Systems (AMS) can potentially lead to runtime behavioral failures including deadlocks. Deadlocks can cause major financial consequences by negatively affecting the production cost and time. Although the deadlock monitoring techniques can prevent the harmful effects of deadlocks at runtime, but the testing techniques are able to detect design faults during the system design and development stages that can potentially lead to deadlock at runtime. In this paper, we propose a search based testing technique for deadlock detection in multi-agent manufacturing system based on the MAS design models. MAS design artifacts, constructed using Multi-agent Software Engineering (MaSE) methodology, are used for extracting test requirements for deadlock detection. As the case study, the proposed technique is applied to a multi-agent manufacturing system for verifying its effectiveness. A MAS simulator has been developed to simulate multi-agent manufacturing system behavior under test and the proposed testing technique has been implemented in a test requirement generator tool which creates test requirements based on the given design models.
APA, Harvard, Vancouver, ISO, and other styles
8

Marsteintredet, Leiv. "Executive-Legislative Deadlocks in the Dominican Republic." Latin American Politics and Society 50, no. 02 (2008): 131–60. http://dx.doi.org/10.1111/j.1548-2456.2008.00015.x.

Full text
Abstract:
Abstract This study analyzes the causes of executive-legislative deadlocks in the Dominican Republic in the period 1978–2005. Deadlocks are considered a pernicious element in (presidential) democracies. The study applies a combination of simple statistical techniques and process tracing to test four institutional hypotheses, which argue that certain institutional and party system constellations increase the probability of deadlocks. The hypotheses point to necessary causes of deadlocks, but their predictions are imprecise. Presidents' persuasive powers and coalition building have helped alleviate the deadlock problem. Analysis of the deadlock periods shows that the additional triggering or sufficient causes for deadlocks are either exogenous to the political institutions or related to the instability of coalitions in the nation's nonideological party system, which consists of three almost equal-sized parties.
APA, Harvard, Vancouver, ISO, and other styles
9

KHONSARI, A., H. SARBAZI-AZAD, and M. OULD-KHAOUA. "A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes." Parallel Processing Letters 15, no. 01n02 (March 2005): 153–68. http://dx.doi.org/10.1142/s012962640500212x.

Full text
Abstract:
Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
APA, Harvard, Vancouver, ISO, and other styles
10

., Elavarasi, and G. Raja. "A Necessary and Sufficient Condition for Deadlock-Free Message Routing in Communication Networks." International Journal of Advance Research and Innovation 3, no. 2 (2015): 23–26. http://dx.doi.org/10.51976/ijari.321506.

Full text
Abstract:
Deadlocks are an important issue in the design and analysis of communication networks. Wormhole switching is a popular switching technique in direct networks. It refers to a simple flow control system in computer network that is primarily based on fixed links. It also reduces the latency and storage requirements on each node. Deadlock analysis of routing function is a manual and complex task. In the absence of contention, latencies are proportional to the sum of the packet length and the distances to travel. We propose an algorithm to analyze the deadlock in communication networks. The deadlock-free routing algorithm is the first to automatically check a necessary and sufficient condition for deadlock-free routing. Our algorithm performs Effective analysis in this network.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Deadlock"

1

Dathi, Naiem. "Deadlock and deadlock freedom." Thesis, University of Oxford, 1989. https://ora.ox.ac.uk/objects/uuid:458852c5-fa20-41f4-8537-8085a063c546.

Full text
Abstract:
We introduce a number of techniques for establishing the deadlock freedom of concurrent systems. Our methods are based on the local analysis (or at worst a directed global analysis) of networks. We identify the relationships between these techniques and the range of their application within a framework of deadlock freedom types that we have defined. We also show that the problem of proving total correctness may be translated to one of proving deadlock freedom, with the consequence that our techniques for proving deadlock freedom may be utilised to effect a total correctness proof.
APA, Harvard, Vancouver, ISO, and other styles
2

Palmer, Geraint. "Modelling deadlock in queueing systems." Thesis, Cardiff University, 2018. http://orca.cf.ac.uk/117490/.

Full text
Abstract:
Motivated by the needs of Aneurin Bevan University Health Board, this thesis ex- plores three themes: the phenomenon of deadlock in queueing systems, the develop- ment of discrete event simulation software, and applying modelling to the evaluation of the effects of a new healthcare intervention, Stay Well Plans, for older people in Gwent. When customers in a restricted queueing network become mutually blocked, and all possible movement ceases, that system becomes deadlocked. This thesis novelly investigates deadlock. A graph theoretical method of detecting deadlock in discrete event simulations is given, analytical models of deadlocking systems are built, and these are used to investigate the effect of system parameters on the expected time until reaching deadlock. Furthermore a deadlock resolution procedure is proposed. An open source discrete event simulation software, Ciw, is developed. This software is designed and developed using best practice principles. Furthermore it permits the use of best practice, such as reproducibility, in simulation modelling. Ciw is used for the modelling of a healthcare system, in order to evaluate the effect of Stay Well Plans. During the development of these models, a number of techniques are employed to overcome the difficulties of lack of data. Insightful results from these models are obtained, indicating a shift in demand from residential care services to community care services.
APA, Harvard, Vancouver, ISO, and other styles
3

Askman, Amelie. "Joint ventures : (deadlock-) låsningar och lösningar." Thesis, Stockholms universitet, Juridiska institutionen, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-153172.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kinsy, Michel A. "Application-aware deadlock-free oblivious routing." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53316.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 67-71).
Systems that can be integrated on a single silicon die have become larger and increasingly complex, and wire designs as communication mechanisms for these systems on chip (SoC) have shown to be a limiting factor in their performance. As an approach to remove the limitation of communication and to overcome wire delays, interconnection networks or Network-on-Chip (NoC) architectures have emerged. NoC architectures enable faster data communication between components and are more scalable. In designing NoC systems, there are three key issues; the topology, which directly depends on packaging technology and manufacturing costs, dictates the throughput and latency bounds of the network; the flit control protocol, which establishes how the network resources are allocated to packets exchanged between components; and finally, the routing algorithm, which aims at optimizing network performance for some topology and flow control protocol by selecting appropriate paths for those packets. Since the routing algorithm sits on top of the other layers of design, it is critical that routing is done in a matter that makes good usage of the resources of the network. Two main approaches to routing, oblivious and adaptive, have been followed in creating routing algorithms for these systems. Each approach has its pros and cons; oblivious routing, as opposite to adaptive routing, uses no network state information in determining routes at the cost of lower performance on certain applications, but has been widely used because of its simpler hardware requirements.
(cont.) This thesis examines oblivious routing schemes for NoC architectures. It introduces various non-minimal, oblivious routing algorithms that globally allocate network bandwidth for a given application when estimated bandwidths for data transfers are provided, while ensuring deadlock freedom with no significant additional hardware. The work presents and evaluates these oblivious routing algorithms which attempt to minimize the maximum channel load (MCL) across all network links in an effort to maximize application throughput. Simulation results from popular synthetic benchmarks and concrete applications, such as an H.264 decoder, show that it is possible to achieve better performance than traditional deterministic and oblivious routing schemes.
by Michel A. Kinsy.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
5

Mastandrea, Vincenzo. "Deadlock analysis of asynchronous sequential processes." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/7451/.

Full text
Abstract:
In this thesis we present ad study an object-oriented language, characterized by two different types of objects, passive and active objects, of which we define the operational syntax and semantics. For this language we also define the type system, that will be used for the type checking and for the extraction of behavioral types, which are an abstract description of the behavior of the methods, used in deadlock analysis. Programs can manifest deadlock due to the errors of the programmer. To statically identify possible unintended behaviors we studied and implemented a technique for the analysis of deadlock based on behavioral types.
APA, Harvard, Vancouver, ISO, and other styles
6

Grazia, Carlo Augusto. "Analisi statica dei Deadlock in Featherweight Java con Futuri." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/4473/.

Full text
Abstract:
Abbiamo studiato ABSFJf, un linguaggio ad oggetti concorrente con tipi di dato futuro ed operazioni per acquisire e rilasciare il controllo delle risorse. I programmi ABSFJf possono manifestare lock (deadlock e livelock) a causa degli errori del programmatore. Per individuare staticamente possibili com- portamenti non voluti abbiamo studiato e implementato una tecnica per l'analisi dei lock basata sui contratti, che sono una descrizione astratta del comportamento dei metodi. I contratti si utilizzano per formare un automa i cui stati racchiudono informazioni di dipendenza di tipo chiamante-chiamato; vengono derivati automaticamente da un algoritmo di type inference e model- lati da un analizzatore che sfrutta la tecnica del punto
APA, Harvard, Vancouver, ISO, and other styles
7

Ashfield, Bruce. "Distributed deadlock detection in mobile agent systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ57757.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Williams, Amy Lynne Ph D. Massachusetts Institute of Technology. "Static detection of deadlock for Java libraries." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/87909.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 63-66).
Library writers wish to provide a guarantee not only that each procedure in the library performs correctly in isolation, but also that the procedures perform correctly when run in conjunction. To this end, we propose a method for static detection of deadlock in Java libraries. Our goal is to determine whether client code exists that may deadlock a library, and, if so, to enable the library writer to discover the calling patterns that can lead to deadlock. Our flow-sensitive, context-sensitive analysis determines possible deadlock configurations using a lock-order graph. This graph represents the order in which locks are acquired by the library. Cycles in the graph indicate deadlock possibilities, and our tool reports all such possibilities. We implemented our analysis and evaluated it on 18 libraries comprising 1245 kLOC. We verified 13 libraries to be free from deadlock, and found -14 distinct deadlocks in 3 libraries.
by Amy Lynne Williams.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
9

Lehman, Eric (Eric Allen) 1970. "Deadlock-free routing in a faulty hypercube." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47503.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Scherer, John-Patrick. "“Deadlock Provisions in Equity Joint Venture Agreements”." Master's thesis, University of Cape Town, 2018. http://hdl.handle.net/11427/29713.

Full text
Abstract:
The dissertation “Deadlock Provisions in Equity Joint Venture Agreements” gives a comprehensive overview and a detailed analysis of the existing contracting possibilities addressing conflicts between the partners of an equity joint venture which cannot dissolved by them. To understand the variety of such deadlock provisions and their effects on the relationship between the joint venture partners, reaching from provisions which preserve the joint cooperation (preservation mechanisms) to provisions which force the exit of, at least, one partner from the joint company (exit mechanisms), are the key points of the dissertation. Given such variety of deadlock provisions and their possible combinations, a comprehensive overview and a detailed analysis including a comparison of such clauses will support future joint venture partners to decide whether and, if yes, what types of deadlock provisions are suitable for their joint venture and should, therefore, be included in the joint venture agreement. Previous work has failed to give such a comprehensive overview and analysis of deadlock provisions consisting of a description of the different types of provisions, an explanation of their effects, and the provision of the respective example clauses. After a short description of the various types of joint ventures and the structure of an equity joint venture, the dissertation examines on the basis of example clauses preservation mechanisms and exit mechanisms typically included in equity joint venture agreements. The complexity of the different deadlock provisions, in particular the combination of preservation mechanisms and exit mechanisms, but also the question what types of disputes between the joint venture partners should be defined as “deadlocks” triggering such procedures require that joint venture partners understand the effects of drafting the joint venture agreement, in particular the inclusion of deadlock provisions, when they are entering into a joint venture. The dissertation provides the joint venture partners with a guide to cut through such complexity and to understand how the joint venture agreement should be drafted for their joint cooperation.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Deadlock"

1

Deadlock. Grand Rapids, Mich: Zondervan, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lacy, Al. Deadlock. Waterville, Me: Thorndike Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Paretsky, Sara. Deadlock. Pleasantville, N.Y: ImPress Mystery, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Deadlock. New York: Simon & Schuster, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Langford, Stuart. Deadlock. Hull: Voyageur Pub., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lacy, Al. Deadlock. Colorado Springs, Colo: Multnomah Books, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Johansen, Iris. Deadlock. New York: St. Martin's Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Deadlock. New York: St. Martin's Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Deadlock. Carol Stream, Illinois: Tyndale House Publishers, Inc., 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Deadlock. London: Robert Hale, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Deadlock"

1

Weik, Martin H. "deadlock." In Computer Science and Communications Dictionary, 366. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_4458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dallin, David J. "The Deadlock." In Soviet Foreign Policy after Stalin, 101–14. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003324256-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bérard, Béatrice, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, and Pierre Mckenzie. "Deadlock-freeness." In Systems and Software Verification, 99–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04558-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Falsafi, Babak, Samuel Midkiff, JackB Dennis, JackB Dennis, Amol Ghoting, Roy H. Campbell, Christof Klausecker, et al. "Deadlock Detection." In Encyclopedia of Parallel Computing, 524. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fritchey, Grant. "Deadlock Analysis." In SQL Server 2012 Query Performance Tuning, 393–406. Berkeley, CA: Apress, 2012. http://dx.doi.org/10.1007/978-1-4302-4204-8_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Song, Wei, and Guangda Zhang. "Deadlock Recovery." In Asynchronous On-Chip Networks and Fault-Tolerant Techniques, 303–22. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003284789-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Song, Wei, and Guangda Zhang. "Deadlock Detection." In Asynchronous On-Chip Networks and Fault-Tolerant Techniques, 271–302. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003284789-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Song, Wei, and Guangda Zhang. "Deadlock Recovery." In Asynchronous On-Chip Networks and Fault-Tolerant Techniques, 303–22. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003284789-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Song, Wei, and Guangda Zhang. "Deadlock Detection." In Asynchronous On-Chip Networks and Fault-Tolerant Techniques, 271–302. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003284789-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rennard, Jean-Philippe. "Perspectives for Strong Artificial Life." In Recent Developments in Biologically Inspired Computing, 301–19. IGI Global, 2005. http://dx.doi.org/10.4018/978-1-59140-312-8.ch012.

Full text
Abstract:
This chapter introduces the twin deadlocks of strong artificial life. Conceptualization of life is a deadlock both because of the existence of a continuum between the inert and the living, and because we only know one instance of life. Computationalism is a second deadlock since it remains a matter of faith. Nevertheless, artificial life realizations quickly progress and recent constructions embed an always-growing set of the intuitive properties of life. This growing gap between theory and realizations should sooner or later crystallize in some kind of “paradigm shift” and then give clues to break the twin deadlocks.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Deadlock"

1

Simon, Bertrand, Brigitte Jaumard, and Thai Hoa Le. "Deadlock Avoidance and Detection in Railway Simulation Systems." In 2014 Joint Rail Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/jrc2014-3864.

Full text
Abstract:
Avoiding or preventing deadlocks in simulation tools for train scheduling remains a critical issue, especially when combined with the objective of minimizing, e.g., the travel times of the trains. In this paper, we revisit the deadlock avoidance and detection problem, and propose a new deadlock avoidance algorithm, called DEADAALG, based on a resource reservation mechanism. The DEADAALG algorithm is proved to be exact, i.e., either detects an unavoidable deadlock resulting from the input data or provide a train scheduling thanks to the scheduling algorithm, called SIMTRAS, which is free of deadlocks. Moreover, we show that the SIMTRAS algorithm is a polynomial time algorithm with an O(|S| × |T|2log |T|) time complexity, where T is the set of trains and S is the set of sections in the railway topology. Numerical experiments are conducted on the Vancouver-Calgary single-track corridor of Canadian Pacific. We then show that the SIMTRAS algorithm is very efficient and provides schedules of a quality that is comparable to those of an exact optimization algorithm, in tens of seconds for up to 30 trains/day over a planning period of 60 days.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhou, Shuqiao, Xiaojin Huang, and Jia Qianqian. "Control Policy for Shared Objects in HTR-PM: Toward the Collision and Deadlock Avoidance." In 2016 24th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/icone24-60406.

Full text
Abstract:
High Temperature gas-cooled Reactor Pebble-bed Module (HTR-PM) is a high temperature gas-cooled reactor demonstration plant with a structure of two modules feeding one steam turbine. Compared with the structure of a single reactor feeding a turbine, there are more devices shared between these two modules. When they are operated, the shared components are prone to introduce collisions or even logical deadlocks for different technical processes. The future commercial HTR-PM plants are supposed to comprise more modules for a larger turbine, thus the collision problem and potential deadlocks introduced by the shared components will become severer, which may impact the efficiency or even the functions of the related systems. Therefore, how to design suitable control policies in the distributed control system (DCS) to relieve the collisions and avoid the deadlocks during using these shared devices is a new and also a very important problem. In this paper, the classifications of the shared devices are first addressed, and then how to identify the shared objects of nuclear power plant (NPP) is proposed. Furthermore, a general model for the control logic design is proposed, taking into consideration the collision avoidance, time delay and fairness. Moreover, a scheme for deadlock avoidance is proposed. The example of how to apply the schemes to relieve the conflicts and deadlocks in the processes of using the shared devices in fuel element cycling system is illustrated.
APA, Harvard, Vancouver, ISO, and other styles
3

Mireles, Jose, Frank L. Lewis, and Ayla Gu¨rel. "Implementation of a Deadlock Avoidance Policy for Multipart Reentrant Flow Lines Using a Matrix-Based Discrete Event Controller." In ASME 2002 International Mechanical Engineering Congress and Exposition. ASMEDC, 2002. http://dx.doi.org/10.1115/imece2002-33431.

Full text
Abstract:
A deadlock avoidance supervisory controller for Discrete Event (DE) Systems is implemented. The DE controller uses a novel rule-based matrix dispatching formulation (US patent received). This matrix formulation makes it direct to write down the DE controller from standard manufacturing tools such as the bill of materials or the assembly tree. It is shown that the DE controller’s matrix form equations plus the Petri Net marking transition equation together provide a complete dynamical description of DE systems. Deadlock-free dispatching rules are derived by performing circular wait analysis (CW) for possible deadlock situations. We analyze the so-called critical siphons, certain critical subsystems and resources to develop a DE controller that guaranties deadlock-free dispatching by limiting the work-in-progress in the critical subsystems associated with each CW. This is the least-restrictive dispatching policy that avoids deadlock. The deadlock-free dispatching rules are implemented by the DE controller on a three-robot, two machine reentrant flow line, the Intelligent Material Handling cell at the Automation and Robotics Research Institute of UTA. Technical information given includes the development of the deadlock-free controller in LabVIEW®.
APA, Harvard, Vancouver, ISO, and other styles
4

Pyla, Hari K., and Srinidhi Varadarajan. "Avoiding deadlock avoidance." In the 19th international conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1854273.1854288.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

El-Kafrawy, Passent M. "Graphical Deadlock Avoidance." In 2009 International Conference on Advances in Computing, Control, & Telecommunication Technologies (ACT 2009). IEEE, 2009. http://dx.doi.org/10.1109/act.2009.83.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Karatkevich, Andrei, and Iwona Grobelna. "Deadlock detection in Petri nets: One trace for one deadlock?" In 2014 7th International Conference on Human System Interactions (HSI). IEEE, 2014. http://dx.doi.org/10.1109/hsi.2014.6860480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pinkston, Timothy Mark, Mongkol Raksapatcharawong, and Yungho Choi. "Smart-Pixel Implementation of Network Router Deadlock Handling Mechanisms." In Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.othb.2.

Full text
Abstract:
We present WARRP: the core deadlock handling circuitry for a fully adaptive, deadlock recovery-based multiprocessor network router. This chip primarily demonstrates the integration of complex deadlock recovery circuitry and free-space optical channels on a monolithic GaAs-based chip. We report the design and implementation of the first generation, bit-serial, torus-connected chip employing 1400 transistors and 6 LED/photodetector pairs.
APA, Harvard, Vancouver, ISO, and other styles
8

Raksapatcharawong, Mongkol, and Timothy Mark Pinkston. "A System Demonstration of Progressive Deadlock Recovery Routing based on Optoelectronic/VLSI Chips." In Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.othd.18.

Full text
Abstract:
We present a system demonstration of a sequential deadlock recovery-based scheme [1] employing a circulating token to guarantee mutual exclusive access to deadlock buffers. This system allows us to evaluate the design and implementation of a multiprocessor network router using free-space optical interconnects. The system is designed based on our CMOS-SEED chip—OMNI [2] and GaAs-based chip—WARRP [3]. These two chips are employed to implement asynchronous optical token-based resource arbitration and deadlock recovery via channel preemption, respectively. With an external node controller, this experimental system is capable of demonstrating a high-performance bandwidth-efficient deadlock recovery-based multiprocessor network router.
APA, Harvard, Vancouver, ISO, and other styles
9

Bujtor, Ferenc, Lev Sorokin, and Walter Vogler. "Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing." In 2015 15th International Conference on Application of Concurrency to System Design (ACSD). IEEE, 2015. http://dx.doi.org/10.1109/acsd.2015.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zeng, Fancong. "Pattern-driven deadlock avoidance." In the 7th Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1639622.1639628.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Deadlock"

1

Roncero, Matias F. Deadlock Before Moscow. Fort Belvoir, VA: Defense Technical Information Center, April 2001. http://dx.doi.org/10.21236/ada394188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Donaldson, Jason Roderick, Nadya Malenko, and Giorgia Piacentino. Deadlock on the Board. Cambridge, MA: National Bureau of Economic Research, August 2019. http://dx.doi.org/10.3386/w26155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Forss, Stefan, and Pekka Holopainen. Breaking the Nordic Defense Deadlock. Fort Belvoir, VA: Defense Technical Information Center, February 2015. http://dx.doi.org/10.21236/ada615286.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tchobo, Denakpon. Proposed Ukraine Tribunal risks justice deadlock. Edited by Reece Hooker. Monash University, February 2023. http://dx.doi.org/10.54377/0f91-eb58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brewer, Eric A., and Carl A. Waldspurger. Preventing Recursion Deadlock in Concurrent Object-Oriented Systems. Fort Belvoir, VA: Defense Technical Information Center, February 1992. http://dx.doi.org/10.21236/ada247084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Burg, Roger W. Anwar Sadat and the October War: Breaking the Deadlock. Fort Belvoir, VA: Defense Technical Information Center, September 1992. http://dx.doi.org/10.21236/ada440778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bonakdarpour, Borzoo, Fuad Abujarad, and Sandeep S. Kulkarni. Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs. Fort Belvoir, VA: Defense Technical Information Center, January 2008. http://dx.doi.org/10.21236/ada487024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Brookes, Stephen. An Axiomatic Treatment of Partial Correctness and Deadlock in a Shared Variable Parallel Language. Fort Belvoir, VA: Defense Technical Information Center, June 1992. http://dx.doi.org/10.21236/ada256234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

A., Mulyana, Moeliono M., Minnigh P., Indriatmoko Y., Limberg G., Utomo N.A., Iwan R., Saparuddin, and Hamzah. Establishing special use zones in national parks: can it break the conservation deadlock in Indonesia? Center for International Forestry Research (CIFOR), 2010. http://dx.doi.org/10.17528/cifor/003094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Araujo, María Caridad, Sebastián Saiegh, Aníbal Pérez-Liñán, and Andrés Mejía Acosta. Veto Players, Fickle Institutions and Low-Quality Policies: The Policymaking Process in Ecuador. Inter-American Development Bank, May 2006. http://dx.doi.org/10.18235/0011280.

Full text
Abstract:
This paper seeks to understand why political actors, institutions and legal reforms have systematically failed to produce cooperation in the Ecuadorian policymaking process. From a comparative and historical standpoint, Ecuador has been trapped in a cycle of low-quality public policies that fail to adjust to environmental conditions, that fluctuate according to political whims and that tend to favor well-organized lobbies rather than pursuing optimal social outcomes. The paper identifies two alternative policymaking paths leading to poor policy outcomes. In the first one, the executive agenda is eclipsed by the short-term clientelistic demands of multiple veto players in the legislature, thus contributing to policy deadlock or rigidity. In the second, executive power is delegated to a decisive, often technical bureaucracy isolated from political pressures, but the lack of institutional stability of such bodies leads to a pattern of policy volatility. Lastly, the paper discusses the formal and informal roles of "last-ditch" veto players to stall or revert unwanted policies.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Deadlock' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography