IT Society of India (ITSI)
In multiprocessor system are widely used in parallel computing. In many cases, the authors can divide a huge problem into small portion and assign these small problems to processors. Task scheduling is crucial and complex problem in multiprocessor system and is defined as a NP-hard problem. Now-a-days, with increasing size of program and information to this algorithm is use task graph is various restriction of these problem is Independent task, dependent task and with and without communication time.