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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
