A tight bound on online buffer management for two-port shared-memory switches.
Koji M. KobayashiShuichi MiyazakiYasuo OkabePublished in: SPAA (2007)
Keyphrases
- shared memory
- buffer management
- multithreading
- lower bound
- message passing
- distributed memory
- parallel algorithm
- parallel computing
- real time database systems
- storage management
- virtual memory
- coarse grained
- real time
- replacement policy
- markov random field
- highly efficient
- data access
- flash memory
- distributed systems
- higher order
- databases