f9dbfba145
Bonnie++ is a benchmark suite that is aimed at performing a number of simple tests of hard drive and file system performance. Bonnie++ was based on the code for Bonnie by Tim Bray. Differences between Bonnie++ 1.00 and 2.00. Version 2.00 is totally threaded, this has many subtle impacts on the way the code works. This changed the per-char results so I decided to make it do per-byte tests using write() and read() instead. The results are now much less. From 1.92. When closing files for the IO tests the operation is to fsync() each file handle. This means on Linux and other OSs that agressively cache writes the write performance will be noticably less, but the results will be more accurate. From 1.90b. The number of seek processes is now 5 instead of 3. Now almost all new hard drives have some sort of seek reordering capability, and OSs are getting smarter about maintaining queues. This and the increasing popularity of RAID arrays requires more seek procs to do a reasonable test.
7 lines
376 B
Text
7 lines
376 B
Text
$NetBSD: distinfo,v 1.1.1.1 2012/06/01 15:26:59 hfath Exp $
|
|
|
|
SHA1 (bonnie++-1.96.tgz) = 24a0e3de4dc98f905654f51ef6732b1b766e1378
|
|
RMD160 (bonnie++-1.96.tgz) = f2bbcfb6b17b2baa0d268046aa8a994f6b41bfee
|
|
Size (bonnie++-1.96.tgz) = 105183 bytes
|
|
SHA1 (patch-Makefile.in) = 91e1a133dc7c092180189a0a609f57a5d3333792
|
|
SHA1 (patch-bonnie++.cpp) = 2a0d92c597a5f46394111207a1496f265ec63b78
|