Search: 
 
Commands
  Search pubs database

Quick search by ...
Theme
  alternative
core
concurrent
resilient
self_test
heterogeneous
infrastructure
microarch
power
reliable
soft
verification
roadmap

Design Driver
  driver
Year
  2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


Group
  2006faculty
alternative
bee2
bk_partitioning
bk_placement
bk_routing
bookshelf
embedded
fabricsthrust
faculty
fresco
gsrc
gsrcadmin
gsrcexec
gsrc_faculty
gtx
infrax
marcov
mescal
metropolis
nexsis
polis
ptolemy
semantics
sig_modeling
sig_power
sig_uarch
sig_verification
testthrust
theme_leaders
 Automated Task Allocation for Network Processors
William Plishker, Kaushik Ravindran, Niraj Shah, Kurt Keutzer

Citation
William Plishker, Kaushik Ravindran, Niraj Shah, Kurt Keutzer. "Automated Task Allocation for Network Processors". Network System Design Conference Proceedings, 235-245, October, 2004.

Abstract
Network processors have great potential to combine high performance with increased flexibility. These multiprocessor systems consist of programmable elements, dedicated logic, and specialized memory and interconnection networks. However, the architectural complexity of the systems makes programming difficult. Programmers must be able to productively implement high performance applications for network processors to succeed. Ideally, designers describe applications in a domain specific language (DSL). DSLs expedite the development process by providing component libraries, communication and computation semantics, visualization tools, and test suites for an application domain. An integral aspect of mapping applications described in a DSL to network processors is allocating computational tasks to processing elements. We formulate this task allocation problem for a popular network processor, the Intel IXP1200. This method proves to be computationally efficient and produces results that are within 5% of aggregate egress bandwidths achieved by hand-tuned implementations on two representative applications: IPv4 forwarding and DiffServ.

Electronic downloads

Citation formats  

  • HTML
    William Plishker, Kaushik Ravindran, Niraj Shah, Kurt
    Keutzer. <a
    href="http://www.gigascale.org/pubs/576.html">Automated
    Task Allocation for Network Processors</a>, Network
    System Design Conference Proceedings, 235-245, October, 2004.
  • Plain text
    William Plishker, Kaushik Ravindran, Niraj Shah, Kurt
    Keutzer. "Automated Task Allocation for Network Processors".
    Network System Design Conference Proceedings, 235-245,
    October, 2004.
  • BibTeX
    @inproceedings{PlishkerRavindranShahKeutzer04_AutomatedTaskAllocationForNetworkProcessors,
        author = {William Plishker and Kaushik Ravindran and Niraj
                  Shah and Kurt Keutzer},
        title = {Automated Task Allocation for Network Processors},
        booktitle = {Network System Design Conference Proceedings},
        pages = {235-245},
        month = {October},
        year = {2004},
        abstract = {Network processors have great potential to combine
                  high performance with increased flexibility. These
                  multiprocessor systems consist of programmable
                  elements, dedicated logic, and specialized memory
                  and interconnection networks. However, the
                  architectural complexity of the systems makes
                  programming difficult. Programmers must be able to
                  productively implement high performance
                  applications for network processors to succeed.
                  Ideally, designers describe applications in a
                  domain specific language (DSL). DSLs expedite the
                  development process by providing component
                  libraries, communication and computation
                  semantics, visualization tools, and test suites
                  for an application domain. An integral aspect of
                  mapping applications described in a DSL to network
                  processors is allocating computational tasks to
                  processing elements. We formulate this task
                  allocation problem for a popular network
                  processor, the Intel IXP1200. This method proves
                  to be computationally efficient and produces
                  results that are within 5% of aggregate egress
                  bandwidths achieved by hand-tuned implementations
                  on two representative applications: IPv4
                  forwarding and DiffServ.},
        URL = {http://www.gigascale.org/pubs/576.html}
    }
    

Posted by William Plishker on 9 Nov 2004..

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.

 
You are not logged in
©1998-2009 GSRC