Patent ID: 8145739

Claim:
A computer-implemented method of analyzing the schedulability of a non-preemptive system that employs rate monotonic scheduling to determine access priority of a plurality of clients to a common resource, each client having an associated processing time, the method comprising: (a) determining, with a data processing element, a shortest service deadline of a preselected one of the clients; (b) determining, with the data processing element, a longest processing time of any of the plurality of clients having a lower priority than the preselected client according to rate monotonic scheduling; (c) adding, with the data processing element, the processing times of all of the clients having a higher priority than the preselected client to obtain a combined processing time of the higher priority clients; and (d) declaring the system unschedulable if the sum of the longest processing time of the clients having a lower priority than the preselected client and the combined processing time of the higher priority clients is greater than the shortest deadline of the preselected client.