The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 23)
ISSN: 1045-9219
pp: 1934-1943
Qiang Wu , Juniper Networks, Inc., Sunnyvale
Tilman Wolf , University of Massachusetts, Amherst
Computer networks require increasingly complex packet processing functions in the data plane to adapt to new requirements. To meet performance demands, packet processing systems on routers employ multiple processor cores. To efficiently utilize processing resources in such systems, we propose a novel methodology for allocating tasks to processors. The main idea is to obtain runtime profiling information and to duplicate tasks with heavy processing requirements. Using our duplication algorithm, a balanced workload can be obtained and the complexity of packing tasks with different processing requirements can be reduced. By translating traffic characteristics into processing requirements, the system is able to adapt to dynamic changes in the workload and balance the utilization of all processing resources to maximize system throughput. Our approach can adapt to any traffic change in a single iteration, whereas existing adaptive approaches may require multiple steps. Results from our prototype implementation based on the Click modular router show that our system only requires on average 5.3-31.5 percent of the adaptation steps that are necessary in iterative systems. In addition, our system achieves a throughput that is 1.32 times higher than the throughput achieved with symmetric multiprocessing support with general-purpose task allocation.
Decision support systems, Silicon, Mercury (metals), scheduling, Network router, multicore processor, network processor, task allocation

T. Wolf and Q. Wu, "Runtime Task Allocation in Multicore Packet Processing Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1934-1943, 2012.
88 ms
(Ver 3.3 (11022016))