CHiP: a configurable hybrid parallel covering array constructor

Mercan, Hanefi and Yılmaz, Cemal and Kaya, Kamer (2019) CHiP: a configurable hybrid parallel covering array constructor. IEEE Transactions on Software Engineering, 45 (12). pp. 1270-1291. ISSN 0098-5589 (Print) 1939-3520 (Online)

This is the latest version of this item.

Full text not available from this repository. (Request a copy)


We present a configurable, hybrid, and parallel covering array constructor, called CHiP. CHiP is parallel in that it utilizes vast amount of parallelism provided by graphics processing units (GPUs). CHiP is hybrid in that it bundles the bests of two construction approaches for computing covering arrays; a metaheuristic search-based approach for efficiently covering a large portion of the required combinations and a constraint satisfaction-based approach for effectively covering the remaining hard-to-cover-by-chance combinations. CHiP is configurable in that a trade-off between covering array sizes and construction times can be made. We have conducted a series of experiments, in which we compared the efficiency and effectiveness of CHiP to those of a number of existing constructors by using both full factorial designs and well-known benchmarks. In these experiments, we report new upper bounds on covering array sizes, demonstrating the effectiveness of CHiP, and the first results for a higher coverage strength, demonstrating the scalability of CHiP.
Item Type: Article
Uncontrolled Keywords: constraint satisfaction problem; Covering arrays; CUDA; graphics processing units; metaheuristic search; parallel computing
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Cemal Yılmaz
Date Deposited: 15 Jun 2023 16:09
Last Modified: 15 Jun 2023 16:09

Available Versions of this Item

Actions (login required)

View Item
View Item