Publisher
Springer International Publishing
Reference31 articles.
1. Awerbuch, B., Saks, M.: A dining philosophers algorithm with polynomial response time. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, vol. 1, pp. 65–74 (1990)
2. Bouabdallah, A., Laforest, C.: A Distributed Token-Based Algorithm for the Dynamic Resource Allocation Problem. SIGOPS Oper. Syst. Rev. 34(3), 60–68 (2000)
3. Casanova, H., et al.: Versatile, scalable, and accurate simulation of distributed applications and platforms. J. Parallel Distrib. Comput. 74(10), 2899–2917 (2014)
4. Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6(4), 632–646 (1984)
5. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)