## Abstract We present a parallel implementation of the three‐dimensional alternating direction implicit finite‐difference time‐domain (ADI‐FDTD) method in Cartesian coordinates using the message passing interface (MPI) library. Parallel implementations not only speed up computations but also incre
A parallel implementation of the PROMETHEE method
✍ Scribed by Luis C. Dias; João P. Costa; João N. Clímaco
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 952 KB
- Volume
- 104
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
✦ Synopsis
The obtainment of a result from a decision support system is usually preceded by a structuring of the decision situation and followed by a robustness analysis phase. In this last phase the decision makers (DMs) observe the impact of changing the parameters of the decision model built during structuring, in order to learn about the situation and increase their confidence on the results. It is essential that the decision support system enables interactivity (i.e. provides short response times), otherwise during this phase the DMs will not be encouraged to be as exhaustive as required by the situation. This presents a computational challenge when the problems are not of trivial dimension. This paper discusses the application of parallel processing as a means to meet this challenge when building a decision support system based on the PROMETHEE multicriteria aid method. Several parallel programs have been built and compared on a 16-processor computer. Our purpose was to acquire some insight on how the parallel programs do perform under different situations and to identify the features of the method more relevant to its parallelisation. We verified that at some situations the reduction of the computer's response time by means of parallel processing is quite appreciable and may foster the use of a decision support tool.
📜 SIMILAR VOLUMES
The boundary element method has its origins in the boundary integral equation method [1] and has, in the past two decades, become a well-established technique for the solution of problems in engineering and applied science. A significant amount of work has been focused on the development of computer
A coarse-grain, parallel approach to direct Hartree-Fock calculations is presented and discussed. The suggested scheme allows for a near asymptotic speedup involving a very low parallelization overhead without compromising the vector performance of vector-parallel architectures. A shared-memory MIMD