Sciweavers

Share
APPT
2007
Springer

Replication-Based Partial Dynamic Scheduling on Heterogeneous Network Processors

8 years 11 months ago
Replication-Based Partial Dynamic Scheduling on Heterogeneous Network Processors
It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on-Chip. This paper proposes a novel scheduling algorithm, called Replication-based Partial Dynamic Scheduling (RPDS). It aims to improve the NP performance by combining the strategies of partial dynamic mapping and task replication with a 2-phase scheduling. RPDS differs from existing solutions in several aspects, e.g., the processing elements are heterogeneous, fully-connected, and multi-threading, the application is decomposed into directed acyclic graph tasks with continuous data-packets, and scheduling is conducted at both of initialization and run-time. Experimental results showed our algorithm could increase the largest average throughput by about 30% than those without dynamic phase replication.
Zhiyong Yu, Zhiyi Yang, Fan Zhang, Zhiwen Yu, Tuan
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where APPT
Authors Zhiyong Yu, Zhiyi Yang, Fan Zhang, Zhiwen Yu, Tuanqing Zhang
Comments (0)
books