EMINENT: EMbarrassINgly parallEl mutatioN Testing

被引:5
|
作者
Canizares, Pablo C. [1 ]
Merayo, Mercedes G. [1 ]
Nunez, Alberto [1 ]
机构
[1] Univ Complutense Madrid, Madrid, Spain
来源
INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2016 (ICCS 2016) | 2016年 / 80卷
关键词
Mutation testing; Scientific Computing; Parallel and Distributed Computing; SYSTEMS;
D O I
10.1016/j.procs.2016.05.298
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
During the last decade, the fast evolution in communication networks has facilitated the development of complex applications that manage vast amounts of data, like Big Data applications. Unfortunately, the high complexity of these applications hampers the testing process. Moreover, generating adequate test suites to properly check these applications is a challenging task due to the elevated number of potential test cases. Mutation testing is a valuable technique to measure the quality of the selected test suite that can be used to overcome this difficulty. However, one of the main drawbacks of mutation testing lies on the high computational cost associated to this process. In this paper we propose a dynamic distributed algorithm focused on HPC systems, called EMINENT, which has been designed to face the performance problems in mutation testing techniques. EMINENT alleviates the computational cost associated with this technique since it exploits parallelism in cluster systems to reduce the final execution time. In addition, several experiments have been carried out on three applications in order to analyse the scalability and performance of EMINENT. The results show that EMINENT provides an increase in the speed-up in most scenarios.
引用
收藏
页码:63 / 73
页数:11
相关论文
共 50 条
  • [41] The application of nearly embarrassingly parallel computation in the optimization of fluid-film lubrication
    Wang, NZ
    Chang, YZ
    Tsai, CM
    TRIBOLOGY TRANSACTIONS, 2004, 47 (01) : 34 - 42
  • [42] EMBARRASSINGLY PARALLEL ALGORITHMS FOR ALGEBRAIC NUMBER ARITHMETIC - AND SOME LESS TRIVIAL ISSUES
    WEEKS, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 584 : 63 - 70
  • [43] Software Alchemy: Turning Complex Statistical Computations into Embarrassingly-Parallel Ones
    Matloff, Norman
    JOURNAL OF STATISTICAL SOFTWARE, 2016, 71 (04):
  • [44] Performance Analysis of OpenMP Scheduling Type on Embarrassingly Parallel Matrix Multiplication Algorithm
    Qun, Ng Hui
    Khalib, Z. I. A.
    Raof, R. A. A.
    RECENT TRENDS IN INFORMATION AND COMMUNICATION TECHNOLOGY, 2018, 5 : 917 - 925
  • [45] Energy-Aware Scheduling of Embarrassingly Parallel Jobs and Resource Allocation in Cloud
    Shi, Li
    Zhang, Zhemin
    Robertazzi, Thomas
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (06) : 1607 - 1620
  • [46] Embarrassingly Parallel Independent Training of Multi-Layer Perceptrons with Heterogeneous Architectures
    Farias, Felipe C.
    Ludermir, Teresa B.
    Bastos-Filho, Carmelo J. A.
    AI, 2022, 4 (01) : 16 - 27
  • [47] EPCWebX: An unsophisticated approach for Embarrassingly Parallel Computations over the Web using XAMPP stack
    Meduri, Suryaa Pranav
    Tiruvayipati, Sujanavan
    PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICCS), 2019, : 214 - 218
  • [48] Embarrassingly Parallel GPU Based Matrix Inversion Algorithm for Big Climate Data Assimilation
    Varalakshmi, M.
    Kesarkar, Amit Parashuram
    Lopez, Daphne
    INTERNATIONAL JOURNAL OF GRID AND HIGH PERFORMANCE COMPUTING, 2018, 10 (01) : 71 - 92
  • [49] A Network Substrate for Peer-to-Peer Grid Computing beyond Embarrassingly Parallel Applications
    Schulz, Sven
    Blochinger, Wolfgang
    Poths, Mathias
    2009 WRI INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND MOBILE COMPUTING: CMC 2009, VOL 3, 2009, : 60 - +
  • [50] WHERE ARE EMBARRASSINGLY PARALLEL PROBLEMS - THE ATOM-DIATOM QUASI-CLASSICAL REACTIVITY
    LAGANA, A
    GERVASI, O
    BARAGLI, R
    LAFORENZA, D
    PEREGO, R
    THEORETICA CHIMICA ACTA, 1993, 84 (4-5): : 413 - 421