Efficient input/output-aware multi-processor virtual machine scheduling
US-9081621-B2 · Jul 14, 2015 · US
US9513964B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9513964-B2 |
| Application number | US-201414583412-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 26, 2014 |
| Priority date | Sep 23, 2010 |
| Publication date | Dec 6, 2016 |
| Grant date | Dec 6, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Systems and methods of managing break events may provide for detecting a first break event from a first event source and detecting a second break event from a second event source. In one example, the event sources can include devices coupled to a platform as well as active applications on the platform. Issuance of the first and second break events to the platform can be coordinated based on at least in part runtime information associated with the platform.
Opening claim text (preview).
We claim: 1. A machine-readable storage media having machine executable instructions that, when executed, cause one or more processors to perform operations comprising: receive a first request associated with a first process, the first request indicating a waiting period after which at least a portion of the first process is to be executed; receive a second request associated with a second process, the second request indicating a waiting period after which at least a portion of the second process is to be executed; and time coalesce execution of the first or second processes according to a criteria, wherein the time coalesce to determine a new time for at least one of the first and second requests. 2. The machine-readable storage media of claim 1 , wherein at least the first or second process is an application. 3. The machine-readable storage media of claim 1 , wherein the first process is to send the first request. 4. The machine-readable storage media of claim 1 , wherein the second process is to send the second request. 5. The machine-readable storage media of claim 1 , wherein to time coalesce comprises shifting execution times of at least one of the first and second processes such that an idle time window duration increases. 6. The machine-readable storage media of claim 1 , wherein to time coalesce shifts execution times of at least one of the first or second requests. 7. The machine-readable storage media of claim 1 , wherein to time coalesce the execution of at least one of the first and second requests comprises shifting execution times of the first and second processes such that the execution times of the first and second processes are substantially aligned to one another. 8. The machine-readable storage media of claim 1 , wherein to time coalesce the execution of at least one of the first and second processes comprises shifting execution time of the first process to substantially align with execution time of the second process. 9. The machine-readable storage media of claim 1 , wherein the criteria is one of: importance of the first and second processes relative to each other; or duration of waiting periods of the first and second requests. 10. The machine-readable storage media of claim 1 having further instructions that when executed cause the one or more processors to perform a further operation comprising: detect a third request associated with a third process, the third request indicating a waiting period after which at least a portion of the third process is executed; identify importance of the third process relative to the first and second processes; and maintain an execution time associated with the third request while time coalescing the first and second requests. 11. The machine-readable storage media of claim 1 having further instructions that when executed cause the one or more processors to perform a further operation comprising: increase an amount of time the one or more processors spends in an idle state. 12. A machine-readable storage media having machine executable instructions that, when executed, cause one or more processors to perform operations comprising: receive a first request associated with a first process, the first request indicating a waiting period after which at least a portion of the first process is to be executed; receive a second request associated with a second process, the second request indicating a waiting period after which at least a portion of the second process is to be executed; and time coalesce execution of the first or second processes according to a criteria, wherein the operation of time coalesce comprises shifting execution times of at least one of the first and second processes such that an idle time window duration increases. 13. The machine-readable storage media of claim 12 , wherein at least the first or second process is an application. 14. The machine-readable storage media of claim 12 , wherein the first process is to send the first request. 15. The machine-readable storage media of claim 12 , wherein the second process is to send the second request. 16. The machine-readable storage media of claim 12 , wherein shifting execution times of the first and second processes is such that the execution times of the first and second processes are substantially aligned to one another. 17. The machine-readable storage media of claim 12 , wherein shifting execution time of the first process comprises substantially aligning with execution time of the second process. 18. The machine-readable storage media of claim 12 , wherein the criteria is one of: importance of the first and second processes relative to each other; or duration of waiting periods of the first and second requests. 19. The machine-readable storage media of claim 12 having further instructions that when executed cause the one or more processors to perform a further operation comprising: detect a third request associated with a third process, the third request indicating a waiting period after which at least a portion of the third process is executed; identify importance of the third process relative to the first and second processes; and maintain an execution time associated with the third request while time coalescing the first and second requests. 20. A system comprising: a memory; one or more processors coupled to the memory; and an operating system for controlling operations of the one or more processors, the operating system operable to perform operations comprising: receive a first request associated with a first process, the first request indicating a waiting period after which at least a portion of the first process is to be executed; receive a second request associated with a second process, the second request indicating a waiting period after which at least a portion of the second process is to be executed; and time coalesce execution of the first or second processes according to a criteria, wherein the time coalesce to determine a new time for at least one of the first and second requests.
Interprogram communication · CPC title
Power management, i.e. event-based initiation of a power-saving mode · CPC title
Event management; Broadcasting; Multicasting; Notifications · CPC title
Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title
Means for acting in the event of power-supply failure or interruption, e.g. power-supply fluctuations (for resetting only G06F1/24) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.