Adaptive Load Sharing for Network Processors
نویسندگان
چکیده
منابع مشابه
Power-Adaptive Network Processors
This paper explores the notion of dynamically scaling the architectural resources of network processor systems with the aim reducing their overall power consumption levels. We show that when faced with a realistic traffic load characterized by a high degree of burstiness, a network processor architecture wastes a non-trivial fraction of total power consumed. We then suggest a simple software ap...
متن کاملLoad Sharing with OCGRR for Network Processors Which Supports Different services
A new scheme for packet transaction in a router is used, which provides load sharing among multiple network processors for various traffic patterns by introducing an OCGRR scheduler at the output port of the core router and multiprocessors . A feedback control mechanism prevents processor overload. The incoming traffic is scheduled by using a mapping formula derived from the robust hash routing...
متن کاملTHE PERFORMANCE LIMITS OF A TWO - DIMENSIONAL NETWORK OF LOAD - SHARING PROCESSORS Jacek
A process of computation in a two-dimensional mesh of processors is analysedd in this work. A computational taskk is assumedd to be arbitrarily divisible between processors. The loadd of the job is transferre dd from the originatingg processor to other processors by a point to point communication n etwork. Communication delays are taken into consideration. The time costs of computation andd com...
متن کاملThe Performance Limits of a Two-dimensional Network of Load-sharing Processors
A process of computation in a two-dimensional mesh of processors is analysed in this work. A computational task is assumed to be arbitrarily divisible between processors. The load of the job is transferred from the originating processor to other processors by a point to point communication network. Communication delays are taken into consideration. The time costs of computation and communicatio...
متن کاملMethodical Analysis of Adaptive Load Sharing Algorithms
This paper presents a method for qualitative and quantitative analysis of load sharing algorithms, using a number of well known examples as illustration. Algorithm design choices are considered with respect to the main activities of information dissemination and allocation decision making. We argue that nodes must be capable of making local decisions, and for this efficient state dissemination ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2008
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2007.909839