Talk:Bully algorithm - Revision history

Cewbot: Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computing}}.

2024-01-29T14:19:33Z

Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computing}}.

← Previous revision		Revision as of 14:19, 29 January 2024
Line 1:		Line 1:
	{{WikiProject ~~Computing~~\|class=Start\|importance=low\|network=yes\|network-importance=low}}		{{WikiProject banner shell\|class=Start\|
			{{WikiProject Computing\|importance=low\|network=yes\|network-importance=low}}
			}}

	The algorithm is described right but has a flaw in the describtion.<br />		The algorithm is described right but has a flaw in the describtion.<br />
	The recusion is not adressed.		The recusion is not adressed.

Craw-daddy: oops, wrong class

2012-08-28T17:08:43Z

oops, wrong class

← Previous revision		Revision as of 17:08, 28 August 2012
Line 1:		Line 1:
	{{WikiProject Computing\|class=~~Stub~~\|importance=low\|network=yes\|network-importance=low}}		{{WikiProject Computing\|class=Start\|importance=low\|network=yes\|network-importance=low}}

	The algorithm is described right but has a flaw in the describtion.<br />		The algorithm is described right but has a flaw in the describtion.<br />

Craw-daddy: add project template

2012-08-28T17:08:14Z

add project template

← Previous revision		Revision as of 17:08, 28 August 2012
Line 1:		Line 1:
			{{WikiProject Computing\|class=Stub\|importance=low\|network=yes\|network-importance=low}}

	The algorithm is described right but has a flaw in the describtion.<br />		The algorithm is described right but has a flaw in the describtion.<br />
	The recusion is not adressed.		The recusion is not adressed.

220.225.78.137 at 10:00, 11 January 2010

2010-01-11T10:00:02Z

← Previous revision		Revision as of 10:00, 11 January 2010
Line 10:		Line 10:
	It is a recursiv algorithm which works like this:<br />		It is a recursiv algorithm which works like this:<br />
	** If an election was started all higher id'd process get it (if not dead).		** If an election was started all higher id'd process get it (if not dead).
	** They ~~than~~ start their own election to see if their higher ups are alive.		** They then start their own election to see if their higher ups are alive.
	** In the end one process can't find any higher ones.		** In the end one process can't find any higher ones.
	** This process has N-1 elections asking him if he is the big shot. (N being the number of alive processes including him)		** This process has N-1 elections asking him if he is the big shot. (N being the number of alive processes including him)

Discospinster: Reverted edits by 220.225.32.91 (talk) to last version by 79.192.243.94

2009-02-11T20:14:16Z

Reverted edits by 220.225.32.91 (talk) to last version by 79.192.243.94

← Previous revision		Revision as of 20:14, 11 February 2009
Line 27:		Line 27:
	<br />		<br />
	[[Special:Contributions/79.192.243.94\|79.192.243.94]] ([[User talk:79.192.243.94\|talk]]) 20:44, 6 September 2008 (UTC) Moooitic		[[Special:Contributions/79.192.243.94\|79.192.243.94]] ([[User talk:79.192.243.94\|talk]]) 20:44, 6 September 2008 (UTC) Moooitic

	[[File:Example.jpg]]
	----
	<s><br />Strike-through text<sup><sub>Superscript text</sub></sup></s>

	'[''fgsafda''' ''saty''][[Media:Example.ogg]]

220.225.32.91 at 06:51, 10 February 2009

2009-02-10T06:51:08Z

← Previous revision		Revision as of 06:51, 10 February 2009
Line 31:		Line 31:
	----		----
	<s><br />Strike-through text<sup><sub>Superscript text</sub></sup></s>		<s><br />Strike-through text<sup><sub>Superscript text</sub></sup></s>

			'[''fgsafda''' ''saty''][[Media:Example.ogg]]

220.225.32.91 at 06:49, 10 February 2009

2009-02-10T06:49:58Z

← Previous revision		Revision as of 06:49, 10 February 2009
Line 27:		Line 27:
	<br />		<br />
	[[Special:Contributions/79.192.243.94\|79.192.243.94]] ([[User talk:79.192.243.94\|talk]]) 20:44, 6 September 2008 (UTC) Moooitic		[[Special:Contributions/79.192.243.94\|79.192.243.94]] ([[User talk:79.192.243.94\|talk]]) 20:44, 6 September 2008 (UTC) Moooitic

			[[File:Example.jpg]]
			----
			<s><br />Strike-through text<sup><sub>Superscript text</sub></sup></s>

79.192.243.94 at 20:44, 6 September 2008

2008-09-06T20:44:54Z

← Previous revision		Revision as of 20:44, 6 September 2008
Line 4:		Line 4:
	** P broadcasts an election message (inquiry) to all other processes with higher process IDs. '''(correct)'''		** P broadcasts an election message (inquiry) to all other processes with higher process IDs. '''(correct)'''
	** If P hears from no process with a higher process ID than it, it wins the election and '''broadcasts victory'''. '''(incorrect)'''		** If P hears from no process with a higher process ID than it, it wins the election and '''broadcasts victory'''. '''(incorrect)'''
	** If P hears from a process with a higher ID, P waits a certain amount of time for that '''process to broadcast itself as the leader'''. If it does not receive this message in time, it re-broadcasts the election message."~~<br />~~ '''(incorrect)'''		** If P hears from a process with a higher ID, P waits a certain amount of time for that '''process to broadcast itself as the leader'''. If it does not receive this message in time, it re-broadcasts the election message."'''(incorrect)'''
	<br />		<br />
	The bully algorithm can't "broadcast to lower IDs" because it does not have any reference to processes with lower Ids ! It only has the ones who asked him (in an election) and the higher Id'd processes.<br />		The bully algorithm can't "broadcast to lower IDs" because it does not have any reference to processes with lower Ids ! It only has the ones who asked him (in an election) and the higher Id'd processes.<br />

79.192.243.94: ← Created page with 'The algorithm is described right but has a flaw in the describtion.
The recusion is not adressed.
** P broadcasts an election message (inquiry) to all...'

2008-09-06T20:44:10Z

← Created page with 'The algorithm is described right but has a flaw in the describtion. The recusion is not adressed. ** P broadcasts an election message (inquiry) to all...'

New page

The algorithm is described right but has a flaw in the describtion. 
The recusion is not adressed.
 
** P broadcasts an election message (inquiry) to all other processes with higher process IDs. '''(correct)'''
** If P hears from no process with a higher process ID than it, it wins the election and '''broadcasts victory'''. '''(incorrect)'''
** If P hears from a process with a higher ID, P waits a certain amount of time for that '''process to broadcast itself as the leader'''. If it does not receive this message in time, it re-broadcasts the election message." '''(incorrect)'''
 
The bully algorithm can't "broadcast to lower IDs" because it does not have any reference to processes with lower Ids ! It only has the ones who asked him (in an election) and the higher Id'd processes. 
 
It is a recursiv algorithm which works like this: 
** If an election was started all higher id'd process get it (if not dead).
** They than start their own election to see if their higher ups are alive.
** In the end one process can't find any higher ones.
** This process has N-1 elections asking him if he is the big shot. (N being the number of alive processes including him)
** He can '''(now)''' broadcast because the election hold the lower PIDs IPs and he has N-1!
** Alternative he does not need to keep N-2 lower elections instead every process below him can send this highest ID one step lower in the chain of request (no broatcast - point to point)
 
"This is how the algorithm gets its name - a process with a higher ID number will bully a lower ID process out of the coordinator position as soon as it comes online." 
 
This would be a pretty lame reason also it is true that this will happen. 
But a name does describe the method itself. 
 
The name was given cause the one process at the top of the cain announce himself in contrast to a consent ! 
Thus he bullys his way. Which a joining high ID process will do as well ... but as said thats a natural ... 
 
People should check if the ref. book is good and/or the ref. is realy valid... 
 
[[Special:Contributions/79.192.243.94|79.192.243.94]] ([[User talk:79.192.243.94|talk]]) 20:44, 6 September 2008 (UTC) Moooitic