The shadow algorithm: a scheduling technique for both compiled and interpreted simulation

Author

Maurer, Peter M.

Author_Institution

Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA

Volume

12

Issue

9

fYear

1993

fDate

9/1/1993 12:00:00 AM

Firstpage

1411

Lastpage

1413

Abstract

The shadow algorithm, which is an event-driven unit-delay simulation technique that has been designed to take advantage of the instruction caches present in many of the latest workstations, is discussed. The algorithm is based on the threaded-code technique, but uses a dynamically created linked list of environments called shadows. Compiled shadow algorithm simulations run in about 1/5th the time required for a conventional interpreted event-driven simulation. The interpreted shadow algorithm runs in about 1/4th the time of a conventional interpretive simulation

Keywords

circuit analysis computing; digital simulation; logic CAD; scheduling; dynamically created linked list; event-driven unit-delay simulation; interpreted simulation; scheduling technique; shadow algorithm; threaded-code technique; Algorithm design and analysis; Circuit simulation; Computational modeling; Computer science; Discrete event simulation; Microelectronics; Processor scheduling; Scheduling algorithm; Timing; Workstations;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.240088

Filename

240088