Towards a quantum algorithm for evaluating WCETs: an overview - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Towards a quantum algorithm for evaluating WCETs: an overview

Résumé

In this paper we propose a quantum-based solution to the problem of counting the cache hits, an important issue when analyzing real-time embedded applications. This field has already seen the development of “quantum-inspired” classical algorithms which are competitive with the state of the art. We designed a polynomial-time dynamic programming algorithm for computing the lowest number of cache hits realized by a deterministic sequence of memoryaccesses, in the presence of preemptions. Our contribution consists in porting that algorithm to the quantum framework, improving the complexity of the algorithm from O(N³) to O(N²+N).
ROADEF_2022_1_.pdf (309.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03596241 , version 1 (03-03-2022)

Identifiants

  • HAL Id : hal-03596241 , version 1

Citer

Gabriella Bettonte, Stéphane Louise, Renaud Sirdey. Towards a quantum algorithm for evaluating WCETs: an overview. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03596241⟩
35 Consultations
10 Téléchargements

Partager

Gmail Facebook X LinkedIn More