Parallelism versus memory allocation in pipelined router forwarding engines

DOI10.1007/S00224-006-1249-3zbMATH Open1113.68036OpenAlexW1987017632MaRDI QIDQ863192FDOQ863192

Fan Chung, Ron Graham, George Varghese, Jia Mao

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

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

Cited In (9)

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

   Recommendations

• Efficient algorithms for dynamic allocation of distributed memory 👍 👎
• Parallel algorithms for routing in nonblocking networks 👍 👎
• Title not available (Why is that?) 👍 👎
• Dynamic parallel memories 👍 👎
• A fast parallel algorithm for routing in permutation networks 👍 👎

This page was built for publication: Parallelism versus memory allocation in pipelined router forwarding engines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863192)