Talk:Banker's algorithm

message: See also is for irrelevant resources (?) OK, can be. But for relevant as well? (Primarily for relevant) --Premil 14:59, 29 January 2006 (UTC)
replies: text: Definitely. I missed an extra 'also' in my edit comment. Mark Hurd 15:38, 29 January 2006 (UTC)

message: The linked C program crashes and burns (bus error) when requesting resources for a process. Compiled with "gcc -o bankers bankers.c" on Mac OS X. 12.165.3.118 (talk) 14:38, 9 November 2008 (UTC)
thread_title:  C Implementation Crashes 

message: What does the Banker's rounding link have to do with deadlock avoidance?
:Nothing, but some who type Banker's algorithm to the search box may want to read about Banker's rounding instead of deadlock avoidance. Torzsmokus (talk) 17:28, 13 January 2008 (UTC)
thread_title:  Banker's rounding link 

message: This entire article looks suspiciously similar to the explaination of Banker's algorithm in "Operating System Concepts" by Silberschatz, Galvin, and Gagne (pages 259-261 of the 7th edition).  Everything from the structure of the article to most of the wording, with a few changes, is no different from this copyrighted work.  I'm assuming this shouldn't be?
:Indeed it should not. I have now rewritten the article from scratch as a stub article using multiple sources, and added a reference to the source you cite above for further reading. -- The Anome 12:22, 30 May 2006 (UTC)
thread_title:  This article plagiarised? 

message: I added a large section describing how the algorithm works.  I wrote this from my memory of the algorithm from my operating systems class.  I did check with some websites and my textbook (which I cited) to make sure I wasn't too far off.  Still, it would help if someone else could double check everything, (especially to make sure it is clear enough and not too technical).  Also, I didn't want to remove the stub tag myself, but there might be enough information now to do so.  MagiMaster 07:48, 10 July 2006 (UTC)
thread_title:  Added algorithm section 

message: I'm not sure how this paper diverges from the banker's algorithm. It says that it is a generalization:
Acknowledgment. The deadlock problem occurred to 
me for the first time when E. W. Dijkstra gave a practical 
solution of the problem for a special purpose [1]. Later 
on, I had the pleasure of discussing a general solution of 
the problem with him when I wrote my thesis.
(where [1] is "De Bankiers Algorithm"), but I don't see the difference between what that paper and this article describe. Anyone? -Slamb 01:15, 28 August 2006 (UTC)
thread_title:  Habermann's "Prevention of System Deadlocks"? 

message: The "Deadlock Recovery, Avoidance and Prevention" link is dead.  — Preceding unsigned comment added by 89.68.109.167 (talk) 06:48, 27 May 2015 (UTC)
thread_title:  Dead links 

message: Currently, the first example refers to a "previous example" which might be a later example (except the numbers do not match). This conflicts with probably all english meanings of the word "previous".  — Preceding unsigned comment added by 108.28.151.178 (talk) 09:21, 30 September 2015 (UTC)
thread_title:  "Previous example"? 

message: * Can somebody make the numbered list in Resources > Requests > Example continued? Currently the newlines break the list and the numbering becomes 1,2,1,2,3,... I wonder if there's a way to make it 1,2,3,4,5,... Sheep0x (talk) 23:29, 14 October 2015 (UTC)
thread_title:  Formatting issues