Author Details

In this project we have proposed an algorithm named Earliest Deadline First-Virtual Deadline. Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, which cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to merely two sets of certification requirements. Then we quantify, via the metric of processor with improved speedup factor. This method produces a better speed up factor value compare to the existing one. It introduces the procedure for implementing logarithmic computational time. The proposed system derives utilization bound and simulates the behaviour of utilization bound. And also own criticality based priority is used for the scheduling of the job which contain same critical level.

Full Text

Username
Password
Remember me