Author:
Hanuliak Juraj,Hanuliak Ivan
Abstract
PurposeTo address the problems of high performance computing by using the networks of workstations (NOW) and to discuss the complex performance evaluation of centralised and distributed parallel algorithms.Design/methodology/approachDefines the role of performance and performance evaluation methods using a theoretical approach. Presents concrete parallel algorithms and tabulates the results of their performance.FindingsSees that a network of workstations based on powerful personal computers belongs in the future and as very cheap, flexible and perspective asynchronous parallel systems. Argues that this trend will produce dynamic growth in the parallel architectures based on the networks of workstations.Research limitations/implicationWe would like to continue these experiments in order to derive more precise and general formulae for typical used parallel algorithms from linear algebra and other application oriented parallel algorithms.Practical implicationsDescribes how the use of NOW can provide a cheaper alternative to traditionally used massively parallel multiprocessors or supercomputers and shows the advantages of unifying the two disciplines that are involved.Originality/valueProduces a new approach and exploits the parallel processing capability of NOW. Gives the concrete practical examples of the method that has been developed using experimental measuring.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference18 articles.
1. Andrews, G.R. (2000), Foundations of Multithreaded, Parallel, and Distributed Programming, Addison‐Wesley Longman, Glen View, IL, p. 664.
2. Banks, J. and Dai, J.G. (1997), “Simulation studies of multiclass queueing networks”, IEEE Transactions, Vol. 29, pp. 213‐9.
3. Basoglu, Ch., Lee, W. and Kim, Y. (1997), “An efficient FFT algorithm for super‐scalar and VLIW processor architectures”, Real Time Imaging, Vol. 3 No. 6, pp. 441‐53.
4. Fodor, G., Blaabjerg, S. and Andersen, A. (1998), “Modelling and simulation of mixed queueing and loss systems”, Wireless Personal Communication, Vol. 8, pp. 253‐76.
5. Greenberg, D.S., Park, J.K. and Schvabe, E.J. (1996), “The cost of complex communication on simple networks”, Journal of Parallel and Distributed Computing, Vol. 35, pp. 133‐41.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献