Task assignment for network processor pipelines using GA

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In several commercial network processors programming environments, programmer must manually assign many processing tasks to the processor pipelines which consist of many processing engines. Due to the large exploration space, this manual procedure is usually very tedious and inefficient and the optimal or even near-optimal assignment scheme may be difficult to obtain. This paper proposes an automated task-to-PE assignment algorithm based on genetic algorithm. Experimental results show that this method can quickly obtain near-GNPoptimal solutions from the large solution space and the algorithm execution time is decoupled with pipeline stages. These two features make this method very suitable to be used in a NP application development environment and provide a more efficient development experience for developers. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Yan, S., Zhou, X., Wang, L., Zhang, F., & Wang, H. (2005). Task assignment for network processor pipelines using GA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3756 LNCS, pp. 244–252). Springer Verlag. https://doi.org/10.1007/11573937_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free