Dimensions of fixed-priority aperiodic servers

  • Abhishek Singh
  • , Sanjoy Baruah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We identify the budget and the utilization of an aperiodic server as vital attributes that affect its performance. Based on this observation, we formulate an optimization problem in which we are given a minimum budget for multiple servers running at the same priority, and the objective is to find the dimensions (budgets and periods) of these servers to maximize their cumulative utilization. We propose a linear-time algorithm for solving the problem if priorities are rate-monotonic, periods are harmonic, and deadlines are equal to periods. We also propose mixed-integer nonlinear programs for the general problem when these simplifying assumptions are lifted. Finally, we discuss issues arising when implementing multiple servers at the same priority, and we show how to modify the specifications of servers to address these issues.

Original languageEnglish
Title of host publicationProceedings of 31st International Conference on Real-Time Networks and Systems, RTNS 2023
PublisherAssociation for Computing Machinery
Pages56-66
Number of pages11
ISBN (Electronic)9781450399838
DOIs
StatePublished - Jun 7 2023
Event31st International Conference on Real-Time Networks and Systems, RTNS 2023 - Dortmund, Germany
Duration: Jun 7 2023Jun 8 2023

Publication series

NameACM International Conference Proceeding Series

Conference

Conference31st International Conference on Real-Time Networks and Systems, RTNS 2023
Country/TerritoryGermany
CityDortmund
Period06/7/2306/8/23

Keywords

  • MINLP
  • algorithm design
  • aperiodic servers
  • fixed priority
  • harmonic
  • optimization

Fingerprint

Dive into the research topics of 'Dimensions of fixed-priority aperiodic servers'. Together they form a unique fingerprint.

Cite this