Continuous execution method for realizing single-machine cyclic scheduling through judgment

Abstract

The invention discloses a continuous execution method for realizing single-machine circular scheduling through judgment. The method comprises the following steps: constructing a logic circular queue, and initializing a dynamic allocation storage space, a queue head pointer of the logic circular queue and a queue tail pointer of the logic circular queue; carrying out dequeuing, enqueuing and variable or constant assignment operations; setting priority switches of the tasks; inserting a single task to be executed into the logic round-robin queue, constructing a test group round-robin queue by the single task, setting a test group priority, constructing a test task set round-robin queue by the test group round-robin queue, and setting a priority of the task set round-robin queue; firstly executing the test groups according to the setting of the priorities, after the test groups are executed, executing a test set consisting of the test groups, and quickly testing to generate a test report; and finally, packaging the completed algorithm data into a group of APIs. According to the method, the execution time of the automatic items is set differently, the automatic test items are executed in a polling mode, 7 * 24-hour task continuous execution is achieved on a single machine, and the machine utilization rate is increased.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a continuous execution method for realizing single-machine cycle scheduling through judgment. Background technique [0002] At present, in the field of automated loop testing, the time slice round-robin algorithm used is the oldest, simplest, fairest and most widely used algorithm. Each process is assigned a period of time, called its time slice, which is the amount of time the process is allowed to run. If the process is still running when the time slice ends, the CPU will be taken away and assigned to another process. If the process blocks or ends before the time slice ends, the CPU switches immediately. All the scheduler has to do is maintain a list of ready processes, and when a process runs out of its time slice, it is moved to the end of the queue. [0003] In order to make full use of the vector space, the way to overcome the "false overflow" phenomenon is to imagine ...

AI Technical Summary

Problems solved by technology

[0004] Then, before the automatic test process starts through the CPU time slice rotation algorithm and circular queue, due to the multi-project concurrency and the test server resource shortage, the machine resources will be insufficient, and a single test machine cannot meet the execution requirements of the increasing number of test projects.

Images