0x7f9ffaa0000 0x7f9ffaa0000 0x7f9ffaa0000 0x7f9ffaabeef

0x7f9ffaa0000 0x7f9ffaa0000 0x7f9ffaa0000 0x7f9ffaabeef - PowerPoint PPT Presentation

0x7f9ffaa0000 0x7f9ffaa0000 0x7f9ffaa0000 0x7f9ffaabeef 0x7f9ffaa0000 0x7f9ffaa0123 Based on http://sourceforge.net/projects/mpimd5bruteforc/ <Page with RBA guess> 0x7f9ffa70000 0x7f9ffa80000 0x7f9ffa90000 0x7f9ffaa0000


  1. 0x7f9ffaa0000

  2. 0x7f9ffaa0000

  3. 0x7f9ffaa0000

  4. 0x7f9ffaabeef 0x7f9ffaa0000 0x7f9ffaa0123

  5. Based on http://sourceforge.net/projects/mpimd5bruteforc/

  6. <Page with RBA guess> 0x7f9ffa70000 0x7f9ffa80000 0x7f9ffa90000 0x7f9ffaa0000 0x7f9ffab0000 0x7f9ffac0000 0x7f9ffad0000 . . .

  7. <Page with RBA guess> 0x7f9ffa70000 0x7f9ffa80000 detect_shared_pages() 0x7f9ffa90000 0x7f9ffaa0000 0x7f9ffaa0000 0x7f9ffab0000 0x7f9ffac0000 0x7f9ffad0000 . . .

  8. N = 10’000 , t start = 10 min t start

  9. t start = t 1 = 10 min, loop: test_time(t n ) If detection rate > 95% return t n *1.2 If detection rate < 50% t n+1 = t n *2 Else N = 10,000, t start = 10min t start t n+1 = t n *(1/ [detection rate])

  10. t

  11. t t

  12. t t rdtsc t

  13. t t rdtsc t t 2 > 2 * (t 1 +t 3 )/2 t 1,3 < M = 1000 t 1 < t 3 , (t 3 -t 1 ) < t 3 /3

  14. t t rdtsc t t 2 > 2 * (t 1 +t 3 )/2 t 1,3 < M = 1000 t 1 < t 3 , (t 3 -t 1 ) < t 3 /3

  15. /sys/kernel/mm/ksm/run ‘1’ or ‘0’ /sys/kernel/mm/ksm/sleep_millisecs e.g., 200 ms /sys/kernel/mm/ksm/pages_to_scan e.g., 100

  16. /sys/kernel/mm/ksm/run ‘1’ or ‘0’ /sys/kernel/mm/ksm/sleep_millisecs e.g., 200 ms /sys/kernel/mm/ksm/pages_to_scan e.g., 100 1000/sleep_millisecs * pages_to_scan = pages per second e.g., (1000/200ms) * 100 = 500 pages/sec

Recommend


More recommend