2026-09-20T15:58:21Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/341002026-06-05T20:26:26Zcom_1721.1_7582com_1721.1_7581col_1721.1_131024

Dimitri P. Bertsekas and Ed. Leung. Daly, Daniel Cameron Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2006-09-28T15:02:38Z 2006-09-28T15:02:38Z 1993 1994 http://hdl.handle.net/1721.1/34100 46988178 Thesis (B.S. and M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 1994. Includes bibliographical references (leaf 29). 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. by Daniel Cameron Daly. B.S. M.S. 30 leaves 1505509 bytes 1506639 bytes application/pdf application/pdf eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Synchronization issues of the parallel A Star Search Synchronization issues of the parallel A* Search Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a49f6a77-cf23-4a13-adce-d69569e4971f"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Synchronization issues of the parallel A Star Search</Title> <Subtitle>Synchronization issues of the parallel A* Search</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>1994</PublicationDate> <Authors> <Author> <DisplayName>Daly, Daniel Cameron</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>