Max-Throughput for (Conservative) k-of-n Testing

Details Max-Throughput for (Conservative) k-of-n Testing Max-Throughput for (Conservative) k-of-n Testing

2011-09-15

arxiv.org/abs/1109.3401v1

Computer Science

Data Structures and Algorithms

An extended abstract of this paper will appear in the Proceedings of the 22nd International Symposium on Algorithms and Comput

Scientific paper

We define a variant of k-of-n testing that we call conservative k-of-n testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative k-of-n testing, in a parallel setting. This extends previous work of Kodialam and Condon et al., who presented combinatorial algorithms for parallel pipelined filter ordering, which is the special case where k=1 (or k = n). We also consider the problem of maximizing throughput for standard k-of-n testing, and show how to obtain a polynomial-time algorithm based on the ellipsoid method using previous techniques.

Affiliated with

Also associated with

No associations

Rating

Max-Throughput for (Conservative) k-of-n Testing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Max-Throughput for (Conservative) k-of-n Testing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Max-Throughput for (Conservative) k-of-n Testing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-673665