Using Consistent Subcuts for Detecting Stable Properties

Marzullo, Keith; Sabel, Laura S.

doi:10.21236/ada237122

“…Some assumptions in fact require atomicity of multiple events. For example, the Abortion Assumption assumes that the time when a process aborts and the time when it sends the abortion /-'~ e3(0, 2) P2R3 (9,9) Plfi,(15, 16) /;/0/33(0,3) P2/~3 (9,10) P2/~ (14,17) ~Ra (4,4) gaP2(9, 11) /~2 P, ( Po , (20,20) (L5, 19) R, /'i ,--(5,71 (20,21) e~,ql (20,21/ abort( P,,23), /31R, (20,20,23), R2PI (15,19,23) fi~P~ (15,18,24) /~z P2 ( 14,25) R~P~(Vl,261 /3o Ro (27,27) eofio(27, 28) Although we argue that the logical edges and their relationships can be implemented, we do not require that they are. In any system, the implemented concepts may be higher level constructs, such as process-to-process edges instead of edges between processes and resources.…”

Section: Discussionmentioning

confidence: 99%

“…PoRo (27,27) coexist at 27, R2Pl (15,19) and P~R~ (20,20) coexist ~at 21, RAPE(9, 13) and P2R2 (14,14) coexist at 14, and RoP3(0, 3) and P3R3(4, 4) coexist at 9. Moreover, for RoP3(0,2), R1Po(5,7), R2P~ (15,18) and R3P2 (9,11), Ro receives Po's request at 28 (> 2), R~ receives Px'S request at 21 (>7), R2 receives P2's request at 17 (<18) but P2R2 (14,17) is not deleted before 18, and R 3 receives P3'S request at 12 (> 11).…”

Section: Deadlocksmentioning

confidence: 99%

“…There are several algorithms that use consistent cuts for deadlock detection. However, one should note that, to detect a deadlock, obtaining a consistent cut is neither necessary [7] nor sufficient [20]. Furthermore, it is not fundamental to the definition of a deadlock: A consistent cut is defined by the pattern of messages exchanged, and is thus a syntactic construct that does not capture the semantics of the messages (e.g.…”

Section: Deadlocksmentioning

confidence: 99%

See 1 more Smart Citation

On deadlocks of exclusive AND-requests for resources

Tay

¹

,

Loke

²

1995

Distrib Comput

5

0

View full text Add to dashboard Cite

Although there are numerous concurrency control algorithms and they use a variety of techniques, there is an underlying serializability theory that serves both as a basis for analyzing their correctness and as a guide for designing new protocols. Following this paradigm, this paper proposes a uniform framework for characterizing and developing distributed deadlockrelated algorithms. The system considered here consists of processes making multiple requests for exclusive access to resources. The results examine the role of process abortion and the asymmetry between processes and resources. To illustrate the generality of the framework, the results are used to analyze several well-known deadlock detectors, thus revealing a common structure among them, despite the variety of techniques they use.

show abstract

Runtime Monitoring of Timing Constraints in Distributed Real-Time Systems

Jahanian¹,

Rajkumar²,

Raju³

1994

Responsive Computing

View full text Add to dashboard Cite

Embedded real-time systems often operate under strict timing and dependability constraints. To ensure responsiveness, these systems must be able to provide the expected services in a timely manner even in the presence of faults. In this paper, we describe a run-time environment for monitoring of timing constraints in distributed real-time systems. In particular, we focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either inter-processor or intra-processor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints from the user-specified constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. We characterize a sub-class of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. We also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, we describe a prototype implementation of a distributed rim-time monitor.

show abstract

Runtime monitoring of timing constraints in distributed real-time systems

Jahanian

¹

,

Rajkumar

²

,

Raju

³

1994

View full text Add to dashboard Cite

Embedded real-time systems often operate under strict timing and dependability constraints. To ensure responsiveness, these systems must be able to provide the expected services in a timely manner even in the presence of faults. In this paper, we describe a run-time environment for monitoring of timing constraints in distributed real-time systems. In particular, we focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either inter-processor or intra-processor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints from the user-specified constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. We characterize a sub-class of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. We also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, we describe a prototype implementation of a distributed rim-time monitor.

show abstract

Using Consistent Subcuts for Detecting Stable Properties

Cited by 6 publications

References 2 publications

On deadlocks of exclusive AND-requests for resources

On deadlocks of exclusive AND-requests for resources

Runtime Monitoring of Timing Constraints in Distributed Real-Time Systems

Runtime monitoring of timing constraints in distributed real-time systems

Contact Info

Product

Resources

About