Step Persistence in the Design of GALS Systems

Fernandes, J; Koutny, M; Pietkiewicz-Koutny, M; Sokolov, D; Yakovlev, A

doi:10.1007/978-3-642-38697-8_11

Step Persistence in the Design of GALS Systems

Lookup NU author(s): Johnson Fernandes, Professor Maciej Koutny ORCiD, Dr Marta Koutny, Dr Danil Sokolov, Professor Alex Yakovlev

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

In this paper we investigate the behaviour of GALS (Globally Asynchronous Locally Synchronous) systems in the context of VLSI circuits. The specification of a system is given in the form of a Petri net. Our aim is to re-design the system to optimise signal management, by grouping together concurrent events. Looking at the concurrent reachability graph of the given Petri net, we are interested in discovering events that appear in ‘bundles’, so that they all can be executed in one clock tick. The best candidates for bundles are sets of events that appear and re-appear over and over again in the same configurations, forming ‘persistent’ sets of events. Persistence was considered so far only in the context of sequential semantics. Here we introduce a notion of persistent steps and discuss their basic properties. We then introduce a formal definition of a bundle and propose an algorithm to prune the behaviour of a system, so that only bundle steps remain. The pruned reachability graph represents the behaviour of a re-engineered system, which in turn can be implemented in a new Petri net using the standard techniques of net synthesis. The proposed algorithm prunes reachability graphs of persistent and safe nets leaving bundles that represent maximally concurrent steps.