Scheduling for Real-Time Multiprocessor System : 9783659573668 : 11 Jul 2014 : A scheduling algorithm schedules a set of tasks in such way that the tasks are completed before their deadlines reached. There are varieties of algorithms for scheduling of periodic tasks on multiprocessor under partitioning scheme or global scheduling scheme. The most common scheduling algorithms are: Rate Monotonic (RM), Deadline Monotonic (DM), Earliest Deadline First (EDF) and Least Laxity First (LLF). In this book, we have proposed a new algorithm titled as D_EDF which is modified conventional EDF algorithm. The proposed algorithm along with EDF, LLF, RM, DM algorithms are simulated and tested for independent, preemptive, periodic tasks on tightly coupled real-time multiprocessor system under global scheduling. From experiments and result analysis it concludes that the proposed algorithm is very efficient in both underloaded and overloaded conditions. The algorithm proposed in this book; perform qu