Abstract
This paper continues the study of the the allocation of memory to processors in a pipeline problem. This problem can be modeled as a variation of bin packing where each item corresponds to a different type and the normalized weight of each item can be greater than 1, which is the size of a bin. Furthermore, in this problem, items may be split arbitrarily, but each bin may contain at most k types of items, for any fixed integer k ≥ 2. The case of k = 2 was first introduced by Chung el al. who gave a 3/2-approximation asymptotically. In this paper, we generalize the result of Chung et al. to higher k. We show that NEXT FIT gives a \(\left(1+\frac 1 k\right)\)-approximation asymptotically, for k ≥ 2. Also, as a minor contribution, we rewrite the strong NP-hardness proof of Epstein and van Stee for this problem for k ≥ 3.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chung, F., Graham, R., Mao, J., Varghese, G.: Parallelism Versus Memory Allocation in Pipelined Router Forwarding Engines. Theory of Computing Systems 39(6), 829–849 (2006)
Culler, D., Singh, J., Gupta, A.: Parallel Computer Architecture, A Hardware/Software Approach. Morgan Kaufman, San Mateo (1999)
Epstein, L., van Stee, R.: Improved Results for a Memory Allocation Problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 362–373. Springer, Heidelberg (2007)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Johnson, D.S.: Fast Algorithms for Bin Packing. Journal of Computer and System Sciences 8(3), 272–314 (1974)
Ruiz-Sanchez, M., Biersack, E., Dabbous, W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network Magazine 15(2), 8–23 (2001)
Sikka, S., Varghese, G.: Memory Efficient State Lookups With Fast Updates. In: Applications, Technologies, Architectures, and Protocols for Computer Communication. ACM SIGCOMM, pp. 335–347 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Chedid, F.B. (2010). On Packing Splittable Items with Cardinality Constraints. In: Calude, C.S., Sassone, V. (eds) Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology, vol 323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15240-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-15240-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15239-9
Online ISBN: 978-3-642-15240-5
eBook Packages: Computer ScienceComputer Science (R0)