Email this article 
Open Access
Subscription or Fee Access
Modelling of Complexities in PA of Laplace Equation
(*) Corresponding author
DOI: https://doi.org/10.15866/irecos.v11i4.8910
Abstract
Dominant trends in parallel and distributed computing (parallel computers, parallel algorithms) aim to connect a number of powerful workstations (WS) based on single personal computers (PC) or symmetrical multiprocessor system (SMP) to solve complex problems in a parallel way. Typical representatives of these trends are network of workstation (NOW) and Grid as a high integrated network of NOW modules. In relation to it there is a bad need of unified modelling in traditionally evolved parallel computing and distributed computing as two separate research disciplines. Likewise current trends in high performance computing (HPC) aim to use NOW modules based on SMP parallel computers as cheaper alternatives to the traditionally used massive parallel multiprocessors or supercomputers and to profit from unifying modelling in parallel and distributed computing too. To exploit the parallel processing capability of such cluster, any application program must be paralleled. A way how to do it (decomposition model) belongs to a most important step in developing process of effective parallel algorithm. This article at first discusses the development of effective (optimised) iterative parallel algorithms (IPA) to solve partial differential equations (PDE). By carefully choosing an illustrative typical problem of PDE (Laplace equation) the proposed research has demonstrated the most important complexities in the process of complete modelling of substantial complexities and their optimisation in order to develop an effective PA. Such approach could be used as illustrative example for a complete modelling and effective solution of even other more complex PDE´s in a parallel way.
Copyright © 2016 Praise Worthy Prize - All rights reserved.
Keywords
References
Abderazek A. B., Multicore systems on chip - Practical Software/Hardware design, Imperial college press, UK, pp. 200, 2010
http://dx.doi.org/10.2991/978-94-91216-33-6
Hwang K. and coll., Distributed and Parallel Computing, Morgan Kaufmann, USA, 472 pages, 2011
Hanuliak P., Hanuliak M., Analytical modelling in parallel and distributed computing, Chartridge Book Oxford, UK, pp. 294, 2014
http://dx.doi.org/10.11648/j.ajnc.20140301.11
Kushilevitz E., Nissan N., Communication Complexity, Cambridge University Press, UK, 208 pages, 2006
Hanuliak, P., Hanuliak, M., Optimisation of Communication Complexity in Parallel Computing, (2016) International Review on Computers and Software (IRECOS), 11 (2), pp. 109-115.
http://dx.doi.org/10.15866/irecos.v11i2.8471
Zhuge Hai, The Knowledge Grid, Imperial College Press, UK, pp. 360, 2011
Kirk D. B., Hwu W. W., Programming massively parallel processors, Morgan Kaufmann, USA, 280 pages, 2010
http://dx.doi.org/10.1016/b978-0-12-415992-1.00001-8
Bahi J. H., Contasst-Vivier S., Couturier R., Parallel iterative algorithms: From sequential to Grid computing, CRC Press, USA, 2007
http://dx.doi.org/10.1201/9781584888093
Hanuliak, P., Hanuliak, M., Modelling of Communication Complexity in Computers, (2016) International Journal on Communications Antenna and Propagation (IRECAP), 6 (2), pp. 68-81.
http://dx.doi.org/10.15866/irecap.v6i2.8444
Hanuliak J., Modelling of communication complexity in parallel computing, AJNC, Science PG, Vol. 3, (Special issue 1), USA, pp. 29 – 42, 2014
Hanuliak J., Hanuliak I., To performance evaluation of distributed parallel algorithms, Kybernetes, UK, Volume 34, No. 9/10, pp. 1633-1650, 2005
http://dx.doi.org/10.1108/03684920510614858
Harchol-BalterMor, Performance modelling and design of computer systems, Cambridge University Press, UK, pp. 576, 2013
Arora Sanjeev, Barak Boaz, Computational complexity - A modern Approach, Cambridge University Press, UK, pp. 573, 2009
http://dx.doi.org/10.1017/cbo9780511804090
Riano l., McGinity T.M., Quantifying the role of complexity in a system´s performance, Evolving Systems, Springer Verlag, Germany, pp. 189 – 198, 2011
http://dx.doi.org/10.1007/s12530-011-9031-4
Dattatreya G. R., Performance analysis of queuing and computer network, University of Texas, Dallas, USA, pp. 472, 2008
Kostin A., Ilushechkina L., Modelling and simulation of distributed systems, Imperial College Press, UK, 440 pages, 2010
Paterson D. A., Hennessy J. L., Computer Organization and Design, Morgan Kaufmann, USA, pp. 912, 2009
Articolo G., Partial differential equations & boundary value problems, Elsevier, Netherland, pp. 744, 2009
http://dx.doi.org/10.1016/b978-0-12-374732-7.00002-0
Powers D., Boundary value problems and partial differential equations, Elsevier, Netherland, pp. 520, 2005
Dosly O., Rehak P., Half linear differential equations, North Holland, pp. 552, 2005
http://dx.doi.org/10.1016/s0304-0208(05)80001-5
Mazumder Sandip, Numerical Methods for Partial Differential Equations - Finite Difference and Finite Volume Methods, Elsevier, Netherland, 484 pages, 2015
http://dx.doi.org/10.1016/b978-0-12-849894-1.00002-0
Meerschaert M., Mathematical modelling (4th edition), Elsevier, Netherland, pp. 384, 2013
Alasha'ary, H., Matrouk, K., Al-Hasanat, A., Alqadi, Z., Al-Shalabi, H., Improving Matrix Multiplication Using Parallel Computing, (2013) International Journal on Information Technology (IREIT), 1 (6), pp. 346-349.
Bronson R., Costa G. B., Saccoman J. T., Linear Algebra - Algorithms, Applications, and Techniques 3rd Edition, Elsevier Science & Technology, Netherland, 536 pages, 2014
Refbacks
- There are currently no refbacks.
Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize
