*banner
 

NP-Click: A Programming Model for the Intel IXP1200
Niraj Shah, William Plishker, Kurt Keutzer

Citation
Niraj Shah, William Plishker, Kurt Keutzer. "NP-Click: A Programming Model for the Intel IXP1200". Proc. Of 2nd Workshop on Network Processors (NP-2), 9th International Symposium on High Performance Computer Architectures (HPCA), P. Crowley, M. Franklin, H. Hadimioglu, P. Onufryk (eds.), 181-201, 2003; Appears in Network Processor Design: Issues and Practices, Volume 2 .

Abstract
The architectural diversity and complexity of network processor architectures motivate the need for a more natural abstraction of the underlying hardware. In this paper, we describe a programming model, NPClick, which makes it possible to write efficient code and improve application performance without having to understand all of the details of the target architecture. Using this programming model, we implement the data plane of an IPv4 router on a particular network processor, the Intel IXP1200, and compare results with a hand-coded implementation. Our results show the IPv4 router written in NP-Click performs within 7% of a hand-coded version of the same application using a realistic packet mix.

Electronic downloads

Citation formats  
  • HTML
    Niraj Shah, William Plishker, Kurt Keutzer. <a
    href="http://chess.eecs.berkeley.edu/pubs/744.html"
    >NP-Click: A Programming Model for the Intel
    IXP1200</a>, Proc. Of 2nd Workshop on Network
    Processors (NP-2), 9th International Symposium on High
    Performance Computer Architectures (HPCA), P. Crowley, M.
    Franklin, H. Hadimioglu, P. Onufryk (eds.), 181-201, 2003;
    Appears in Network Processor Design: Issues and Practices,
    Volume 2
    .
  • Plain text
    Niraj Shah, William Plishker, Kurt Keutzer. "NP-Click:
    A Programming Model for the Intel IXP1200". Proc. Of
    2nd Workshop on Network Processors (NP-2), 9th International
    Symposium on High Performance Computer Architectures (HPCA),
    P. Crowley, M. Franklin, H. Hadimioglu, P. Onufryk (eds.),
    181-201, 2003; Appears in Network Processor Design: Issues
    and Practices, Volume 2
    .
  • BibTeX
    @inproceedings{ShahPlishkerKeutzer03_NPClickProgrammingModelForIntelIXP1200,
        author = {Niraj Shah and William Plishker and Kurt Keutzer},
        title = {NP-Click: A Programming Model for the Intel IXP1200},
        booktitle = {Proc. Of 2nd Workshop on Network Processors
                  (NP-2), 9th International Symposium on High
                  Performance Computer Architectures (HPCA)},
        editor = {P. Crowley, M. Franklin, H. Hadimioglu, P. Onufryk},
        pages = {181-201},
        year = {2003},
        note = {Appears in Network Processor Design: Issues and
                  Practices, Volume 2
    },
        abstract = {The architectural diversity and complexity of
                  network processor architectures motivate the need
                  for a more natural abstraction of the underlying
                  hardware. In this paper, we describe a programming
                  model, NPClick, which makes it possible to write
                  efficient code and improve application performance
                  without having to understand all of the details of
                  the target architecture. Using this programming
                  model, we implement the data plane of an IPv4
                  router on a particular network processor, the
                  Intel IXP1200, and compare results with a
                  hand-coded implementation. Our results show the
                  IPv4 router written in NP-Click performs within 7%
                  of a hand-coded version of the same application
                  using a realistic packet mix.},
        URL = {http://chess.eecs.berkeley.edu/pubs/744.html}
    }
    

Posted by Christopher Brooks on 4 Nov 2010.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess