• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Response Time Analysis with Limited Carry-in ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
Title :
Response Time Analysis with Limited Carry-in for Global Earliest Deadline First Scheduling
Author(s) :
Sun, Youcheng [Auteur]
Scuola Universitaria Superiore Sant'Anna [Pisa] [SSSUP]
Lipari, Giuseppe [Auteur correspondant]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Conference title :
Real-Time Systems Symposium
Conference organizers(s) :
IEEE
City :
Saint Antonio (TX)
Country :
Etats-Unis d'Amérique
Start date of the conference :
2015-12-01
Journal title :
Proceedings of the IEEE Real-Time System Symposium
English keyword(s) :
Real-time
Scheduling
Schedulability analysis
Multicore Processors
HAL domain(s) :
Informatique [cs]/Systèmes embarqués
Informatique [cs]/Système d'exploitation [cs.OS]
English abstract : [en]
We address the problem of schedulability analysis for a set of sporadic real-time tasks scheduled by the Global Earliest Deadline First (G-EDF) policy on a multiprocessor platform. State-of-the-art tests for schedula-bility ...
Show more >
We address the problem of schedulability analysis for a set of sporadic real-time tasks scheduled by the Global Earliest Deadline First (G-EDF) policy on a multiprocessor platform. State-of-the-art tests for schedula-bility analysis of multiprocessor global scheduling are often incomparable. That is, a task set that is judged not schedulable by a test may be verified to be schedulable by another test, and vice versa. In this paper, we first develop a new schedulability test that integrates the limited carry-in technique and Response Time Analysis (RTA) procedure for Global EDF schedulability analysis. Then, we provide an over-approximate variant of this test with better run-time efficiency. Later, we extend these two tests to self-suspending tasks. All schedulability tests proposed in the paper have provable dominance over their state-of-the-art counterparts. Finally, we conduct extensive comparisons among different schedula-bility tests. Our new tests show significant improvements for schedulabil-ity analysis of Global EDF.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-01239132/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-01239132/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-01239132/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017