TY - JOUR
T1 - Towards a portable and efficient environment for parallel computing
AU - Lyu, J.
AU - Gunasekaran, A.
AU - Kachttvichyanukul, V.
N1 - Funding Information:
The authors wish to thank the Argonne National Laboratory for the permission to use the Advanced Computing Research Facility and numerous helpful comments from the staffs of the Laboratory. The first author also acknowledges the financial support provided by the Graduate College at the University of Iowa, U.S.A.
PY - 1995/6
Y1 - 1995/6
N2 - The availability of more and more cost-effective and powerful parallel computers has enhanced the ability of the operations research community to solve more laborious computational problems. In this paper an attempt has been made to implement a parallel simulation runs dispatcher with an objective to study the feasibility of establishing a portable and efficient parallel programming environment. This parallel simulation run dispatcher can be applied to both terminating type and steady-state type simulation models. The algorithm is then transferred and executed on various other shared-memory multiprocessor systems to illustrate its portability. Another contribution of this paper is to verify whether the performance of the portable code and the non-portable code of a same algorithm is significantly different on a specific parallel system using the analysis of covariance model.
AB - The availability of more and more cost-effective and powerful parallel computers has enhanced the ability of the operations research community to solve more laborious computational problems. In this paper an attempt has been made to implement a parallel simulation runs dispatcher with an objective to study the feasibility of establishing a portable and efficient parallel programming environment. This parallel simulation run dispatcher can be applied to both terminating type and steady-state type simulation models. The algorithm is then transferred and executed on various other shared-memory multiprocessor systems to illustrate its portability. Another contribution of this paper is to verify whether the performance of the portable code and the non-portable code of a same algorithm is significantly different on a specific parallel system using the analysis of covariance model.
UR - http://www.scopus.com/inward/record.url?scp=0029324393&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029324393&partnerID=8YFLogxK
U2 - 10.1080/00207729508929102
DO - 10.1080/00207729508929102
M3 - Article
AN - SCOPUS:0029324393
SN - 0020-7721
VL - 26
SP - 1333
EP - 1341
JO - International Journal of Systems Science
JF - International Journal of Systems Science
IS - 6
ER -