CPU Scheduling for Staged Servers

Add to your list(s) Download to your calendar using vCal

• Minor Gordon, Computer Laboratory, University of Cambridge
• Tuesday 22 January 2008, 14:30-15:30
• Room FW26, Computer Laboratory, William Gates Building.

If you have a question about this talk, please contact Minor Gordon.

Over the last decade a variety of novel server architectures such as Flash and SEDA have emerged from the systems community as alternatives to conventional thread-per-client server designs. These architectures are known to be extremely efficient on single processors, yet relatively little attention has been paid to how they will scale to the next generation of SMT /CMP/SMP machines.

In the first part of this presentation I will introduce Yield, a high-performance, staged application server written in C++ with an embedded Python interpreter for application logic. I will start with an overview of staged server architectures and then focus on some of the specific features of Yield.

The second part of the talk will resume where my last talk left off, with an investigation into the state of the art in stage scheduling algorithms, some proposed improvements to the same, and a discussion of problems that arise in developing new algorithms.

This talk is part of the Computer Laboratory Opera Group Seminars series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Opera Group Seminars
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Room FW26, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.