Real-Time, Priority-Ordered, Deadlock Avoidance Algorithms
暂无分享,去创建一个
[1] C. H. Chang,et al. Performance evaluation of real-time locking protocols using a distributed software prototyping environment , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.
[2] Sándor Vágvölgyi,et al. An infinite hierarchy of tree transformations in the class NDR , 1987, Acta Cybern..
[3] Aloysius Ka-Lau Mok,et al. Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .
[4] R. P. Cook,et al. The StarLite project , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.
[5] Ference Belik. An Efficient Deadlock Avoidance Rechnique , 1990, IEEE Trans. Computers.
[6] Butler W. Lampson,et al. Experience with processes and monitors in Mesa , 1980, CACM.
[7] Hector Garcia-Molina,et al. Scheduling real-time transactions , 1988, SGMD.
[8] Edsger W. Dijkstra. A class of allocation strategies inducing bounded delays only , 1971, AFIPS '72 (Spring).
[9] A. Nico Habermann,et al. Prevention of system deadlocks , 1969, CACM.
[10] Ozalp Babaoglu,et al. Priority Inversion and Its Prevention , 1990 .
[11] Robert P. Cook,et al. -StarLite- A Software Education Laboratory , 1990, CSEE.
[12] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[13] Lui Sha,et al. Real-time synchronization protocols for multiprocessors , 1988, Proceedings. Real-Time Systems Symposium.