期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：8
页码：357-360
出版社：Shri Pannalal Research Institute of Technolgy
摘要：In this survey paper we can make use of theheterogeneous system by mapping the tasks and schedulethem on different processors so that their finish time can bereduced. Total finish time is time which includes individualruntime of programs and their communication cost amongprograms. The optimal scheduling of parallel programs isconsidered as NP-complete problem. A major issue in theoperation of parallel computing systems is that of scheduling,which is an important problem in other areas such asmanufacturing, process control, economics and operationresearch .Heterogeneity in parallel systems introduces anadditional degree of complexity to the scheduling problem.The complexity of the problem increase when task schedulingis to be done in a heterogeneous environment, where theprocessors in the network may not be identical and takedifferent amounts of time to execute the same task. Quite afew methods have been used to solve this problem. In thispaper we are studying about different scheduling techniqueswhich help to reduce time complexity as well as the over allcost of the process and their fruitfulness.
关键词：Genetic Algorithms; Program Scheduling;Heterogeneous Multiprocessor System; Total Finish Time
