I want to understand SSD performance so I can design fast data
structures, such as fractal trees. This talk will present some
performance measurements of an Intel X25E which were motivated by the
I tried to measure what the right block size is for operating an SSD.
A good block size is one that hits the “half power point”. That is,
half the performance is accounted for by “seek time”, and half by
“bandwidth”. This experiment postulates a simple model for SSD and
rotating disks where for random reads of a block, there is a startup
time S and a bandwidth B. The half-power points look like this:
SSD / Rotating Disk
reads: 50KB / 0.5MB-1MB
writes: 10KB / 0.5MB-1MB
read/write: mix 21KB / 0.5MB-1MB
I found SSD performance to be a little bit strange and unpredictable.
Dr. Kuszmaul’s research focuses on developing computer systems and
hardware that behave well both in practice and in theory. His entry
won 5 out of 6 categories in Jim Gray’s 2007 sorting benchmark
contest, sorting a terabyte in 197
seconds. He formerly architected Akamai’s distributed data collection
system, was a Yale Professor of Computer Science and was a principal
network architect for the Thinking Machines Connection Machine
He was one of the developers of the MIT
Cilk multithreaded programming
system and wrote, in Cilk++, winning entries for 4 out of 12 of
problems in the 2009 Intel Threading Challenge. Dr. Kuszmaul a
founder and Chief Architect at Tokutek and is a Research Scientist in
the Massachusetts Institute of Technology Computer Science and
Artificial Intelligence Laboratory (MIT CSAIL).
For information on exhibition and sponsorship opportunities at the conference, contact Yvonne Romaine at email@example.com
For media-related inquiries, contact Maureen Jennings at firstname.lastname@example.org
To stay abreast of conference news and to receive email notification when registration opens, please sign up for the O'Reilly MySQL Conference newsletter (login required).
View a complete list of O'Reilly MySQL Conference contacts.