Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Mathematics of Operations Research
Analysis and Synthesis of Computer Systems: Texts)
Analysis and Synthesis of Computer Systems: Texts)
Max-throughput for (conservative) k-of-n testing
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Parallel pipelined filter ordering with precedence constraints
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
This paper addresses the problem of determining the maximum achievable throughput in a sequential testing system. The input to the system are n bit binary strings. There are n tests in the system, and if a string is subjected to test j then the test determines if bit j in that string is zero or one. The objective of the test system is to check if the sum of the bits in each incoming string is zero or not. The mean time taken to perform each test and the probability that bit j is one are known. The objective of this paper is to determine the maximum input rate that can be processed by this system. The problem of determining the maximum throughput is first formulated as a a quadratic programming problem over a polymatroid with some additional structure. The special structure of the polymatroid polyhedron is exploited to derive an O(n2) algorithm to solve the maximum throughput problem.