Home
Resource
Just-in-time and just-in-place deadlock resolution
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(342.84 kb)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Zeng, Fancong. Just-in-time and just-in-place deadlock resolution. Retrieved from https://doi.org/doi:10.7282/T3SX6DPR

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleJust-in-time and just-in-place deadlock resolution
NameZeng, Fancong (author); Littman, Michael (chair); Steinberg, Louis (internal member); Paull, Marvin (internal member); Levine, Gertrude (outside member); Rutgers University; Graduate School-New Brunswick
Date Created2007
Other Date2007 (degree)
SubjectComputer Science, Discrete-time systems, System design
Extentx, 82 pages
DescriptionDeadlocked threads cannot make further progress, and frequently tie up resources requested by still other threads, causing more and more threads to come to a standstill. Thus, a deadlock should not remain undetected and uncorrected for a long time. If deadlock-detection processes are run too frequently, however, valuable system resources may be wasted. Therefore, it is important to choose the right interval between successive deadlock detections.
Deadlock recovery must follow deadlock detection to release held resources in the cyclic wait. In addition to restarting the entire system, it
is desirable that programmers be able to implement fine-grained recovery actions such as releasing a resource currently not in use.
Such fine-grained recovery actions often require the knowledge of program contexts and deadlock states. Unfortunately, modern programming languages lack language-level support for signaling deadlock conditions and for structuring resolution code.
My thesis is that, under the assumption that the time to the first deadlock in the system (after a system restart) follows an exponential distribution, a reinforcement-learning approach is effective in scheduling deadlock detection for a restart-oriented system, and that runtime exceptions are a programming abstraction that allows programmers to write fine-grained deadlock recovery code.
My approach to deadlock-detection scheduling as reinforcement learning estimates the deadlock rate and then performs an optimization to find the detection interval that maximizes system utility. It is theoretically proved that this technique finds the best tradeoff, and experimental results suggest that it is a reasonable approximation to assume that the time to the first deadlock in the system (after a system restart) follows an exponential distribution.
It is natural to consider deadlock occurrences as runtime exceptions because at runtime it is relatively easy to detect actual deadlock occurrences, which represent not only abnormal states but also fatal errors. Thus, exception handlers can be used to resolve deadlock occurrences based on deadlock states and program contexts. Furthermore, because exceptions are a widely used language concept, the technique of deadlock resolution via exceptions is intuitive and practical.
NotePh.D.
NoteIncludes bibliographical references (p. 78-81).
Genretheses, ETD doctoral
Persistent URLhttps://doi.org/doi:10.7282/T3SX6DPR
LanguageEnglish
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024