M.Z. Yannakakis, C.H. Papadimitriou and H.T. Kung, Locking Policies: Safety and Freedom for Deadlock, Proc. 20th Annual IEEE Symposium on Foun- dations of Computer Science (1979), 286-297 15  Home/Search   Document Not in Database   Summary   Related Articles   Check

....we define the SWclosure. The closure is the smallest region containing S that is both SW closed and NE closed. A reason for considering the closure problem, is that it has an important relation to the problem of safeness and deadlock freedom when several users concurrently access a database [22]. There, it is common for a user to lock a variable, for exclusive access, at the beginning of an update and unlock it afterwards. If the two axes in our problem formulation reflect the history of actions taken by two users, then a rectangle depicts a time slot when both users would access a ....

M.Z. Yannakakis, C.H. Papadimitriou and H.T. Kung, Locking Policies: Safety and Freedom for Deadlock, Proc. 20th Annual IEEE Symposium on Foun- dations of Computer Science (1979), 286-297 15

....prioritisation is combined with a potential field that is defined on a time varying configuration space. O Donnell and Lozano P erez [OLP89] introduced a decoupled planning approach called path coordination, which is based on a scheduling technique originally developed by Yannakakis et al. YPK79] for concurrent database access by several users. It is assumed that the planning problem involves just two robots. First, paths P 1 and P 2 for the two robots are planned independently. Then, a two dimensional coordination diagram is constructed, where the x axis corresponds to path P 1 and the ....

M.Z. Yannakakis, C.H Papadimitriou, and H.T. Kung. Locking policies: Safety and freedom for deadlock. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 286--297, 1979.

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