Virtual topologies for massively parallel computations. (c2015)

LAUR Repository

Show simple item record

dc.contributor.author Jahed, Karim A.
dc.date.accessioned 2015-09-09T05:55:58Z
dc.date.available 2015-09-09T05:55:58Z
dc.date.copyright 2015 en_US
dc.date.issued 2015-09-09
dc.date.submitted 2015-05-28
dc.identifier.uri http://hdl.handle.net/10725/2122
dc.description.abstract In their essence, recursive search tree algorithms are nothing but mere enumeration of the solution space. Most of the time is spent generating new search tree nodes with very little computation performed at each tree node. Massively parallel computations that are based on such algorithms often suffer from a large communication overhead due to the exponential growth in the number of tasks generated at each search-tree level. Cores would spend computation time generating and exchanging tasks rather than traversing the search tree. This communication overhead will only increase as we scale-up the computation, up to the point where adding new cores negatively affects the computational time. To address this issue, we propose virtual topologies: an architecture-oblivious communication graph imposed on top of the physical network to limit and manage core-to-core communication. Using the Cluster Editing problem as a case study, we show that managed cooperation, coupled with an efficient task generation and load balancing strategy, is capable of dramatically reducing the communication overhead and improving the computational throughput. en_US
dc.language.iso en en_US
dc.subject Virtual computer systems en_US
dc.subject Electric network topology en_US
dc.subject Parallel processing (Electronic computers) en_US
dc.subject Lebanese American University -- Dissertations en_US
dc.subject Dissertations, Academic en_US
dc.title Virtual topologies for massively parallel computations. (c2015) en_US
dc.type Thesis en_US
dc.title.subtitle a case study en_US
dc.term.submitted Spring en_US
dc.author.degree MS in Computer Science en_US
dc.author.school SAS en_US
dc.author.idnumber 200801605 en_US
dc.author.commembers Haraty, Ramzi
dc.author.commembers Hamdan, May
dc.author.woa OA en_US
dc.author.department Computer Science en_US
dc.description.embargo N/A en_US
dc.description.physdesc 1 hard copy: x, 42 leaves; col. ill.; 31 cm. avaiable at RNL. en_US
dc.author.advisor Abu-Khzam, Faisal
dc.keywords Parallel Computation en_US
dc.keywords Virtual Topology en_US
dc.keywords Cluster Editing en_US
dc.keywords Load Balancing en_US
dc.keywords Graph Representation en_US
dc.description.bibliographiccitations Bibliography: leaves 40-42. en_US
dc.identifier.doi https://doi.org/10.26756/th.2015.13 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account