Chess Review May 10, 2004 Berkeley, CA Distributed Schedule-Carrying Code Tom Henzinger Slobodan Matic

Download Chess Review May 10, 2004 Berkeley, CA Distributed Schedule-Carrying Code Tom Henzinger Slobodan Matic

Post on 20-Dec-2015

216 views

Category:

Documents

3 download

Embed Size (px)

TRANSCRIPT

<ul><li> Slide 1 </li> <li> Chess Review May 10, 2004 Berkeley, CA Distributed Schedule-Carrying Code Tom Henzinger Slobodan Matic </li> <li> Slide 2 </li> <li> Chess Review, May 10, 2004 2 Motivation Distributed real-time system static scheduling, TDMA communication Independent code generation by several developers specifications from resource manager Code composability component code modification does not influence other components check only modified code against its specification </li> <li> Slide 3 </li> <li> Chess Review, May 10, 2004 3 Distributing SCC mode start() period 24ms { taskfreq 2 do t1(); taskfreq 2 do t2(t1); taskfreq 1 do t3(); taskfreq 3 do t4(t2,t3); } Giotto dispatch( t3,5 ) dispatch( t2,5 ) call( d2 ) idle( 1 ) dispatch( t2,1 ) SCC (segment) </li> <li> Slide 4 </li> <li> Chess Review, May 10, 2004 4 S+N Type and SCC N type SCCModified SCC S type </li> </ul>