Periodic scheduling of marked graphs using balanced binary words

Authors:
Jean-Vivien Millo;Robert De Simone
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2012

Citing 10
Cited 1

Free choice Petri nets

Free choice Petri nets
Sturmian words, Lyndon words and trees

Theoretical Computer Science
Analysis of simple algorithms for dynamic load balancing

Mathematics of Operations Research
Balanced sequences and optimal routing

Journal of the ACM (JACM)
Will Physical Scalability Sabotage Performance Gains?

Computer
Formal methods for scheduling of latency-insensitive designs

EURASIP Journal on Embedded Systems
Compositionality of Statically Scheduled IP

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstraction of Clocks in Synchronous Data-Flow Systems

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Marked directed graphs

Journal of Computer and System Sciences
Theory of latency-insensitive design

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Explicit routing schemes for implementation of cellular automata on processor arrays

Natural Computing: an international journal

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper presents an algorithm to statically schedule live and strongly connected Marked Graphs. 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 are the proposed algorithm itself along with the characterization of the best execution of any marked graph.