Banker's algorithm
E79782
Banker's algorithm is a classic deadlock-avoidance algorithm in operating systems that safely allocates resources to processes by simulating and verifying that the system will remain in a safe state.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Banker's algorithm canonical | 1 |
| Resource Allocation in Multiprocess Computer Systems | 1 |
| banker's algorithm | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T636098 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Banker's algorithm Context triple: [Edsger W. Dijkstra, knownFor, Banker's algorithm]
-
A.
A Loop
A Loop is a modern streetcar route in Portland, Oregon, that provides circulator service through the central city and adjacent neighborhoods as part of the Portland Streetcar system.
-
B.
Resource Governor
Resource Governor is a SQL Server feature that enables administrators to manage and control SQL Server workload and system resource consumption by defining and enforcing resource limits for different workloads.
-
C.
Nyquist stability criterion
The Nyquist stability criterion is a graphical frequency-domain method in control theory used to determine the stability of feedback systems by analyzing how their open-loop transfer function encircles a critical point in the complex plane.
-
D.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
E.
UCSD p-System
UCSD p-System is a portable operating system and programming environment based on the Pascal language and p-code virtual machine, widely used in the late 1970s and early 1980s across multiple hardware platforms.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Banker's algorithm Target entity description: Banker's algorithm is a classic deadlock-avoidance algorithm in operating systems that safely allocates resources to processes by simulating and verifying that the system will remain in a safe state.
-
A.
A Loop
A Loop is a modern streetcar route in Portland, Oregon, that provides circulator service through the central city and adjacent neighborhoods as part of the Portland Streetcar system.
-
B.
Resource Governor
Resource Governor is a SQL Server feature that enables administrators to manage and control SQL Server workload and system resource consumption by defining and enforcing resource limits for different workloads.
-
C.
Nyquist stability criterion
The Nyquist stability criterion is a graphical frequency-domain method in control theory used to determine the stability of feedback systems by analyzing how their open-loop transfer function encircles a critical point in the complex plane.
-
D.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
E.
UCSD p-System
UCSD p-System is a portable operating system and programming environment based on the Pascal language and p-code virtual machine, widely used in the late 1970s and early 1980s across multiple hardware platforms.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
deadlock avoidance algorithm
ⓘ
operating system algorithm ⓘ resource allocation algorithm ⓘ |
| appliesTo | multiple instances of each resource type ⓘ |
| assumes |
fixed number of processes
ⓘ
fixed number of resource types ⓘ maximum resource demand known in advance ⓘ processes eventually release resources ⓘ |
| basedOn | safe state concept ⓘ |
| category | deadlock handling technique ⓘ |
| checks | safety of resource allocation ⓘ |
| complexity | polynomial time in number of processes and resources ⓘ |
| contrastedWith |
deadlock detection
ⓘ
deadlock prevention ⓘ |
| deniesRequestIf | resulting state is unsafe ⓘ |
| developedBy | Edsger W. Dijkstra ⓘ |
| ensures |
each process can complete eventually in a safe state
ⓘ
system remains in a safe state ⓘ |
| exampleUsedIn | resource allocation problems in textbooks ⓘ |
| formalizedIn | matrices and vectors ⓘ |
| goal | find safe sequence of process execution ⓘ |
| grantsRequestIf | resulting state is safe ⓘ |
| inspired | later research in deadlock avoidance ⓘ |
| introducedIn | 1960s ⓘ |
| involves |
resource request algorithm
ⓘ
safety algorithm ⓘ |
| limitation |
assumes resources are reusable
ⓘ
high runtime overhead for large systems ⓘ not suitable when maximum demands are unknown ⓘ |
| models | banker-customer relationship ⓘ |
| nameOrigin | analogy with a banker granting loans ⓘ |
| notApplicableTo | single-instance resource deadlock avoidance ⓘ |
| prevents |
circular wait
ⓘ
deadlock ⓘ |
| property | conservative in resource allocation ⓘ |
| relatedTo |
deadlock state
ⓘ
safe state ⓘ unsafe state ⓘ |
| requires |
allocation matrix
ⓘ
available resources vector ⓘ maximum demand matrix ⓘ need matrix ⓘ preemption not allowed for allocated resources ⓘ processes declare maximum resource needs ⓘ |
| simulates | future resource allocation sequences ⓘ |
| taughtIn | operating systems courses ⓘ |
| usedFor |
deadlock avoidance
ⓘ
safe resource allocation ⓘ |
| usedIn | operating systems ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Banker's algorithm Description of subject: Banker's algorithm is a classic deadlock-avoidance algorithm in operating systems that safely allocates resources to processes by simulating and verifying that the system will remain in a safe state.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Banker's algorithm
linked to: Banker's algorithm