TY - GEN
T1 - Concurrent test algebra execution with combinatorial testing
AU - Tsai, Wei Tek
AU - Luo, Jie
AU - Qi, Guanqiu
AU - Wu, Wenjun
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Software-as-a-Service (SaaS), a new software delivery model, plays an important role in daily life. In SaaS, mission-critical applications are composed, deployed, and executed on cloud platforms. SaaS applications needed to have high reliability and availability before publishing. Testing SaaS applications becomes important, as the large number of testing prior to their deployment. Test Algebra (TA), a algebraic system, identifies faults in combinatorial testing for SaaS applications using existing test results and eliminates those related faults. Although TA eliminates a large number of configurations from considerations, it is still difficult to finish testing enormous combinations of services in a reasonable time. To improve TA analysis, this paper proposes a concurrent TA analysis. It allocates workloads into different clusters of computers and performs TA analysis from 2-way to 6-way configurations. Different database designs are used to store the test results of various configurations. Faulty and operational table search algorithms are proposed to retrieve existing test results. One 25-component experiment is simulated using the proposed solutions. The same experiment is also simulated on multiple processors for concurrent TA analysis.
AB - Software-as-a-Service (SaaS), a new software delivery model, plays an important role in daily life. In SaaS, mission-critical applications are composed, deployed, and executed on cloud platforms. SaaS applications needed to have high reliability and availability before publishing. Testing SaaS applications becomes important, as the large number of testing prior to their deployment. Test Algebra (TA), a algebraic system, identifies faults in combinatorial testing for SaaS applications using existing test results and eliminates those related faults. Although TA eliminates a large number of configurations from considerations, it is still difficult to finish testing enormous combinations of services in a reasonable time. To improve TA analysis, this paper proposes a concurrent TA analysis. It allocates workloads into different clusters of computers and performs TA analysis from 2-way to 6-way configurations. Different database designs are used to store the test results of various configurations. Faulty and operational table search algorithms are proposed to retrieve existing test results. One 25-component experiment is simulated using the proposed solutions. The same experiment is also simulated on multiple processors for concurrent TA analysis.
KW - Combinatorial testing
KW - SaaS
KW - algebra
KW - concurrent
UR - http://www.scopus.com/inward/record.url?scp=84903640107&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84903640107&partnerID=8YFLogxK
U2 - 10.1109/SOSE.2014.11
DO - 10.1109/SOSE.2014.11
M3 - Conference contribution
AN - SCOPUS:84903640107
SN - 9781479925049
T3 - Proceedings - IEEE 8th International Symposium on Service Oriented System Engineering, SOSE 2014
SP - 35
EP - 46
BT - Proceedings - IEEE 8th International Symposium on Service Oriented System Engineering, SOSE 2014
PB - IEEE Computer Society
T2 - 8th IEEE International Symposium on Service Oriented System Engineering, SOSE 2014
Y2 - 7 April 2014 through 11 April 2014
ER -