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 条
  • [31] Hybrid Embarrassingly Parallel algorithm for heterogeneous CPU/GPU clusters
    Yang, Bo
    Lu, Kai
    Liu, Jie
    Wang, Xiaoping
    Gong, Chunye
    2012 7TH INTERNATIONAL CONFERENCE ON COMPUTING AND CONVERGENCE TECHNOLOGY (ICCCT2012), 2012, : 373 - 378
  • [32] CRBLASTER: A Parallel-Processing Computational Framework for Embarrassingly Parallel Image-Analysis Algorithms
    Mighell, Kenneth John
    PUBLICATIONS OF THE ASTRONOMICAL SOCIETY OF THE PACIFIC, 2010, 122 (896) : 1236 - 1245
  • [33] An embarrassingly parallel algorithm for random walk simulations on random fractal structures
    Lang, Jens
    Prehl, Janett
    JOURNAL OF COMPUTATIONAL SCIENCE, 2017, 19 : 1 - 10
  • [34] Impact of Design Decisions on Performance of Embarrassingly Parallel .NET Database Application
    Karwaczynski, Piotr
    Sitko, Marcin
    Pietras, Sylwia
    Marczuk, Bogdan
    Kwiatkowski, Jan
    Fras, Marius
    RECENT CHALLENGES IN INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2022, 2022, 1716 : 238 - 250
  • [35] Multi-Objective Embarrassingly Parallel Search with Upper Bound Constraints
    Miyamoto, T.
    Yasuhara, M.
    Mori, K.
    Kitamura, S.
    Izui, Y.
    2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 1334 - 1339
  • [36] Embarrassingly Parallel Acceleration of Global Tractography via Dynamic Domain Partitioning
    Wu, Haiyong
    Chen, Geng
    Jin, Yan
    Shen, Dinggang
    Yap, Pew-Thian
    FRONTIERS IN NEUROINFORMATICS, 2016, 10
  • [37] Point-Counting Method for Embarrassingly Parallel Evaluation in Secure Computation
    Krips, Toomas
    Willemson, Jan
    FOUNDATIONS AND PRACTICE OF SECURITY (FPS 2015), 2016, 9482 : 66 - 82
  • [38] Impact of Design Decisions on Performance of Embarrassingly Parallel .NET Database Application
    Karwaczynski, Piotr
    Sitko, Marcin
    Pietras, Sylwia
    Marczuk, Bogdan
    Wasielewski, Mariusz
    Kwiatkowski, Jan
    Fras, Mariusz
    VIETNAM JOURNAL OF COMPUTER SCIENCE, 2025, 12 (01) : 101 - 122
  • [39] Parallel Execution of Programs as a Support for Mutation Testing: A Replication Study
    Delamaro, Marcio E.
    Andrade, Stevao A.
    de Souza, Simone R. S.
    de Souza, Paulo S. L.
    INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2021, 31 (03) : 337 - 380
  • [40] Optimization Monte Carlo: Efficient and Embarrassingly Parallel Likelihood-Free Inference
    Meeds, Edward
    Welling, Max
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28