29-04-2017, 08:08 PM
Hi am Mohamed i would like to get details on source code for bully algorithm in java. I need to refer it.
|
source code for bully algorithm in java
|
Hi am Mohamed i would like to get details on source code for bully algorithm in java. I need to refer it.
01-05-2017, 03:09 PM
The Bully algorithm was devised by García-Molina in 1982. When a process warns that the coordinator no longer responds to requests, he initiates an election. Process P, carries out an election as follows:
1) P sends a ELECTION message to all processes with higher numbers.
2) If no one answers, P wins the election and becomes a coordinator.
3) If one of the highest responses, takes over. P's work is done.
At any point in time, a process can get a CHOICE from one of your lower-ranked colleagues. When a message of this type arrives, the receiver sends an OK message to the sender to indicate that he is alive and will take care of it. The receiver then holds an election, unless he already has one. Eventually, all processes renounce one, and that is the new coordinator. He announces his victory by sending all the processes a message telling them that he is immediately the new coordinator.
If a process that was formerly below comes again, it sustains an election. If it happens to be the highest numbered process currently in use, it will win the elections and take over the work of the coordinator. So, the biggest guy in the city always wins, hence the name "Bully Algorithm".
The workbench shows four processes. There are two queues associated with each process: a queue of requests received from other processes and a queue of requests waiting for recognition of other processes. The processes are color coded as follows: red means a noncoordinating process alive, purple indicates a coordinator and gray represents a process that is down. Each non-coordinator process sends requests (circles) to the coordinator and waits for an acknowledgment before sending the next request. Acknowledgment messages are indicated by circles within rectangles. If the acknowledgment does not arrive in a certain waiting time, the process initiates an election by sending ELECTION messages (bars).
The simulation can be controlled step by step by pressing the buttons corresponding to each process. These buttons can cause individual processes to send requests, fail, or recover. The simulation can also be run in the animation mode in which the processes operate simultaneously and randomly raise and lower. The animation speed can be controlled by the "Slow Ratio" at the top of the demonstration. Moving the slide to the right will slow down the animation.
1) P sends a ELECTION message to all processes with higher numbers.
2) If no one answers, P wins the election and becomes a coordinator.
3) If one of the highest responses, takes over. P's work is done.
At any point in time, a process can get a CHOICE from one of your lower-ranked colleagues. When a message of this type arrives, the receiver sends an OK message to the sender to indicate that he is alive and will take care of it. The receiver then holds an election, unless he already has one. Eventually, all processes renounce one, and that is the new coordinator. He announces his victory by sending all the processes a message telling them that he is immediately the new coordinator.
If a process that was formerly below comes again, it sustains an election. If it happens to be the highest numbered process currently in use, it will win the elections and take over the work of the coordinator. So, the biggest guy in the city always wins, hence the name "Bully Algorithm".
The workbench shows four processes. There are two queues associated with each process: a queue of requests received from other processes and a queue of requests waiting for recognition of other processes. The processes are color coded as follows: red means a noncoordinating process alive, purple indicates a coordinator and gray represents a process that is down. Each non-coordinator process sends requests (circles) to the coordinator and waits for an acknowledgment before sending the next request. Acknowledgment messages are indicated by circles within rectangles. If the acknowledgment does not arrive in a certain waiting time, the process initiates an election by sending ELECTION messages (bars).
The simulation can be controlled step by step by pressing the buttons corresponding to each process. These buttons can cause individual processes to send requests, fail, or recover. The simulation can also be run in the animation mode in which the processes operate simultaneously and randomly raise and lower. The animation speed can be controlled by the "Slow Ratio" at the top of the demonstration. Moving the slide to the right will slow down the animation.
|
« Next Oldest | Next Newest »
|
Important Note..!
If you are not satisfied with above reply ,..PleaseASK HERE
So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
| Possibly Related Threads... | |||||
| Thread | Author | Replies | Views | Last Post | |
| voice vased email system source code | 0 | 3,143 |
20-04-2021, 07:59 AM Last Post: |
||
| ns2 source codes free download for hello flood attack | 0 | 2,849 |
31-10-2018, 02:42 PM Last Post: Guest |
||
| voice based email for blinds source code | 0 | 724 |
22-10-2018, 05:12 PM Last Post: Guest |
||
| source code for blood group detection in matlab | 0 | 6,621 |
22-10-2018, 10:59 AM Last Post: Guest |
||
| voice based email for blinds source code | 0 | 712 |
21-10-2018, 07:58 PM Last Post: Guest |
||
| voice based email for blinds source code | 0 | 644 |
21-10-2018, 07:43 PM Last Post: Guest |
||
| source code for hall ticket generation in php | 0 | 2,276 |
08-10-2018, 10:00 PM Last Post: Guest |
||
| program for ticket reservation using multithreading in java | 0 | 1,085 |
08-10-2018, 10:00 AM Last Post: Guest |
||
| algorithm of railway reservation system | 0 | 684 |
02-10-2018, 10:50 PM Last Post: Guest |
||
| voice based email for blinds source code | 0 | 658 |
28-09-2018, 02:42 PM Last Post: Guest |
||