CHiP: a configurable hybrid parallel covering array constructor

Mercan, Hanefi and Yılmaz, Cemal and Kaya, Kamer (2018) CHiP: a configurable hybrid parallel covering array constructor. IEEE Transactions on Software Engineering . ISSN 0098-5589 (Print) 1939-3520 (Online) Published Online First http://dx.doi.org/10.1109/TSE.2018.2837759

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1109/TSE.2018.2837759


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
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:35220
Deposited By:Kamer Kaya
Deposited On:09 Aug 2018 13:40
Last Modified:09 Aug 2018 13:40

Repository Staff Only: item control page