Patents by Inventor Nasro Min Allah

Nasro Min Allah has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method for determining earliest deadline first schedulability of non-preemptive uni-processor system
    Patent number: 10296382
    Abstract: Earliest deadline first (EDF) scheduling algorithm is the most celebrated result for dynamic priority scheduling in real-time systems for both preemptive and non-preemptive cases. From complexity point of view, EDF is polynomial for preemptive scheduling of tasks. However, it becomes pseudo-polynomial under non-preemptive case. Described herein is a technique that determines EDF feasibility of non-preemptive task set by analyzing schedulability of the lowest priority task at common scheduling points generated by all higher priority tasks in the task set. The adjustment results in improving the computational cost of an existing test from O(n2 pn/p1) to O(pn/p1), where n is the number of tasks in the system, while pn and p1 represent the task periods of largest and smallest periodic tasks respectively. With reduced computation cost, the described method of analyzing feasibility can be intergraded with online systems for testing feasibility of a special class of real-time systems under non-preemptive case.
    Type: Grant
    Filed: May 17, 2017
    Date of Patent: May 21, 2019
    Assignee: Imam Abdulrahman Bin Faisal University
    Inventors: Saleh Alrashed, Jamal Alhiyafi, Aamir Shafi, Nasro Min Allah
  • METHOD FOR DETERMINING EARLIEST DEADLINE FIRST SCHEDULABILITY OF NON-PREEMPTIVE UNI-PROCESSOR SYSTEM
    Publication number: 20180336064
    Abstract: Earliest deadline first (EDF) scheduling algorithm is the most celebrated result for dynamic priority scheduling in real-time systems for both preemptive and non-preemptive cases. From complexity point of view, EDF is polynomial for preemptive scheduling of tasks. However, it becomes pseudo-polynomial under non-preemptive case. Described herein is a technique that determines EDF feasibility of non-preemptive task set by analyzing schedulability of the lowest priority task at common scheduling points generated by all higher priority tasks in the task set. The adjustment results in improving the computational cost of an existing test from O(n2 pn/p1) to O(pn/p1), where n is the number of tasks in the system, while pn and p1 represent the task periods of largest and smallest periodic tasks respectively. With reduced computation cost, the described method of analyzing feasibility can be intergraded with online systems for testing feasibility of a special class of real-time systems under non-preemptive case.
    Type: Application
    Filed: May 17, 2017
    Publication date: November 22, 2018
    Applicant: Imam Abdulrahman Bin Faisal University
    Inventors: Saleh Alrashed, Jamal Alhiyafi, Aamir Shafi, Nasro Min Allah