Optimizing the Hardware Usage of Parallel FSMs

Rainer Leonhard Findenig, Florian Eibensteiner, Markus Pfaff

Research output: Chapter in Book/Report/Conference proceedingsConference contribution


Hardware design is traditionally done by modeling finite state machines (FSMs). In this paper, we present how a basic round-robing scheduling mechanism, well-known from operating systems, can be applied to a design that needs several identical FSMs running (quasi) in parallel. This approach allows exploiting the classical trade-off between chip area and operating frequency to severely cut down the hardware resources needed to implement the FSMs by increasing the operating frequency of the design. We additionally show that, in a system-on-a-chip design using only a single clock domain, the design's overall operating frequency is dependent on the processor's frequency, making especially low-speed communication cores already clocked faster than needed. This means that with regard to the design's frequency, our approach may come at no additional cost.
Original languageEnglish
Title of host publicationComputer Aided Systems Theory, EUROCAST 2009 - 12th International Conference, Revised Selected Papers
Number of pages6
Publication statusPublished - 2009
EventTwelve International Conference on Computer Aided Systems Theory 2009 - Las Palmas, Spain
Duration: 15 Feb 200920 Feb 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5717 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceTwelve International Conference on Computer Aided Systems Theory 2009
CityLas Palmas
Internet address


  • FSM
  • Resource sharing
  • Scheduling
  • Serialization


Dive into the research topics of 'Optimizing the Hardware Usage of Parallel FSMs'. Together they form a unique fingerprint.

Cite this