/
The socket C10K problem

The socket C10K problem

The first API used watching a set of non blocking sockets in the Berkeley sockets API was the select call. It has the problem performance degrades as you increase the number of sockets in the array it watchs significantly.

This was called the socket C10k problem. I discuss this with Vismay, with a brief guest appearance by Prannay:

It turned out that it is possible to solve this problem using the following different APIs on each of the major operating systems:

 

Related content

What are the core API needs for a socket API to enable non blocking sockets to be implemented?
What are the core API needs for a socket API to enable non blocking sockets to be implemented?
More like this
Handling large amounts of data with sockets and an event loop
Handling large amounts of data with sockets and an event loop
More like this
Epoll, select and kqueue have a similar model, but Windows IOCP is different
Epoll, select and kqueue have a similar model, but Windows IOCP is different
More like this
Why is windows important?
Why is windows important?
Read with this
A brief history of sockets
A brief history of sockets
More like this
Event Loop
Event Loop
Read with this