Parallel panel methods
Authors: Chalmers, Alan G., Fiddes, Steven P., Paddon, Derek J.
The nature of panel methods makes parallelisation difficult, unless effective methods can be found that minimise the number of messages required to calculate the interaction of all panels in the problem domain. Here, we use a minimal path configuration of processors to give an effective solution and show its performance superiority over a solution obtained from a ring configuration of processors. A detailed description of the numerical model and the numerical methods that are used for a typical panel method problem is given.The importance of balancing the message generating parts of an algorithm are established by examining the influence matrix set-up time and the matrix solution time. The scalability and maximum performance characteristics of the algorithm and system configuration are analysed and reported.
OUG-13: Real-Time Systems with Transputers, Hussein S. M. Zedan, 1990, pp 313 - 321 published by IOS Press, Amsterdam
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org