11-2 notes - An algorithmic event of input size n occurs...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
, such that Pr(one pillar has height > C*log(n)) = (1/2) clog(n) = Pr(max of n pillars has height > c * log(n) ) = Pr(max of n pillars has height > c * log(n) ) ^^^AKA Given Disk-Bound Computation We have – CPU, memory, disk CPU is arbitrarily fast compared to disk, memory is arbitrarily fast but small Disk is big, but read/write is slow o Can only read/write one block at a time Storage Speed Size L2/L3 Cache 5-15 ns ~10 7 bytes DRAM 30-50 ns ~10 10 bytes Disk 4-8 ms (4-8*10 6 ns) ~10 12 Runtime of algorithm is measured in # of disk ops (reads and writes) Disk-based Tree Each node can hold a variable # of keys If node y has n(x) keys, it has n(x)+1 children # of keys/node has some max m o <= m+1 children/node M / \ OH QTX / | \ / | | \ BC FG JKL NP RS VW YZ Pick m such that each node fits in one disk block To access node x o Disk-read(x) o Disk-write(x) Suppose one block can store 999 keys
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/05/2011 for the course ENGINEERIN 131 taught by Professor Cytron during the Spring '11 term at Washington University in St. Louis.

Page1 / 2

11-2 notes - An algorithmic event of input size n occurs...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online