Show simple item record

dc.contributor.advisorJohn, Lizy Kurian
dc.creatorIqbal, Muhammad Faisalen
dc.date.accessioned2013-09-06T20:54:28Zen
dc.date.accessioned2017-05-11T22:33:27Z
dc.date.available2017-05-11T22:33:27Z
dc.date.issued2013-08en
dc.date.submittedAugust 2013en
dc.identifier.urihttp://hdl.handle.net/2152/21143en
dc.descriptiontexten
dc.description.abstractNetwork Processors are multicore processors capable of processing network packets at wire speeds of multi-Gbps. Due to their high performance and programmability, these processors have become the main computing elements in many demanding network processing equipments like enterprise, edge and core routers. With the ever increasing use of the internet, the processing demands of these routers have also increased. As a result, the number and complexity of the cores in network processors have also increased. Hence, efficiently managing these cores has become very challenging. This dissertation discusses two main issues related to efficient usage of large number of parallel cores in network processors: (1) How to allocate work to the processing cores to optimize performance? (2) How to meet the desired performance requirement power efficiently? This dissertation presents the design of a hash based scheduler to distribute packets to cores. The scheduler exploits multiple dimensions of locality to improve performance while minimizing out of order delivery of packets. This scheduler is designed to work seamlessly when the number of cores allocated to a service is changed. The design of a resource allocator is also presented which allocates different number of cores to services with changing traffic behavior. To improve the power efficiency, a traffic aware power management scheme is presented which exploits variations in traffic rates to save power. The results of simulation studies are presented to evaluate the proposals using real and synthetic network traces. These experiments show that the proposed packet scheduler can improve performance by as much as 40% by improving locality. It is also observed that traffic variations can be exploited to save significant power by turning off the unused cores or by running them at lower frequencies. Improving performance of the individual cores by careful scheduling also helps to reduce the power consumption because the same amount of work can now be done with fewer cores with improved performance. The proposals made in this dissertation show promising improvements over the previous work. Hashing based schedulers have very low overhead and are very suitable for data rates of 100 Gbps and even beyond.en
dc.format.mimetypeapplication/pdfen
dc.language.isoen_USen
dc.subjectNetwork processorsen
dc.subjectLoad balancingen
dc.subjectDynamic resource allocationen
dc.subjectPower managementen
dc.subjectFlow migrationen
dc.subjectElephant flow detectionen
dc.subjectLinear hashingen
dc.titleWorkload-aware network processors : improving performance while minimizing power consumptionen
dc.description.departmentElectrical and Computer Engineeringen
dc.date.updated2013-09-06T20:54:29Zen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record