Resource mapping and scheduling for heterogeneous network processor systems

Authors:
Liang Yang;Tushar Gohad;Pavel Ghosh;Devesh Sinha;Arunabha Sen;Andrea Richa
Affiliations:
Arizona State University, Tempe, AZ;MontaVista Software, Tempe, AZ;Arizona State University, Tempe, AZ;Arizona State University, Tempe, AZ;Arizona State University, Tempe, AZ;Arizona State University, Tempe, AZ
Venue:
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Year:
2005

Citing 6
Cited 1

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
TGFF: task graphs for free

Proceedings of the 6th international workshop on Hardware/software codesign
Hardware-Software partitioning and pipelined scheduling of transformative applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Multi-objective design space exploration using genetic algorithms

Proceedings of the tenth international symposium on Hardware/software codesign
Hardware/Software Partitioning using Integer Programming

EDTC '96 Proceedings of the 1996 European conference on Design and Test
Hardware/software partitioning for multifunction systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Replication-based partial dynamic scheduling on heterogeneous network processors

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first problem is to find the task to resource mapping that minimizes the design cost subject to all design constraints. The goal of the second problem is to find the mapping that maximizes the performance, subject to all architectural constraints. To meet the design goals in performance, it may be necessary to allow multiple packets to be inside the system at any given instance of time and this may give rise to the resource contention between packets. In this paper, a Randomized Rounding (RR) based solution is presented for the task to resource mapping and scheduling problem. We also proposed two techniques to detect and eliminate the resource contention. We evaluate the efficacy of our RR approach through extensive simulation. The simulation results demonstrate that this approach produces near optimal solutions in almost all instances of the problem in a fraction of time needed to find the optimal solution. The quality of the solution produced by this approach is also better than often used list scheduling algorithm for task to resource mapping problem. Finally, we demonstrate with a case study, the results of a Network Processor design and scheduling problem using our techniques.