Revisiting the I/O Bottleneck

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

• University of Cambridge Computer Laboratory
• Tuesday 27 May 2008, 13:00-14:00
• Computer Laboratory, William Gates Building, Room FW11.

If you have a question about this talk, please contact Henry Robinson.

As commodity computers become more powerful with ever increasing amounts of RAM and now 4 CPU cores as standard (with further increases expected in the near future), is it the I/O subsystem that is the bottleneck? And if it is, then given the abundance of RAM and CPU power available could we use them to help alleviate the problem?

When writing Linux programs today programmers are faced with a plethora of choices of how to do I/O, and the “wrong” choice could mean their program takes twice as long to execute. In this talk I present results from experimenting with the Linux I/O APIs and show that performance can differ substantially depending on which and how the API is used. Clearly educating the programmers and re-writing all the existing code would be a solution, but with the abundance of RAM and CPU power available could other techniques allow the programmer to always use the same API , but with the kernel giving it the performance equal to if it had used the “fastest” API .

This talk is part of the Computer Laboratory NetOS Group Talklets series.

This talk is included in these lists:

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

Note that ex-directory lists are not shown.