期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2012
卷号：3
期号：2
页码：3436-3443
出版社：TechScience Publications
摘要：In typical real time systems, tasks need to communicate so as to achieve effective resource utilization. Tasks should be scheduled considering their precedence constraints. Modified rate monotonic scheduling, earliest deadline scheduling algorithm and latest deadline first scheduling algorithm do well in precedence constraint tasks scheduling; however these algorithms do not take care about overall contribution of individual tasks in tasks network. This paper suggests novel idea which is considering both contribution of individual tasks and deadline. This algorithm is modification of performance contribution and deadline (PCD) algorithm. It is proved through analysis that, number of missing deadlines and context switching is less as compared to PCD. Important feature of this algorithm is that it supports both cyclic and acyclic process structure for scheduling.
关键词：Performance Contribution and Deadline (PCD);Rate Monotonic (RM) and Earliest Deadline First (EDF)
