Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Software (D) > Operating Systems (D.4) > Process Management (D.4.1) > Deadlocks (D.4.1...)  
 
Options:
 
  1-6 of 6 Reviews about "Deadlocks (D.4.1...)": Date Reviewed
  Distributed deadlock detection in mobile agent systems: a case study
Ashfield B., Deugo D., Oppacher F., White T.  Industrial and Engineering, Applications of Artificial Intelligence and Expert Systems (Proceedings of the 15th International Conference,Jun 17-20, 2002) 146-156, 2002.  Type: Proceedings

Two different research areas are connected in this paper: mobile systems and distributed deadlock resolution. As is stated in the paper, the fundamental building blocks of many traditional distributed algorithms rely on assumptions, su...

Jul 23 2003
  Detection of Ada Static Deadlocks Using Petri Net Invariants
Murata T., Shatz S., Shenker B. IEEE Transactions on Software Engineering 15(3): 314-326, 1989.  Type: Article

The authors present a technique which uses Petri nets to detect static deadlocks in concurrent Ada programs (Ada programs which use the tasking features of the language). This method addresses two kinds of static deadlock: what the aut...

Apr 1 1990
  Deadlock detection in distributed databases
Knapp E. ACM Computing Surveys 19(4): 303-328, 1987.  Type: Article

This readable and instructive paper focuses on algorithms for deadlock detection, rather than deadlock prevention or resolution. Knapp begins by formulating a general model for resource allocation in distributed systems, distinguishing...

Feb 1 1989
  Deadlock avoidance with a modified banker’s algorithm
Belik F. BIT 27(3): 290-305, 1987.  Type: Article

The paper describes the Banker’s algorithm for deadlock avoidance in resource allocation systems together with a modification to the algorithm that seeks to reduce its execution time by identifying the conditions under which ...

May 1 1988
  The distributed deadlock detection algorithm
Badal D. ACM Transactions on Computer Systems 4(4): 320-337, 1986.  Type: Article

The distributed deadlock detection algorithm described in the title is an improved version of Obermarck’s algorithm [1]. One change is associating a lock history with each transaction. The lock history records all lock...

Mar 1 1987
  Extension of the Banker’s algorithm for resource allocation in a distributed operating system
Madduri H., Finkel R. Information Processing Letters 19(1): 1-8, 1984.  Type: Article

This paper is a very well-written extension of the Banker’s algorithm to a distributed operating system. The high cost of centralized decisions is avoided by imposing a hierarchy on the processors under consideration, and app...

Jul 1 1985
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy