{"id":40,"date":"2007-09-12T21:17:13","date_gmt":"2007-09-12T20:17:13","guid":{"rendered":"http:\/\/tmachine1.dh.bytemark.co.uk\/blog\/index.php\/2007\/09\/12\/thousands-of-clients-per-server-game-programming-gems-4\/"},"modified":"2007-09-12T21:21:14","modified_gmt":"2007-09-12T20:21:14","slug":"thousands-of-clients-per-server-game-programming-gems-4","status":"publish","type":"post","link":"http:\/\/new.t-machine.org\/index.php\/2007\/09\/12\/thousands-of-clients-per-server-game-programming-gems-4\/","title":{"rendered":"Thousands of Clients per Server (Game Programming Gems 4)"},"content":{"rendered":"

…was my section in the fourth GPG book from Charles River Media. And, sadly, although I tried to put some resources up on the web, a series of unfortunate events led to that all disappearing.<\/p>\n

But now … they’re back! (and I’ll be adding more followup stuff in the coming weeks\/months)
\n<\/p>\n

If you’re interested in the article itself, there’s a pretty good writeup here<\/a> (scroll halfway down to find it) that covers the main core points (although understandably leaves out several sections, and doesn’t include any of the diagrams from the book – if it were much longer they might get into trouble over copyright issues ;)).<\/p>\n

These are the most useful IMHO links from the references in my chapter. If you want the full text, you’ll have to buy the book (you can get it fairly cheaply these days – and you get more than 60 other gems as well, so it’s probably well worth it), but these refs themselves are pretty good reading.<\/p>\n\n\n\n\n\n\n\n\n\n\n
GPG4 ref<\/th>\nTitle<\/th>\n<\/tr>\n
\n[Bansil01]<\/td>\n“Analysis of SRPT Scheduling: Investigating Unfairness”<\/a>\n<\/td>\n<\/tr>\n
\n[EiffelSoftware03]<\/td>\n“An introduction to Design by Contract”<\/a>\n<\/td>\n<\/tr>\n
\n[FCF02]<\/td>\n“Fastest Connection First: A New Scheduling Policy for Web Servers”<\/a>\n<\/td>\n<\/tr>\n
\n[Gooch02]<\/td>\n“I\/O Event Handling under linux”<\/a>\n<\/td>\n<\/tr>\n
\n[Josephs03]<\/td>\n“Scheduling Algorithms”<\/a>\n<\/td>\n<\/tr>\n
\n[Kegel03]<\/td>\n“The C10K Problem”<\/a>\n<\/td>\n<\/tr>\n
\n[Mellon03]<\/td>\n“Automated Testing of Massively Multiplayer Games”<\/a>\n<\/td>\n<\/tr>\n
\n[Welsh03]<\/td>\n“SEDA: An Architecture for Highly Concurrent Server Applications”\t<\/a>\n<\/td>\n<\/tr>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

…was my section in the fourth GPG book from Charles River Media. And, sadly, although I tried to put some resources up on the web, a series of unfortunate events led to that all disappearing. But now … they’re back! (and I’ll be adding more followup stuff in the coming weeks\/months)<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[13,19,15,17],"tags":[],"_links":{"self":[{"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/posts\/40"}],"collection":[{"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/comments?post=40"}],"version-history":[{"count":0,"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/posts\/40\/revisions"}],"wp:attachment":[{"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/media?parent=40"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/categories?post=40"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/new.t-machine.org\/index.php\/wp-json\/wp\/v2\/tags?post=40"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}