Distributed resource management in a portable computing device

• US 8,631,414 B2
• Filed: 09/02/2011
• Issued: 01/14/2014
• Est. Priority Date: 09/15/2010
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Gargash, Norman S., Zhou, Yizheng, Vijayarajan, Vinod
• Primary Examiner(s): NGUYEN, VAN H
• Application Number:
  US13/225,152
• Publication Number:
  US 20120227053A1
• Time in Patent Office: 865 Days
• Field of Search: None
• 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/548 Object oriented; Remote method invocation [RMI] non-remote method invocation G06F9/449

Abstract

In a portable computing device having a node-based resource architecture, a first or distributed node controlled by a first processor but corresponding to a second or native node controlled by a second processor is used to indirectly access a resource of the second node. In a resource graph defining the architecture each node represents an encapsulation of functionality of one or more resources, each edge represents a client request, and adjacent nodes represent resource dependencies. Resources defined by a first graph are controlled by the first processor but not the second processor, while resources defined by a second graph are controlled by the second processor but not the first processor. A client request on the first node may be received from a client under control of the first processor. Then, a client request may be issued on the second node in response to the client request on the first node.

Claims

1. A method for distributed resource management in a portable computing device having a first plurality of resources controlled by a first processor and a second plurality of resources controlled by a second processor, the method comprising:

instantiating a first node controlled by the first processor, the first node corresponding to a second node controlled by the second processor, the first plurality of resources defined by a first directed acyclic graph, the second plurality of resources defined by a second directed acyclic graph not sharing any resources with the first directed acyclic graph, wherein each node of the first directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the first processor, each edge of the first directed acyclic graph represents a client request, and adjacent nodes of the first directed acyclic graph represent resource dependencies, and wherein each node of the second directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the second processor, each edge of the second directed acyclic graph represents a client request, and adjacent nodes of the second directed acyclic graph represent resource dependencies;

receiving a client request on the first node from a client under control of the first processor; and

issuing a client request on the second node in response to the client request on the first node.

2. The method of claim 1, wherein the first node depends on a protocol resource, the first node is instantiated to include a driver that invokes a transport protocol defined by the protocol resource, and the driver conforms the client request on the second node to the transport protocol.

3. The method of claim 2, wherein the first node is not instantiated until the protocol resource is instantiated and the second node is instantiated.

4. The method of claim 1, further comprising:

receiving a plurality of client requests on the first node; and

the first node aggregating the received plurality of client requests to provide an aggregation result;

wherein issuing a client request on the second node comprises issuing a client request for the aggregation result.

5. The method of claim 1, further comprising:

receiving a plurality of client requests on the first node, wherein issuing a client request on the second node comprises issuing a plurality of client request on the second node corresponding to the plurality of client requests issued on the first node; and

the second node aggregating the plurality of client requests issued on the second node to provide an aggregation result.

6. The method of claim 1, further comprising:

receiving a first state query on the first node from a client under control of the first processor;

issuing a second state query on the second node to obtain an indication of a state of the second node; and

the first node providing the indication of the state of the second node in response to the first state query.

7. The method of claim 1, further comprising:

receiving a first state query on the first node from a client under control of the first processor;

the first node providing an indication of a state of the first node in response to the first state query;

detecting a change in state of the second node; and

providing an indication of the state of the second node to the first node in response to detection of a change in state of the second node.

8. A computer system for distributed resource management in a portable computing device having a first plurality of resources controlled by a first processor and a second plurality of resources controlled by a second processor, the computer system comprising:

a processor which;

instantiates a first node controlled by the first processor, the first node corresponding to a second node controlled by the second processor, the first plurality of resources defined by a first directed acyclic graph, the second plurality of resources defined by a second directed acyclic graph not sharing any resources with the first directed acyclic graph, wherein each node of the first directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the first processor, each edge of the first directed acyclic graph represents a client request, and adjacent nodes of the first directed acyclic graph represent resource dependencies, and wherein each node of the second directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the second processor, each edge of the second directed acyclic graph represents a client request, and adjacent nodes of the second directed acyclic graph represent resource dependencies;

receives a client request on the first node from a client under control of the first processor; and

issues a client request on the second node in response to the client request on the first node.

9. The computer system of claim 8, wherein the first node depends on a protocol resource, the first node is instantiated to include a driver that invokes a transport protocol defined by the protocol resource, and the driver conforms the client request on the second node to the transport protocol.

10. The computer system of claim 9, wherein the first node is not instantiated until the protocol resource is instantiated and the second node is instantiated.

11. The computer system of claim 8, wherein the processor receives a plurality of client requests on the first node;

and the first node aggregating the received plurality of client requests to provide an aggregation result;

wherein issuing a client request on the second node comprises issuing a client request for the aggregation result.

12. The computer system of claim 8, wherein the processor receives a plurality of client requests on the first node, wherein issuing a client request on the second node comprises issuing a plurality of client request on the second node corresponding to the plurality of client requests issued on the first node;

and the second node aggregating the plurality of client requests issued on the second node to provide an aggregation result.

13. The computer system of claim 8, wherein the processor receives a first state query on the first node from a client under control of the first processor;

and issues a second state query on the second node to obtain an indication of a state of the second node; and

the first node providing the indication of the state of the second node in response to the first state query.

14. The computer system of claim 8, wherein the processor receives a first state query on the first node from a client under control of the first processor;

the first node providing an indication of a state of the first node in response to the first state query; and

detects a change in state of the second node; and

provides an indication of the state of the second node to the first node in response to detection of a change in state of the second node.

15. A computer system for distributed resource management in a portable computing device having a first plurality of resources controlled by a first processor and a second plurality of resources controlled by a second processor, the computer system comprising:

means for instantiating a first node controlled by the first processor, the first node corresponding to a second node controlled by the second processor, the first plurality of resources defined by a first directed acyclic graph, the second plurality of resources defined by a second directed acyclic graph not sharing any resources with the first directed acyclic graph, wherein each node of the first directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the first processor, each edge of the first directed acyclic graph represents a client request, and adjacent nodes of the first directed acyclic graph represent resource dependencies, and wherein each node of the second directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the second processor, each edge of the second directed acyclic graph represents a client request, and adjacent nodes of the second directed acyclic graph represent resource dependencies;

means for receiving a client request on the first node from a client under control of the first processor; and

means for issuing a client request on the second node in response to the client request on the first node.

16. The computer system of claim 15, wherein the first node depends on a protocol resource, the first node is instantiated to include a driver that invokes a transport protocol defined by the protocol resource, and the driver conforms the client request on the second node to the transport protocol.

17. The computer system of claim 16, wherein the first node is not instantiated until the protocol resource is instantiated and the second node is instantiated.

18. The computer system of claim 15, further comprising:

means for receiving a plurality of client requests on the first node; and

means for the first node aggregating the received plurality of client requests to provide an aggregation result;

wherein issuing a client request on the second node comprises issuing a client request for the aggregation result.

19. The method of claim 15, further comprising:

means for receiving a plurality of client requests on the first node, wherein issuing a client request on the second node comprises issuing a plurality of client request on the second node corresponding to the plurality of client requests issued on the first node; and

means for the second node aggregating the plurality of client requests issued on the second node to provide an aggregation result.

20. The computer system of claim 15, further comprising:

means for receiving a first state query on the first node from a client under control of the first processor;

means for issuing a second state query on the second node to obtain an indication of a state of the second node; and

means for the first node providing the indication of the state of the second node in response to the first state query.

21. The computer system of claim 15, further comprising:

means for receiving a first state query on the first node from a client under control of the first processor;

means for the first node providing an indication of a state of the first node in response to the first state query;

means for detecting a change in state of the second node; and

providing an indication of the state of the second node to the first node in response to detection of a change in state of the second node.

22. A computer program product comprising a non-transitory computer usable medium having a computer readable program code embodied therein, said computer readable program code being executed to implement a method for managing resources of a portable computing device, said method comprising:

instantiating a first node controlled by the first processor, the first node corresponding to a second node controlled by the second processor, the first plurality of resources defined by a first directed acyclic graph, the second plurality of resources defined by a second directed acyclic graph not sharing any resources with the first directed acyclic graph, wherein each node of the first directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the first processor, each edge of the first directed acyclic graph represents a client request, and adjacent nodes of the first directed acyclic graph represent resource dependencies, and wherein each node of the second directed acyclic graph represents an encapsulation of functionality of one or more resources controlled by the second processor, each edge of the second directed acyclic graph represents a client request, and adjacent nodes of the second directed acyclic graph represent resource dependencies;

receiving a client request on the first node from a client under control of the first processor; and

issuing a client request on the second node in response to the client request on the first node.

23. The computer program product of claim 22, wherein the first node depends on a protocol resource, the first node is instantiated to include a driver that invokes a transport protocol defined by the protocol resource, and the driver conforms the client request on the second node to the transport protocol.

24. The computer program product of claim 23, wherein the first node is not instantiated until the protocol resource is instantiated and the second node is instantiated.

25. The computer program product of claim 22, wherein the method further comprises:

receiving a plurality of client requests on the first node; and

the first node aggregating the received plurality of client requests to provide an aggregation result;

wherein issuing a client request on the second node comprises issuing a client request for the aggregation result.

26. The computer program product of claim 22, wherein the method further comprises:

receiving a plurality of client requests on the first node, wherein issuing a client request on the second node comprises issuing a plurality of client request on the second node corresponding to the plurality of client requests issued on the first node; and

the second node aggregating the plurality of client requests issued on the second node to provide an aggregation result.

27. The computer program product of claim 22, wherein the method further comprises:

receiving a first state query on the first node from a client under control of the first processor;

issuing a second state query on the second node to obtain an indication of a state of the second node; and

the first node providing the indication of the state of the second node in response to the first state query.

28. The computer program product of claim 22, wherein the method further comprises:

receiving a first state query on the first node from a client under control of the first processor;

the first node providing an indication of a state of the first node in response to the first state query;

detecting a change in state of the second node; and

providing an indication of the state of the second node to the first node in response to detection of a change in state of the second node.