The Mathematics Behind the Banker’s Algorithm

  • Dijkstra E
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

I recently lectured on the so-called ``Banker's Algorithm'' as an example of a method for deadlock prevention. Because my informal justification left my students visibly unconvinced, I designed a more explicit one while preparing my next week's lectures. This note is written because I think the argument I developed at that occasion rather nice; it is not a symptom of any revival of my interest in the Banker's Algorithm as a scheduling strategy.

Cite

CITATION STYLE

APA

Dijkstra, E. W. (1982). The Mathematics Behind the Banker’s Algorithm. In Selected Writings on Computing: A personal Perspective (pp. 308–312). Springer New York. https://doi.org/10.1007/978-1-4612-5695-3_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free