Relevant bibliographies by topics / Deadlock detection / Journal articles
To see the other types of publications on this topic, follow the link: Deadlock detection.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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
11

Shrivastava, Anurag, and Sudhir Kumar Sharma. "Efficient bus based router for NOC architecture." World Journal of Engineering 13, no. 4 (August 1, 2016): 370–75. http://dx.doi.org/10.1108/wje-08-2016-049.

Full text
Abstract:
Purpose Increase in the speed of processors has led to crucial role of communication in the performance of systems. As a result, routing is taken into consideration as one of the most important subjects of the network-on-chip (NOC) architecture. Routing algorithms to deadlock avoidance prevent packets route completely based on network traffic condition by means of restricting the route of packets. This action leads to less performance especially in non-uniform traffic patterns. On the other hand, true fully adaptive routing algorithm provides routing of packets completely based on traffic conditions. However, deadlock detection and recovery mechanisms are needed to handle deadlocks. Use of a global bus beside NOC as a parallel supportive environment provides a platform to offer advantages of both features of bus and NOC. Design/methodology/approach In this research, the authors use this bus as an escaping path for deadlock recovery technique. Findings According to simulation results, this bus is a suitable platform for a deadlock recovery technique. Originality/value This bus is useful for broadcast and multicast operations, sending delay sensitive signals, system management and other services.
APA, Harvard, Vancouver, ISO, and other styles
12

Wojcik, B. E., and Z. M. Wojcik. "Sufficient condition for a communication deadlock and distributed deadlock detection." IEEE Transactions on Software Engineering 15, no. 12 (1989): 1587–95. http://dx.doi.org/10.1109/32.58770.

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

Brzezinski, J., J. M. Helary, M. Raynal, and M. Singhal. "Deadlock Models and a General Algorithm for Distributed Deadlock Detection." Journal of Parallel and Distributed Computing 31, no. 2 (December 1995): 112–25. http://dx.doi.org/10.1006/jpdc.1995.1150.

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

Brzezinski, Jerzy, Jean-Michel Helary, Michel Raynal, and Mukesh Singhal. "Deadlock Models and a General Algorithm for Distributed Deadlock Detection." Journal of Parallel and Distributed Computing 32, no. 2 (February 1996): 232. http://dx.doi.org/10.1006/jpdc.1996.0017.

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

Rout, Kshirod Kumar, Debani Prasad Mishra, and Surender Reddy Salkuti. "Deadlock detection in distributed system." Indonesian Journal of Electrical Engineering and Computer Science 24, no. 3 (December 1, 2021): 1596. http://dx.doi.org/10.11591/ijeecs.v24.i3.pp1596-1603.

Full text
Abstract:
In highly automated devices, deadlock is a case that occurs when no system can permit its event which may give irrelevant economic losses. A process can request or release resources that are either available or are on hold by others. If a process requesting a resource is not available at any time, then that process enters into the waiting state. But if a waiting state is not converted into its present state, it enters more than two processes are having an indefinite waiting state. The proposed algorithm gives an efficient way for deadlock detection. For the implementation of this work, C++ and python as the basic programming language are used. It gives an idea about how resources are allocated, and how few processes result in deadlock.
APA, Harvard, Vancouver, ISO, and other styles
16

Polyakov, Sergey Andreevich, and Alexey Evgenevich Borodin. "Deadlock Detection using Static Analysis." Proceedings of the Institute for System Programming of the RAS 32, no. 5 (2020): 21–34. http://dx.doi.org/10.15514/ispras-2020-32(5)-2.

Full text
Abstract:
The paper describes an extension to summary based static program analysis to find deadlock errors. Summary based analysis is a popular approach aimed at the detection of bugs in programs due to its high performance and scalability. At the same time, the implementation of deadlock detectors in such an analysis is nontrivial, because there is no information about the locks held higher in the call stack during the process of function intraprocedural analysis. A lock graph, which is built during the main analysis, is used to model the semantics of multithreaded programs. Lock graph is a modification of call graph which contains additional information about held locks. After the lock graph is built, the deadlock detector is launched. Both the construction of the lock graph and the deadlock detection algorithm do not require significant processor time. On the performed measurements, the total analysis time increased by 4%. Based on the results of the analysis of 8 open source projects in C/C++/Java with a total size of more than 14 million lines of code, the proposed algorithm showed a high level of true positives. The described algorithms were implemented in the Svace tool.
APA, Harvard, Vancouver, ISO, and other styles
17

Cidon, I., and J. M. Jaffe. "Local distributed deadlock detection by knot detection." ACM SIGCOMM Computer Communication Review 16, no. 3 (August 1986): 377–84. http://dx.doi.org/10.1145/1013812.18214.

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

Knapp, Edgar. "Deadlock detection in distributed databases." ACM Computing Surveys 19, no. 4 (December 1987): 303–28. http://dx.doi.org/10.1145/45075.46163.

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

Yibei Ling, Shigang Chen, and Cho-Yu Jason Chiang. "On Optimal Deadlock Detection Scheduling." IEEE Transactions on Computers 55, no. 9 (September 2006): 1178–87. http://dx.doi.org/10.1109/tc.2006.151.

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

Zeng, Hong-wei. "Deadlock detection using abstraction refinement." Journal of Shanghai University (English Edition) 14, no. 1 (February 2010): 1–5. http://dx.doi.org/10.1007/s11741-010-0101-2.

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

Jiang, Bin. "Deadlock detection is really cheap." ACM SIGMOD Record 17, no. 2 (June 1988): 2–13. http://dx.doi.org/10.1145/51708.51709.

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

Singhal, M. "Deadlock detection in distributed systems." Computer 22, no. 11 (November 1989): 37–48. http://dx.doi.org/10.1109/2.43525.

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

Badal, D. Z. "The distributed deadlock detection algorithm." ACM Transactions on Computer Systems 4, no. 4 (September 1986): 320–37. http://dx.doi.org/10.1145/6513.6516.

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

Elmagarmid, A. K., and A. K. Datta. "Two-phase deadlock detection algorithm." IEEE Transactions on Computers 37, no. 11 (1988): 1454–58. http://dx.doi.org/10.1109/12.8717.

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

Luecke, Glenn R., Yan Zou, James Coyle, Jim Hoekstra, and Marina Kraeva. "Deadlock detection in MPI programs." Concurrency and Computation: Practice and Experience 14, no. 11 (2002): 911–32. http://dx.doi.org/10.1002/cpe.701.

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

Shang, Kun, and Kai Zhang. "The Analysis and Avoidance of Concurrent Processes Deadlock." Advanced Materials Research 219-220 (March 2011): 45–48. http://dx.doi.org/10.4028/www.scientific.net/amr.219-220.45.

Full text
Abstract:
Deadlock is a common problem in concurrent processing where two or more processes compete for resources in mutually exclusive way to access critical resources. The in-depth analysis and discussion about deadlock would be conducive to the improvement of reliability of the operating system. In this paper, problems about deadlock is analyzed and overviewed, including concept, cause of the deadlock, and prevention, avoidance , detection, and recovery from deadlock, etc .
APA, Harvard, Vancouver, ISO, and other styles
27

Nicheporuk, Andrii, Yuriy Klots, Oksana Yashyna, Sergiy Mostovyi, and Yuriy Nicheporuk. "Prediction of entering processes into the deadlock state." Indonesian Journal of Electrical Engineering and Computer Science 14, no. 3 (June 1, 2019): 1484. http://dx.doi.org/10.11591/ijeecs.v14.i3.pp1484-1492.

Full text
Abstract:
<p><em></em>The work is devoted to the problem of processes’ deadlock in the multi-tasking system. On the basis of the study of the life cycle of the process, the boundary state of the process was distinguished, which will precede the deadlock state. Proposed the method for prediction of entering processes into the deadlock state, which consists of two algorithms: algorithm of detection of potential processes that may fall into the deadlock and algorithm of processes detection that falling into the state of deadlock. An evaluation of time complexity of proposed method is conducted. Unlike the known methods and algorithms, proposed method use fuzzy logic components to detect two or more processes that fall into the state of deadlock, and thus do not make the algorithm cumbersome, which allows it to be used in modern operating systems.</p>
APA, Harvard, Vancouver, ISO, and other styles
28

Ding, Zuohua, MengChu Zhou, and ShouGuang Wang. "Ordinary Differential Equation-Based Deadlock Detection." IEEE Transactions on Systems, Man, and Cybernetics: Systems 44, no. 10 (October 2014): 1435–54. http://dx.doi.org/10.1109/tsmc.2014.2311757.

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

Wuu, G. T., and A. J. Bernstein. "False Deadlock Detection in Distributed Systems." IEEE Transactions on Software Engineering SE-11, no. 8 (August 1985): 820–21. http://dx.doi.org/10.1109/tse.1985.232530.

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

Haque, W. "Concurrent Deadlock Detection In Parallel Programs." International Journal of Computers and Applications 28, no. 1 (January 2006): 19–25. http://dx.doi.org/10.1080/1206212x.2006.11441784.

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

Samak, Malavika, and Murali Krishna Ramanathan. "Multithreaded test synthesis for deadlock detection." ACM SIGPLAN Notices 49, no. 10 (December 31, 2014): 473–89. http://dx.doi.org/10.1145/2714064.2660238.

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

Kaveh, Nima, and Wolfgang Emmerich. "Deadlock detection in distribution object systems." ACM SIGSOFT Software Engineering Notes 26, no. 5 (September 2001): 44–51. http://dx.doi.org/10.1145/503271.503216.

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

Feitelson, Dror G. "Deadlock detection without wait-for graphs." Parallel Computing 17, no. 12 (December 1991): 1377–83. http://dx.doi.org/10.1016/s0167-8191(05)80004-3.

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

Elmagarmid, Ahmed K., Amit P. Sheth, and Ming T. Liu. "A partially distributed deadlock detection algorithm." International Journal of Computer & Information Sciences 14, no. 5 (October 1985): 307–30. http://dx.doi.org/10.1007/bf00987040.

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

Rontogiannis, P., G. Pavlides, and A. Levy. "Distributed algorithm for communication deadlock detection." Information and Software Technology 33, no. 7 (September 1991): 483–88. http://dx.doi.org/10.1016/0950-5849(91)90092-p.

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

Pun, Ka I., Martin Steffen, and Volker Stolz. "Deadlock checking by data race detection." Journal of Logical and Algebraic Methods in Programming 83, no. 5-6 (September 2014): 400–426. http://dx.doi.org/10.1016/j.jlamp.2014.07.003.

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

Spirakis, Paul. "The parallel complexity of deadlock detection." Theoretical Computer Science 52, no. 1-2 (1987): 155–63. http://dx.doi.org/10.1016/0304-3975(87)90084-3.

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

Eguchi, Yoshikazu, and Tsunehiro Yoshinaga. "Deadlock detection algorithm with level number." Systems and Computers in Japan 17, no. 11 (1986): 42–50. http://dx.doi.org/10.1002/scj.4690171105.

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

A. "Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model." Journal of Computer Science 8, no. 2 (October 1, 2012): 265–71. http://dx.doi.org/10.3844/jcssp.2012.265.271.

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

Hilbrich, Tobias, Joachim Protze, Martin Schulz, Bronis R. de Supinski, and Matthias S. Müller. "MPI Runtime Error Detection with MUST: Advances in Deadlock Detection." Scientific Programming 21, no. 3-4 (2013): 109–21. http://dx.doi.org/10.1155/2013/314971.

Full text
Abstract:
The widely used Message Passing Interface (MPI) is complex and rich. As a result, application developers require automated tools to avoid and to detect MPI programming errors. We present the Marmot Umpire Scalable Tool (MUST) that detects such errors with significantly increased scalability. We present improvements to our graph-based deadlock detection approach for MPI, which cover future MPI extensions. Our enhancements also check complex MPI constructs that no previous graph-based detection approach handled correctly. Finally, we present optimizations for the processing of MPI operations that reduce runtime deadlock detection overheads. Existing approaches often require 𝒪(p) analysis time per MPI operation, forpprocesses. We empirically observe that our improvements lead to sub-linear or better analysis time per operation for a wide range of real world applications.
APA, Harvard, Vancouver, ISO, and other styles
41

Cidon, I., J. M. Jaffe, and M. Sidi. "Local Distributed Deadlock Detection by Cycle Detection and Clusterng." IEEE Transactions on Software Engineering SE-13, no. 1 (January 1987): 3–14. http://dx.doi.org/10.1109/tse.1987.232560.

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

Maruta, Tetsuya, Sen'ichi Onoda, Yoshitomo Ikkai, Takashi Kobayashi, and Norihisa Komoda. "An Automatic Deadlock Detection Method with Extension of Deadlock Pattern for Workflow Models." IEEJ Transactions on Electronics, Information and Systems 120, no. 12 (2000): 1972–77. http://dx.doi.org/10.1541/ieejeiss1987.120.12_1972.

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

Sapra, Pooja, Suresh Kumar, and R. K Rathy. "Deadlock Detection and Recovery in Distributed Databases." International Journal of Computer Applications 73, no. 1 (July 26, 2013): 32–36. http://dx.doi.org/10.5120/12708-9509.

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

Gupta, Swati. "Deadlock Detection Techniques in Distributed Database System." International Journal of Computer Applications 74, no. 21 (July 30, 2013): 41–45. http://dx.doi.org/10.5120/13045-0162.

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

Dongliang Weng, Lu Yang, Quan Liu, Yuchen Fu, and Xiang Mu. "Type-2 Fuzzy Logic Based Deadlock Detection." International Journal of Digital Content Technology and its Applications 6, no. 1 (January 31, 2012): 429–38. http://dx.doi.org/10.4156/jdcta.vol6.issue1.52.

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

H.Hassan, Samar, Lamiaa H. Ahmed, and Amr A. Badr. "Deadlock Detection and Recovery in P Systems." International Journal of Computer Applications 92, no. 10 (April 18, 2014): 11–17. http://dx.doi.org/10.5120/16043-5161.

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

Verbeek, Freek, and Julien Schmaltz. "Formal verification of a deadlock detection algorithm." Electronic Proceedings in Theoretical Computer Science 70 (October 20, 2011): 103–12. http://dx.doi.org/10.4204/eptcs.70.8.

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

Santhiar, Anirudh, and Aditya Kanade. "Static deadlock detection for asynchronous C# programs." ACM SIGPLAN Notices 52, no. 6 (September 14, 2017): 292–305. http://dx.doi.org/10.1145/3140587.3062361.

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

Soojung Lee and J. L. Kim. "Performance analysis of distributed deadlock detection algorithms." IEEE Transactions on Knowledge and Data Engineering 13, no. 4 (2001): 623–36. http://dx.doi.org/10.1109/69.940736.

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

Sinha, M. K., and N. Natarajan. "A Priority Based Distributed Deadlock Detection Algorithm." IEEE Transactions on Software Engineering SE-11, no. 1 (January 1985): 67–80. http://dx.doi.org/10.1109/tse.1985.231844.

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