Computation of Ternary Covering Arrays Using a Grid
نویسندگان
چکیده
Grid technology emerged (mainly) in response to the need of making efficient use of underutilized computer resources, and the availability of many commercial and freeware grid management software is making a reality the dream of having huge distributed grid computing at reasonable costs. In this paper a brief introduction to the concept of grid computing is presented, and in order to evidence the usefulness of the grid computing approach, it was applied to compute instances of a hard NP-Complete problem, namely ternary covering arrays (CA) computation, using a mutation selection algorithm that ran using InnerGRID over a UPV’s computer cluster. Topics: Cluster and Grid Computing.
منابع مشابه
Profiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملA Branch and Bound Algorithm for Ternary Covering Arrays Construction Using Trinomial Coefficients
A ternary covering array (CA(N ; t, k, 3)) is an N × k array with entries from the set {0, 1, 2} where every N × t subarray contains each of the 3 combinations at least once. Here, t is called the strength, k the degree or number of factors, and the alphabet is set to 3. Covering arrays (CAs) are combinatorial designs that have applications in experimental designs and they have been proved to b...
متن کاملA Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients
This paper presents a simulated annealing (SA) algorithm for the construction of ternary covering arrays (CAs) using a trinomial coefficient representation. A ternary CA, denoted by CA(t, k, 3), is an N × k array where each N × t subarray contains each of the 3 combinations of symbols at least once. The construction of optimal CAs is, in general, an NP-complete problem. Many reported SA impleme...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کامل