INTERNATIONAL JOURNAL OF TECHNOLOGY MANAGEMENT & HUMANITIES
Viewer Login | Editor Login
ISSN(ONLINE):2454-566X
Archive

Volume -1, Issue - 1

Volume -1, Issue - 2

Volume -1, Issue - 3

Volume -1, Issue - 4

Volume -2, Issue - 1

Volume -2, Issue - 2

Volume -2, Issue - 3

Volume -2, Issue - 4

Volume-3, Issue-1
 Inedexing
1.Indexd by International Innovative Journal Impact Factor(IIJIF)

2.Indexd by Global Impact Factor Organisation

3.Indexd by ResearchBib

4.Indexd by Root Indexing


Download
AUTHORS GUIDELINES FORM
COPYRIGHT FORM
PUBLICATION FEE FORM

Title:Analysis of the Dining Philosophers Problem in Concurrency Control between Processes
Abstract:computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals. Soon after, Tony Hoare gave the problem its present formulation. Keywords : Mutex, Concurrency control, Fork, Resource Starvation