Synchronization issues of the parallel A Star Search

An experimental study was carried out on the performance of synchronous and asynchronous implementations of the A* Search on a multiprocessor network. Master-Slave parallelism was used to distribute the Search among the 8 processor nodes of a transputer network. The test programs were run on 4 different types of maps. Measurements were taken in the form of percentages of time spent in computation and communication in each cycle of the search as an artificial delay in the computation phase was increased. The results from the map tests showed that the asynchronous implementation spent a larger percentage of each cycle performing calculations rather than communicating or waiting for communications as the artificial delay was increased. This means that the efficiency of the asynchronous approach increases more rapidly than the efficiency of the synchronous approach as the computational complexity of a parallel program is increased. This was found to be true for all artificial delays on all test maps for the Master-Slave A* Search. The results might vary with different implementations and search methodologies.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

1994

Author dc:creator

• Daly, Daniel Cameron

Advisor dc:contributor.advisor

• Dimitri P. Bertsekas and Ed. Leung.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/34100

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/34100