01About This Special Issue
Parallel computing (Parallel computers and algorithms) has emerged as an indispensable tool for any scientific domains during last 25 years of intensive using of parallel principles (Parallelism). Using of parallel principles belongs nowadays to dominant ways of achieving the required performance, which should be higher than what is possible with only single computers. Performance driven studies have explored a wealth of alternatives with respect to all aspects of parallel computers and algorithms too aiming at improving the performance of the available parallel systems and their parallel algorithms by optimizing the whole performance of individual technical and program resources and their influences.The best way how to optimize the whole performance in parallel computing is to apply performance evaluation tools (modeling) in parallel computing. The optimal resource allocation constitutes the problem of being able to understand and to predict modeled resource behavior. To this analysis we can use both analytical and simulation methods. Modeling and simulation are methods, which are commonly used by performance analysts to represent constraints and to optimize performance. Principally analytical methods represented by queuing theory and theory of complexity belong to the preferred methods in comparison to the simulation method, because of their potential ability of general analysis and also of their ability to potentially analyze also massive resources of parallel computers and algorithms too. In relation to it the suggested Special issue should by devoted to complex modeling in parallel computing in order to optimize the whole execution times including the minimization of coincident overheads in parallel computing. The idea of extended complex modeling then opens new possibilities to unify modeling and optimization in parallel computers based on queuing theory and in parallel algorithms using the extensions of theory of complexity to parallel algorithms including their overheads.
02Meet the Guest Editors
Our distinguished editors bring deep subject-matter expertise to curate high-quality research and ensure a rigorous peer-review process.
Lead Guest Editor
Peter Hanuliak
Dubnica Technical Institute, Dubnica nad Vahom, Slovakia
Guest Editor
Kiran kumar K
Hosur, Tamil Nadu, India
Guest Editor
Zitao Liu
University of Pittsburgh, United States
Guest Editor
Dr.GANDHIYA VENDHAN S
Tamilnadu Agricultural University, Trichy, India
03Published Articles
The following articles have been published in this special issue.
-
Decomposition Models of Parallel Algorithms
Issue: Volume 3, Issue 5-1, September 2014Pages: 70-84Received: 16 July 2014Accepted: 18 July 2014Published: 31 July 2014DOI: 10.11648/j.ajnc.s.2014030501.16Downloads:Views:Abstract: The article is devoted to the important role of decomposition strategy in parallel computing (parallel computers, parallel algorithms). The influence of decomposition model to performance in parallel computing we have illustrated on the chosen illustrative examples and that are parallel algorithms (PA) for numerical integration and matrix multiplic... Show More -
Modeling of Single Computing Nodes of Parallel Computers
Issue: Volume 3, Issue 5-1, September 2014Pages: 57-69Received: 16 July 2014Accepted: 18 July 2014Published: 31 July 2014DOI: 10.11648/j.ajnc.s.2014030501.15Downloads:Views:Abstract: The paper describes analytical modeling for single computing nodes of parallel computers. At first the paper describes very shortly the developing steps of parallel computer architectures and then he summarized the basic concepts for performance evaluation. To illustrate theoretical evaluation concepts the paper considers in its experimental part t... Show More -
Modeling of Parallel Computers Based on Network of Computing
Issue: Volume 3, Issue 5-1, September 2014Pages: 43-56Received: 14 July 2014Accepted: 18 July 2014Published: 31 July 2014DOI: 10.11648/j.ajnc.s.2014030501.14Downloads:Views:Abstract: The optimal resource allocation to satisfy such demands and the proper settlement of contention when demands exceed the capacity of the resources, constitute the problem of being able to understand and to predict system behavior. To this analysis we can use both analytical and simulation methods. Modeling and simulation are methods, which are commo... Show More -
Modeling of Communication Complexity in Parallel Computing
Issue: Volume 3, Issue 5-1, September 2014Pages: 29-42Received: 14 July 2014Accepted: 18 July 2014Published: 31 July 2014DOI: 10.11648/j.ajnc.s.2014030501.13Downloads:Views:Abstract: Parallel principles are the most effective way how to increase parallel computer performance and parallel algorithms (PA) too. Parallel using of more computing nodes (processors, cores), which have to cooperate each other in solving complex problems in a parallel way, opened imperative problem of modeling communication complexity so in symmetrical ... Show More -
Complex Performance Modeling of Parallel Algorithms
Issue: Volume 3, Issue 5-1, September 2014Pages: 15-28Received: 14 July 2014Accepted: 18 July 2014Published: 31 July 2014DOI: 10.11648/j.ajnc.s.2014030501.12Downloads:Views:Abstract: Parallel principles are the most effective way how to increase parallel computer performance and parallel algorithms (PA) too. In this sense the paper is devoted to a complex performance evaluation of chosen PA. At first the paper describes very shortly PA and then it summarized basic concepts for performance evaluation of PA. To illustrate the ana... Show More -
Complex Modeling of Matrix Parallel Algorithms
Issue: Volume 3, Issue 5-1, September 2014Pages: 1-14Received: 14 July 2014Accepted: 18 July 2014Published: 31 July 2014DOI: 10.11648/j.ajnc.s.2014030501.11Downloads:Views:Abstract: Parallel principles are the most effective way how to increase performance in parallel computing (parallel computers and algorithms too). In this sense the paper is devoted to a complex performance evaluation of matrix parallel algorithms (MPA). At first the paper describes the typical matrix parallel algorithms and then it summarizes common proper... Show More
