A comparison of optimization heuristics for the data mapping problem

LAUR Repository

Show simple item record

dc.contributor.author Mansour, Nashat
dc.date.accessioned 2018-05-16T07:19:40Z
dc.date.available 2018-05-16T07:19:40Z
dc.date.copyright 1997 en_US
dc.identifier.uri http://hdl.handle.net/10725/7830
dc.description.abstract In this paper we compare the performance of six heuristics with suboptimal solutions for the data mapping problem of two dimensional meshes that are used for the numerical solution of Partial Differential Equations(PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to seven criteria covering load balancing, interprocessor communication,flexibility and ease of use for a class of single-phase iterative PDE solvers. Our evaluation suggests that the simple and fast block distribution heuristic can be as effective as the other five complex and computationally expensive algorithms. en_US
dc.language.iso en en_US
dc.title A comparison of optimization heuristics for the data mapping problem en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 198629170 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.identifier.ctation Chrisochoides, N., Mansour, N., & Fox, G. C. (1997). A comparison of optimization heuristics for the data mapping problem. en_US
dc.author.email nmansour@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://surface.syr.edu/cgi/viewcontent.cgi?article=1059&context=npac en_US
dc.author.affiliation 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