.

A Tabu Search algorithm for mapping data to multicomputers. (c1997)

LAUR Repository

Show simple item record

dc.contributor.author Diab, Kamal M.
dc.date.accessioned 2011-04-11T08:06:22Z
dc.date.available 2011-04-11T08:06:22Z
dc.date.copyright 1997 en_US
dc.date.issued 2011-04-11
dc.date.submitted 1997-06
dc.identifier.uri http://hdl.handle.net/10725/346
dc.description Includes bibliographical references. en_US
dc.description.abstract We present a Tabu Search algorithm for mapping data to multicomputer nodes, assuming certain computation and multicomputer models. The experimental results show that the Tabu algorithm offers both reasonable solution quality and mapping time, which ranks about fourth in comparison with five other algorithms. en_US
dc.language.iso en en_US
dc.subject TS algorithm en_US
dc.subject Data mapping problems en_US
dc.title A Tabu Search algorithm for mapping data to multicomputers. (c1997) en_US
dc.type Thesis en_US
dc.term.submitted Spring en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.commembers Dr. Issam Mougbrabi
dc.author.commembers Dr. Ramzi Haraty
dc.author.woa RA en_US
dc.description.physdesc 1 bound copy: vi, 30 leaves; ill. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Nashat Mansour
dc.identifier.doi https://doi.org/10.26756/th.1997.16 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

Browse

My Account