HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >
Please use this identifier to cite or link to this item:
|Title: ||Analysis of interrupt coalescing schemes for receive-livelock problem in Gigabit Ethernet Network hosts|
|Authors: ||Chang, Xiaolin|
Muppala, Jogesh K.
|Keywords: ||Interrupt coalescing|
|Issue Date: ||2008 |
|Citation: ||Peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings|
|Abstract: ||Interrupt coalescing (IC) technique has been used in general-purpose operating systems to mitigate Receive Livelock (RL) problem in Gigabit Ethernet Network hosts. Schemes for dynamically tuning the interrupt coalescing behavior of a communication interface based on traffic load or system state have been proposed. However, all the existing IC schemes are designed using heuristics. In this paper we present an analytical model for the IC technique and carry out a detailed study of existing IC schemes in terms of their performance haracteristics including system goodput, CPU consumption and latency. We validate our analysis through measurement-based experiments.|
|Rights: ||© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
|Appears in Collections:||CSE Conference Papers|
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.