返回Google圖書搜尋

Data Temporal Consistency in Hard Real-time Systems

出版	University of Illinois at Urbana-Champaign, 1992
URL	http://books.google.com.hk/books?id=Hq4XcMYUq28C&hl=&source=gbs_api

註釋More precisely, data objects are inconsistent when their ages and dispersions are greater than the absolute and relative thresholds allowed by the application. Real-time transactions must read temporally consistent data in order to deliver correct results. Based on this model, we have evaluated the performance of two well-known classes of concurrency control algorithms that handle multiversion data: the two-phase locking and the optimistic algorithms, as well as the well-known priority-driven, preemptive scheduling algorithms: the rate-monotone and earliest-deadline- first algorithms. The effect of using the priority inheritance and stack- based protocols with lock-based concurrency control is also studied.