Abstract
We present an approach to model dataflow architectures at a high level of abstraction using timed coloured Petri nets. We specifically examine the value of Petri nets for evaluating the performance of such architectures. For this purpose we assess the value of Petri nets both as a modelling technique for dataflow architectures and as an analysis tool that yields valuable performance data for such architectures through the execution of Petri net models. Because our aim is to use the models for performance analysis, we focus on representing the timing and communication behaviour of the architecture rather than the functionality. A modular approach is used to model architectures. We identify five basic hardware building blocks from which Petri net models of dataflow architectures can be constructed. In defining the building blocks we will identify strengths and weaknesses of Petri nets for modelling dataflow architectures. A technique called folding is applied to build generic models of dataflow architectures. A timed coloured Petri net model of the Prophid dataflow architecture, which is being developed at Philips Research Laboratories, is presented. This model has been designed in the tool ExSpect. The performance of the Prophid architecture has been analysed by simulation with this model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ASPT (1994). ExSpect 5.0 User Manual. ASPT, Eindhoven University of Technology, Eindhoven, the Netherlands.
Buck, J. (1993). Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model. PhD thesis, University of California, Berkeley.
Govindarajan, R., Suciu, F., and Zuberek, W. (1997). Timed petri net model of multithreaded multiprocessor architectures. In International Workshop on Petri Nets and Performance Models IEEEpages 153–162.
Jensen, K. (1992). Coloured Petri Nets 1. Springer Verlag, New York.
Kienhuis, B., Deprettere, E., Vissers, K., and van der Wolf, P. (1997). An approach for quantitative analysis of application-specific dataflow architectures. In Proceedings of 11th Int. Conference of Applications-specific Systems, Architectures and Processors, pages 338–349.
Leijten, J., van Meerbergen, J., Timmer, A., and Jess, J. (1997). Prophid, a data-driven multi-processor architecture for high-performance dsp. In Proceedings of EDandTC
Lindemann, C. (1992). Performance Analysis of Complex Systems by Deterministic and Stochastic Petri Net Models. PhD thesis, Technische Universität Berlin.
Madhukar, M., Leuze, M., and Dowdy, L. (1995). Petri net model of a dynamically partitioned multiprocessor system. In International Workshop on Petri Nets and Performance Models IEEE.
Marsan, M., Balbo, G., and Conte, G. (1986). Performance Models of Multiprocessor Systems. MIT Press, London.
Molloy, M. (1982). Performance analysis using stochastic petri nets. In IEEE Transactions on Computers, Vol. 31, No. 9, pages 913–917.
van Hee, K. (1994). Information systems engineering: a formal approach. Cambridge University Press, Cambridge.
Watlington, J. and Bove, Jr., V. (1995). Stream-based computation and future television. In Proceedings of the 137th SMPTE Technical Conferencepages 69–79.
Zuberek, W. (1991). Timed petri nets–definitions, properties and applications. In Microelectronics and Reliability 31, No. 4, pages 627–644.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Witlox, B.R.T.M., van der Wolf, P., Aarts, E.H.L., van der Aalst, W.M.P. (2000). Performance Analysis of Dataflow Architectures Using Timed Coloured Petri Nets. In: Yakovlev, A., Gomes, L., Lavagno, L. (eds) Hardware Design and Petri Nets. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3143-9_14
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3143-9_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4969-1
Online ISBN: 978-1-4757-3143-9
eBook Packages: Springer Book Archive