Global Information Lookup Global Information

C10k problem information


The C10k problem is the problem of optimizing network sockets to handle a large number of clients at the same time.[1] The name C10k is a numeronym for concurrently handling ten thousand connections.[2] Handling many concurrent connections is a different problem from handling many requests per second: the latter requires high throughput (processing them quickly), while the former does not have to be fast, but requires efficient scheduling of connections.

The problem of socket server optimisation has been studied because a number of factors must be considered to allow a web server to support many clients. This can involve a combination of operating system constraints and web server software limitations. According to the scope of services to be made available and the capabilities of the operating system as well as hardware considerations such as multi-processing capabilities, a multi-threading model or a single threading model can be preferred. Concurrently with this aspect, which involves considerations regarding memory management (usually operating system related), strategies implied relate to the very diverse aspects of I/O management.[2]

  1. ^ "The C10K problem". Archived from the original on 2013-07-22.
  2. ^ a b Liu, D.; Deters, R. (2009). "The Reverse C10K Problem for Server-Side Mashups". Service-Oriented Computing – ICSOC 2008 Workshops. Lecture Notes in Computer Science. Vol. 5472. p. 166. doi:10.1007/978-3-642-01247-1_16. ISBN 978-3-642-01246-4.

and 9 Related for: C10k problem information

Request time (Page generated in 0.7876 seconds.)

C10k problem

Last Update:

The C10k problem is the problem of optimizing network sockets to handle a large number of clients at the same time. The name C10k is a numeronym for concurrently...

Word Count : 731

Numeronym

Last Update:

prefixes include Y2K problem – Year 2000 problem Y2K38 problem – Year 2038 problem C10k problem – Ten-thousand concurrent connections problem Leet or leetspeak...

Word Count : 942

Lighttpd

Last Update:

was originally written by Jan Kneschke as a proof-of-concept of the c10k problem – how to handle 10,000 connections in parallel on one server, but has...

Word Count : 762

Reactor pattern

Last Update:

considerations for the client–server model in large networks, such as the C10k problem for web servers, were the original motivation for the reactor pattern...

Word Count : 1481

Nginx

Last Update:

development of Nginx in 2002. Originally, Nginx was developed to solve the C10k problem, and to fill the needs of multiple websites including the Rambler search...

Word Count : 2572

Kqueue

Last Update:

Team. Kqueue makes it possible for software like nginx to solve the c10k problem. The term "kqueue" refers to its function as a "kernel event queue" Kqueue...

Word Count : 684

Simtel

Last Update:

In the same year it served 10,000 clients at a time, showing that the C10k problem was tractable on contemporary systems. Due to a mirror licensing dispute...

Word Count : 997

Web server

Last Update:

thousands for each active web server process, see also the C10k problem and the C10M problem). When a web server is near to or over its load limits, it...

Word Count : 9990

Libevent

Last Update:

web page Libevent github repository Libevent 2.0 book Dan Kegel's "The C10K problem" web page A benchmark by the libev author comparing libevent with libev...

Word Count : 394

PDF Search Engine © AllGlobal.net