×

Methods and arrangements for ordering changes in computing systems

  • US 7,496,912 B2
  • Filed: 02/27/2004
  • Issued: 02/24/2009
  • Est. Priority Date: 02/27/2004
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer-implemented method of automatically determining an allowable order of changes in a distributed system, the computer-implemented method comprising the steps of:

  • receiving a request for change;

    wherein the request for change describes a task to be done on at least one target system, and a deadline by which a change needs to be completed;

    determining existing relationship descriptions between components of the distributed system, wherein the components of the distributed system are implemented on a plurality of managed resources;

    transforming acquired relationships into ordered tasks that are linked by temporal ordering constraints which describe when tasks can begin in relation to one another, wherein the temporal ordering constraints are selected from the group consisting of;

    Finish-to-Start, Start-to-Start, Finish-to-Finish, and Start-to-Finish;

    creating an order of changes taking into account the temporal ordering constraints, wherein creating the order of changes includes determining whether the ordered changes are conflicting and flagging such conflicts and further includes an estimate of the time required to complete a change;

    wherein the order of changes transitions the at least one target system from one workable state into another workable state;

    building a Task Graph from the order of changes, wherein the Task Graph represents each task to be completed within an overall job;

    constructing an Annotated Task Graph by assigning estimated durations to each task within the Task Graph; and

    computing a makespan for the overall job represented by the Task Graph, wherein the Annotated Task Graph is returned to an administrator.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×