Real time job dispatching patcher and method

Real time job dispatching patcher and method

  • CN 101,694,631 B
  • Filed: 09/30/2009
  • Issued: 10/05/2016
  • Est. Priority Date: 09/30/2009
  • Status: Active Grant
First Claim
Patent Images

1. the method for a job scheduling, it is characterised in that said method comprising the steps of:

  • A. multiple queue is created;

    B. the plurality of queue is arranged to different priority levels, and according to the priority of described queueThe property seized of described queue is not set;

    C. judge whether real time job, if it is present perform step D, otherwise continue executing withExisting operation;

    D. described existing operation is hung up, discharge the resource of described existing job request;

    E. described real time job is run on server;

    AndAfter the most described real time job end of run, the described existing operation being suspended is returned to described clothesContinue to run with on business device,Wherein, use adaptive algorithm that the priority level of described queue and the property seized are set, including followingStep;

    Collect cluster information, and search in described cluster information the information about cluster scale;

    AndAccording to described cluster scale, the priority level of described queue and the property seized are set,Wherein, judge whether described in that real time job comprises the following steps;

    A. judge whether the user that operation is relevant has the authority submitting real time job to, if having describedAuthority, then perform step B1, otherwise judge that described operation is as non real-time operation;

    AndWhether the rank B1. judging described operation is high priority, if high priority, then describedOperation is real time job, is otherwise non real-time operation,Wherein, described the priority level of described queue and the property seized, bag are set according to described cluster scaleInclude;

    If described cluster scale is less than the threshold value of cluster scale, then described queue is arranged to two kinds excellentFirst rank, including high priority and low priority, wherein, the job priority of described high-priority queueDispatch and seize the resource of the operation of described Low Priority Queuing;

    AndIf described cluster scale is not less than the threshold value of described cluster scale, then described queue is arranged toThree kinds of priority levels, including high priority, medium priority and low priority, wherein, described height is preferentialThe resource of operation of described medium priority queue and described low excellent is dispatched and seized to the job priority of level queue The resource of the operation of first level queue, the operation of described medium priority queue is than described Low Priority QueuingJob priority is dispatched.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×