Improvement of Schedulability Analysis with a Priority Share Policy in On-Chip Networks

Abstract : Priority-based wormhole switching with a priority share policy has been proposed as a possible solution for real-time on-chip communication. However, the blocking introduced by priority share complicates the analysis process. In this paper, we propose a new “per-priority” basis analysis scheme which computes the total time window at each priority level instead of each traffic-flow. By checking the release instance of each flow at the corresponding priority window, we can determine schedulability efficiently.
Type de document :
Communication dans un congrès
Laurent George and Maryline Chetto andMikael Sjodin. 17th International Conference on Real-Time and Network Systems, Oct 2009, Paris, France. pp.75-84, 2009
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00441970
Contributeur : Alain Monteil <>
Soumis le : jeudi 17 décembre 2009 - 17:07:48
Dernière modification le : samedi 11 novembre 2017 - 19:04:02
Document(s) archivé(s) le : jeudi 17 juin 2010 - 21:59:56

Fichier

Networks_Shi.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00441970, version 1

Collections

Citation

Zheng Shi, Alan Burns. Improvement of Schedulability Analysis with a Priority Share Policy in On-Chip Networks. Laurent George and Maryline Chetto andMikael Sjodin. 17th International Conference on Real-Time and Network Systems, Oct 2009, Paris, France. pp.75-84, 2009. 〈inria-00441970〉

Partager

Métriques

Consultations de la notice

88

Téléchargements de fichiers

87