Method of analyzing non-preemptive dram transactions in real-time unified memory architectures
AssigneeBroadcom Corporation
InventorDarren Neuman
Life of this patent
Estimating the term…
Abstract
Systems and methods are disclosed for non-preemptive DRAM transactions. More specifically, the present invention relates to improvements in non-preemptive DRAM transactions in real-time unified memory architectures. One embodiment of the present invention relates to a method for determining access to non-preemptive DRAM devices. This method comprises determining real time need for access to the device and prioritizing access using a rate monotonic scheduling.
Claims18
1-25. (canceled)
A 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 a shortest service deadline of a preselected one of the clients;
- (b) determining a longest processing time of any of the plurality of clients having a lower priority than the preselected device client according to rate monotonic scheduling;
- (c) adding 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.
34-50. (canceled)
A machine-readable storage, having stored thereon a computer program having a plurality of code sections for implementing a 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 code sections executable by a machine for causing the machine to perform operations comprising:
- (a) determining a shortest service deadline of a preselected one of the clients;
- (b) determining 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 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.
Dependencies are inferred from the claim text.