perform@vuse.vanderbilt.edu (Performance Mailing List) (07/12/90)
I make tycho, the C program described in the attached unix
man page, available to researchers via ftp. Tycho allows for the
trace-driven simulation of many caches at a time, but severely
restricts the design options that may be varied.
If interested, please send me e-mail (markhill@cs.wisc.edu).
I do NOT have address traces to distribute.
--Mark Hill
TYCHO() UNIX Programmer's Manual TYCHO()
NAME
tycho - cache simulator
SYNOPSIS
tycho -b block_size -c cache_type [ other_options ]
DESCRIPTION
tycho is a trace-driven cache simulator that CAN SIMULATE
MANY DIRECT-MAPPED, SET-ASSOCIATIVE AND FULLY-ASSOCIATIVE
CACHES WITH ONE PASS THROUGH AN ADDRESS TRACE TO PRODUCE A
TABLE OF MISS RATIOS. The algorithm used is the special
case of all-associativity simulation [Hill89] that was
introduced in [Matt70]. All-associativity simulation
requires a single block size, no sub-blocks or prefetching,
and LRU replacement. This implementation further requires
that bit-selection be used to determine the set of a refer-
ence, i.e., the set of address x must be (x/block_size)
modulo 2^n where n is a non-negative integer.
...
The command line options (more limited than dineroIII's) include:
-b block_size
-c cache_type
-s min_log2numsets
-S max_log2numsets
-a max_associativity
SEE ALSO
Mark D. Hill and Alan Jay Smith, Evaluating Associativity in
CPU Caches, to appear in IEEE Trans. on Computers, C-38, 12,
December 1989.
R.L. Mattson, J. Gecsei, D.R. Slutz, I.L. Traiger, Evalua-
tion Techniques for Storage Hierarchies, IBM Systems Jour-
nal, 9-2, 1970.
AUTHOR
Mark D. Hill
Computer Sciences Dept.
Univ. of Wisconsin
Madison, WI 53706
markhill@cs.wisc.edu