home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.sys.apple2
- Path: sparky!uunet!cs.utexas.edu!zaphod.mps.ohio-state.edu!news.acns.nwu.edu!nucsrl!delta!holmer
- From: holmer@eecs.nwu.edu (Bruce Holmer)
- Subject: Request for benchmarks (in 6502 assembly code)
- Message-ID: <HOLMER.92Dec18172533@rose.eecs.nwu.edu>
- Sender: usenet@eecs.nwu.edu (Mr. Usenet)
- Organization: EECS Department, Northwestern University, Evanston, Il., USA
- Date: Fri, 18 Dec 1992 23:25:33 GMT
- Lines: 18
-
-
- Does anyone have 6502 assembly code for some smallish
- benchmark programs? I have the C code for many of these (see
- below), but I don't have access to a C compiler.
-
- I'm looking for things like the old Byte benchmarks (circa
- 1981) or the benchmarks used in the first RISC articles (e.g.
- Patterson/Sequin, Computer Magazine, Sept. 1982). Things
- like sieve, sort (quicksort, heapsort, etc.), string move,
- string search, ackerman, simple puzzle solvers, matrix
- operations, software floating point, etc. I'll be running
- these on a simulator, so I'll just initialize the memory, run
- the code, and look at the results in memory (that is to say,
- I can do with just subroutines for most of the simple stuff).
-
- Thanks,
- --Bruce Holmer
- holmer@eecs.nwu.edu
-