Parallelism versus memory allocation in pipelined router forwarding engines

DOI10.1007/s00224-006-1249-3zbMath1113.68036OpenAlexW1987017632MaRDI QIDQ863192

George Varghese, Jia Mao, Fan R. K. Chung, Ronald L. Graham

Publication date: 25 January 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-006-1249-3

zbMATH Keywords

fast online algorithms

Mathematics Subject Classification ID

Computer system organization (68M99) Distributed systems (68M14)

Related Items

Scheduling shared continuous resources on many-cores, Scheduling with interjob communication on parallel processors, Mathematical programming algorithms for bin packing problems with item fragmentation, Exactly solving packing problems with fragmentation, EPTAS for the dual of splittable bin packing with cardinality constraint, Scheduling with Interjob Communication on Parallel Processors, Approximation schemes for packing splittable items with cardinality constraints, Improved results for a memory allocation problem, Approximation Schemes for Packing Splittable Items with Cardinality Constraints