Research ArticleOpen accessIn the author namesFeasibility Analysis of Non-Preemptive Periodic Systems from Infeasibility PerspectiveNasro Min-AllahDue to simple implementation, non-preemptive scheduling has the advantage over preemptive counterpart when it comes to deployment of real-time systems. Accordingly, many feasibility techniques have been established to answer schedulability of the task set for non-preemptive case. The time complexity of exact condition for non-preemptive under dynamic priority assignment is of pseud-polynomial nature. Recently, efforts are made to decrease the … …Journal of Computer Science, Vol. 15, Issue 9 · 9 Sep 2019 · 7,617 accessesView PDFCite
Research ArticleOpen accessIn the author namesIntegrating Lowest Priority Approach with Largest Point Scheme for Faster Feasibility AnalysisNasro Min-AllahRecently many solutions have been proposed to lower the computational cost of feasibility analysis for real-time systems. The computational cost of feasibility tests can be lowered by strategies such as lowering the number of scheduling points needed during analysis, starting feasibility analysis from lowest priority, or starting schedulability tests for a task with larger scheduling point. All these techniques significantly … …Journal of Computer Science, Vol. 15, Issue 4 · 26 Apr 2019 · 7,247 accessesView PDFCite