Batching and Forking Resource Requests In A Portable Computing Device

• US 20130031560A1
• Filed: 01/27/2012
• Published: 01/31/2013
• Est. Priority Date: 09/15/2010
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Gargash, Norman S., Vijayarajan, Vinod
• Granted Patent: US 9,152,523 B2
• Time in Patent Office: Days
• 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 9/466 Transaction processing
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system

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. Additionally, this single transaction may become forked so that parallel processing among a client issuing the single transaction and the resources handling the requests of the single transaction may occur.

Claims

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

issuing a transaction of resource requests with a client, the resource request requiring two or more resources of the plurality of resources; and

forking the transaction so that the client does not wait for completion of the transaction and so that the client may either issue additional transactions or requests to other resources.

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

providing 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, each resource request indicating one or more of the plurality of resources defined by a directed acyclic graph;

locking the resources indicated by the plurality of resource requests;

adding information associated with each of the plurality of resource requests to a queue;

transmitting the queue to a recipient in response to the indication of the end of the transaction; and

unlocking the plurality of resources after transmitting the queue.

3. The method of claim 2, wherein transmitting the queue to a recipient comprises transmitting the queue from a first processing entity to a second processing entity.

4. The method of claim 2, wherein locking each resource indicated by the plurality of resource requests comprises locking all resources indicated by the plurality of resource requests in response to an indication of the beginning of the transaction.

5. The method of claim 4, wherein:

transmitting the queue comprises transmitting the queue from a first processing entity to a second processing entity; and

locking each resource indicated by the plurality of resource requests comprises locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

6. The method of claim 4, 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.

7. The method of claim 2, wherein locking each resource indicated by the plurality of resource requests comprises locking a resource indicated by a resource request in response to an indication of the resource request.

8. The method of claim 7, wherein:

transmitting the queue comprises transmitting the queue from a first processing entity to a second processing entity; and

locking each resource indicated by the plurality of resource requests comprises locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

9. The method of claim 1, further comprising:

during forking of the transaction, placing each resource into an incoherent state for servicing one or more requests of the transaction, the incoherent state delaying cleanup work associated with a request.

10. The method of claim 9, further comprising:

in response to receiving an outside request relative to the transaction, changing the incoherent state for one or more of the resources associated with the outside request so that one or more resources may service the outside request.

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

a processor operable for;

issuing a transaction of resource requests with a client, the resource request requiring two or more resources of the plurality of resources; and

forking the transaction so that the client does not wait for completion of the transaction and so that the client may either issue additional transactions or requests to other resources.

12. The system of claim 11, wherein the processor is further operable for:

providing 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, each resource request indicating one or more of the plurality of resources defined by a directed acyclic graph;

locking the resources indicated by the plurality of resource requests;

adding information associated with each of the plurality of resource requests to a queue;

transmitting the queue to a recipient in response to the indication of the end of the transaction; and

unlocking the plurality of resources after transmitting the queue.

13. The system of claim 12, wherein transmitting the queue to a recipient comprises transmitting the queue from a first processing entity to a second processing entity.

14. The system of claim 12, wherein locking each resource indicated by the plurality of resource requests comprises the processor operable for locking all resources indicated by the plurality of resource requests in response to an indication of the beginning of the transaction.

15. The system of claim 14, wherein the processor is further operable for:

transmitting the queue comprises transmitting the queue from a first processing entity to a second processing entity; and

locking each resource indicated by the plurality of resource requests comprises locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

16. The system of claim 14, wherein locking each resource indicated by the plurality of resource requests further comprises the processor operable for:

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.

17. The system of claim 12, wherein locking each resource indicated by the plurality of resource requests comprises the processor operable for locking a resource indicated by a resource request in response to an indication of the resource request.

18. The system of claim 11, wherein the processor is further operable for transmitting the queue comprises transmitting the queue from a first processing entity to a second processing entity;

and

locking each resource indicated by the plurality of resource requests comprises the processor operable for locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

19. The system of claim 11, wherein during forking of the transaction, the processor is operable for placing each resource into an incoherent state for servicing one or more requests of the transaction, the incoherent state delaying cleanup work associated with a request.

20. The system of claim 19, wherein in response to receiving an outside request relative to the transaction, the processor is operable for changing the incoherent state for one or more of the resources associated with the outside request so that one or more resources may service the outside request.

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

means for issuing a transaction of resource requests with a client, the resource request requiring two or more resources of the plurality of resources; and

means for forking the transaction so that the client does not wait for completion of the transaction and so that the client may either issue additional transactions or requests to other resources.

22. The system of claim 21, wherein the means for issuing the transaction of resource requests comprises:

means for providing 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, each resource request indicating one or more of the plurality of resources defined by a directed acyclic graph;

means for locking the resources indicated by the plurality of resource requests;

means for adding information associated with each of the plurality of resource requests to a queue;

means for transmitting the queue to a recipient in response to the indication of the end of the transaction; and

means for unlocking the plurality of resources after transmitting the queue.

23. The system of claim 22, wherein the means for transmitting the queue to a recipient comprises means for transmitting the queue from a first processing entity to a second processing entity.

24. The system of claim 21, wherein the means for locking each resource indicated by the plurality of resource requests comprises means for locking all resources indicated by the plurality of resource requests in response to an indication of the beginning of the transaction.

25. The system of claim 24, wherein the means for transmitting the queue comprises means for transmitting the queue from a first processing entity to a second processing entity;

and

the means for locking each resource indicated by the plurality of resource requests comprises means for locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

26. The method of claim 24, 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.

27. The system of claim 22, wherein the means for locking each resource indicated by the plurality of resource requests comprises means for locking a resource indicated by a resource request in response to an indication of the resource request.

28. The system of claim 27, wherein:

the means for transmitting the queue comprises means for transmitting the queue from a first processing entity to a second processing entity; and

the means for locking each resource indicated by the plurality of resource requests comprises means for locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

29. The system of claim 21, further comprises means for placing each resource into an incoherent state for servicing one or more requests of the transaction, the incoherent state delaying cleanup work associated with a request during the transaction.

30. The system of claim 21, further comprising means for changing the incoherent state for one or more of the resources associated with the outside request so that one or more resources may service the outside request in response to receiving an outside request relative to the transaction.

31. A computer program product comprising a 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 managing resource requests in a portable computing device having a plurality of resources, the method comprising:

issuing a transaction of resource requests with a client, the resource request requiring two or more resources of the plurality of resources; and

forking the transaction so that the client does not wait for completion of the transaction and so that the client may either issue additional transactions or requests to other resources.

32. The computer program product of claim 31, wherein the program code implementing the method further comprises:

providing 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, each resource request indicating one or more of the plurality of resources defined by a directed acyclic graph;

locking the resources indicated by the plurality of resource requests;

adding information associated with each of the plurality of resource requests to a queue;

transmitting the queue to a recipient in response to the indication of the end of the transaction; and

unlocking the plurality of resources after transmitting the queue.

33. The computer program product of claim 32, wherein transmitting the queue to a recipient comprises transmitting the queue from a first processing entity to a second processing entity.

34. The computer program product of claim 32, wherein locking each resource indicated by the plurality of resource requests comprises locking all resources indicated by the plurality of resource requests in response to an indication of the beginning of the transaction.

35. The computer program product of claim 34, wherein transmitting the queue comprises transmitting the queue from a first processing entity to a second processing entity;

and locking each resource indicated by the plurality of resource requests comprises locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

36. The computer program product of claim 34, 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.

37. The computer program product of claim 32, wherein locking each resource indicated by the plurality of resource requests comprises locking a resource indicated by a resource request in response to an indication of the resource request.

38. The computer program product of claim 31, wherein transmitting the queue comprises transmitting the queue from a first processing entity to a second processing entity;

and locking each resource indicated by the plurality of resource requests comprises locking a plurality of local resources controlled by the first processing entity corresponding to a plurality of remote resources controlled by the second processing entity.

39. The computer program product of claim 31, wherein the program code implementing the method further comprises:

during forking of the transaction, placing each resource into an incoherent state for servicing one or more requests of the transaction, the incoherent state delaying cleanup work associated with a request.

40. The computer program product of claim 31, wherein the program code implementing the method further comprises:

in response to receiving an outside request relative to the transaction, changing the incoherent state for one or more of the resources associated with the outside request so that one or more resources may service the outside request.