By Topic

An Application of Vertex Partition for Parallel Test Tasks Scheduling in Automatic Test System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiao Xun ; Dept. of Comput. Sci., South Central Univ. for Nat., Wuhan ; Wang Jiangqing

Emergency of automatic test system (ATS) aims to increase efficiency of software development. However, traditional testing skill in ATS is low efficiency when it faces large scale testing tasks. Therefore, parallel test becomes one kind of proper way to use system resources efficiently. Nevertheless, parallel testing task scheduling problem (PTTSP) is a complicated issue. Additionally, when system processes its scheduling it also have to concern time precedence constraints between testing tasks. Therefore, in this paper, we propose an algorithm--vertex partition algorithm derived from graph theory. It coordinates system resources conflicts (SRC) and time precedence constraints (TPC) in testing tasks. From experimental simulation, it shows that VPA approach is meaningful for design of scheduling strategy of ATS.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:2 )

Date of Conference:

12-14 Dec. 2008