Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bazaraa, M.S., Jarvis, J.J, and Sherali, H.D., Linear Programming and Network Flows, John Wiley and Sons, 1990.
Bertsimas, D., and Nino-Mora, J., “Conservation laws, extended polymatroids and multi-armed bandit problems: A unified approach to indexable systems,” Mathematics of Operations Research
Coman, E., and Mitrani, I., “A characterization of waiting time performance realizable by single server queues,” Operations Research 28, 1980, pp. 810–821.
Federgruen, A., and Groenevelt, H., “M/G/c Queueing systems with multiple customer classes: Characterization and control of achievable performance under non-preemptive priority rules, ” Management Science 34, 1988, pp. 1121–1138.
Federgruen, A., and Groenevelt, H., “The greedy procedure for resource allocation problems: Necessary and sufficient conditions for optimality,” Operations Research 34, 1988, pp. 909–918.
Fujishige, S., Submodular functions and optimization, North-Holland, 1991.
Gelenbe, E., and Mitrani, I., Analysis and synthesis of computer systems, Academic Press, 1980.
Grotschel, M., Lovasz, L., and Schrijver, A., “The ellipsoid method and its consequences in combinatorial optimization,” Cominatorica 1, 1981, pp. 169–197.
Lawler, E., and Martel, C., “Computing maximal polymatroidal network flows, ” Math. of Operations Research, 7, 1982, pp. 334–348.
Ross, K., and Yao, D., “Optimal dynamic scheduling in Jackson networks,” IEEE Transaction on Automatic Control 34, 1989, pp. 47–53.
Welsh, D., Matroid Theory, Academic Press, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kodialam, M.S. (2001). The Throughput of Sequential Testing. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-45535-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42225-9
Online ISBN: 978-3-540-45535-6
eBook Packages: Springer Book Archive