Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Parallel Probabilistic Computations On A Cluster Of Workstations, Atanas Radenski, Andrew Vann, Boyana Norris
Parallel Probabilistic Computations On A Cluster Of Workstations, Atanas Radenski, Andrew Vann, Boyana Norris
Mathematics, Physics, and Computer Science Faculty Books and Book Chapters
Probabilistic algorithms are computationally intensive approximate methods for solving intractable problems. Probabilistic algorithms are excellent candidates for cluster computations because they require little communication and synchronization. It is possible to specify a common parallel control structure as a generic algorithm for probabilistic cluster computations. Such a generic parallel algorithm can be glued together with domain-specific sequential algorithms in order to derive approximate parallel solutions for different intractable problems.
In this paper we propose a generic algorithm for probabilistic computations on a cluster of workstations. We use this generic algorithm to derive specific parallel algorithms for two discrete optimization problems: the …
Development And Utilization Of Parallel Generic Algorithms For Scientific Computations, Atanas Radenski, Andrew Vann, Boyana Norris
Development And Utilization Of Parallel Generic Algorithms For Scientific Computations, Atanas Radenski, Andrew Vann, Boyana Norris
Mathematics, Physics, and Computer Science Faculty Books and Book Chapters
We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as meshes, pipelines, or master-server networks in problem-independent manner. Such modules can be extended with sequential domain-specific code in order to derive particular parallel applications. In this paper, we first outline the essence of extensible modules. Then, we focus on a case study of the cellular automaton, a message-parallel generic algorithm from which we derive diverse parallel scientific applications.