[ad_1]
A distributed algorithm runs different parts of an algorithm simultaneously on interconnected processors, communicating with each other. It differs from a regular algorithm designed for a single processor. Problems may arise, but programmers study to overcome them.
A distributed algorithm is a specific type of algorithm used on computer software that must use various interconnected processors. The distributed algorithm is responsible for running different parts of the algorithm simultaneously, each on a different processor. The processors must therefore communicate with each other for the software to work properly.
To understand distributed algorithm, it is easier to look at what a typical algorithm is. An algorithm is a defined process that outlines from start to finish the steps that must be taken to complete the desired process or solve a problem. For example, an algorithm for mailing a letter would go something like:
1. Take the envelope
2. Open the pouch
3. Enter letter
4. Close the envelope
5. Attach the stamp
This will continue until the process is complete. Some steps may branch into other steps. These would tell the person what to do if he fails to complete one of the major steps and eventually lead him back to the original algorithm. The important thing is that the algorithm eventually has an end, regardless of the path the person takes to reach it.
Technically anything that is a defined process can be an algorithm, like the example above for sending a letter. A computer algorithm is an algorithm designed to tell a computer what to do. It has a beginning and an end step with several steps in between. It helps the computer perform an action and tells it what to do if something goes wrong. If a file that your computer needs is missing, it may tell it to skip that step or take an alternate step for it.
The difference between an algorithm and a distributed algorithm is simply that the distributed algorithm is designed to run on separate processors while a normal computer algorithm would not. Each processor runs a different part of the overall algorithm at the same time and then sends the results.
There are several problems that arise when using distributed algorithms. One of the processors could fail, causing that part of the algorithm to stop working. There could also be a communication problem between the processors which would prevent the distributed algorithm from reaching the end of the process. Many programmers study distributed algorithms to find ways to overcome these problems and ensure that the algorithm will complete even in the event of a technical error.
[ad_2]