Affiliations: [a] Department of Information Technology, Guru Nanak Dev Engineering College, Ludhiana, India
| [b] Department of Computer Science and Engineering, ABES Engineering College, Ghaziabad, India
Correspondence:
[*]
Corresponding author. Sachin Bagga, Department of Information Technology, Guru Nanak Dev Engineering College,
Ludhiana, India. Tel.: +91 9779903785; E-mail: sachin8510@gmail.com.
Abstract: Thread based programs are very much efficient in terms of increasing application response, improving structure of the program, combining with the remote procedure call(RPC) and complete utilization of the computation available. A shared-memory system along with the multithreading, can result in developing a parallel system on which different threads can run in parallel on different processor cores. Even when there are more number of threads than the processor cores, scheduling along with context switching can be done to ensure start of execution of all the threads. Keeping these benefits in mind, present research formulates that in certain cases, the results of multithreading based programming on a single system can be more convincing than making use of the cluster based distributed programming. Proposed work tests all these claims, by decomposing an image having salt and pepper noise into number of small images and then applying median filtering parallely on all these subimages using multithreading approach. Various performance measurement metrics like % Idle Time, % Processor Time, % Maximum Frequency, % Processor Utility, total execution time are used to validate the results generated by the proposed approach. Remote method invocation (RMI) based cluster for distributed programming has also been deployed to perform the same operation on a cluster based architecture with number of nodes working together, to compare the results of both the architectures.
Keywords: SPMD, time sharing, median filter, Java, RMI, threads, processor frequency, processor utility
