This paper introduces the PN-PEM framework. It is based on the representation of an algorithm with Petri Nets. Frequently, a real algorithm needs a large Petri Net to be represented. We present a way to model an algorithm with Colored Petri Nets that simplify the model. After that, this high level model is transformed into a low level but executable model, preserving its semantics. The execution also needs other components of the framework, as the involved processors, data used and executable kernels. The combination of these elements is described in order to obtain a parallel execution. Some tests are also presented as a testbed of the framework in symmetric multiprocessors. Usability, as well as good performance, confirm the quality of th...
International audienceFast simulation, i.e., automatic computation of sequential runs, is widely use...
Abstract. Coloured Petri nets have proved to be a useful formalism for modeling distributed algorith...
Coloured Petri nets have proved to be a useful formalism for modeling distributed algorithms, i.e., ...
This paper introduces the PN-PEM framework. It is based on the representation of an algorithm with P...
This paper introduces the PN-PEM framework. It is based on the representation of an algorithm with P...
The development of parallel programs following the paradigm of communicating sequen- tial pr...
Multicore - MultiGPU systems are frequently used in supercomputers design. The heterogeneity between...
Abstra t. We propose to use high-level Petri nets as a model for the semanti s of high-level paralle...
Concurrent programming is used in all large and complex computer systems. However, concurrency error...
International audienceWe propose to use high-level Petri nets for the semantics of high-level parall...
International audienceWe propose to use high-level Petri nets as a model for the semantics of high-l...
Parallel and distributed systems play an important role in the development of information technolo...
Consulta en la Biblioteca ETSI Industriales (Riunet)[EN] This is a master thesis that studies the pr...
Verification of parallel programs is a very important goal on the way to improve the reliability of ...
"A workshop within the 19th International Conference on Applications and Theory of Petri Nets - ICAT...
International audienceFast simulation, i.e., automatic computation of sequential runs, is widely use...
Abstract. Coloured Petri nets have proved to be a useful formalism for modeling distributed algorith...
Coloured Petri nets have proved to be a useful formalism for modeling distributed algorithms, i.e., ...
This paper introduces the PN-PEM framework. It is based on the representation of an algorithm with P...
This paper introduces the PN-PEM framework. It is based on the representation of an algorithm with P...
The development of parallel programs following the paradigm of communicating sequen- tial pr...
Multicore - MultiGPU systems are frequently used in supercomputers design. The heterogeneity between...
Abstra t. We propose to use high-level Petri nets as a model for the semanti s of high-level paralle...
Concurrent programming is used in all large and complex computer systems. However, concurrency error...
International audienceWe propose to use high-level Petri nets for the semantics of high-level parall...
International audienceWe propose to use high-level Petri nets as a model for the semantics of high-l...
Parallel and distributed systems play an important role in the development of information technolo...
Consulta en la Biblioteca ETSI Industriales (Riunet)[EN] This is a master thesis that studies the pr...
Verification of parallel programs is a very important goal on the way to improve the reliability of ...
"A workshop within the 19th International Conference on Applications and Theory of Petri Nets - ICAT...
International audienceFast simulation, i.e., automatic computation of sequential runs, is widely use...
Abstract. Coloured Petri nets have proved to be a useful formalism for modeling distributed algorith...
Coloured Petri nets have proved to be a useful formalism for modeling distributed algorithms, i.e., ...