Back to Results
First PageMeta Content
Technology / Scheduling / Worst-case execution time / Job shop scheduling / Mission critical / Computing / Scheduling algorithms / Operations research / Real-time computing


Scheduling real-time mixed-criticality jobs Sanjoy Baruah1, , Vincenzo Bonifaci2 , Gianlorenzo D’Angelo3 , Haohan Li1 , Alberto Marchetti-Spaccamela4 , Nicole Megow2 , and Leen Stougie5
Add to Reading List

Document Date: 2010-06-18 12:46:37


Open Document

File Size: 184,51 KB

Share Result on Facebook

City

Monteluco di Roio / /

Company

IBM / AT&T / Air Force Research Laboratory / Cyber Physical Systems / Aquila / /

Country

Germany / United States / Italy / /

Currency

pence / /

/

Facility

Air Force Research Laboratory / Chapel Hill / Sapienza University of Rome / The University of North Carolina / /

IndustryTerm

given processor / mixed-criticality systems / on-line scheduling policy / safety-critical embedded systems / mixedcriticality systems / mixed-criticality realtime systems / correct on-line scheduling policy / online scheduling policy / preemptive single machine scheduling algorithm / dualcriticality systems / mixed criticality systems / speed-s processor / speed-sh processor / approximation algorithms / /

Organization

Max-Planck-Institut f¨ / National Security Agency / National Science Foundation / University of North Carolina / Chapel Hill / National Aeronautics and Space Administration / University of Rome / Rome / /

Person

Job Ji / /

Position

formal model for representing such mixed-criticality workloads / /

ProvinceOrState

North Carolina / /

TVStation

WCET / /

Technology

machine scheduling algorithm / given processor / speed-1 processor / unit-speed processor / approximation algorithms / speed-s processor / same processor / speed-sh processor / /

SocialTag