Taming the IXP network processor

ACM SIGPLAN Notices

Volumn 38, Issue 5, 2003, Pages 26-37

  George, Lal ^a   Blume, Matthias ^b  

^a Network Speed Technologies

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Bank assignment; Code generation; Integer linear programming; Intel IXA; Network processors; Programming languages; Register allocation

Indexed keywords

HIGH LEVEL LANGUAGES; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROGRAM COMPILERS; RESOURCE ALLOCATION; SHIFT REGISTERS;

INTEGER LINEAR PROGRAMMING; NETWORK PROCESSOR;

SOFTWARE ENGINEERING;

EID: 1442288819     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/780822.781135     Document Type: Conference Paper

References (25)

1. 3GPP. Specification of the 3GPP confidentiality and integrity algorithms. Version 1.2, Sept. 2000.
2. A. W. Appel. Compiling with Continuations. Cambridge University Press, Cambridge, England, 1992.
3. A. W. Appel. SSA is functional programming. ACM SIGPLAN Notices, 33(4):17-20, April 1998.
4. A. W. Appel and L. George, Optimal spilling for CISC machines with few registers. In SIGPLAN Conference on Programming Language Design and Implementation, pages 243-253, 2001.
5. A. W. Appel and D. B. MacQueen. A Standard ML compiler. In G. Kahn, editor, Functional Programming Languages and Computer Architecture (LNCS 274), pages 301-24, New York, 1987, Springer-Verlag.
6. U. Boquist. Interprocedural register allocation for lazy functional languages. In Proceedings of the 1995 Conference on Functional Programming Languages and Computer Architecture (FPCA), La Jolla, California, USA, June 1995.
7. W. D. Clinger, A. Hartheimer, and E. Ost. Implementation strategies for first-class continuations. Higher-Order and Symbolic Computation, 12(1):7-45, 1999.
8. CPLEX mixed integer solver. www.cplex.com 2000.
9. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Prog. Lang. Syst., 13(4):451-490, October 1991.
10. J. Daemen and V. Rijmen. The block cipher rijndael, pages 288-296. LNCS 1820. Springer-Verlag, 2000. J.-J. Quisquater and B. Schneier, Eds.
11. J. Daemen and V. Rijmen. Rijndael the advanced encryption standard. Dr. Dobb's journal, 26(3):137-139, March 2001.
12. J. R. Ellis. Bulldog: A compiler for VLIW architectures. The MIT Press, 1986.
13. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 237-247, New York, 1993. ACM Press.
14. R. Fourer, D. M. Gay, and B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming. Scientific Press, South San Francisco, CA, 1993.
15. C. Fu and K. Wilken. A faster optimal register allocator. In The 35th Annual IEEE/ACM International Symp. on Microarchitecture. IEEE/ACM, November 2002.
16. L. George and A. W. Appel. Iterated register coalescing. ACM transactions on programming languages and systems., 18(3):300-324, May 1996.
17. E. Grosse and Lakshman Y. N. Network processors applied to IPv4/IPv6 transition. Bell Labs Report.
18. R. A. Kelsey. A correspondence between continuation passing style and static single assignment form. In Proceedings ACM SIGPLAN Workshop on Intermediate Representations, volume 30, pages 13-22. ACM Press, Mar. 1995.
19. T. Kong and K. D. Wilken. Precise register allocation for irregular architectures. In 31st International Microarchitecture Conference. ACM, December 1998.
20. J. Park and S.-M. Moon. Optimistic register coalescing. In Proceedings of the 1998 International Conference on Parallel Architecture and Compilation Techniques, pages 196-204, 1998.
21. B. Scholz and E. Eckstein. Register allocation for irregular architectures. In LCTES/SCOPES. ACM, June 2002.
22. R. Sharp, M. Blott, M. Coss, B. Ellis, D. Majette, and V. Purohit. Starburst: Building next-generation internet devices. Bell Labs Technical Journal, 6(2):6-17, 2001.
23. C. Strachey and C. Wadsworth. Continuations: A mathematical semantics which can deal with full jumps. Technical Monograph PRG-11, Programming Research Group, Oxford University, 1974.
24. S. Tallam and R. Gupta. Bitwidth aware global register allocation. In 30th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 85-96. ACM, January 2003.
25. Y. Wu and J. R. Larus, Static branch frequency and program profile analysis. In 27th IEEE/ACM Inter'l Symp. on microarchitecture (MICRO-27). IEEE/ACM, Nov. 1994.