 Dining Philosophers Theory and Concept in Operating System SchedulingAndysah Putera Utama Siahaan
No kbyhq_v1, INA-Rxiv from Center for Open Science Abstract: This research describes how to avoid deadlock condition in dining philosophers problem. It is the undesirable condition of concurrent systems. It is marked as in a circular waiting state. At first, most people wear concepts simple synchronization is supported by the hardware, such as user or user interrupt routines that may have been implemented by hardware. In 1967, Dijkstra proposed a concept wearer an integer variable to count the number of processes that are active or who are inactive. This type of variable is called semaphore. The mostly semaphore also be used to synchronize the communication between devices in the device. In this journal, semaphore used to solve the problem of synchronizing dining philosophers problem. Dining itself is a situation where five philosophers are sitting at the dinner table to eat spaghetti, every philosopher is given a plate of spaghetti and one chopstick to eat spaghetti the two chopsticks are needed to resolve the issue semaphore variable is then applied to each chopstick chopsticks that can be shared all the other philosopher. This paper presents the efficient distributed deadlock avoidance scheme using lock and release method that prevents other thread in the chain to make race condition. Date: 2017-09-22 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:osf:inarxi:kbyhq_v1 Access Statistics for this paper More papers in INA-Rxiv from Center for Open Science |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.