Deadlock analysis in minimal adaptive routing algorithms using Petri Nets

Multicomputer Interconnection Networks and the design of routing algorithms for these networks, is a very active research domain that in the last decade has given rise to technologically consolidated systems. Nevertheless, from the methodological point of view, the diverse approaches are very limite...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Systems, Man and Cybernetics pp. 2619 - 2626
Main Authors Rovetto, Carlos A, Cano, Elia E, Colom, José-Manuel
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2010
Subjects
Deadlock Analysis
Minimal Adaptive Routing Algorithms
Petri Nets
Resource Allocation Systems
System recovery
Online AccessGet full text

Cover

More Information
Summary:Multicomputer Interconnection Networks and the design of routing algorithms for these networks, is a very active research domain that in the last decade has given rise to technologically consolidated systems. Nevertheless, from the methodological point of view, the diverse approaches are very limited, moreover in many cases are not complete in order to cover the different phases of the design cycle. In this paper we present a complete design approach, supported by a methodology until to get a deadlock-free routing algorithm. The starting information is the topology of the interconnection network and the initial minimal routing algorithm elaborated by the designer. From this information we obtain a Petri Net model, allowing to characterize the deadlock situations, and, if necessary, to modify the algorithm in order to produce a deadlock-free minimal adaptive routing algorithm.
ISBN:1424465869
9781424465866
ISSN:1062-922X
2577-1655
DOI:10.1109/ICSMC.2010.5641904