Rebooting timing adjustment for improved performance

US10228953B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10228953-B2
Application numberUS-201615278828-A
CountryUS
Kind codeB2
Filing dateSep 28, 2016
Priority dateDec 15, 2015
Publication dateMar 12, 2019
Grant dateMar 12, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method, computer program product, and system identify a low-cost time to re-boot a system. The method includes a processor obtaining a request for a re-boot of a system. The processor obtains identifiers of uncompleted tasks executing in the system. Based on obtaining the identifiers, the processor obtains a task cost of each task of the uncompleted tasks, where a value of the task cost of each task relates to a portion of each task completed by the processor at a given time. The processor determines, based on the task costs associated with the uncompleted tasks, a re-boot cost for re-booting the system at the given time. The processor determined a system cost for not re-booting the system at the given time. The processor compares the re-boot cost to the system cost to determine whether to re-boot the system at the given time in response to the request.

First claim

Opening claim text (preview).

What is claimed is: 1. A computer-implemented method, comprising: obtaining, by one or more processors, a request for a re-boot of a system; obtaining, by the one or more processors, identifiers of tasks executing in the system at a given time; based on obtaining the identifiers, obtaining, by the one or more processors, a task cost of each task of the tasks at a the given time; determining, by the one or more processors, based on the task costs associated with the tasks, a re-boot cost for re-booting the system at the given time; determining, by the one or more processors, a system cost for not re-booting the system at the given time; comparing, by the one or more processors, the re-boot cost to the system cost to determine whether to re-boot the system at the given time in response to the request; determining, by the one or more processors, that the re-boot cost is less than or equal to the system cost at the given time; based on the determining that the re-boot cost is less, applying, by the one or more processors, the patch; and rebooting, by the one or more processors, the system at the given time. 2. The computer-implemented method of claim 1 , further comprising: detecting, by the one or more processors, a vulnerability, wherein addressing the vulnerability requires applying a patch and re-booting the system. 3. The computer-implemented method of claim 1 , further comprising: based on completing the rebooting, restarting, by the one or more processors, the tasks. 4. The computer-implemented method of claim 2 , wherein the system cost comprises a quantified risk associated with failing to apply an update to the system, wherein the update corrects the vulnerability. 5. The computer-implemented method of claim 1 , wherein the value of the task cost comprises a cost to the system associated with killing the task. 6. The computer-implemented method of claim 1 , wherein the given time comprises a window of time. 7. The computer-implemented method of claim 1 , wherein a portion of the tasks executing in the system comprise direct user tasks. 8. The computer-implemented of claim 1 , further comprising: determining, by the one or more processors, that the re-boot cost is less than or equal to the system cost during a portion of the given time; and rebooting, by the one or more processors, the system during the portion of the given time. 9. The computer-implemented of claim 1 , further comprising: determining, by the one or more processors, that the re-boot cost is less than or equal to the system cost at the given time; and scheduling, by the one or more processors, the re-boot at the given time; and alerting, by the one or more processors, a user of the scheduled system re-boot. 10. The computer-implemented of claim 9 , further comprising: obtaining, by the one or more processors, a request from the user not to re-boot the system at the given time; and based on the obtaining the request from the user, canceling, by the one or more processors, the scheduled system re-boot. 11. The computer-implemented of claim 9 , further comprising: obtaining, by the one or more processors, an indication of an action in the system, wherein the action was selected from a group of predefined actions; analyzing, by the one or more processors, an impact of the action on the re-boot cost and the system cost; adjusting, by the one or more processors, at least one of: the re-boot cost or the system cost, based on the impact; based on the adjusting, replacing, by the one or more processors, the given time with a new re-boot time; and scheduling, by the one or more processors, the re-boot at the new time. 12. A computer program product comprising: A non-transitory computer readable storage medium readable by one or more processors and storing instructions for execution by the one or more processors for performing a method comprising: obtaining, by one or more processors, a request for a re-boot of a system; obtaining, by the one or more processors, identifiers of tasks executing in the system at a given time; based on obtaining the identifiers, obtaining, by the one or more processors, a task cost of each task of the tasks at a the given time; determining, by the one or more processors, based on the task costs associated with the tasks, a re-boot cost for re-booting the system at the given time; determining, by the one or more processors, a system cost for not re-booting the system at the given time; comparing, by the one or more processors, the re-boot cost to the system cost to determine whether to re-boot the system at the given time in response to the request; determining, by the one or more processors, that the re-boot cost is less than or equal to the system cost at the given time; based on the determining that the re-boot cost is less, applying, by the one or more processors, the patch; and rebooting, by the one or more processors, the system at the given time. 13. The computer program product of claim 12 , the method further comprising: detecting, by the one or more processors, a vulnerability, wherein addressing the vulnerability requires applying a patch and re-booting the system. 14. The computer program product of claim 12 , the method further comprising: based on completing the rebooting, restarting, by the one or more processors, the tasks. 15. The computer program product of claim 13 , wherein the system cost comprises a quantified risk associated with failing to apply an update to the system, wherein the update corrects the vulnerability. 16. The computer program product of claim 12 , wherein the value of the task cost comprises a cost to the system associated with killing the task. 17. The computer program product of claim 12 , the method further comprising: determining, by the one or more processors, that the re-boot cost is less than or equal to the system cost during a portion of the given time; and rebooting, by the one or more processors, the system during the portion of the given time. 18. A system comprising: one or more memories; one or more processors in communication with the one or more memories; and program instructions executed by the one or more processors via the one or more memories to perform a method, the method comprising: obtaining, by the one or more processors, identifiers of tasks executing in the system at a given time; based on obtaining the identifiers, obtaining, by the one or more processors, a task cost of each task of the tasks at a the given time; determining, by the one or more processors, based on the task costs associated with the tasks, a re-boot cost for re-booting the system at the given time; determining, by the one or more processors, a system cost for not re-booting the system at the given time; comparing, by the one or more processors, the re-boot cost to the system cost to determine whether to re-boot the system at the given time in response to the request; determining, by the one or more processors, that the re-boot cost is less than or equal to the system cost at the given time; based on the determining that the re-boot cost is less, applying, by the one or more processors, the patch; and rebooting, by the one or more processors, the system at the given time.

Assignees

Inventors

Classifications

  • G06F8/65Primary

    Updates (security arrangements therefor G06F21/57) · CPC title

  • Physics · mapped topic

  • Initialisation or configuration control {(processor initialisation G06F9/4405)} · CPC title

  • Software update, e.g. print driver, modules, plug-ins, fonts · CPC title

  • Bootstrapping (security arrangements therefor G06F21/57) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10228953B2 cover?
A method, computer program product, and system identify a low-cost time to re-boot a system. The method includes a processor obtaining a request for a re-boot of a system. The processor obtains identifiers of uncompleted tasks executing in the system. Based on obtaining the identifiers, the processor obtains a task cost of each task of the uncompleted tasks, where a value of the task cost of ea…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F8/65. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Mar 12 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).