Enabling multiple operating systems to run concurrently using barrier task priority

• US 9,122,521 B2
• Filed: 08/09/2007
• Issued: 09/01/2015
• Est. Priority Date: 08/09/2006
• Status: Active Grant

• Current Assignee: Virtuallogix SA
• Original Assignee: Virtuallogix SA
• Inventors: Maslov, Guennadi
• Primary Examiner(s): Wai, Eric C
• Application Number:
  US12/376,822
• Publication Number:
  US 20100017806A1
• Time in Patent Office: 2,945 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 9/45537 Provision of facilities of other operating environments, e.g. WINE I/O emulation G06F13/105
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

The invention relates to a method of enabling multiple operating systems to run concurrently on the same computer, the method comprising: scheduling a plurality of tasks for execution by at least first and second operating systems, wherein each task has one of a plurality of priorities; setting the priority of each operating system in accordance with the priority of the next task scheduled for execution by the respective operating system; and providing a common program arranged to compare the priorities of all operating systems and to pass control to the operating system having the highest priority. Accordingly, the invention resides in the idea that different operating systems can be run more efficiently on a single CPU by changing the priority of each operating system over time. In other words, each operating system has a flexible priority.

Claims

1. A method of enabling multiple operating systems to run on the same CPU, the method comprising:

scheduling a plurality of tasks for execution by at least first and second operating systems, wherein each task has one of a plurality of first priorities;

assigning a second priority to each operating system;

providing a common program arranged to compare the second priorities of all operating systems and to run the operating system having the highest second priority on the CPU;

activating a barrier task in a given operating system in response to an interrupt for the given operating system; and

scheduling the barrier task for execution in the given operating system when the barrier task has the highest first priority in the given operating system,

wherein each operating system causes the common program to change its priority when it switches from one task to another task having a lower priority, and

wherein each operating system can invoke the common program to decrease its priority.

2. The method of claim 1, wherein each operating system performs the barrier task in between consecutive tasks, thereby to split consecutive tasks into tasks of different importance.

3. The method of claim 2, wherein the barrier routine is performed in response to an interrupt.

4. The method of claim 2, wherein the common program pre-empts the operating system performing the barrier task if, after decreasing its priority, another operating system has a higher priority, and passes control to the higher priority operating system.

5. The method of claim 2 wherein, if control is passed to the higher priority operating system, the barrier task remains active.

6. The method of claim 5, comprising resuming performance of the barrier task when control is passed back to the operating system in which the barrier task has remained active.

7. The method of claim 2, wherein the common program is invoked to pass control to the operating system having the highest priority when a barrier task has been performed.

8. The method of claim 2, wherein each operating system is adapted to perform multiple barrier tasks, wherein each barrier task is associated with tasks of a specific priority and/or each barrier task causes a different decrease of the priority of the respective operating system.

9. The method of claim 1, wherein each operating system is arranged to invoke the common program to cause a decrease of its own priority.

10. The method of claim 9, wherein each operating system causes a decrease of its own priority upon completion of a task if no further task having a priority equal to or higher than the priority of the completed task is scheduled for execution.

11. The method of claim 1, wherein the common program is adapted to increase the priority of any of the operating systems.

12. The method of claim 11, wherein the common program increases the priority of an operating system when that operating system receives an interrupt.

13. The method of claim 12, wherein the common program increases the priority of an operating system to a respective highest level when that operating system receives an interrupt.

14. The method of claim 1, wherein the common program is invoked to pass control to the operating system having the highest priority after an operating system has become inactive.

15. The method of claim 1, wherein the common program is invoked to pass control to the operating system having the highest priority after the priority of an operating system has been set to a different level.

16. The method of claim 1, wherein each operating system has a highest priority, wherein the highest priority of the first operating system is higher than the highest priority of the other priority systems.

17. A non-transitory computer storage medium containing programmable code which, when executed by a computer, including at least one processor, accessible input/output and at least one data store, performs the method of claim 1.

18. A computer system including at least one processor, accessible input/output, and at least one data store arranged to perform the method of claim 1.

19. The method of claim 1, wherein the common program decreases the second priority of an operating system in response to being invoked by that operating system, or increases the second priority of an operating system in response to an interrupt for that operating system.

20. The method of claim 1, wherein the priority of an operating system can only be increased by the common program upon receipt of an interrupt intended for that operating system.

21. The method of claim 1, wherein no operating system causes the common program to increase its priority.

22. A method of enabling multiple operating systems to run on the same CPU, the method comprising:

scheduling a plurality of tasks for execution by at least first and second operating systems, wherein each task has one of a plurality of first priorities;

assigning a second priority to each operating system;

providing a common program arranged to compare the second priorities of all operating systems and to run the operating system having the highest second priority on the CPU; and

a given operating system executing a barrier task, wherein executing the barrier task comprises passing control to the common program to cause a decrease of the second priority of the given operating system,

wherein each operating system causes the common program to change its priority when it switches from one task to another task having a lower priority, and

wherein each operating system can invoke the common program to decrease its priority.

23. The method of claim 22, wherein each operating system performs the barrier task in between consecutive tasks, thereby to split consecutive tasks into tasks of different importance.

24. The method of claim 23, wherein the barrier routine is performed in response to an interrupt.

25. The method of claim 24, wherein, if control is passed to the higher priority operating system, the barrier task remains active.

26. The method of claim 25, comprising resuming performance of the barrier task when control is passed back to the operating system in which the barrier task has remained active.

27. The method of claim 23, wherein the common program pre-empts the operating system performing the barrier task if, after decreasing its priority, another operating system has a higher priority, and passes control to the higher priority operating system.

28. The method of claim 23, wherein the common program is invoked to pass control to the operating system having the highest priority when a barrier task has been performed.

29. The method of claim 23, wherein each operating system is adapted to perform multiple barrier tasks, wherein each barrier task is associated with tasks of a specific priority and/or each barrier task causes a different decrease of the priority of the respective operating system.

30. The method of claim 22, wherein each operating system is arranged to invoke the common program to cause a decrease of its own priority.

31. The method of claim 30, wherein each operating system causes a decrease of its own priority upon completion of a task if no further task having a priority equal to or higher than the priority of the completed task is scheduled for execution.

32. The method of claim 22, wherein the common program is adapted to increase the priority of any of the operating systems.

33. The method of claim 32, wherein the common program increases the priority of an operating system when that operating system receives an interrupt.

34. The method of claim 33, wherein the common program increases the priority of an operating system to a respective highest level when that operating system receives an interrupt.

35. The method of claim 22, wherein the common program is invoked to pass control to the operating system having the highest priority after an operating system has become inactive.

36. The method of claim 22, wherein the common program is invoked to pass control to the operating system having the highest priority after the priority of an operating system has been set to a different level.

37. The method of claim 22, wherein each operating system has a highest priority, wherein the highest priority of the first operating system is higher than the highest priority of the other priority systems.

38. A non-transitory computer storage medium containing programmable code which, when executed by a computer, including at least one processor, accessible input/output and at least one data store, performs the method of claim 22.

39. A computer system including at least one processor, accessible input/output, and at least one data store arranged to perform the method of claim 22.

40. The method of claim 22, wherein the common program decreases the second priority of an operating system in response to being invoked by that operating system, or increases the second priority of an operating system in response to an interrupt for that operating system.

41. The method of claim 22, wherein the priority of an operating system can only be increased by the common program upon receipt of an interrupt intended for that operating system.

42. The method of claim 22, wherein no operating system causes the common program to increase its priority.

43. A method of enabling multiple operating systems to run on the same CPU, the method comprising:

scheduling a plurality of tasks for execution by at least first and second operating systems, wherein each task has one of a plurality of first priorities;

assigning a second priority to each operating system;

providing a common program arranged to compare the second priorities of all operating systems and to run the operating system having the highest second priority on the CPU; and

a given operating system executing a barrier task, wherein, if the common program pre-empts the given operating system and passes control to an operating system having a higher second priority, the barrier task in the given operating system remains active until it is next scheduled for execution,

wherein each operating system causes the common program to change its priority when it switches from one task to another task having a lower priority, and

wherein each operating system can invoke the common program to decrease its priority.

44. The method of claim 43, wherein the priority of an operating system can only be increased by the common program upon receipt of an interrupt intended for that operating system.

45. The method of claim 43, wherein no operating system causes the common program to increase its priority.