Algorithms for Test Suite Split in Multi Machine Setup with Symmetrical and Asymmetrical Machine Execution Speeds

{"title":"Algorithms for Test Suite Split in Multi Machine Setup with Symmetrical and Asymmetrical Machine Execution Speeds","authors":"","doi":"10.33140/jsndc.04.02.09","DOIUrl":null,"url":null,"abstract":"Regression test suite study can be on various parameters such as code and requirement coverage, test suite execution time reduction. The focus of the article is on reduction of test suite execution in multi machine setup. Two cases are possible. Test setup with symmetrical execution speed of machines and asymmetrical execution speeds. This article proposes four algorithms for both symmetrical and asymmetrical execution combined. Our previous published article explains the case of identical split for identical execution speed machines and weighted split for asymmetrical execution speed cases. We build on those two algorithms and total four algorithms are proposed. Two new algorithms are being proposed in this article. The logic underlying these algorithms is efficient usage of execution speeds of the machines. Although the article is for regression test suite execution, the algorithms can be beneficial in all cases where queuing is involved and service time of each entity is known prior. The algorithm and python version of the code is shared in this article for ready reference. While the algorithms can be beneficial for the test suite execution reduction for edge cases where order of test cases execution is must these algorithms should not be used. As mentioned earlier the algorithms can also be used in situations where there are queues involved and serial, fixed time service takes place for each of the entity being served.","PeriodicalId":517894,"journal":{"name":"Journal of Sensor Networks and Data Communications","volume":" 14","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Sensor Networks and Data Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33140/jsndc.04.02.09","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Regression test suite study can be on various parameters such as code and requirement coverage, test suite execution time reduction. The focus of the article is on reduction of test suite execution in multi machine setup. Two cases are possible. Test setup with symmetrical execution speed of machines and asymmetrical execution speeds. This article proposes four algorithms for both symmetrical and asymmetrical execution combined. Our previous published article explains the case of identical split for identical execution speed machines and weighted split for asymmetrical execution speed cases. We build on those two algorithms and total four algorithms are proposed. Two new algorithms are being proposed in this article. The logic underlying these algorithms is efficient usage of execution speeds of the machines. Although the article is for regression test suite execution, the algorithms can be beneficial in all cases where queuing is involved and service time of each entity is known prior. The algorithm and python version of the code is shared in this article for ready reference. While the algorithms can be beneficial for the test suite execution reduction for edge cases where order of test cases execution is must these algorithms should not be used. As mentioned earlier the algorithms can also be used in situations where there are queues involved and serial, fixed time service takes place for each of the entity being served.
在机器执行速度对称和不对称的多机器设置中拆分测试套件的算法
对回归测试套件的研究可以采用多种参数,如代码和需求覆盖率、测试套件执行时间缩减等。本文的重点是减少多机器设置下的测试套件执行时间。有两种情况。机器执行速度对称的测试设置和执行速度不对称的测试设置。本文针对对称执行和非对称执行两种情况提出了四种算法。我们之前发表的文章解释了相同执行速度机器的相同拆分和非对称执行速度情况下的加权拆分。我们以这两种算法为基础,共提出了四种算法。本文提出了两种新算法。这些算法的基本逻辑是有效利用机器的执行速度。虽然本文针对的是回归测试套件的执行,但在涉及队列和每个实体的服务时间已知的所有情况下,这些算法都是有益的。本文分享了算法和 python 版本的代码,以供随时参考。虽然这些算法有利于减少测试套件的执行,但在必须遵守测试用例执行顺序的边缘情况下,不应使用这些算法。如前所述,这些算法还可用于涉及队列和为每个被服务实体提供串行、固定时间服务的情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信