TAILIEUCHUNG - A Scalable and Explicit Event Delivery Mechanism for UNIX

It is easy to see how a website may suffer for publish- ing RSS feeds. The most popular feed on Bloglines2 is , which has about 17,700 subscribers as of this writing. If each of those subscribers were using per- sonal aggregation software (desktop clients), Slashdot’s headlines-only RSS feed (about 2 kilobytes for a day’s worth of entries, and typically polled half-hourly) would be transferred 850,000 times a day, for a total of GB of data daily. The New York Times recently introduced a suite of RSS feeds for its headlines; the front page alone claims 7,800 subscribers, but the sum of subscribers to all its feeds comes to 24,000 | USENIX THE ADVANCED COMPUTING SYSTEMS ASSOCIATION The following paper was originally published in the Proceedings of the USENIX Annual Technical Conference Monterey California USA June 6-11 1999 A Scalable and Explicit Event Delivery Mechanism for UNIX Gaurav Banga Network Appliance Inc. Jeffrey C. Mogul Compaq Computer Corp. Peter Druschel Rice University 1999 by The USENIX Association All Rights Reserved Rights to individual papers remain with the author or the author s employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. For more information about the USENIX Association Phone 1 510 528 8649 FAX 1 510 548 5738 Email office@ WWW http A scalable and explicit event delivery mechanism for UNIX Gaurav Banga gaurav@ Network Appliance Inc. 2770 San Tomas Expressway Santa Clara CA 95051 Jeffrey C. Mogul mogul@ Compaq Computer Corp. Western Research Lab. 250 University Ave. Palo Alto CA 94301 Peter Druschel druschel@ Department of Computer Science Rice University Houston TX 77005 Abstract UNIX applications not wishing to block when doing I O often use the select system call to wait for events on multiple file descriptors. The select mechanism works well for small-scale applications but scales poorly as the number of file descriptors increases. Many modern applications such as Internet servers use hundreds or thousands of file descriptors and suffer greatly from the poor scalability of select . Previous work has shown that while the traditional implementation of se-lect can be improved the poor scalability is inherent in the design. We present a new event-delivery mechanism which allows the application to register interest in one or more sources of events and to efficiently dequeue new events. We show that this mechanism which requires only minor changes

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.