Analysing gCSP Models Using Runtime and Model Analysis Algorithms


Share/Save/Bookmark

Bezemer, M.M. and Groothuis, M.A. and Broenink, J.F. (2009) Analysing gCSP Models Using Runtime and Model Analysis Algorithms. In: WoTUG Technical Meeting on Communicating Process Architectures, CPA, 1-4 November 2009, Eindhoven, The Netherlands.

[img]PDF
Restricted to UT campus only
: Request a copy
667Kb
Abstract:This paper presents two algorithms for analysing gCSP models in order to improve their execution performance. Designers tend to create many small separate processes for each task, which results in many (resource intensive) context switches. The research challenge is to convert the model created from a design point of view to models which have better performance during execution, without limiting the designers in their ways of working. The first algorithm analyses the model during run-time execution in order to find static sequential execution traces that allow for optimisation. The second algorithm analyses the gCSP model for multi-core execution. It tries to find a resource-efficient placement on the available cores for the given target systems. Both algorithms are implemented in two tools and are tested. We conclude that both algorithms complement each other and the analysis results are suitable to create optimised models.
Item Type:Conference or Workshop Item
Copyright:© 2009 IOS Press
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/68650
Official URL:http://dx.doi.org/10.3233/978-1-60750-065-0-67
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 264181