TASKING SYSTEM INTERFACE METHODS AND APPARATUSES FOR USE IN WIRELESS DEVICES

• US 20110296415A1
• Filed: 10/01/2010
• Published: 12/01/2011
• Est. Priority Date: 06/01/2010
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Zaman, Naveed U., Chan, Joseph C., Khan, Raheel, Shalev, Ron
• Granted Patent: US 8,527,993 B2
• Time in Patent Office: Days
• US Class Current: 718/100
• CPC Class Codes: G06F 9/544 Buffers; Shared memory; Pipes

Abstract

Techniques are provided which may be implemented in various methods and/or apparatuses that to provide a tasking system buffer interface capability to interface with a plurality of shared processes/engines.

Claims

1. A method comprising:

in a wireless modem;

accessing task information from at least one of a plurality of task queues, said task information for processing by one or more of a plurality of shared client processes;

selectively altering at least a portion of said task information by affecting execution of at least one task thread associated with said at least one of a plurality of task queues; and

selectively routing said altered task information to at least one of said plurality of shared client processes.

2. The method as recited in claim 1, further comprising:

obtaining event information associated with at least one of;

said one or more of a plurality of shared client processes, and/or said one or more of said plurality of task queues; and

selectively altering said at least a portion of said task information based, at least in part, on said event information.

3. The method as recited in claim 1, further comprising:

obtaining, at least in part via a pulling operation, at least a portion of said at least one task thread from memory.

4. The method as recited in claim 1, further comprising:

storing at least a portion of said at least one task thread in a first-in, first-out (FIFO) buffer.

5. The method as recited in claim 4, further comprising:

selectively altering at least said portion of said at least one task thread stored in said FIFO buffer.

6. The method as recited in claim 4, wherein selectively altering said at least said portion of said task information further comprises:

operatively bypassing at least said portion of said at least one task thread stored in said FIFO buffer.

7. The method as recited in claim 6, wherein selectively altering said at least said portion of said task information further comprises:

storing said portion of said altered task information in said FIFO buffer.

8. The method as recited in claim 1, further comprising:

selectively altering said at least said portion of said task information based, at least in part, on at least one identifier within said at least one task thread.

9. The method as recited in claim 1, further comprising:

selectively altering said at least said portion of said task information based, at least in part, on at least one conditional determination.

10. The method as recited in claim 1, further comprising:

arbitrating access to said at least one of said plurality of shared client processes between at least two of said plurality of task queues.

11. An apparatus comprising:

a resource authority to selectively route task information to one or more of a plurality of shared client processes;

a task queue array comprising a plurality of task queues to provide said task information to said resource authority for routing to said one or more of a plurality of shared client processes; and

at least one task decoder coupled to at least one of said plurality of task queues, said task decoder to selectively alter at least a portion of said task information by affecting execution of at least one task thread associated with said at least one of said plurality of task queues.

12. The apparatus as recited in claim 11, further comprising:

an event pool coupled to at least one of;

at least one of said plurality of shared client processes, said at least one of said plurality of task queues, said at least one task decoder, said event pool to provide access to event information associated with at least one of;

said one or more of a plurality of shared client processes, said one or more of said plurality of task queues, and/or said at least one task decoder.

13. The apparatus as recited in claim 11, wherein said at least one of said plurality of task queues comprises a task fetcher to obtain at least a portion of said at least one task thread.

14. The apparatus as recited in claim 11, wherein said at least one of said plurality of task queues comprises a task buffer to store at least a portion of said at least one task thread.

15. The apparatus as recited in claim 14, wherein said at least one task decoder selectively alters at least said portion of said at least one task thread stored in said task buffer.

16. The apparatus as recited in claim 14, wherein said at least one task decoder operatively bypasses at least said portion of said at least one task thread stored in said task buffer.

17. The apparatus as recited in claim 16, wherein said at least one of said plurality of task queues comprises a task dispatcher coupled to said at least one task decoder to selectively provide said altered portion of said task information to said resource authority.

18. The apparatus as recited in claim 11, said at least one task decoder to selectively alter said at least said portion of said task information based, at least in part, on at least one identifier within said at least one task thread.

19. The apparatus as recited in claim 11, said at least one task decoder to obtain event information and selectively alter said at least said portion of said task information based, at least in part, on said event information.

20. The apparatus as recited in claim 11, said at least one task decoder to selectively alter said at least said portion of said task information based, at least in part, on at least one conditional determination.

21. An apparatus for use in a wireless modem, the apparatus comprising:

means for accessing task information from at least one of a plurality of task queues, said task information for processing by one or more of a plurality of shared client processes;

means for selectively altering at least a portion of said task information by affecting execution of at least one task thread associated with said at least one of a plurality of task queues; and

means for selectively routing said altered task information to at least one of said plurality of shared client processes.

22. The apparatus as recited in claim 21, further comprising:

means for obtaining event information associated with at least one of;

said one or more of a plurality of shared client processes, and/or said one or more of said plurality of task queues; and

means for selectively altering said at least a portion of said task information based, at least in part, on said event information.

23. The apparatus as recited in claim 21, further comprising:

means for obtaining, at least in part via a pulling operation, at least a portion of said at least one task thread from memory.

24. The apparatus as recited in claim 21, further comprising:

means for storing at least a portion of said at least one task thread in a first-in, first-out (FIFO) manner.

25. The apparatus as recited in claim 24, further comprising:

means for selectively altering at least said portion of said at least one task thread stored in said FIFO manner.

26. The apparatus as recited in claim 24, further comprising:

means for operatively bypassing at least said portion of said at least one task thread stored in said FIFO manner.

27. The apparatus as recited in claim 26, further comprising:

means for storing said portion of said altered task information in said FIFO manner.

28. The apparatus as recited in claim 21, further comprising:

means for selectively altering said at least said portion of said task information based, at least in part, on at least one identifier within said at least one task thread.

29. The apparatus as recited in claim 21, further comprising:

means for selectively altering said at least said portion of said task information based, at least in part, on at least one conditional determination.

30. The apparatus as recited in claim 21, further comprising:

means for arbitrating access to said at least one of said plurality of shared client processes between at least two of said plurality of task queues.

31. An article comprising:

a computer-readable medium having stored thereon computer-implementable instructions executable by at least one processing unit in a wireless modem to;

access task information from at least one of a plurality of task queues, said task information for processing by one or more of a plurality of shared client processes;

selectively alter at least a portion of said task information by affecting execution of at least one task thread associated with said at least one of a plurality of task queues; and

initiate selectively routing of said altered task information to at least one of said plurality of shared client processes.

32. The article as recited in claim 31, said computer-implementable instructions being further executable by said at least one processing unit to:

obtain event information associated with at least one of;

said one or more of a plurality of shared client processes, and/or said one or more of said plurality of task queues; and

selectively alter said at least a portion of said task information based, at least in part, on said event information.

33. The article as recited in claim 31, said computer-implementable instructions being further executable by said at least one processing unit to:

obtain, at least in part via a pulling operation, at least a portion of said at least one task thread from memory.

34. The article as recited in claim 31, said computer-implementable instructions being further executable by said at least one processing unit to:

initiate storing of at least a portion of said at least one task thread in a first-in, first-out (FIFO) buffer.

35. The article as recited in claim 34, said computer-implementable instructions being further executable by said at least one processing unit to:

selectively alter at least said portion of said at least one task thread stored in said FIFO buffer.

36. The article as recited in claim 34, said computer-implementable instructions being further executable by said at least one processing unit to:

initiate operatively bypassing at least said portion of said at least one task thread stored in said FIFO buffer.

37. The article as recited in claim 36, said computer-implementable instructions being further executable by said at least one processing unit to:

initiate storing of said portion of said altered task information in said FIFO buffer.

38. The article as recited in claim 31, said computer-implementable instructions being further executable by said at least one processing unit to:

selectively alter said at least said portion of said task information based, at least in part, on at least one identifier within said at least one task thread.

39. The article as recited in claim 31, said computer-implementable instructions being further executable by said at least one processing unit to:

selectively alter said at least said portion of said task information based, at least in part, on at least one conditional determination.

40. The article as recited in claim 31, said computer-implementable instructions being further executable by said at least one processing unit to:

initiate arbitrating access to said at least one of said plurality of shared client processes between at least two of said plurality of task queues.