Deadlock prevention in the RTC programming system for distributed real-time applications

Abstract

The RTC distributed real-time programming system was implemented using AND-OR locking of system resources to meet real-time and concurrency control requirements. Since RTC processes can hold locks while acquiring others, deadlock is possible and therefore a deadlock prevention technique was implemented for AND-OR locking in such systems. The authors briefly discuss the RTC programming system, illustrate the system's use in programming a timed version of the classic dining philosophers example, describe the deadlock prevention technique, and show how it is applied in the RTC dining philosophers example.<>