DocumentCode
1954971
Title
An Application of Vertex Partition for Parallel Test Tasks Scheduling in Automatic Test System
Author
Xun, Xiao ; Jiangqing, Wang
Author_Institution
Dept. of Comput. Sci., South Central Univ. for Nat., Wuhan
Volume
2
fYear
2008
fDate
12-14 Dec. 2008
Firstpage
723
Lastpage
726
Abstract
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.
Keywords
graph theory; parallel processing; program testing; task analysis; automatic test system; graph theory; parallel test task scheduling; software development; system resources conflict; time precedence constraint; vertex partition; Automatic testing; Computer science; Graph theory; Instruments; Partitioning algorithms; Processor scheduling; Software engineering; Software testing; System testing; Time factors; Automatic Test System (ATS); Graph Coloring; Graph Theory; Parallel Testing Tasks Scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Software Engineering, 2008 International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-0-7695-3336-0
Type
conf
DOI
10.1109/CSSE.2008.1067
Filename
4722153
Link To Document