Skip to Main content Skip to Navigation
Reports

Marking optimization and parallelism of marked graphs

Abstract : The aim of the paper is to provide a formalization of the notion of parallelism of a marked graph exploitable by parallel simulation. We show that there exists an optimal starting point for equational simulations which gives a speed of simulation in the order of the intrinsic sequentiality of the system. Furthermore, under few assumptions, the modification of the marking will accelerate the simulation without altering its results for the stationary regime. We also derive algorithms to compute this optimal marking.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074623
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:55:49 PM
Last modification on : Wednesday, December 4, 2019 - 10:38:46 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:21:03 PM

Identifiers

  • HAL Id : inria-00074623, version 1

Collections

Citation

M. Canales, Bruno Gaujal. Marking optimization and parallelism of marked graphs. RR-2049, INRIA. 1993. ⟨inria-00074623⟩

Share

Metrics

Record views

116

Files downloads

189