In today＇s data centers supporting Internet-scale computing and input/output （I/0） services, increasingly more network-intensive applications are deployed on the network as a service. To this end, it is critical fo...In today＇s data centers supporting Internet-scale computing and input/output （I/0） services, increasingly more network-intensive applications are deployed on the network as a service. To this end, it is critical for the applications to quickly retrieve requests from the network and send their responses to the network. To facilitate this network func- tion, operating system usually provides an event notification mechanism so that the applications （or the library） know if the network is ready to supply data for them to read or to receive data for them to write. As a widely used and repre- sentative notification mechanism, epoll in Linux provides a scalable and high-performance implementation by allowing applications to specifically indicate which connections and what events on them need to be watched. As epoll has been used in some major systems, includ- ing key-value （KV） systems, such as Redis and Memcached, and web server systems such as NGINX, we have identified a substantial performance issue in its use. For the sake of efficiency, applications usually use epoll＇s system calls to inform the kernel exactly of what events they are interested in and always keep the information up-to-date. However, in a system with demanding network traffic, such a rigid main- tenance of the information is not necessary and the excess number of system calls for this purpose can substantially de- grade the system＇s performance. In this paper, we use Redis as an example to explore the issue. We propose a strategy of informing the kernel of the interest events in a manner adaptive to the current network load, so that the epoll system calls can be reduced and the events can be efficiently deliv- ered. We have implemented an event-polling library, named as FlexPoll, purely in user-level without modifying any ker- nel code. Our evaluation on Redis shows that the query through- put can be improved by up to 46.9% on micro-benchmarks, and even up to 67.8% on workloads emulating real-world ac- cess patterns. FlexPoll is a generic mechanism thus it can be adopted by other applications in a straightforward manner, such as NG1NX and Memcached.展开更多
基金This work was supported by National High Tech- nology Research and Development Program of China （863） （2011AA01A204）, and the National Natural Science Foundation of China （Grant No. 61272167）.
文摘In today＇s data centers supporting Internet-scale computing and input/output （I/0） services, increasingly more network-intensive applications are deployed on the network as a service. To this end, it is critical for the applications to quickly retrieve requests from the network and send their responses to the network. To facilitate this network func- tion, operating system usually provides an event notification mechanism so that the applications （or the library） know if the network is ready to supply data for them to read or to receive data for them to write. As a widely used and repre- sentative notification mechanism, epoll in Linux provides a scalable and high-performance implementation by allowing applications to specifically indicate which connections and what events on them need to be watched. As epoll has been used in some major systems, includ- ing key-value （KV） systems, such as Redis and Memcached, and web server systems such as NGINX, we have identified a substantial performance issue in its use. For the sake of efficiency, applications usually use epoll＇s system calls to inform the kernel exactly of what events they are interested in and always keep the information up-to-date. However, in a system with demanding network traffic, such a rigid main- tenance of the information is not necessary and the excess number of system calls for this purpose can substantially de- grade the system＇s performance. In this paper, we use Redis as an example to explore the issue. We propose a strategy of informing the kernel of the interest events in a manner adaptive to the current network load, so that the epoll system calls can be reduced and the events can be efficiently deliv- ered. We have implemented an event-polling library, named as FlexPoll, purely in user-level without modifying any ker- nel code. Our evaluation on Redis shows that the query through- put can be improved by up to 46.9% on micro-benchmarks, and even up to 67.8% on workloads emulating real-world ac- cess patterns. FlexPoll is a generic mechanism thus it can be adopted by other applications in a straightforward manner, such as NG1NX and Memcached.
