Scheduling Analysis of Distributed Real-Time Embedded Systems

Provided by: Binary Information Press
Topic: Hardware
Format: PDF
After modeling static scheduling of distributed embedded system using time petri-nets model based on resources, existing algorithms of scheduling analysis are difficult to get the characteristics of all scheduling sequences. So new state class is introduced, and the firing rules are setup, then the reachable graph of the model is constructed by confirming output transitions and computing child state class. All feasible scheduling sequences and corresponding scheduling length can be gotten from the reachable graph, so the most feasible scheduling sequences can be selected according to deadline requirement of the task.

Find By Topic