Using timed Petri net to model instruction-level loop scheduling with resource constraints

DOI10.1007/BF02939494zbMath0942.68630OpenAlexW2021146463MaRDI QIDQ1331226

Bogong Su, Jian Wang, Christine Eisenbeis

Publication date: 2 August 2000

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02939494

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Using timed Petri net to model instruction-level loop scheduling with resource constraints

Cites Work

• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Optimal loop storage allocation for argument-fetching dataflow machines
• Using timed Petri net to model instruction-level loop scheduling with resource constraints
• Marked directed graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using timed Petri net to model instruction-level loop scheduling with resource constraints