UCI CS 244 - Introduction to Embedded Systems and Ubiquitous Computing (44 pages)

Previewing pages 1, 2, 3, 21, 22, 23, 42, 43, 44 of 44 page document View the full content.
View Full Document

Introduction to Embedded Systems and Ubiquitous Computing



Previewing pages 1, 2, 3, 21, 22, 23, 42, 43, 44 of actual document.

View the full content.
View Full Document
View Full Document

Introduction to Embedded Systems and Ubiquitous Computing

43 views

Lecture Notes


Pages:
44
School:
University of California, Irvine
Course:
Cs 244 - Introduction to Embedded Systems and Ubiquitous Computing

Unformatted text preview:

CS244 Introduction to Embedded Systems and Ubiquitous Computing Instructor Eli Bozorgzadeh Computer Science Department UC Irvine Winter 2010 CS244 Lecture 4 Real Time Scheduling Winter 2010 CS 244 2 Embedded Systems Design Hardware Components Hardware Flow Concept Specification HW SW Partitioning Estimation Exploration gn i s De t u ayo L si s e nth y S De sig n C om pil a ti on Software Software Components Winter 2010 CS 244 Validation and Evaluation area power performance 3 Reuse of standard software components Knowledge from previous designs to be made available in the form of intellectual property IP for SW HW Operating systems Middleware Real time data bases Standard software MPEG x GSM kernel Includes standard approaches for scheduling requires knowledge about execution times Winter 2010 CS 244 4 Software Components Prediction of execution time Scheduling in real time systems Embedded operating systems Classification of scheduling algorithms Aperiodic scheduling Periodic scheduling Real time OS Middleware Winter 2010 CS 244 5 Worst Case Execution Time Def The worst case execution time WCET is an upper bound on the execution times of tasks Computing such a bound is undecidable Possible for programs without recursion and finite loops Pipeline hazards interrupts caches serious overestimates Approaches for hardware typically requires hardware synthesis for software requires availability of machine programs complex analysis Winter 2010 CS 244 6 Average Execution Time Estimated cost and performance values Difficult to generate sufficiently precise estimates Balance between run time and precision Accurate cost and performance values Can be done with normal tools such as compilers As precise as the input data is Winter 2010 CS 244 7 Real Time Scheduling Assume that we have a task graph G V E A schedule of G is a mapping V T of a set of tasks V to start times from domain T Schedules have to respect a set of constraints such as resource dependency and deadlines



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Introduction to Embedded Systems and Ubiquitous Computing and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Introduction to Embedded Systems and Ubiquitous Computing and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?