| F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 340--349, December 1999. |
....Since tasks may synchronize communicate via critical sections, we will also relax Thane s and Hansson s input output assumption. Our extension is however only valid for the individual nodes in the distributed real time system, unless we assume a global PCEP, which is quite complex to achieve [10]. The subsequent analysis in this paper is hence focused on a single node. The results by Thane and Hansson [13] 14] on how to derive global execution ordering scenarios can however successfully be applied if global scheduling is relying on offsets between tasks on different nodes, but this is ....
Mueller F. Priority inheritance and ceilings for distributed mutual exclusion. Proc. 20th IEEE Real-Time Systems Symposium, pp. 340-349, Phoenix, Arizona, December 1999.
No context found.
F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 340--349, December 1999.
....a dynamically adjusted tree, which results in path compression with regard to future request propagation. It is fully decentralized, which ensures scalability for large number of nodes. The model assures that requests are ordered FIFO, which supports the predictable response times for requests [11, 12]. Our contribution in prior work was to alleviate this shortcoming with a novel protocol. In this proposal, we develop a novel protocol for hierarchical locking building on our past results. 3. Protocol for Scalable Concurrency Services In the following, we present a protocol for mutual ....
F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 340--349, Dec. 1999.
....tree, which results in path compression with regard to future request propagation. It is fully decentralized, which ensures scalability for large numbers of nodes. The model assures that requests are ordered FIFO. Our contribution in prior work was to alleviate shortcomings in priority support [15, 16]. In this work, we develop a novel protocol for hierarchical locking building on our past results and demonstrate its suitability to deliver short latencies and low message overhead in cluster environments. 3. Peer to Peer Hierarchical Locking This section introduces a novel locking protocol. ....
F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 34(349, Dec. 1999.
....the queue based on the collected information, as given by the hybrid variant of repair. As mentioned before, this information is out of date and may lead to arbitrary reordering of disconnected portions of the queue. However, either logical timestamps [10] or ordering based on relative fairness [17] could be utilized to provide a partial ordering ensuring fairness as much as possible in a distributed environment. Finally, fragmentation and multiple faults can be tolerated if the ring is reconstructed based on connected fragments of the ring. In case of multiple rings, the probability of ....
F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 340--349, Dec. 1999.
No context found.
F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 340-349, December 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC