Content deleted Content added
No edit summary |
Importing Wikidata short description: "Problem of optimising network sockets to handle a large number of clients at the same time" (Shortdesc helper) |
||
Line 1:
{{Short description|Problem of optimising network sockets to handle a large number of clients at the same time}}
The '''C10k problem''' is the problem of optimizing [[network socket]]s to handle a large number of clients at the same time.<ref name=C10K>{{cite web|url=http://www.kegel.com/c10k.html |title=The C10K problem |archive-date=2013-07-18 |archive-url=https://www.webcitation.org/6ICibHuyd?url=http://www.kegel.com/c10k.html |url-status=live }}</ref> The name C10k is a [[numeronym]] for [[Concurrent computing|concurrently]] handling ten thousand connections.<ref name=Liu-Deters>{{Cite book | last1 = Liu | first1 = D. | last2 = Deters | first2 = R. | chapter = The Reverse C10K Problem for Server-Side Mashups | doi = 10.1007/978-3-642-01247-1_16 | title = Service-Oriented Computing – ICSOC 2008 Workshops | series = Lecture Notes in Computer Science | volume = 5472 | pages = 166 | year = 2009 | isbn = 978-3-642-01246-4 }}</ref> Note that concurrent connections are not the same as [[requests per second]], though they are similar: handling many requests per second requires high throughput (processing them quickly), while a high number of concurrent connections requires efficient scheduling of connections. In other words, handling many requests per second is concerned with the speed of handling requests, whereas a system capable of handling a high number of concurrent connections does not necessarily have to be a fast system, only one where each request will deterministically return a response within a (not necessarily fixed) finite amount of time.
| |||