UMCP - SDAG Seminar Series

Dynamic Scheduling of Hard Real-Time Tasks in a Distributed Evnironment
by Sameh Mohamed El-Sharkawy

Slides from the talk on May 5, 1999.

  • 1 - Title
  • 2 - Topics
  • 3 - Real-Time Scheduling
  • 4 - Real-Time Communication
  • 5 - Problem Definition
  • 6 - Task Model
  • 7 - Task Model (Illustrated)
  • 8 - Network Model
  • 9 - Network Model (Illustrated)
  • 10 - Distributed Off-Line Scheduling
  • 11 - Communication Feasibility
  • 12 - Communication Feasibility (Illustrated)
  • 13 - Get Global Task Order
  • 14 - Get Global Task Order (Illustrated)
  • 15 - Gloabl Constraint Graph
  • 16 - Global Constraint Graph (Illustrated)
  • 17 - Global Feasibility
  • 18 - Local Node Calendars
  • 19 - Algorithm Correctness
  • 20 - Global Schedulability Validation
  • 21 - Local Calendars Feasibility
  • 22 - On-Line Dynamic Dispatcher
  • 23 - Future Work
    Last update 1999/05/05 by Simon Hawkin

    Web Accessibility