Periodic scheduling of marked graphs using balanced binary words
Jean-Vivien Millo (INRIA Sophia Antipolis), Robert De Simone (INRIA, Rocquencourt / INRIA Sophia Antipolis / Laboratoire I3S)
TL;DR
This paper introduces an algorithm for optimally scheduling marked graphs using balanced binary words, maximizing execution rate and minimizing place sizes, with a formal characterization of optimal execution.
Contribution
It presents a novel algorithm for static scheduling of marked graphs and characterizes their best execution in terms of rate and place sizes.
Findings
Algorithm computes optimal schedules with maximal execution rate.
Schedules are represented as balanced binary words.
Provides formal characterization of optimal execution for MGs.
Abstract
This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The contributions of this paper is the proposed algorithm itself along with the characterization of the best execution of any MG.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Distributed and Parallel Computing Systems · Real-Time Systems Scheduling