Effects of Parallel Processing Implementation on Balanced Load-Division Depending on Distributed Memory Systems | ||
| Journal of University of Anbar for Pure Science | ||
| Article 18, Volume 5, Issue 3, December 2011, Pages 50-56 PDF (366.38 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.37652/juaps.2011.44313 | ||
| Authors | ||
| Subhi R. Zebari* 1; Numan O. Yaseen2 | ||
| 1Foundation of Technical Education/Arbil - Amedi Technical Inst. | ||
| 2Amedi Education Directory. | ||
| Abstract | ||
| Complex problems need long time to be solved, with low efficiency and performance. Therefore, to overcome these drawbacks, the studies went toward the approaches of breaking the problem into independent parts, and treating each part individually in the way that each processing element can execute its part of the problem simultaneously with the others.Parallel processors are computer systems that consist of multiple processing units connected via some interconnection network and the software needed to make the processing units work together. Parallel processing is divided into three types; Shared, Distributed and Hybrid memory systems.In this paper, distributed memory systems addressed depending on client/servers principles, the network can contain any number of nodes; one of them is a client and the others are servers. The algorithms used here are capable of calculating the (Started, Terminated, Consumed -CPU and Total Execution- times and CPU usage) of servers and the Client's -CPU and total execution- times. This work addresses an improved approach for problem subdivision in balanced form and design flexible algorithms to communicate efficiently between client-side and servers-side in the way to overcome the problems of hardware networking components and message passing problems. We addressed Matrix-Algebra case-study to display the effect of balance loaddivision for this approach. The obtained results are checked and monitored by special programming-checkingsubroutines through many testing-iterations and proved a high degree of accuracy. All of these algorithms implemented using Java Language | ||
| Keywords | ||
| Parallel Processing Implementation; Balanced Load; division; Distributed Memory Systems | ||
| References | ||
|
[1] Hank Dietz,hankd@engr.uky.edu, "Linux Parallel Processing HOWTO", http://aggregate.org/LDP/, v2.0, 28-06, 2004.
[2] Marcelo R. Naiouf, Parallel processing. "Dynamic Load Balance in Sorting Algorithms", University Nacional de La Plata, Facultad de Ciencias Exactas, September 2004.
[3] H. El-Rewini and M. Abd-El-Barr ," Advanced Computer Architecture and Parallel Processing", ISBN 0-471-46740-5 John Wiley & Sons, Inc, 2005.
[4] Eitan Frachtenberg, "Job Scheduling Strategies for Parallel Processing", JSSPP, June 17, 2007.
[5] Professor Thomas Braunl , "PARALLEL PROCESSIING: Parrallllell Computterr Arrchiittectturre and Parrallllell Soffttwarre Desiign", Book, University of Western Australia, 2010.
[6] Ameya Waghmari, "What is Parallel Processing", BE SCE Roll No. 41, 2000.
[7] Mohamed Iskandarani and Ashwanth Srinivasan, "Introduction To Parallel Computing, Notes on Parallelization Strategies", November 12, 2008.
[8] Nicholas Carriero and David Gelernter, "HOW TO WRITE PARALLEL PROGRAMS", Book, Massachusetts Institute of Technology, 1992.
[9] Y. F. Funga, M. F. Ercanb, Y. S mChonga, T. K. Hoa, W. L. Cheunga and G.Singha, "Teaching parallel computing concepts with a desktop computer", The Hong Kong Polytechnic University, 2003.
[10] Dr. Tran, Van Hoai, "Parallel Computing", HCMC University of Technology, 2010.
[11] Chris Loosley and Frank Douglas, "High-Performance Client/Server", John Wiley & Sons © 1998.
[12] DRAFT, "Information Retrieval: Implementing and Evaluating Search Engines", MIT Press, 2010. | ||
|
Statistics Article View: 233 PDF Download: 148 |
||