A Reversible MC 68 HC 11 Simulator and

A Reversible MC 68 HC 11 Simulator and Its Empirical Computational Complexity Charles Vermette CIS 4914 Senior Project August 7, 2001

Problem Hard data is needed to prove theoretical behavior of simulation algorithms on a real architecture. Solution Simulate a real irreversible machine on a real reversible architecture and record time/space complexity. Motivation Why? • Work will aid in research into reversible computing. Why me? • Interested in subject matter. • Some previous experience.

Literature Sources • C. H. Bennett. Logical reversibility of computation. IBM J. Research and Development, 17(6): 525 -532, 1973. • C. H. Bennett. Time/space trade-offs for reversible computation. SIAM J. Computing, 18(4): 766 -776, 1989. • M. P. Frank. Reversibility for Efficient Computing. (unpublished manuscript), 1999. • R. Y. Levine and A. T. Sherman. A note on Bennett’s time-space tradeoff for reversible computation. SIAM J. Computation, 19(4): 673 -677, 1990. • M. Li, J. Tromp, P. Vitány. Reversible Simulation of Irreversible Computation. Physica D, 120: 168 -176, 1998. • Motorola, Inc. M 68 HC 11 E Series Programming Reference Guide. (product information pamphlet), 2000.

Work Completed • Test program written and compiled. • integer Floyd-Warshall algorithm. • using gcc hc 11 port http: //home. worldnet. fr/~stcarrez/m 68 hc 11_port. html • Op code counting program written. • outputs op codes used in program dump, total number of op codes and total unique op codes. • Binary to R language translator written. • converts a binary dump of a program segment to an R language array declaration statement • Simulation step code written. • All op codes detected have had simulation routines written. • note: only 45/64 ops in current version due to accidental deletion

Simulator Architecture

Garbage Information Layout 0000000000000000 ccr | pc info [7. . 0]: 7 - branch taken flag 6 - jump taken flag 5 - page x flag 2. . 0 - instruction length garbage | pc info

C to HC 11 Compilation Statistics Source file: apsp. c Length: 13 loc, 273 bytes Text Segment Dump: apsp. b Length: 897 bytes Output from opcount: Page 1 5 6 8 e 20 26 27 2 d 2 f 30 32 33 35 36 37 38 39 3 c 3 e 4 a 4 c 4 f 5 a 5 f 6 f 7 e 80 83 8 c 8 e 8 f a 6 bd c 3 cc ce d 3 dc dd de df e 3 ec ed ee ff Page 2 8 30 38 3 c 8 f a 7 ce de df e 3 ec ed Page 3 83 a 3 ee ef Page 4 ee ef Total opcodes in file: 471 Distinct opcodes in file: 64

Program Embedding 1) Use objcopy utility to produce binary dump of text segment 2) Run bin 2 ra to convert the dump into an R language array 3) Insert the output of bin 2 ra into the simulator source file 4) Binary 5) $12$FF$05 becomes R code (defarray [name] 6) 7) 18 255 5 )

Conclusions • Bugs in R compiler were exposed and corrected • Utility of R as a general purpose language was supported • New R language constructs were discussed • Work was begun to test behavior of Bennett 89

Future Work • Recover lost op code routines. • Test op code routines. • Code simulation segment routine. • Get complexity measurements.