Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Übung 4: Ablaufplanung/Entwurf Ernesto Wandeler 15.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Übung 4: Ablaufplanung/Entwurf Ernesto Wandeler 15."— Presentation transcript:

1 1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Übung 4: Ablaufplanung/Entwurf Ernesto Wandeler 15. Juni 2005

2 2 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Ablaufplanung – Problem Gegeben: Sequenzgraph Operationen evtl. auf verschiedene Resroucen alloziert Eventuell beschränkte Resourcen Problem: Reihenfolge der Operationen? x + - < nop x

3 3 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Ablaufplanung – Definitionen x + - < nop x Sequenzgraph Latenz = n  (v nop1 )=0  (v nop2 )  (v nop1 ) _ =  (v nop2 ) = n Operationen Ausführzeitpunkt  (v i )=t

4 4 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Ablaufplanung – ASAP x + - < nop x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 0 Latenz = 4

5 5 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Ablaufplanung – ALAP x + - < nop x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 0 Latenz = 4

6 6 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Ablaufplanung – List Scheduling Problem: Beschränkte Resourcen x + - < nop x

7 7 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 0: Allocation to Resources r x + - < nop x x + 1 Multiplikator, Dauer: 2 1 ALU, Dauer: 1

8 8 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 0: Priorities P z.B. # Folgeknoten x + - < nop x 13 3 2 1

9 9 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 1: Determine candidates U x + - < nop x 13 3 2 1 Zeit 0 Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5

10 10 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 2: Determine running operations T x + - < x nop 13 3 2 1 Zeit 0 Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

11 11 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 3: Choose S  U with max P and |S|+|T|  x + - < x nop 13 3 2 1 Zeit 0 Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

12 12 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 4: Schedule and Iterate x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

13 13 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 1: Determine candidates U x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

14 14 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 2: Determine running operations T x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

15 15 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 3: Choose S  U with max P and |S|+|T|  x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

16 16 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 4: Schedule and Iterate x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

17 17 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 1: Determine candidates U x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

18 18 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 2: Determine running operations T x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

19 19 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 3: Choose S  U with max P and |S|+|T|  x + - < x nop 13 3 2 1 Zeit 0 - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 nop

20 20 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 4: Schedule and Iterate nop Zeit 0 x + - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 3 2 1

21 21 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 1: Determine candidates U nop Zeit 0 x + - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 3 2 1

22 22 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 2: Determine running operations T nop Zeit 0 x + - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 3 2 1

23 23 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 3: Choose S  U with max P and |S|+|T|  nop Zeit 0 x + - x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 3 2 1

24 24 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 4: Schedule and Iterate nop Zeit 0 x + - < x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 2 1

25 25 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 1: Determine candidates U nop Zeit 0 x + - < x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 2 1

26 26 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 2: Determine running operations T nop Zeit 0 x + - < x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 2 1

27 27 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 3: Choose S  U with max P and |S|+|T|  nop Zeit 0 x + - < x Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 2 1

28 28 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Step 4: Schedule and Iterate nop Zeit 0 x + - < x nop Zeit 1 Zeit 2 Zeit 3 Zeit 4 Zeit 5 x + - < x nop 13 2 1

Download ppt "1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Übung 4: Ablaufplanung/Entwurf Ernesto Wandeler 15."

Similar presentations

Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Modular Performance Analysis with Real-Time Calculus Lothar Thiele,

Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Modular Performance Analysis with Real-Time Calculus Lothar Thiele,
4/12/2015 Management of Engineering Projects Limited Resources Dr. L. K. Gaafar.

4/12/2015 Management of Engineering Projects Limited Resources Dr. L. K. Gaafar.
ECE 667 Synthesis and Verification of Digital Circuits

ECE 667 Synthesis and Verification of Digital Circuits
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Design Space Exploration of Embedded Systems © Lothar Thiele ETH Zurich.

1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Design Space Exploration of Embedded Systems © Lothar Thiele ETH Zurich.
School of Engineering & Technology Computer Architecture Pipeline.

School of Engineering & Technology Computer Architecture Pipeline.
STEINBUCH CENTRE FOR COMPUTING - SCC www.kit.edu KIT – University of the State of Baden-Württemberg and National Laboratory of the Helmholtz Association.

STEINBUCH CENTRE FOR COMPUTING - SCC KIT – University of the State of Baden-Württemberg and National Laboratory of the Helmholtz Association.
Reconfigurable Computing S. Reda, Brown University Reconfigurable Computing (EN2911X, Fall07) Lecture 10: RC Principles: Software (3/4) Prof. Sherief Reda.

Reconfigurable Computing S. Reda, Brown University Reconfigurable Computing (EN2911X, Fall07) Lecture 10: RC Principles: Software (3/4) Prof. Sherief Reda.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 2: Scheduling Real-Time Aperiodic Tasks.

1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 2: Scheduling Real-Time Aperiodic Tasks.
C HAPTER 3 Architecture and Organization © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Computer Organization and Architecture: Themes and.

C HAPTER 3 Architecture and Organization © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Computer Organization and Architecture: Themes and.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Performance Analysis of Embedded Systems Lothar Thiele ETH Zurich.

1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Performance Analysis of Embedded Systems Lothar Thiele ETH Zurich.
Lecture 37 CSE 331 Nov 4, 2009. Homework stuff (Last!) HW 10 at the end of the lecture Solutions to HW 9 on Monday Graded HW 9 on.

Lecture 37 CSE 331 Nov 4, Homework stuff (Last!) HW 10 at the end of the lecture Solutions to HW 9 on Monday Graded HW 9 on.
ECE 667 - Synthesis & Verification - Lecture 2 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Circuits Scheduling.

ECE Synthesis & Verification - Lecture 2 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Circuits Scheduling.
Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Power Management for Solar-Driven Sensor Nodes Clemens Moser ( joint.

Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Power Management for Solar-Driven Sensor Nodes Clemens Moser ( joint.
©2003, Philippe Cudré-Mauroux, EPFL-I&C-IIF, Distributed Information Systems Lab The Chatty Web approach for global semantic agreements MMGPS Workshop,

©2003, Philippe Cudré-Mauroux, EPFL-I&C-IIF, Distributed Information Systems Lab The Chatty Web approach for global semantic agreements MMGPS Workshop,
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 1: Real-Time Systems Ernesto Wandeler 20.

1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 1: Real-Time Systems Ernesto Wandeler 20.
The Dinitz Algorithm An example of a run. v1v1 Residual & Layered Networks construction s t v2v2 v3v3 v4v4 v5v5 v6v6 v7v7 25 1114 9 5 10 8 1 5 8 9 7 6.

The Dinitz Algorithm An example of a run. v1v1 Residual & Layered Networks construction s t v2v2 v3v3 v4v4 v5v5 v6v6 v7v
Embedded Systems Exercise 3: Scheduling Real-Time Periodic and Mixed Task Sets 18. May 2005 Alexander Maxiaguine.

Embedded Systems Exercise 3: Scheduling Real-Time Periodic and Mixed Task Sets 18. May 2005 Alexander Maxiaguine.
High Level Synthesis. Tasks of the Designer/Manager These ideas apply to the design itself, must be reproduced in the chip.

High Level Synthesis. Tasks of the Designer/Manager These ideas apply to the design itself, must be reproduced in the chip.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Übung 4: Ablaufplanung Ernesto Wandeler 22. Juni.

1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Übung 4: Ablaufplanung Ernesto Wandeler 22. Juni.
Lecture 37 CSE 331 Dec 1, 2010. A new grading proposal Towards your final score in the course MAX ( mid-term as 25%+ finals as 40%, finals as 65%) Email.

Lecture 37 CSE 331 Dec 1, A new grading proposal Towards your final score in the course MAX ( mid-term as 25%+ finals as 40%, finals as 65%) .

Similar presentations

Ads by Google