Approximation algorithm for data mapping on block multi-threaded network processor architectures

Chris Ostler, Karam S. Chatha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Network processor architectures incorporate block multi-threading to alleviate the performance degradation due to memory access latencies. Application design on such architectures requires the determination of the number of threads, and mapping of data items to the various memory elements such that the overall throughput is maximized. The paper presents a quasi-polynomial time approximation algorithm for the multi-threading aware data mapping problem which can be shown to be NP complete. The algorithm generates solutions with throughput no less than 1/2(1+ε) of optimal and data memory requirements no more than (1 + ε) times the memory constraints. Experimental results obtained by mapping applications on the Intel IXP 2400 network processor demonstrate that the algorithm is able to generate solutions whose throughput is within 80% of the optimal when ε = 0.5.

Original languageEnglish (US)
Title of host publication2007 44th ACM/IEEE Design Automation Conference, DAC'07
Pages801-804
Number of pages4
DOIs
StatePublished - Aug 2 2007
Event2007 44th ACM/IEEE Design Automation Conference, DAC'07 - San Diego, CA, United States
Duration: Jun 4 2007Jun 8 2007

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0738-100X

Other

Other2007 44th ACM/IEEE Design Automation Conference, DAC'07
CountryUnited States
CitySan Diego, CA
Period6/4/076/8/07

    Fingerprint

Keywords

  • Block multi-threading
  • Network processing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Ostler, C., & Chatha, K. S. (2007). Approximation algorithm for data mapping on block multi-threaded network processor architectures. In 2007 44th ACM/IEEE Design Automation Conference, DAC'07 (pp. 801-804). [4261293] (Proceedings - Design Automation Conference). https://doi.org/10.1109/DAC.2007.375274