Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

An optimal distributed solution to the dining philosphers problem

From MaRDI portal
Publication:1100887
Jump to:navigation, search

DOI10.1007/BF01407879zbMath0641.68040MaRDI QIDQ1100887

S. P. Rana, D. K. Banerji

Publication date: 1986

Published in: International Journal of Parallel Programming (Search for Journal in Brave)


zbMATH Keywords

resource allocationperformance analysisdistributed algorithmsconcurrencydining philosophers


Mathematics Subject Classification ID

Theory of operating systems (68N25)





Cites Work

  • A robust distributed solution to the dining philosophers problem




This page was built for publication: An optimal distributed solution to the dining philosphers problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1100887&oldid=13137467"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 01:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki