
	Where results make sense

Topic: Fhourstones

Related Topics

Dhrystone

Aquamark

Benchmark

Connect Four

Whetstone (benchmark)

LINPACK

	C4
		Fhourstones 1.0 and previous results should be the same...
		The Fhourstones benchmark (c4 for short) solves positions in connect-4, the well-known game played on a vertical board of 7 columns by 6 rows, where 2 players take turns in dropping 'stones' in a column.
		The Fhourstones program (c4.shar and c4.doc) and latest results (c4.tbl, this table) can be obtained via anonymous ftp from 'ftp.nosc.mil' in directory 'pub/aburto'.
	www.netlib.org /performance/html/c4.intro.html (305 words)

	Fhourstones - Education - Information - Educational Resources - Encyclopedia - Music
		Fhourstones is an integer benchmark that efficiently solves positions in the game of Connect-4.
		Available in both ANSI-C and Java, is is quite portable and compact (under 500 lines of source), and uses 50Mb of memory.
		Fhourstones was named as a pun on Dhrystone.
	www.music.us /education/F/Fhourstones.htm (327 words)

	Java Optimization - What's Old
		Speed: pointers to more JIT compilers, the Harissa Java-to-C compiler, and the JAVAR restructuring compiler for multiprocessors, plus limitations to inlining, and the cost of exceptions.
		Resources: Java-vs-C++ results for numeric code, plus an updated link to the Fhourstones benchmark.
		Compilers: expected speedups from manually hoisting array length comparisons out of a loop.
	www.cs.cmu.edu /~jch/java/whatsold.html (1049 words)

	[kaffe] GNU Classpath java.util.zip patch - To Merge Or Not To Merge
		I've first compiled the FhourStones sources with kjc 2.1B.
		So using the pure java zip seems to be bad news when you have an application that needs to load fast.
		Also interesting to note is that memory requirements to compile FhourStones when using jit and nativezip seem to have decreased by 3 MB since 1.0.7.
	www.kaffe.org /pipermail/kaffe/2002-December/028470.html (905 words)

	[computer-go] Fhourstones (Site not responding. Last check: 2007-11-02)
		I ran John's Fhourstones on my linux machine using: C: The gcc compiler on my linux machine.
		The ratio for IBM's java compiler is 1.2415 and I'm pretty impressed.
		Fhourstones is not a trivial program and is processor intensive.
	computer-go.org /pipermail/computer-go/2004-August/000843.html (144 words)

	Ace's Hardware (Site not responding. Last check: 2007-11-02)
		Though we found several candidate benchmarks in general, only one proved compilable with x86-64 and that was only after tweaking the source code - not all C code out there is portable across multiple architectures and compilers.
		This benchmark is the Fhourstones 2.0 connect-4 by John Tromp, which uses 64-bit integers for a hash data structure:
		Implementation of the well-known game played on a vertical board of 7 columns by 6 rows, where 2 players take turns in dropping counters in a column.
	www.aceshardware.com /read.jsp?id=55000265 (940 words)

	[computer-go] Fhourstones
		I ran John's Fhourstones on my linux machine using: C: The gcc compiler on my linux machine.
		The ratio for IBM's java compiler is 1.2415 and I'm pretty impressed.
		Fhourstones is not a trivial program and is processor intensive.
	www.computer-go.org /pipermail/computer-go/2004-August/000843.html (144 words)

	[computer-go] Fhourstones
		The server VM is usually faster these days, and once in a while it can actually outpace gcc.
		-Yonik ----- Original Message ----- From: "Don Dailey" To: Cc: Sent: Tuesday, August 10, 2004 1:03 PM Subject: [computer-go] Fhourstones > > I ran John's Fhourstones on my linux machine using: > > C: The gcc compiler on my linux machine.
		> > Fhourstones is not a trivial program and is processor intensive.
	www.computer-go.org /pipermail/computer-go/2004-August/000845.html (186 words)

	COMPUTERCRAFT - Benchmarks FAQ
		Fhourstones Description: Small integer-only program that solves positions in the game of connect-4 using exhaustive search with a very large transposition table.
		This Xnetlib release contains an Internet-accessible performance database server (PDS) which can be used to extract current benchmark data and literature.
		The current PDS provides an on-line catalog of the following public-domain computer benchmarks: Linpack Benchmark, Parallel Linpack Benchmark, Bonnie Benchmark, FLOPS Benchmark, Peak Performance (part of Linpack Benchmark), Fhourstones and Dhrystones, Hanoi Benchmark, Heapsort Benchmark, Nsieve Benchmark, Math Benchmark, Perfect Benchmarks, and Genesis Benchmarks.
	www.computercraft.com /docs/bnchfaq.html (4727 words)

	OSDI 2002: Practical, transparent operating system support for Superpages
		Linker: Link of the FreeBSD kernel with the GNU linker.
		C4: An alpha-beta search solver for a 12-ply position of the connect-4 game, also known as the fhourstones benchmark.
		Tree: A synthetic benchmark that captures the behaviour of processes that use dynamic allocation for a large number of small objects, leading to poor locality of reference.
	www.cs.rice.edu /~ssiyer/r/superpages/osdi02superpages (10443 words)

Try your search on: Qwika (all wikis)