BogoMIPS - Revision history

Ralf at 13:32, 4 April 2005

2005-04-04T13:32:58Z

Ralf at 09:07, 19 November 2004

2004-11-19T09:07:55Z

Ralf at 17:05, 13 November 2004

2004-11-13T17:05:45Z

Ralf at 16:20, 13 November 2004

2004-11-13T16:20:21Z

New page

BogoMIPS used to be the infamous, prestigious benchmark for Linux machines over a decade. Unfortunately - or fortunately - depending of point of view and probably the BogoMIPS number of the favorite machine BogoMIPS have little to nothing to do with actual processor performance. The BogoMIPS number for any given processor architecture is basically proportional to the clock rate. On most processor architectures the BogoMIPS loop is compiled into just two instructions. Accordingly small is the aspects of a processor that are actually tested. And processors again are just a small part of an overall system which includes other hardware and software. To show the actual code on MIPS:

.set noreorder
loop: bnez $reg, loop
subu $reg, 1
.set reorder"

A typical modern machine with efficient branches or branch prediction can execute this loop at a rate of one instruction per cycle. Our of Order Execution which provides roughly a 50% speedup on real workloads provides no benefit. Not even second level caches or memory subsystems are exercised. The more surprising it is that BogoMIPS have become a benchmark for performance as important as extra inches in spam email.

@@ Line 1: / Line 1: @@
-BogoMIPS used to be the infamous, prestigious benchmark for Linux machines over a decade.  Unfortunately - or fortunately - depending of point of view and probably the BogoMIPS number of the favorite machine BogoMIPS have little to nothing to do with actual processor performance.  The BogoMIPS number for any given processor architecture is basically proportional to the clock rate.  On most processor architectures the BogoMIPS loop is compiled into just two instructions.  Accordingly small is the aspects of a processor that are actually tested.  And processors again are just a small part of an overall system which includes other hardware and software.  To show the actual code on MIPS:
+'''BogoMIPS''' used to be the infamous, prestigious benchmark for Linux machines over a decade.  Unfortunately - or fortunately - depending of point of view - the BogoMIPS number of the favorite machine BogoMIPS have little to nothing to do with actual processor performance.  Certain other microarchectural details will also very overproprotionally influence the benchmark.  On the other side memory performance, I/O performance, cache size and speed and many other processor and system architecture feature that make a crucial difference for system performance will ''not'' influence BogoMIPS at all.  The BogoMIPS number for any given processor architecture is basically proportional to the clock rate.  On most processor architectures the BogoMIPS loop is compiled into just two instructions.  Accordingly small is the aspects of a processor that are actually tested.  And processors again are just a small part of an overall system which includes other hardware and software.  To show the actual code on MIPS:
             .set    noreorder
@@ Line 7: / Line 7: @@
 A typical modern machine with efficient branches or branch prediction can execute this loop at a rate of one instruction per cycle.  Out of Order Execution which provides roughly a 50% speedup on real workloads provides no benefit.  Not even second level caches or memory subsystems are exercised.  The more surprising it is that BogoMIPS have become a benchmark for performance as important as extra inches in spam email.  Having been a permanent annoynce over the years due to miss-interpretation by users and due to excessive output on multiprocessor machines Linux by default will no longer print the BogoMIPS number since 2.6.9-rc2.

← Older revision		Revision as of 09:07, 19 November 2004
Line 6:		Line 6:
	.set reorder"		.set reorder"

−	A typical modern machine with efficient branches or branch prediction can execute this loop at a rate of one instruction per cycle. Out of Order Execution which provides roughly a 50% speedup on real workloads provides no benefit. Not even second level caches or memory subsystems are exercised. The more surprising it is that BogoMIPS have become a benchmark for performance as important as extra inches in spam email.	+	A typical modern machine with efficient branches or branch prediction can execute this loop at a rate of one instruction per cycle. Out of Order Execution which provides roughly a 50% speedup on real workloads provides no benefit. Not even second level caches or memory subsystems are exercised. The more surprising it is that BogoMIPS have become a benchmark for performance as important as extra inches in spam email. Having been a permanent annoynce over the years due to miss-interpretation by users and due to excessive output on multiprocessor machines Linux by default will no longer print the BogoMIPS number since 2.6.9-rc2.

← Older revision		Revision as of 17:05, 13 November 2004
Line 6:		Line 6:
	.set reorder"		.set reorder"

−	A typical modern machine with efficient branches or branch prediction can execute this loop at a rate of one instruction per cycle. ~~Our~~ of Order Execution which provides roughly a 50% speedup on real workloads provides no benefit. Not even second level caches or memory subsystems are exercised. The more surprising it is that BogoMIPS have become a benchmark for performance as important as extra inches in spam email.	+	A typical modern machine with efficient branches or branch prediction can execute this loop at a rate of one instruction per cycle. Out of Order Execution which provides roughly a 50% speedup on real workloads provides no benefit. Not even second level caches or memory subsystems are exercised. The more surprising it is that BogoMIPS have become a benchmark for performance as important as extra inches in spam email.