Batching resource requests in a portable computing device

• US 8,806,502 B2
• Filed: 09/13/2011
• Issued: 08/12/2014
• Est. Priority Date: 09/15/2010
• Status: Expired due to Fees

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Gargash, Norman S., Vijayarajan, Vinod
• Primary Examiner(s): Bullock, Jr., Lewis A
• Assistant Examiner(s): Lu, Kevin X
• Application Number:
  US13/231,620
• Publication Number:
  US 20120239812A1
• Time in Patent Office: 1,064 Days
• Field of Search: 718/101, 718/104, 709/229, 710/200
• US Class Current: 718/104
• CPC Class Codes: G06F 11/3013 where the computing system is an embedded system, i.e. a combination of hardware and software dedicated to perform a certain function in mobile devices, printers, automotive or aircraft systems testing or monitoring of control systems or parts thereof G05B23/02
• CPC Class Codes: G06F 11/3051 Monitoring arrangements for monitoring the configuration of the computing system or of the computing system component, e.g. monitoring the presence of processing resources, peripherals, I/O links, software programs verification or detection of system hardware configuration G06F11/2247
• CPC Class Codes: G06F 11/3476 Data logging G06F11/14, G06F11/2205 take precedence
• CPC Class Codes: G06F 16/2308 Concurrency control transaction processing G06F9/466
• CPC Class Codes: G06F 21/604 Tools and structures for managing or administering access control systems
• CPC Class Codes: G06F 9/466 Transaction processing
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: G06F 9/526 Mutual exclusion algorithms
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

In a portable computing device having a node-based resource architecture, resource requests are batched or otherwise transactionized to help minimize inter-processing entity messaging or other messaging or provide other benefits. In a resource graph defining the architecture, each node or resource of the graph represents an encapsulation of functionality of one or more resources controlled by a processor or other processing entity, each edge represents a client request, and adjacent nodes of the graph represent resource dependencies. A single transaction of resource requests may be provided against two or more of the resources.

Claims

1. A method for batching resource requests in a portable computing device having a plurality of resources, the method comprising:

instantiating in a memory device a plurality of nodes, wherein;

each node is associated with, and provides indirect access to one or more of the plurality of resources; and

each node is comprised within a directed acyclic graph that defines an order of dependencies among the plurality of resources, wherein each node of the directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by a processor, each edge of the directed acyclic graph represents a client request, and adjacent nodes of the directed acyclic graph represent resource dependencies;

receiving one or more client requests directed to a first processing entity, wherein a client request comprises a plurality of resource requests and two or more of the plurality of resource requests indicate resources controlled by a second processing entity and inaccessible to the first processing entity;

generating a transaction of resource requests corresponding to the plurality of resource requests that comprises requests to the two or more resources controlled by the second processing entity;

directing each resource request in the transaction to one of the plurality of nodes which is associated with, and provides indirect access to, the resource indicated by the resource request;

locking the two or more resources controlled by the second processing entity, wherein locking precludes access to a resource for resource requests not included in the transaction;

adding information associated with the resource requests in the transaction to a queue, wherein the resources indicated by the information in the queue are controlled by the second processing entity;

transmitting the queue to the second processing entity; and

unlocking the two or more resources controlled by the second processing entity after transmitting the queue.

2. The method claim 1, wherein the transaction of resource requests comprises:

an indication of a sequence of events including a beginning of a transaction, an end of a transaction, and a plurality of resource requests between the beginning of the transaction and the end of the transaction.

3. The method of claim 2, wherein the two or more resources controlled by the second processing entity are locked in response to an indication of the beginning of the transaction.

4. The method of claim 3, further comprising:

locking one or more local resources controlled by the first processing entity and indicated by the plurality of remote resources in response to an indication of the beginning of the transaction.

5. The method of claim 3, wherein locking each resource indicated by the plurality of resource requests further comprises:

sorting representations of the plurality of resources indicated by the plurality of resource requests in accordance with the directed acyclic graph; and

locking all resources indicated by the plurality of resource requests in an order corresponding to results of sorting the representations.

6. A computer system for batching resource requests in a portable computing device having a plurality of resources, the computer system comprising:

a framework manager operable for;

instantiating in a memory device a plurality of nodes, wherein;

each node is associated with and provides indirect access to one or more of the plurality of resources; and

each node is comprised within a directed acyclic graph defines an order of dependencies among a plurality of resources, wherein;

each node of a directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by a processor, each edge of the directed acyclic graph represents a client request, and adjacent nodes in the directed acyclic graph represent resource dependencies;

receiving one or more client requests directed to a first processing entity, wherein a client request comprises a plurality of resource requests and two or more of the plurality of resource requests indicate resources controlled by a second processing entity and inaccessible to the first processing entity;

generating a transaction of resource requests corresponding to the plurality of resource requests that comprises requests to the two or more resources controlled by the second processing entity;

directing each resource request in the transaction to one of the plurality of nodes which is associated with, and provides indirect access to, the resource indicated by the resource request;

locking the two or more resources controlled by the second processing entity, wherein locking precludes access to a resource for resource requests not included in the transaction;

adding information associated with the resource requests in the transaction to a queue, wherein the resources indicated by the information in the queue are controlled by the second processing entity;

transmitting the queue to the second processing entity; and

unlocking the two or more resources controlled by the second processing entity after transmitting the queue.

7. The computer system claim 6, wherein the transaction of resource requests comprises:

an indication of a sequence of events including a beginning of a transaction, an end of a transaction, and a plurality of resource requests between the beginning of the transaction and the end of the transaction.

8. The computer system of claim 7, wherein the two or more resources controlled by the second processing entity are locked in response to an indication of the beginning of the transaction.

9. The computer system of claim 8, further comprising:

locking one or more local resources controlled by the first processing entity and indicated by the plurality of resource requests in response to an indication of the beginning of the transaction.

10. The computer system of claim 9, wherein locking each resource indicated by the plurality of resource requests further comprises:

sorting representations of the plurality of resources indicated by the plurality of resource requests in accordance with the directed acyclic graph; and

locking all resources indicated by the plurality of resource requests in an order corresponding to results of sorting the representations.

11. A computer system for batching resource requests in a portable computing device having a plurality of resources, the computer system comprising:

means for instantiating in a memory device a plurality of nodes, wherein;

each node is associated with, and provides indirect access to one or more of the plurality of resources; and

each node is comprised within a directed acyclic graph that defines an order of dependencies among the plurality of resources, wherein;

each node of the directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by a processor;

each edge of the directed acyclic graph represents a client request, and adjacent nodes in the directed acyclic graph represent resource dependencies;

means for receiving one or more client requests directed to a first processing entity, wherein a client request comprises a plurality of resource requests and two or more of the plurality of resource requests indicate resources controlled by a second processing entity and inaccessible to the first processing entity;

means for generating a transaction of resource requests corresponding to the plurality of resource requests that comprises requests to the two or more resources controlled by the second processing entity;

means for directing each resource request in the transaction to one of the plurality of nodes which is associated with, and provides indirect access to, the resource indicated by the resource request;

means for locking the two or more resources controlled by the second processing entity, wherein locking precludes access to a resource for resource requests not included in the transaction;

means for adding information associated with the resource requests in the transaction to a queue, wherein the resources indicated by the information in the queue are controlled by the second processing entity;

means for transmitting the queue to the second processing entity; and

means for unlocking the two or more resources controlled by the second processing entity after transmitting the queue.

12. The computer system claim 11, wherein transaction of resource requests comprises:

an indication of a sequence of events including a beginning of a transaction, an end of a transaction, and a plurality of resource requests between the beginning of the transaction and the end of the transaction.

13. The computer system of claim 12, wherein the two or more resources controlled by the second processing entity are locked in response to an indication of the beginning of the transaction.

14. The computer system of claim 13, further comprising:

means for locking one or more local resources controlled by the first processing entity in response to an indication of the beginning of the transaction.

15. The computer system of claim 13, wherein the means for locking each resource indicated by the plurality of resource requests further comprises:

means for sorting representations of the plurality of resources indicated by the plurality of resource requests in accordance with the directed acyclic graph; and

means for locking all resources indicated by the plurality of resource requests in an order corresponding to results of sorting the representations.

16. A computer program product comprising a non-transitory computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for batching resource requests in a portable computing device having a plurality of resources, said method comprising:

instantiating in a memory device a plurality of nodes, wherein;

each node is associated with, and provides indirect access to one or more of the plurality of resources; and

each node is comprised within a directed acyclic graph that defines an order of dependencies among the plurality of resources, wherein each node of the directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by a processor, each edge of the directed acyclic graph represents a client request, and adjacent nodes of the directed acyclic graph represent resource dependencies;

receiving one or more client requests directed to a first processing entity, wherein a client request comprises a plurality of resource requests and two or more of the plurality of resource requests indicate resources controlled by a second processing entity and inaccessible to the first processing entity;

generating a transaction of resource requests corresponding to the plurality of resource requests that comprises requests to the two or more resources controlled by the second processing entity;

directing each resource request in the transaction to one of the plurality of nodes which is associated with, and provides indirect access to, the resource indicated by the resource request;

locking the two or more resources controlled by the second processing entity, wherein locking precludes access to a resource for resource requests not included in the transaction;

adding information associated with the resource requests in the transaction to a queue, wherein the resources indicated by the information in the queue are controlled by the second processing entity;

transmitting the queue to the second processing entity; and

unlocking the two or more resources controlled by the second processing entity after transmitting the queue.

17. The computer program product of claim 16, wherein the transaction of resource requests comprises:

an indication of a sequence of events including a beginning of a transaction, an end of a transaction, and a plurality of resource requests between the beginning of the transaction and the end of the transaction.

18. The computer program product of claim 17, wherein the two or more resources controlled by the second processing entity are locked in response to an indication of the beginning of the transaction.

19. The computer program product of claim 18, wherein:

locking one or more local resources controlled by the first processing entity and indicated by the plurality of resource requests in response to an indication of the beginning of the transaction.

20. The computer program product of claim 18, wherein locking each resource indicated by the plurality of resource requests further comprises:

sorting representations of the plurality of resources indicated by the plurality of resource requests in accordance with the directed acyclic graph; and

locking all resources indicated by the plurality of resource requests in an order corresponding to results of sorting the representations.