Kirjasto - Tampereen teknillinen yliopisto

Resource conflict detection in simulation of function unit pipelines

Show full item record

Files in this item

Files Size Format View
jaaskelainen_resource_conflict_detection.pdf 122.4Kb PDF View/Open
URN: http://URN.fi/URN:NBN:fi:tty-201104153543
Title: Resource conflict detection in simulation of function unit pipelines
Author: Jääskeläinen, Pekka; Guzma, Vladimir; Korhonen, Viljami
Publication type: Artikkeli - Article
Issue date: 2008
DOI: http://dx.doi.org/10.1016/j.sysarc.2008.04.002
Description: NOTICE: this is the author’s version of a work that was accepted for publication in Journal of Systems Architecture. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Systems Architecture, Vol 54, Issue 11, (November 2008) DOI http://dx.doi.org/10.1016/j.sysarc.2008.04.002
University: Tampereen teknillinen yliopisto - Tampere University of Technology
Faculty: Tieto- ja sähkötekniikan tiedekunta – Faculty of Computing and Electrical Engineering
Department: Tietokonetekniikan laitos
Abstract: Processor simulators are important parts of processor design toolsets in which they are used to verify and evaluate the properties of the designed processors. While simulating architectures with independent function unit pipelines using simulation techniques that avoid the overhead of instruction bit-string interpretation, such as compiled simulation, the simulation of function unit pipelines can become one of the new bottlenecks for simulation speed. This paper evaluates several resource conflict detection models, commonly used in compiler instruction scheduling, in the context of function unit pipeline simulation. The evaluated models include the conventional reservation table based-model, the dynamic collision matrix model, and an finite state automata (FSA) based model. In addition, an improvement to the simulation initialization time by means of lazy initialization of states in the FSA-based approach is proposed. The resulting model is faster to initialize and provides comparable simulation speed to the actively initialized FSA.
Copyright: This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.


This item appears in the following Collection(s)

Show full item record

Search TUT DPub


Advanced Search

Browse

My Account

Statistics