Open Access Open Access  Restricted Access Subscription or Fee Access

Unique Analytical Model of Parallel Computers


(*) Corresponding author


Authors' affiliations


DOI: https://doi.org/10.15866/iremos.v9i4.9716

Abstract


Any parallel computer consists of coupled computing nodes. The number of computing nodes determines the parameter p. Single computing nodes are actually used as high performance sequential computers and parallel computers based on the same multiprocessor/multicore processors or cores (SMP). The paper is devoted to the modelling of dominant parallel computers based on at least one used communication network of coupled computing nodes. The paper at first characterises very shortly the basic developing steps of the parallel computer architectures and then the basic methods of the network modelling based on parallel computers. The suggested and developed analytical models are presented in the experimental part of the article. All the suggested and developed analytical models consider for every independent parallel computer module (NOW, Grid)one queuing theory system to model their own computing node’s computation activities and another one for each computing node’s communication channel within the considered parallel computer module. When using modern multiprocessor/multicore SMP system, the developed standard analytical model considers, for its own computation, the computing node’s activities M/M/m queuing theory system and M/M/1 queuing theory system for every used computing node’s communication channel. Based on the analysed results by the experimental 7- computing nodes of the communication network with the standard analytical model the present paper suggests the improved analytical model to correct the not real exponential nature of the data inputs to modelled M/M/1 queuing theory systems. The achieved results of both the developed analytical models have been compared with the developed simulation model results to estimate the magnitude of the improvement. All the developed models (analytical, simulation) have been tested under various values of the modelled input parameters which represent the influences of modelled network architecture modules of NOW and Grid and which should be interested in practical projecting and in evaluating the dominated modular parallel computers.
Copyright © 2016 Praise Worthy Prize - All rights reserved.

Keywords


Parallel Computer; Computing Node; Network of Workstation (NOW); Grid; Meta computer; Modelling; Optimisation; Queuing Theory; Queuing Theory System; Jackson Theorem; System of Linear Equations (SLE)

Full Text:

PDF


References


Dubois M., Annavaram M., Stenstrom P., Parallel Computer Organization and Design, (2012), Cambridge university press, 560 pp., UK.
http://dx.doi.org/10.1017/cbo9781139051224

Coulouris G., Dollimore J., Kindberg T., Distributed Systems – Concepts and Design, (2011), Addison Wesley, 800 pp., UK.

Kirk D., B., Hwu W., Programming massively parallel processors, (2012), Morgan Kaufmann, 280 pp., USA.
http://dx.doi.org/10.1016/b978-0-12-415992-1.00001-8

Wang L., Jie Wei., Chen J., Grid Computing: Infrastructure, Service, and Application, (2009), CRC Press, USA.
http://dx.doi.org/10.1201/9781420067682

Hwang K. and coll., Distributed and Parallel Computing, (2011), Morgan Kaufmann, 472 pp., USA.

Abderazek A., B., Multicore systems on chip-Practical Software/Hardware design, (2010), Imperial college press, 200 pp., UK.
http://dx.doi.org/10.2991/978-94-91216-33-6

Peterson L., Davie B. C., Computer networks – a system approach, (2011), Morgan Kaufmann, 920 pp., USA.

Hager G., Wellein G., Introduction to High Performance Computing for Scientists and Engineers, (2010), CRC Press, 356 pp., USA.
http://dx.doi.org/10.1201/ebk1439811924

Le Boudec Jean-Yves, Performance evaluation of computer and communication systems, (2011), CRC Press, 300 pp., USA.
http://dx.doi.org/10.1201/b16328

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

Tripathy L., Tripathy C., Barik S., A New Fault-Tolerant Interconnection Network, (2015) International Review on Computers and Software (IRECOS), 10 (4), pp. 424-430.
http://dx.doi.org/10.15866/irecos.v10i4.5680

Palaniandy M., Scheduling Strategies in Grid Computing Environment:a Survey, (2014), International Review on Computers and Software (IRECOS), 9 (7), pp.1134-1153.

Dattatreya G., R., Performance analysis of queuing and computer network, (2008), University of Texas, Dallas, pp. 472, 2008, USA

Natarajan G., Analysis of Queues - Methods and Applications, CRC Press, (2012), 802 pp., USA.

Arora S., Barak B., Computational complexity - A modern approach, (2009), Cambridge University Press, 573 pp., UK.
http://dx.doi.org/10.1145/1907450.1907510

Hanuliak, P., Hanuliak, M., Modelling of Complexities in PA of Laplace Equation, (2016) International Review on Computers and Software (IRECOS), 11 (4), pp. 362-372.
http://dx.doi.org/10.15866/irecos.v11i4.8910

Kostin A., Ilushechkina L., Modelling and simulation of distributed systems, (2010), Imperial College Press, pp. 440, UK.

Harchol Balter Mor, Performance modelling and design of computer systems, (2013), Cambridge University Press, 576 pp., UK.
http://dx.doi.org/10.1017/cbo9781139226424

John L., K., Eeckhout L., Performance evaluation and benchmarking, (2005), CRC Press, USA.
http://dx.doi.org/10.1201/9781420037425

Hanuliak J., Modelling of communication complexity in parallel computing, American Journal of Networks and Communications, (2014), 3 (Special Issue 1), Science PG, pp. 29-42, USA.

Hanuliak P., Hanuliak M., Analytical modelling in parallel and distributed computing, (2014), Chartridge Book Oxford, 294 pages, UK.

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

Hanuliak J., Hanuliak I., To performance evaluation of distributed parallel algorithms, Kybernetes, (2005), 34 (9/10), pp. 1633-1650, UK.
http://dx.doi.org/10.1108/03684920510614858

Dubhash D. P., Panconesi A., Concentration of measure for the analysis of randomised algorithms, (2009), Cambridge University Press, UK.

Giambene G., Queuing theory and telecommunications, (2005), Springer, 585 pp., Germany.
http://dx.doi.org/10.1007/978-1-4614-4084-0

Gautam, N., Analysis of Queues: Methods and Applications, (2012), CRC Press, 802 pp., USA.


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize