Determining variable wait time in an asynchronous call-back system based on calculated average sub-queue wait time

Patent metadata

Field	Value
Publication number	US-2016127382-A1
Application number	US-201614996465-A
Country	US
Kind code	A1
Filing date	Jan 15, 2016
Priority date	Apr 30, 2013
Publication date	May 5, 2016
Grant date	—

Abstract

A method includes a workload management (WLM) server that receives a first CHECK WORKLOAD command for a workload in a queue of the WLM server. It may be determined whether the workload is ready to run on a WLM client. If the workload is not ready to run, a wait time for the workload with the WLM server is dynamically estimated. The wait time is sent to the WLM client. If the workload is ready to run, then a response is sent to the WLM client that workload is ready to run.

First claim

What is claimed is:

1 . A computer system for asynchronous call-back, the computer system comprising:
a memory; and at least one processor in communication with the memory, wherein the computer system is configured to perform a method, the method comprising:
receiving, by a workload management (WLM) server from a WLM client, a first authorization request for authorization to run a workload, the workload in a queue of pending workloads, each pending workload and each of a plurality of prior workloads having an actual wait time spent in the queue of pending workloads, the queue of pending workloads containing a number of workloads (Lq), and wherein a weighted maximum workload count per queue (Nmax) is a maximum number of workloads that can run concurrently in the parallel execution system;
determining, by the WLM server in response to the receiving the first authorization request, that the workload is not ready to run;
dividing, by the WLM server, the queue of pending workloads into a number of sub-queues (Ns), wherein Ns=Lq/Nmax;
calculating, by the WLM server, an average sub-queue wait time (Wsavg) for each of the Ns sub-queues, wherein the Wsavg of a given sub-queue is based at least in part on an average queue wait time (Wqavg), the Wqavg of the given sub-queue being an average of the actual wait times of the plurality of prior workloads contained in that given sub-queue;
calculating, by the WLM server, a first wait time based at least in part on the Wsavg of the sub-queue containing the workload;
sending, by the WLM server, the first wait time to the WLM client, the first wait time indicating how long the WLM client should wait before sending a second authorization request for the authorization to run the workload;
receiving, by the WLM server and after the first wait time has expired, the second authorization request from the WLM client, the second authorization request sent by the WLM client after waiting a time period equal to the first wait time;
determining, by the WLM server in response to the receiving the second authorization request, that the workload is not ready to run;
calculating, by the WLM server, a second wait time, the second wait time different from the first wait time; and
sending, by the WLM server, the second wait time to the WLM client, the second wait time indicating how long the WLM client should wait before sending a third authorization request for the authorization to run the workload.

2 . The computer system of claim 1 , wherein the method further comprises:
receiving, by the WLM server and before the calculating the first wait time, a first wait time request for the first wait time from the WLM client; and receiving, by the WLM server and before the calculating the second wait time, a second wait time request for the second wait time from the WLM client.

3 . The computer system of claim 1 , wherein a first sub-queue contains the Nmax workloads having actual wait times longer than the actual wait times of all other workloads in the queue of pending workloads, wherein a second sub-queue contains the Nmax workloads having actual wait times shorter than the workloads in the first sub-queue but longer than the actual wait times of all other workloads in the queue of pending workloads, wherein a last sub-queue contains the Nmax or fewer workloads having actual wait times shorter than the actual wait times of all other workloads in the queue of pending workloads, wherein the first sub-queue has a first Wsavg=Wqavg/Ns, wherein the second sub-queue has a second Wsavg=Wqavg/(Ns−1), and wherein the last sub-queue has a last Wsavg=Wqavg.

4 . The computer system of claim 3 , wherein the calculating the first wait time comprises:
determining that the workload is in the second sub-queue; and setting the first wait time equal to the second Wsavg.

5 . The computer system of claim 4 , wherein the calculating the second wait time comprises:
determining that the workload is in the first sub-queue; and setting the second wait time equal to the first Wsavg.

6 . The computer system of claim 3 , wherein the queue of pending workloads contains a maximum of Lqmax workloads, and wherein the calculating the first wait time comprises:
determining that the workload is in the second sub-queue; and setting the first wait time equal to the second Wsavg*Lq/Lqmax.

Assignees

• IBM

Inventors

• Li Yong
• Lieu Hanson
• Liu Ron
• Pu Xiaoyan

Classifications

• G06F9/4881 Primary

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

• H04L63/102 Primary

  Entity profiles · CPC title

• H04L67/42

  Electricity · mapped topic

• G06F2209/5013

  Request control · CPC title

• G06F2209/548

  Queue · CPC title