A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Program mapping onto network processors by recursive bipartitioning and refining
2007
Proceedings - Design Automation Conference
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network application domains. A remarkable difference with general multiprocessor task scheduling is that NPs are often programmed into a hybrid parallel and pipeline topology. In this paper, we introduce a multilevel balancing and refining algorithm for NP program mapping. We use a divideand-conquer approach to recursively
doi:10.1145/1278480.1278681
dblp:conf/dac/YuYBY07
fatcat:f2boqepclbauho5twbui4ymjlq