Revision as of 08:59, 29 September 2020

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.

Document type: Part of book or chapter of book

Full document

Original document

The different versions of the original document can be found in:

• http://tce.cs.tut.fi/papers/FU_conflict_detection.pdf

• http://www.springerlink.com/index/pdf/10.1007/978-3-540-73625-7_25,http://dx.doi.org/10.1007/978-3-540-73625-7_25

• https://api.elsevier.com/content/article/PII:S1383762108000593?httpAccept=text/xml,https://api.elsevier.com/content/article/PII:S1383762108000593?httpAccept=text/plain,http://dx.doi.org/10.1016/j.sysarc.2008.04.002 under the license https://www.elsevier.com/tdm/userlicense/1.0/

• https://link.springer.com/chapter/10.1007/978-3-540-73625-7_25,https://academic.microsoft.com/#/detail/2123220156

• https://www.sciencedirect.com/science/article/pii/S1383762108000593,http://dblp.uni-trier.de/db/journals/jsa/jsa54.html#JaaskelainenGK08,https://academic.microsoft.com/#/detail/2079377457

• [ ]

DOIS: 10.1016/j.sysarc.2008.04.002 10.1007/978-3-540-73625-7_25