A comparison of data mapping algorithms for parallel iterative PDE solvers

Mansour, Nashat; Fox, Geoffrey; Chrisochoides, Nikos

dc.contributor.author	Mansour, Nashat
dc.contributor.author	Fox, Geoffrey
dc.contributor.author	Chrisochoides, Nikos
dc.date.accessioned	2018-05-16T12:05:43Z
dc.date.available	2018-05-16T12:05:43Z
dc.date.copyright	1995	en_US
dc.date.issued	2018-05-16
dc.identifier.uri	http://hdl.handle.net/10725/7834
dc.description.abstract	We review and evaluate the performances of six data mapping algorithms used for parallel single-phase iterative PDE solvers with irregular 2-dimensional meshes on multicomputers. We provide a table that compares the six algorithms for eight measures covering load balance, interprocessor communication, exibility, ease of use and speed. Based on the comparison results, we recommend the use of the simplest and fastest (PQ) of the six algorithms considered for sequential compile-time mapping of 2-dimensional meshes.	en_US
dc.language.iso	en	en_US
dc.title	A comparison of data mapping algorithms for parallel iterative PDE solvers	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.relation.journal	Concurrency: Practice Experience	en_US
dc.identifier.ctation	Chrisochoides, N. P., Mansour, N., & Fox, G. (1995). A comparison of data mapping algorithms for parallel iterative PDE solvers. Concurrency: Practice Experience.	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://www.researchgate.net/profile/Geoffrey_Fox/publication/228729609_A_Comparison_of_data_mapping_algorithms_for_parallel_iterative_PDE_solvers/links/0deec51901cfe5e3d1000000.pdf	en_US
dc.orcid.id	https://orcid.org/0000-0002-3603-8284	en_US
dc.author.affiliation	Lebanese American University	en_US