Task scheduling algorithm for non-unit time testing

Zhongming Yang; Wei Li; Wenquan Zeng

doi:10.1117/12.2539584

27 November 2019 Task scheduling algorithm for non-unit time testing

Zhongming Yang, Wei Li, Wenquan Zeng

Proceedings Volume 11321, 2019 International Conference on Image and Video Processing, and Artificial Intelligence; 113211U (2019) https://doi.org/10.1117/12.2539584
Event: The Second International Conference on Image, Video Processing and Artifical Intelligence, 2019, Shanghai, China

Abstract

Due to different length of test tasks, multi-thread testing task scheduling for software automatic testing is a non-unit time task scheduling procedure. This text will study a unit time task scheduling algorithm with time limit and punishment from the point of view of deadline of performing task scheduling, and design a scheduling algorithm which can meet the non-unit time task and complete the testing task within the limited time range. And this optimal scheduling design of the algorithm stated above has been verified by experiments.

Citation Download Citation

Zhongming Yang, Wei Li, and Wenquan Zeng "Task scheduling algorithm for non-unit time testing", Proc. SPIE 11321, 2019 International Conference on Image and Video Processing, and Artificial Intelligence, 113211U (27 November 2019); https://doi.org/10.1117/12.2539584

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available