Relevant bibliographies by topics / Deadlock detection

Contents

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

Academic literature on the topic 'Deadlock detection'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

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 detection.'

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 detection"

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

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
6

AlDhubhani, Raed, Fathy Eassa, and Faisal Saeed. "Exascale Message Passing Interface based Program Deadlock Detection." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 2 (April 1, 2016): 887. http://dx.doi.org/10.11591/ijece.v6i2.9575.

Full text
Abstract:
Deadlock detection is one of the main issues of software testing in High Performance Computing (HPC) and also inexascale computing areas in the near future. Developing and testing programs for machines which have millions of cores is not an easy task. HPC program consists of thousands (or millions) of parallel processes which need to communicate with each other in the runtime. Message Passing Interface (MPI) is a standard library which provides this communication capability and it is frequently used in the HPC. Exascale programs are expected to be developed using MPI standard library. For parallel programs, deadlock is one of the expected problems. In this paper, we discuss the deadlock detection for exascale MPI-based programs where the scalability and efficiency are critical issues. The proposed method detects and flags the processes and communication operations which are potential to cause deadlocks in a scalable and efficient manner. MPI benchmark programs were used to test the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
7

AlDhubhani, Raed, Fathy Eassa, and Faisal Saeed. "Exascale Message Passing Interface based Program Deadlock Detection." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 2 (April 1, 2016): 887. http://dx.doi.org/10.11591/ijece.v6i2.pp887-894.

Full text
Abstract:
Deadlock detection is one of the main issues of software testing in High Performance Computing (HPC) and also inexascale computing areas in the near future. Developing and testing programs for machines which have millions of cores is not an easy task. HPC program consists of thousands (or millions) of parallel processes which need to communicate with each other in the runtime. Message Passing Interface (MPI) is a standard library which provides this communication capability and it is frequently used in the HPC. Exascale programs are expected to be developed using MPI standard library. For parallel programs, deadlock is one of the expected problems. In this paper, we discuss the deadlock detection for exascale MPI-based programs where the scalability and efficiency are critical issues. The proposed method detects and flags the processes and communication operations which are potential to cause deadlocks in a scalable and efficient manner. MPI benchmark programs were used to test the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

Bracha, Gabriel, and Sam Toueg. "Distributed deadlock detection." Distributed Computing 2, no. 3 (September 1987): 127–38. http://dx.doi.org/10.1007/bf01782773.

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

Giebas, Damian, and Rafał Wojszczyk. "Deadlocks Detection in Multithreaded Applications Based on Source Code Analysis." Applied Sciences 10, no. 2 (January 10, 2020): 532. http://dx.doi.org/10.3390/app10020532.

Full text
Abstract:
This paper extends multithreaded application source code model and shows how to using it to detect deadlocks in C language applications. Four known deadlock scenarios from literature can be detected using our model. For every scenario we created theorems and proofs whose fulfillment guarantees the occurrence of deadlocks in multithreaded applications. Paper also contains comparison of multithreaded application source code model and Petri nets and describe advantages and disadvantages both of them.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Deadlock detection"

1

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
2

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
3

Ashfield, Bruce Carleton University Dissertation Computer Science. "Distributed deadlock detection in mobile agent systems." Ottawa, 2000.

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

Elmagarmid, Ahmed Khalifa. "Deadlock detection and resolution in distributed processing systems /." The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919110166.

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

Deorukhkar, Mayuresh. "Deadlock probability prediction and detection in distributed systems /." free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p1421130.

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

Kshemkalyani, Ajay D. "Characterization and correctness of distributed deadlock detection and resolution /." The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487694702783488.

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

Cape, David Andrew. "Deadlock detection and dihomotopic reduction via progress shell decomposition." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2010. http://scholarsmine.mst.edu/thesis/pdf/Cape_09007dcc8078d6bb.pdf.

Full text
Abstract:
Thesis (Ph. D.)--Missouri University of Science and Technology, 2010.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed April 21, 2010) Includes bibliographical references (p. 133-134).
APA, Harvard, Vancouver, ISO, and other styles
8

Faiz, Tariq Nadeem. "Deadlock detection and avoidance for a class of manufacturing systems." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178654511.

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

Lee, Jaehwan. "Hardware/Software Deadlock Avoidance for Multiprocessor Multiresource System-on-a-Chip." Diss., Also available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-11222004-083429/unrestricted/lee%5Fjaehwan%5F200412%5Fphd.pdf.

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

Daniel, Pamela Dorr Fuller. "The impact of network characteristics on the selection of a deadlock detection algorithm for distributed databases." Thesis, Virginia Tech, 1989. http://hdl.handle.net/10919/43084.

Full text
Abstract:
Much attention has been focused on the problem of deadlock detection in distributed databases, resulting in the publication of numerous algorithms to accomplish this function. The algorithms published to date differ greatly in many respects: timing, location, information collection, and basic approach. The emphasis of this research has been on theory and proof of correctness, rather than on practical application. Relatively few attempts have been made to implement the algorithms. The impact of the characteristics of the underlying database management system, transaction model, and communications network upon the effectiveness and performance of the proposed deadlock detection algorithms has largely been ignored. It is the intent of this study to examine more closely the interaction between a deadlock detection algorithm and one aspect of the environment in which it is implemented: namely, the communications network.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Deadlock detection"

1

Spirakis, Paul G. The parallel complexity of deadlock detection. New York: Courant Institute of Mathematical Sciences, New York University, 1986.

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

Adams, Richard Arthur. Distributed deadlock detection for communicating processes. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

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

Krivokapić, Natalija. Control mechanisms in distributed object bases: Synchronization, deadlock detection, migration. Sankt Augustin: Infix, 1999.

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

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

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

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

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

Paretsky, Sara. Deadlock. South Yarmouth, Ma: J. Curley, 1985.

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

Schweiger, Jeffrey Mark. Detecting potential synchronization constraint deadlocks from formal system specifications. Monterey, Calif: Naval Postgraduate School, 1992.

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

Paretsky, Sara. Deadlock: Ein V.I. Warshawski Kriminalroman. München: R. Piper, 1993.

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

Paretsky, Sara. Deadlock: A V.I. Warshawski mystery. Oxford: ISIS Large Print, 1993.

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

Paretsky, Sara. Deadlock: A V.I. Warshawski mystery. Boston: G.K. Hall, 1993.

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

Book chapters on the topic "Deadlock detection"

1

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
2

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
3

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
4

Raynal, Michel. "Distributed Deadlock Detection." In Distributed Algorithms for Message-Passing Systems, 401–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38123-2_15.

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

de Boer, Frank S., and Stijn de Gouw. "Run-Time Deadlock Detection." In NASA Monographs in Systems and Software Engineering, 245–64. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-48628-4_10.

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

Al-Dujaily, Ra’ed, Terrence Mak, Fei Xia, Alex Yakovlev, and Maurizio Palesi. "Run-Time Deadlock Detection." In Routing Algorithms in Networks-on-Chip, 41–68. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8274-1_3.

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

Knoblauch, Jan. "Deadlock Detection in OpenPEARL." In Real-time and Autonomous Systems 2022, 13–22. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-32700-1_2.

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

Laneve, Cosimo, and Abel Garcia. "Deadlock Detection of Java Bytecode." In Logic-Based Program Synthesis and Transformation, 37–53. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94460-9_3.

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

Johnston, Brian M., and Ajoy Kumar Datta. "A Distributed Deadlock Detection Algorithm." In Intelligent Systems Third Golden West International Conference, 953–63. Dordrecht: Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-011-7108-3_101.

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

Williams, Amy, William Thies, and Michael D. Ernst. "Static Deadlock Detection for Java Libraries." In ECOOP 2005 - Object-Oriented Programming, 602–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11531142_26.

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

Conference papers on the topic "Deadlock detection"

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

Naik, Mayur, Chang-Seo Park, Koushik Sen, and David Gay. "Effective static deadlock detection." In 2009 IEEE 31st International Conference on Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/icse.2009.5070538.

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

Visser, W. "Session details: Deadlock detection." In ISSTA06: International Symposium on Software Testing and Analysis 2006. New York, NY, USA: ACM, 2006. http://dx.doi.org/10.1145/3245599.

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

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
5

Datta, A. K., and S. Ghosh. "Deadlock detection in distributed systems." In Ninth Annual International Phoenix Conference on Computers and Communications. 1990 Conference Proceedings. IEEE, 1990. http://dx.doi.org/10.1109/pccc.1990.101611.

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

Flatebo, Mitchell, and Ajoy Kumar Datta. "Self-stabilizing deadlock detection algorithms." In the 1992 ACM annual conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/131214.131229.

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

Appleton, Randy. "Deadlock detection in a multidatabase." In the 30th annual Southeast regional conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/503720.503739.

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

Cidon, I., and J. M. Jaffe. "Local distributed deadlock detection by knot detection." In the ACM SIGCOMM conference. New York, New York, USA: ACM Press, 1986. http://dx.doi.org/10.1145/18172.18214.

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

Shao, Baolin, Nalini Vasudevan, and Stephen A. Edwards. "Compositional deadlock detection for rendezvous communication." In the seventh ACM international conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1629335.1629344.

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

Cape, David A., and Bruce M. McMillin. "Dihomotopic Reduction Used in Deadlock Detection." In 2009 33rd Annual IEEE International Computer Software and Applications Conference. IEEE, 2009. http://dx.doi.org/10.1109/compsac.2009.200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Deadlock detection' 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