Gamma is a kernel programming language with an elegant chemical reaction metaphor in whichprograms are described in terms of multiset rewriting. Gamma formalism allows one to describe analgorithm without introducing a...Gamma is a kernel programming language with an elegant chemical reaction metaphor in whichprograms are described in terms of multiset rewriting. Gamma formalism allows one to describe analgorithm without introducing artificial sequentiality and leads to the derivation of a parallel solution to agiven problem naturally. However, the difficulty of incorporating control strategies makes Gamma not onlyhard for one to define any sophisticated approaches but also impossible to reach a decent level of efficiencyin any direct implementation. Recently, a higherorder multiset programming paradigm, named higher--order Gamma, is introduced by Metayer to alleviate these problems. In this paper, we investigate the possibility of implementing higherorder Gamma on Maspar, a massively data parallel computer. The results showthat a program written in higher--order Gamma can be transformed naturally toward an efficientimplementation on a real parallel machine.展开更多
Contingency analysis(CA)requires fast execution time for real-time power system operations.Because CA problems can naturally be divided into separate subtasks,parallel computing helps to speed up the computation time....Contingency analysis(CA)requires fast execution time for real-time power system operations.Because CA problems can naturally be divided into separate subtasks,parallel computing helps to speed up the computation time.This paper proposes a master/slave parallel computing architecture and studies the computation of CA in a large-scale power system through high performance computing,adopting a message passing interface for implementation.In particular,although the execution time of CA varies,there is a tradeoff between having an imbalanced workload and"paying"a synchronization penalty for parallel computing:either factor blocks the progress of scalability.The proposed layered dynamic scheduling method is effective to tackle the challenge of high synchronization cost and workload imbalance and have the potential to further scale for the N-2 contingency analysis.展开更多
文摘Gamma is a kernel programming language with an elegant chemical reaction metaphor in whichprograms are described in terms of multiset rewriting. Gamma formalism allows one to describe analgorithm without introducing artificial sequentiality and leads to the derivation of a parallel solution to agiven problem naturally. However, the difficulty of incorporating control strategies makes Gamma not onlyhard for one to define any sophisticated approaches but also impossible to reach a decent level of efficiencyin any direct implementation. Recently, a higherorder multiset programming paradigm, named higher--order Gamma, is introduced by Metayer to alleviate these problems. In this paper, we investigate the possibility of implementing higherorder Gamma on Maspar, a massively data parallel computer. The results showthat a program written in higher--order Gamma can be transformed naturally toward an efficientimplementation on a real parallel machine.
基金The submitted manuscript has been created by UChicago Argonne,LLC,Operator of Argonne National Laboratory(“Argonne”).Argonne,a U.S.Department of Energy Office of Science laboratory,is operated under Contract No.DE-AC02-06CH11357.
文摘Contingency analysis(CA)requires fast execution time for real-time power system operations.Because CA problems can naturally be divided into separate subtasks,parallel computing helps to speed up the computation time.This paper proposes a master/slave parallel computing architecture and studies the computation of CA in a large-scale power system through high performance computing,adopting a message passing interface for implementation.In particular,although the execution time of CA varies,there is a tradeoff between having an imbalanced workload and"paying"a synchronization penalty for parallel computing:either factor blocks the progress of scalability.The proposed layered dynamic scheduling method is effective to tackle the challenge of high synchronization cost and workload imbalance and have the potential to further scale for the N-2 contingency analysis.
