Parallelism versus memory allocation in pipelined router forwarding engines

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 103-111

  Chung, Fan ^a   Graham, Ronald ^a   Varghese, George ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithm; Memory allocation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PACKET SWITCHING; POLYNOMIALS; PROBLEM SOLVING; ROUTERS; STORAGE ALLOCATION (COMPUTER);

MEMORY ALLOCATION ALGORITHMS; MEMORY SHARING; PIPELINED ROUTER FORWARDING ENGINES;

PARALLEL PROCESSING SYSTEMS;

EID: 8344275860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007928     Document Type: Conference Paper

References (13)

1. A. Basu and G. Narlikar, Fast Incremental Updates for Pipeline Forwarding Engines, InfoCom 2003.
2. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1976.
3. Guy E. Blelloch Phillip B. Gibbons Yossi Matias Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, volume 8, 1997.
4. D. Culler, J, Singh, and A. Gupta. Parallel Computer Architecture, A Hardware/Software Approach, Morgan Kaufman , 1999.
5. M. Degermark, A. Brodnik, S. Carlsson, and Stephen Pink, Small forwarding tables for fast routing lookups, Proc. SIGCOMM, (1997), 3-14.
6. M. R. Garey and D. S. Johnson, Computer and Intractability, A Guide to the Theory of NP-completeness, W. H. Freeman and Co., San Francisco, 1979.
7. M. R. Garey and D. S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM J. Comput., (1975), 397-411.
8. A. Ranade, How to emulate shared memory. Journal of Computer and System Sciences, 42:307-326, 1991.
9. B. Rau, Pseudo-randomly interleaved memory. In Proceedings Int. Symp. on Computer Architecture, 1991.
10. T.V. Lakshman and D. Staliadis, High Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching, Proc. ACM SIGCOMM '98, 1998.
11. M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, Survey and Taxonomy of IP Address Lookup Algorithms, IEEE Network, March/April 2001.
12. S. Sikka and G. Varghese, Memory Efficient State Lookups with Fast Updates, in Proceedings of SIGCOMM 2000, August 2000.
13. L. Valiant, A bridging model for parallel computation. Communications of the ACM, 33(8), 1990.