Pages that link to "Item:Q863192"
From MaRDI portal
The following pages link to Parallelism versus memory allocation in pipelined router forwarding engines (Q863192):
Displaying 10 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Efficient algorithms for dynamic allocation of distributed memory (Q1293882) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Improved results for a memory allocation problem (Q2429723) (← links)
- Scheduling with Interjob Communication on Parallel Processors (Q2958346) (← links)
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints (Q5443386) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)