Pop, P.: `Scheduling and communication synthesis for distributed realtime systems'. Licentiate thesis, (Linkopings University, 2000)  Home/Search   Document Details and Download   Summary   Related Articles   Check

....people in the system level synthesis pay attentions to handle the control dependencies in the task graph model. Eles et al. described the conditional task graph model and used a list scheduling algorithm to generates different schedule tables for all processing elements in the architecture [7][13]. The schedule table lists all schedules for different condition combination in the task graph. Their algorithm has two limitations: 1. They assume that the allocation of the tasks is fixed for each task; 2. Their algorithm has to enumerate all possible schedules for all condition combinations, ....

....I] branch condition= C3,I1] We can use the algorithm shown in Figure 4 to go through the task graph and calculate the branch info struct for each task. The result is shown in Table 2. The fictitious branch joint tasks are created in Figure 3 for outlining control structure. Note that in [7][13], their conditional process graph model only consider boolean condition while our approach allows multiple conditions (such as the switch statement in C language) B C D E F G H I J K Figure 3. An example conditional task graph. Branch labeling(task ps) if (ps is the branch join ....

[Article contains additional citation context not shown here]

Paul Pop, "Scheduling and communication synthesis for distributed real-time systems", Ph.D. thesis, Linkopings University,2000.

No context found.

Pop, P.: `Scheduling and communication synthesis for distributed realtime systems'. Licentiate thesis, (Linkopings University, 2000)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC