Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Performance analysis of dynamic priority shifting

Reinecke, Philipp ORCID:, Wolter, Katinka and Zapotoczky, Johannes 2008. Performance analysis of dynamic priority shifting. Presented at: EPEW 2008: 5th European Performance Engineering Workshop, Palma de Mallorca, Spain, 24-25 September 2008. Published in: Thomas, Nigel and Juiz, Carlos eds. Computer Performance Engineering: 5th European Performance Engineering Workshop, EPEW 2008, Palma de Mallorca, Spain, September 24-25, 2008. Proceedings. Lecture notes in computer science. , vol.5261 Springer, 181 - 196. 10.1007/978-3-540-87412-6_14

Full text not available from this repository.


We investigate the benefit of priority shifting for resource allocation in systems with a shared resource, where higher priority implies better service. Priority schemes where priority levels are assigned fixed shares of the resource experience underutilisation if there are only low-priority tasks present. In these situations, lower priority tasks can be ‘shifted up’ to higher priority. This increases overall system utilisation and improves the service experienced by low-priority tasks. We present a shifting framework, study its properties and develop a Petri net model for a shifting algorithm. We analyse the model in order to identify situations where shifting of priorities is beneficial.

Item Type: Conference or Workshop Item (Paper)
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Publisher: Springer
ISBN: 9783540874119
ISSN: 1611-3349
Last Modified: 26 Oct 2022 07:13

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item