Call for Paper - August 2019 Edition
IJCA solicits original research papers for the August 2019 Edition. Last date of manuscript submission is July 20, 2019. Read More

An Approach For Process Migration using Task Scheduling

Print
PDF
2nd National Conference on Information and Communication Technology
© 2011 by IJCA Journal
Number 1 - Article 3
Year of Publication: 2011
Authors:
Prof. M.B. Chandak
Chandu Vaidya

M B Chandak and Chandu Vaidya. Article: An Approach for Process Migration using Task Scheduling. IJCA Proceedings on 2nd National Conference on Information and Communication Technology NCICT(6):14-17, November 2011. Full text available. BibTeX

@article{key:article,
	author = {M.B. Chandak and Chandu Vaidya},
	title = {Article: An Approach for Process Migration using Task Scheduling},
	journal = {IJCA Proceedings on 2nd National Conference on Information and Communication Technology},
	year = {2011},
	volume = {NCICT},
	number = {6},
	pages = {14-17},
	month = {November},
	note = {Full text available}
}

Abstract

Given paper contain proposed approached for task scheduling which is done on a group of computers. Analysis of process data part by dividing them into number of fixed part & merge into single set that as good as previous original data set. Parallelism an approach for doing jobs in amount of time i.e very fast. The paper contain dynamic approach for process migration using thread level paradigm. Creating a thread of process into number of task, that leads to reduce total execution time of process. An algorithm is used to calculate PCB for decision purpose to achieve load balancing. Fair share approach is considered to allocating task to every processor using preemption strategy. The MPI[4] [10]is used for process communication. This system has defined to reduce total execution time on onboard & between board times. Open knoppix & MOSIX platform(Middleware) are used to show the results. Prime number calculation code is used to show parallel architecture like SIMD computer. Cluster computing is way of resource managing & scheduling strategy.

Reference

  • M. Willekk-Lemair and A.P. Reeves, Strategies for dynamic load-balancing on highly parallel computers, IEEE Transaction on Parallel and Distribured Systems, (4)9, September 1993, Pages 979-993.
  • M. Wu and W. Sbu, A load balancing algorithm for n-cube, Proceedings of rhe 1996 Inremarwnal Conference on Parallel Processing, IEEE Computer Society, 1996, Pages 148-155.
  • H. Shan, J.P. Singh, L. Oliker and R. Biswas, “Messge passing and shared address space parallelism on an SMP cluster,” Parallel Computing, vol 29, 2003, pp. 167-186.
  • W. Pan, L. Chan, J. Zhang, Y. Li, L. Wan and F. Xia, “Research on MPI+OpenMP hybrid programming paradigm based on SMP cluster,” Application Research of Computers, vol. 26, 2009, pp. 4492–4594
  • M.Cosnard, E. Jeannot, and L. Rougeot, Low MemoryCostDynamicSchedulingofLargeCoarseGrainTaskGraphs,Proc.Int'lParallelProcessingSymp./Symp.ParallelandDistributedProces-sing(IPPS/SPDP), Mar.1998
  • Rewini,H.H.Ali,andT.G.Lewis,TaskSchedulingin MultiprocessingSystems, Computer, pp.27-37,Dec.1995.
  • Oren LA’ADAN Amnon BARAK andAmnonSHILOH.ScalableclustercomputingwithMOSIXforLINUX.InProc.LinuxExpo’99,pages95–100,May1999.
  • N. Islam and A. Prodromidis and M. S. Squillante, "Dynamic Partitioning in Different Distributed-Memory Environments", Proceedings of the 2nd Workshop on Job Scheduling Strategies for Parallel Processing, pages 155-170, April 1996.
  • Huajie Zhang School of Math, Physics and Information Engineering College of Zhejiang Normal University, Jinhua 321004, China” On Load Balancing Model for Cluster Computers”, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.10, October 2008.
  • Amith R. Mamidala Rahul Kumar Debraj De D. K. Panda Department of Computer Science and Engineering” MPI Collectives on Modern Multicore Clusters: Performance Optimizationsand Communication Characteristics”, Eighth IEEE International Symposium on Cluster Computing and the Grid.