计算机科学
集合(抽象数据类型)
网络元件
考试(生物学)
分布式计算
数据挖掘
算法
计算机网络
生物
古生物学
程序设计语言
作者
Alan Williams,Robert L. Probert
标识
DOI:10.1109/issre.1996.558835
摘要
Distributed systems consist of a number of network elements that interact with each other. As the number of network elements and interchangeable components for each network element increases, the trade-off that the system tester faces is the thoroughness of test configuration coverage vs. limited resources of time and expense that are available. An approach to resolving this trade-off is to determine a set of test configurations that test each pair-wise combination of network components. This goal gives a well-defined level of test coverage, with a reduced number of system configurations. To select such a set of test configurations, we show how to apply the method of orthogonal Latin squares, from the design of balanced statistical experiments. Since the theoretical treatment assumes constraints that may not be satisfied in practice, we then show how to adapt this approach to realistic application constraints.
科研通智能强力驱动
Strongly Powered by AbleSci AI