Skip to main content

MEJORA DEL PROCESADOR, SUBSISTEMA DE MEMORIA, ACELERADORES Y REDES

PID2021-123627OB-C51

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2021
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 21
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

SpinQ: Compilation strategies for scalable spin-qubit architectures

  • Paraskevopoulos, Nikiforos
  • Sebastiano, Fabio
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Despite Noisy Intermediate-Scale Quantum devices being severely constrained, hardware- and algorithm-aware quantum circuit mapping techniques have been developed to enable successful algorithm executions. Not so much attention has been paid to mapping and compilation implementations for spin-qubit quantum processors due to the scarce availability of experimental devices and their small sizes. However, based on their high scalability potential and their rapid progress it is timely to start exploring solutions on such devices. In this work, we discuss the unique mapping challenges of a scalable crossbar architecture with shared control and introduce SpinQ, the first native compilation framework for scalable spin-qubit architectures. At the core of SpinQ is the Integrated Strategy that addresses the unique operational constraints of the crossbar while considering compilation scalability and obtaining a O(n) computational complexity. To evaluate the performance of SpinQ on this novel architecture, we compiled a broad set of well-defined quantum circuits and performed an in-depth analysis based on multiple metrics such as gate overhead, depth overhead, and estimated success probability, which in turn allowed us to create unique mapping and architectural insights. Finally, we propose novel mapping techniques that could increase algorithm success rates on this architecture and potentially inspire further research on quantum circuit mapping for other scalable spin-qubit architectures., This work is part of the research program OTP with project number 16278, which is (partly) financed by the Netherlands Organisation for Scientific Research (NWO). This work has also been partially supported by the Spanish Ministerio de Ciencia e Innovación, European ERDF under grant PID2021-123627OB-C51 (CGA). We thank Menno Veldhorst and Hans van Someren for their fruitful discussions.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

ArtA: automating Design Space Exploration of spin-qubit architectures

  • Paraskevopoulos, Nikiforos
  • Hamel, David
  • Sarkar, Aritra
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] In the fast-paced field of quantum computing, identifying the architectural characteristics that will enable quantum processors to achieve high performance across a diverse range of quantum algorithms continues to pose a significant challenge. Given the extensive and costly nature of experimentally testing different designs, this paper introduces the first Design Space Exploration (DSE) for quantum-dot spin-qubit architectures. Utilizing the upgraded SpinQ compilation framework, this study explores a substantial design space comprising 29,312 spin-qubit-based architectures and applies an innovative optimization tool, ArtA (Artificial Architect), to speed up the design space traversal. ArtA can leverage 17 optimization configurations, significantly reducing exploration times by up to 99.1% compared to a traditional brute force approach while maintaining the same result quality. After a comprehensive evaluation of best-matching optimization configurations per quantum circuit, ArtA suggests specific as well as universal architectural features that provide optimal performance across the examined circuits. Our work demonstrates that combining DSE methodologies with optimization algorithms can be effectively used to generate meaningful design insights for quantum processor development., This work is part of the research program OTP with project number 16278, which is (partly) financed by the Netherlands Organisation for Scientific Research (NWO). CGA acknowledges funding from the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023) and from the European ERDF under grant PID2021-123627OB-C51.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

SMT Efficiency in Supervised ML Methods: a Throughput and Interference Analysis

  • Pons-Escat, Lucía|||0000-0002-4582-7744
  • Navarro-Edo, Marta|||0000-0002-4334-460X
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Pons Terol, Julio|||0000-0002-5654-6753
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] The microarchitecture of general-purpose processors is continuously evolving to adapt to the new computation and memory demands of incoming workloads. In this regard, new circuitry is added to execute specific instructions like vector multiplication or string operations. These enhancements and the support of multiple threads per core make simultaneous multithreading (SMT) processors dominate the market for data center processors. Regarding emerging workloads, machine learning is taking an important role in many research domains like biomedicine, economics, and social sciences. This paper analyzes the efficiency of machine learning workloads running in SMT mode (two threads per core) versus running them in ST mode (single-threaded) with twice the number of cores. Experimental results in an Intel Xeon Skylake-X processor show an SMT efficiency falling between 80% and 100% across the studied workloads. These results prove two main findings: i) last-generation SMT processors are excellent candidates to execute ML workloads as they achieve a high SMT efficiency, and ii) if the performance of two major resources (i.e., FP double operator and core's caches) was boosted, all the workloads would achieve an almost perfect SMT efficiency. Moreover, results show that there is still room to support more threads without adding extra hardware. The discussed findings are aimed at providing insights to design future processors for ML workloads., This work has been supported by the Spanish Ministerio de Ciencia e Innovación and European ERDF under grants PID2021 123627OB-C51 and TED2021 130233B-C32. Marta Navarro is supported by Subvenciones para la contratación de personal investigador predoctoral by CIACIF/2021/413.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures

  • Paraskevopoulos, Nikiforos
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] As quantum computing devices increase in size with respect to the number of qubits, two-qubit interactions become more challenging, necessitating innovative and scalable qubit routing solutions. In this work, we introduce beSnake, a novel algorithm specifically designed to address the intricate qubit routing challenges in scalable spin-qubit architectures. Unlike traditional methods in superconducting architectures that solely rely on swap operations, beSnake also incorporates the shuttle operation to optimize the execution time and fidelity of quantum circuits and achieves fast computation times of the routing task itself. Employing a simple breadth-first search approach, beSnake effectively manages the restrictions created by diverse topologies and qubit positions acting as obstacles for up to 72% qubit density. It also has the option to adjust the level of optimization and to dynamically tackle parallelized routing tasks, all the while maintaining noise awareness. Our simulations demonstrate beSnake's advantage over an existing routing solution on random circuits and real quantum algorithms with up to 1000 qubits, showing an average improvement of up to 80% in gate overhead, 54% in depth overhead, and up to 8.33 times faster routing times., This work was supported in part by the Netherlands Organisation for Scientific Research through the Research Program OTP under Grant 16278. The work of Carmen G. Almudever was supported in part by the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo Program 2020 under Grant BG20-00023 and in part by the European Regional Development Fund under Grant PID2021-123627OB-C51.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era

  • Escofet, Pau
  • Bandic, Medina
  • Prielinger, Luise
  • Van Someren, Hans
  • Feld, Sebastian
  • Alarcon, Eduard
  • Abadal, Sergi
  • Ovide-González, Anabel
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Quantum computing represents a paradigm shift in computation, offering the potential to solve complex problems intractable for classical computers. Although current quantum processors already consist of a few hundred qubits, their scalability remains a significant challenge. Modular quantum computing architectures have emerged as a promising approach to scale up quantum computing systems. This article delves into the critical aspects of distributed multi-core quantum computing, focusing on quantum circuit mapping, a fundamental task to successfully execute quantum algorithms across cores while minimizing inter-core communications. We derive the theoretical bounds on the number of non-local communications needed for random quantum circuits and introduce the Hungarian Qubit Assignment (HQA) algorithm, a multi-core mapping algorithm designed to optimize qubit assignments to cores with the aim of reducing inter-core communications. Our exhaustive evaluation of HQA against state-of-the-art circuit mapping algorithms for modular architectures reveals a 4.9x and 1.6x improvement in terms of execution time and non-local communications, respectively, compared to the best-performing algorithm. HQA emerges as a very promising scalable approach for mapping quantum circuits into multi-core architectures, positioning it as a valuable tool for harnessing the potential of quantum computing at scale., The authors gratefully acknowledge funding from the European Commission through HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE) and grant HORIZON-ERC-2021-101042080 (WINC) . This work has been partially supported by the Spanish Ministerio de Ciencia e Innovacion and European ERDF under grant PID2021-123627OB-C5.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Synthesizing an optimal spin-qubit shuttling-bus architecture for the surface code

  • Escofet, Pau
  • Alarcon, Eduard
  • Abadal, S
  • Semenov, Andrii
  • Murphy, Niall
  • Blokhina, Elena
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] As quantum computers scale toward millions of physical qubits, it becomes essential to robustly encode individual logical qubits to ensure fault tolerance under realistic noise. A high-quality foundational encoding allows future compilation techniques and heuristics to build on optimal or near-optimal layouts, improving scalability and error resilience. In this work, we synthesize a one-dimensional shuttling-bus architecture for the rotated surface code, leveraging coherent spin-qubit shuttling, following a methodology we name quantum reverse mapping. We formulate a mixed-integer optimization model that yields optimal solutions with relatively low execution time for small code distances, and propose a scalable heuristic that matches optimal results while maintaining linear computational complexity. We evaluate the synthesized architecture using architectural metrics, such as shuttling distance and cycle time, and full quantum simulations under realistic noise models, showing that the proposed design can sustain logical error rates as low as 2 & times; 10-10 per round at code distance 21, showcasing its feasibility for scalable quantum error correction in spin-based quantum processors., Authors acknowledge funding from the EC through Grant No. HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE) . E.A. acknowledges funding from the Spanish Ministry of Science, Innovation, and Universities and European ERDF (QCOMM-CAT-Planes Complementarios) , Generalitat de Catalunya, and ICREA Academia Grant 2024. S.A. acknowledges funding from the EC through Grant No. HORIZON-ERC-2021-101042080 (WINC) . E.B. acknowledges funding from Science Foundation Ireland under Grant No. 21/RP-2TF/10019. C.G.A. acknowledges funding from QuantERA EQUIP Grant No.PCI2022-133004, funded by Agencia Estatal de Investigacion, Ministerio de Ciencia e Innovacion, Gobierno de Espana, Project No. MCIN/AEI/10.13039/501100011033, from the European Union NextGenerationEU/PRTR, and from the Spanish Ministry of Science, Innovation, and Universities and European ERDF under Grants No. PID2021-123627OB-C51 and No. PID2024-158682OB-C31. P.E. acknowledges funding from the predoctoral FPI-UPC grant supported by UPC and Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

TailBench plus plus : flexible multi-client, multi-server benchmarking for latency-critical workloads

  • Li, Zhibin
  • Pons-Escat, Lucía|||0000-0002-4582-7744
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Pons Terol, Julio|||0000-0002-5654-6753
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Cloud systems have rapidly expanded worldwide in the last decade, shifting computational tasks to cloud servers where clients submit their requests. Among cloud workloads, latency-critical applications -characterized by high-percentile response times - have gained special interest. These applications are present in modern services, representing an important fraction of cloud workloads. This work analyzes common cloud benchmarking suites and identifies TailBench as the most suitable to assess cloud performance with latency-critical workloads. Unfortunately, this suite presents key limitations, especially in multi-server scenarios or environments with variable client arrival patterns and fluctuating loads. To address these limitations, we propose TailBench++, an enhanced benchmark suite that extends TailBench to enable cloud evaluation studies to be performed in dynamic multi-client, multi-server environments. It allows reproducing experiments with varying client arrival times, dynamic query per second (QPS) fluctuations, and multiple servers handling requests. Case studies show that TailBench++ enables more realistic evaluations by capturing a wider range of real-world scenarios., This work has been supported by the Spanish Ministerio de Ciencia e Innovacion and European ERDF under grants PID2021-123627OB-C51 and PID2024-158682OB-C31, as well as by the Generalitat Valenciana under grant CIPROM/2024/007.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Main memory controller with multiple media technologies for big data workloads

  • Avargues, Miguel A.
  • Lurbe-Sempere, Manel
  • Yang, Rui
  • Zhu, Xiaoping
  • Wang, Guanhao
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] SRAM and DRAM memory technologies have been dominant in the implementations of memory subsystems. In recent years, and mainly driven by the huge memory demands of big data applications, NVRAM technology has emerged as a denser memory technology, enabling the design of new hybrid DRAM/NVRAM memory hierarchies that combine multiple memory media technologies to balance memory capacity, latency, cost, and endurance. Two main approaches are being applied to the design of hybrid memory hierarchies: the hybrid address space approach, which relies on the programmer or the operating system to choose the memory technology where each memory page should be stored; and the (only) NVM address space approach, where a faster technology (e.g. commodity DRAM) is needed to acts as a cache of NVRAM to boost the performance. This approach presents architectural challenges such the organization of metadata (e.g. cache tags) and the selection of the proper technology for each memory component. In contrast to existing approaches, this work proposes a memory controller that leverages novel memory technologies such as eDRAM and MRAM to mitigate NVRAM bus contention and improve the performance of the NVM address space. The devised solution proposes a two-level cache hierarchy in the memory controller: a SRAM sector cache and a (x)RAM cache. The (x)RAM cache, much denser, helps significantly reduce the number of accesses to NVRAM. Experimental results show that implementing the (x)RAM cache with eDRAM or MRAM is the best performing approach. Moreover, the eRAM is able to improve the SRAM cache miss penalty by up to 50% and 80%, and overall system performance by 15% and 23%., This work has been partially supported by Huawei under Agreement No: TC20210705020, by the Spanish Ministerio de Ciencia e Innovacion and European ERDF under grants PID2021-123627OB-C51 and TED2021-130233B-C32.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Advanced resource management: A hands-on master course in HPC and cloud computing

  • Pons-Escat, Lucía|||0000-0002-4582-7744
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Resource management has become a major concern in dealing with performance and fairness in recent computing servers, including a wide variety of shared resources. To achieve high-performing and efficient systems, both hardware and software engineers must be thoroughly trained in effective resource management techniques. This paper introduces the GRE master course (Spanish acronym for Resource Management and Performance Evaluation in Cloud and High-Performance Workloads), which is being offered since Fall 2023. The course is taught by instructors with broad research expertise in resource management and performance evaluation. Subjects covered in this course include workload characterization, state-of-the-art resource management approaches, and performance evaluation tools and methodologies used in production systems. Management techniques are studied both in the context of HPC and cloud computing, where resource efficiency is becoming a primary concern. To enhance the learning experience, the course integrates theoretical concepts with a wide set of hands-on tasks carried out on recent real platforms. A real cloud virtualized environment is mimicked using typical software deployed in production systems such as Proxmox Virtual Environment. Students learn to use tools such as Linux Perf and Intel Vtune Profiler, which are commonly employed by researchers and practitioners to carry out typical tasks like performance bottleneck analysis from a microarchitectural perspective. Overall, the GRE course provides students with a solid foundation and skills in resource management by addressing current hot topics both in the industry and academia. Student satisfaction and learning outcomes prove the success of the GRE course and encourage us to continue in this direction., This work has been supported by the Spanish Ministerio de Ciencia e Innovación and European ERDF under grants PID2021-123627OB-C51 and TED2021-130233B-C32.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Predicting the Temporal Variability of Error Rates in Superconducting Quantum Processors: Mitigating Error Accuracy Loss in Queue-Based Quantum Computing Platforms [Focus: Quantum Software and its Engineering]

  • Rodríguez-Soriano, Laura|||0000-0002-2074-0466
  • García-Herrero, Francisco
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Multiple layers of the quantum system full-stack require data on temporal variations in error rates of physical elements. This article proposes using five machine learning and time-series models to predict error rate variability for two-qubit gates based on calibration data., This work is supported by the QuantERA grant EQUIP with Grants PCI2022-133004 and PCI2022-132922, funded by Agencia Estatal de Investigacion, Ministerio de Ciencia e Innovacion, Gobierno de Espana, MCIN/AEI /10.13039/501100011033, and by the European Union "NextGenerationEU/PRTR." CGA acknowledges funding from the Spanish Ministry of Science, In-novation, and Universities through the Beatriz Galindo program 2020 (BG20-00023), from the European ERDF under Grant PID2021-123627OB-C51, and from the Ministry for Digital Transformation and of Civil Service of the Spanish Government through the QUANTUM ENIA project call-Quantum Spain project, and by the European Union through the Recovery, Transformation and Resilience Plan - NextGenerationEU within the framework of the Digital Spain 2026 Agenda. We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors and do not reflect the official policy or position of IBM or the IBM Quantum team.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Energy efficient HPC network topologies with on/off links

  • Andújar-Muñoz, Francisco José
  • Sánchez García, José Luis
  • Alfaro Cortés, Francisco José
  • Coll, Salvador|||0000-0002-7795-7252
  • Alonso Díaz, Marina|||0000-0001-7079-5898
  • Martínez-Rubio, Juan-Miguel|||0000-0002-9748-0332
  • López Rodríguez, Pedro Juan|||0000-0003-4544-955X
[EN] Energy efficiency is a must in today HPC systems. To achieve this goal, a holistic design based on the use of power-aware components should be performed. One of the key components of an HPC system is the high-speed interconnect. In this paper, we compare and evaluate several design options for the interconnection network of an HPC system, including torus, fat-trees and dragonflies. State of the art low power modes are also used in the interconnection networks. The paper does not only consider energy efficiency at the interconnection network level but also at the system as a whole.The analysis is performed by using a simple yet realistic power model of the system. The model has been adjusted using actual power consumption values measured on a real system. Using this model, realistic multi-job trace-based workloads have been used, obtaining the execution time and energy consumed. The results are presented to ease choosing a system, depending on which parameter, performance or energy consumption, receives the most importance., This work has been supported by the Spanish Ministerio de Ciencia e Innovacion (MICINN, formerly MINECO) , and the European Commission (FEDER funds) under the projects PID2019- 105903RB-100 and PID2021-123627OB-C5, and by Junta de Comunidades de Castilla -La Mancha under the project SBPLY/21/180501/000248.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Power-aware scheduling strategies for improving performance and energy consumption in heterogeneous multicore platforms

  • Mazón, Ricardo
  • Hassan Mohamed, Houcine|||0000-0002-2038-0587
[EN] Energy consumption is an increasingly critical concern in multicore embedded real-time systems, especially when it is referred to systems that operate under battery constraints as mobile devices. Moreover, these systems must enhance performance such as the execution time while meeting temporal constraints to reduce deadline miss rates. Although Heterogeneous Multi-Processing (HMP) architectures offer opportunities for power optimization using dynamic voltage and frequency scaling (DVFS), standard operating system (OS) governors do not consider benchmark characteristics, memory or CPU usage, and optimal co-runner configurations. This limitation leads to scheduling decisions that trigger early battery depletion or extreme deadline violations under high system utilization. To solve these challenges, this paper proposes a two-level scheduling and DVFS framework. The proposed solution performs profiling benchmark-pair combinations to construct a static co-runner compatibility matrix. Online, a supervisor level (Partitioner) dynamically evaluates global system constraints, tracking remaining battery status and runtime deadline miss rates to adaptively select an heuristic strategy (A_max, B_max, B_eff). In the second level, a Task Scheduler executes tasks based on Earliest Deadline First (EDF) policy, integrated with a power estimation model. This structure translates a nonlinear, NP-hard multi-objective optimization problem into a deterministic, constant-time O(1) runtime overhead per task. Experimental evaluations are conducted on an ODROID XU4 platform containing a Samsung Exynos 5422 heterogeneous multicore processor, based on an ARM big.LITTLE architecture, using a set of embedded real-time benchmarks. The results show that: (i) B_max strategy delivers a suitable trade-off by simultaneously reducing mean energy consumption by about 7% and execution time by around 8%, compared to the OS., at the same time reducing drastically deadline failures by 72.61% under a 50% workload; (ii) the aggressive B_eff configuration, decreases power consumption by 50% in situations with ample slack time; and (iii) the A_max recovery strategy achieves about 29% acceleration, hence preventing system degradation under extreme workload saturation. Finally, integrating these context-aware mechanisms prevents the hardware from performance collapse, maximizing battery longevity while ensuring suitable real-time predictability., This work has been supported by the Spanish Ministerio de Ciencia e Innovación and European ERDF under grants PID2021-123627OB-C51 and PID2024-158682OB-C31, and Generalitat Valenciana under grant CIPROM/2024/007.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Reducing the number of qubits in quantum simulations of one dimensional many-body Hamiltonians

  • Mehrabankar, Somayeh
  • Pérez, Armando
  • Garcia March, Miguel Angel|||0000-0001-7092-838X
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] We investigate the Ising and Heisenberg models using the block renormalization group method (BRGM), focusing on its behavior across different system sizes. The BRGM reduces the number of spins by a factor of 1/2 (1/3) for the Ising (Heisenberg) model, effectively preserving essential physical features of the model while using only a fraction of the spins. Through a comparative analysis, we demonstrate that as the system size increases, there is an exponential convergence between results obtained from the original and renormalized Ising Hamiltonians, provided the coupling constants are redefined accordingly. Remarkably, for a spin chain with 24 spins, all physical features, including magnetization, correlation function, and entanglement entropy, exhibit an exact correspondence with the results from the original Hamiltonian. The study of the Heisenberg model also shows this tendency, although complete convergence may appear for a size much larger than 24 spins, and is therefore beyond our computational capabilities. The success of BRGM in accurately characterizing the Ising model, even with a relatively small number of spins, underscores its robustness and utility in studying complex physical systems, and facilitates its simulation on current NISQ computers, where the available number of qubits is largely constrained., The authors would like to acknowledge the enlightening discussions with German Sierra and express their gratitude to Ali Najafi (www.linkedin.com/in/ali-najafi-84345546) for his collaboration in numerical calculations. These calculations were performed using the Luis Vives machine at the University of Valencia, Spain. The authors gratefully acknowledge the computer resources at Artemisa, funded by the European Union ERDF and Comunitat Valenciana, as well as the technical support provided by the Instituto de Fisica Corpuscular, IFIC (CSIC-UV). This work has been funded by the Spanish MCIN/AEI/10.13039/501100011033 Grant PID2020-113334GB-I00, Generalitat Valenciana Grant CIPROM/2022/66, the Ministry of Economic Affairs and Digital Transformation of the Spanish Government through the QUANTUM ENIA project call-QUANTUM SPAIN project, and by the European Union through the Recovery, Transformation, and Resilience Plan: NextGenerationEU within the framework of the Digital Spain 2026 Agenda, and by the CSIC Interdisciplinary Thematic Platform (PTI+) on Quantum Technologies (PTI-QTEP+). This project has also received funding from the European Union's Horizon 2020 research and innovation program under Grant Agreement 101086123-CaLIGOLA. M A G-M acknowledges funding from the Spanish Ministry of Education and Professional Training (MEFP) through the Beatriz Galindo program 2018 (BEAGAL18/00203), QuantERA II Cofund 2021 PCI2022-133004, Projects of MCIN with funding from European Union Next GenerationEU (PRTR-C17.I1) and by Generalitat Valenciana, with reference 20220883 (PerovsQuTe) and COMCUANTICA/007 (QuanTwin), and Red Tematica RED2022-134391-T. CGA acknowledges support from the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023) and the European ERDF under Grant PID2021-123627OB-C51 and from the QuantERA Grant EQUIP with the Grant Numbers PCI2022-133004, funded by Agencia Estatal de Investigacion, Ministerio de Ciencia e Innovacion, Gobierno de Espana, MCIN/AEI/10.13039/501100011033, and by the European Union 'NextGenerationEU/PRTR'
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Implementing Quantum Polar Codes in a Superconducting Processor: From State Preparation to Decoding [Focus: Quantum Software and Its Engineering]

  • Kurniawan, Handy
  • Savin, Valentin
  • Garcia Herrero, Francisco
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] A full-stack software framework for implementing quantum polar codes is presented, integrating a noise-aware compilation approach that optimizes resource usage by combining quantum and classical software. Experimental results demonstrate significant improvements in logical state preparation rates, resulting in reduced comsumption of both quantum and classical resources., This work was supported by the QuantERA project EQUIP (Grants PCI2022-133004 and PCI2022-132922, funded by the AEI, Ministerio de Ciencia e Innovacion, Gobierno de Espana, MCIN/AEI/10. 13039/501100011033, and ANR-22-QUA2-0005-01, funded by the Agence Nationale de la Recherche, France), and by the European Union "Next Generation EU/PRTR". This research is part of the project PID2023-147059OB-I00 funded by MCIU/AEI/10 .13 039/50110 0011033/FEDER, UE. Handy Kurniawan acknowledges support from the Comunidad de Madrid under Grant PIPF-2023/COM-30051. Carmen G. Almudever acknowledges support from the Spanish Ministry of Science, Innovation, and Universities through the Beatriz Galindo program 2020 (BG20-00023) and the European ERDF PID2021-123627OB-C51. We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors and do not reflect the official policy or position of IBM or the IBM Quantum team. This article has supplementary downloadable material available at https://doi.org/10.1109/MS.2025.3569447, provided by the authors.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Cloud White: Detecting and Estimating QoS Degradation of Latency-Critical Workloads in the Public Cloud

  • Pons-Escat, Lucía|||0000-0002-4582-7744
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Pons Terol, Julio|||0000-0002-5654-6753
  • Huang, Chaoyi
[EN] The increasing popularity of cloud computing has forced cloud providers to build economies of scale to meet the growing demand. Nowadays, data-centers include thousands of physical machines, each hosting many virtual machines (VMs), which share the main system resources, causing interference that can significantly impact on performance. Frequently, these data-centers run latency-critical workloads, whose performance is determined by tail latency, which is very sensitive to the interference of co-running workloads. To prevent QoS violations, cloud providers adopt overprovisioning strategies but they reduce the server utilization and increase the costs. A mechanism that accurately estimates performance degradation dynamically in a production system would allow cloud providers to improve the servers' utilization. In this work we propose Cloud White, an approach that is able to detect the inter-VM interference in scenarios with multiple co-located latency-critical VMs and estimate the performance degradation using multi-variable regression models. Unlike previous proposals, Cloud White is built taking into account the limitations of a public cloud production system. Experimental results show that Cloud White is able to estimate performance degradation with a small overall prediction error of 5%., This work has been supported by Huawei Cloud, and in part by Spanish Ministerio de Universidades under grant FPU18/01948, and by Spanish Ministerio de Universidades and European ERDF under grants RTI2018-098156-B-C51 and PID2021-123627OB-C51. Funding for open access charge: CRUE-Universitat Politec-nica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Dual Fast-Track Cache: Organizing Ring-Shaped Racetracks to Work as L1 Caches

  • Valero, Alejandro
  • Lorente Garcés, Vicente Jesús
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Static Random-Access Memory (SRAM) is the fastest memory technology and has been the common design choice for implementing first-level (L1) caches in the processor pipeline, where speed is a key design issue that must be fulfilled. On the contrary, this technology offers much lower density compared to other technologies like Dynamic RAM, limiting L1 cache sizes of modern processors to a few tens of KB. This paper explores the use of slower but denser Domain Wall Memory (DWM) technology for L1 caches. This technology provides slow access times since it arranges multiple bits sequentially in a magnetic racetrack. To access these bits, they need to be shifted in order to place them under a header. A 1-bit shift usually takes one processor cycle, which can significantly hurt the application performance, making this working behavior inappropriate for L1 caches. Based on the locality (temporal and spatial) principles exploited by caches, this work proposes the Dual Fast-Track Cache (Dual FTC) design, a new approach to organizing a set of racetracks to build set-associative caches. Compared to a conventional SRAM cache, Dual FTC enhances storage capacity by 5x while incurring minimal shifting overhead, thereby rendering it a practical and appealing solution for L1 cache implementations. Experimental results show that the devised cache organization is as fast as an SRAM cache for 78% and 86% of the L1 data cache hits and L1 instruction cache hits, respectively (i.e., no shift is required). Consequently, due to the larger L1 cache capacities, significant system performance gains (by 22% on average) are obtained under the same silicon area., This work was supported in part by Agencia Estatal de Investigacion (AEI) under Grant PID2022-136454NB-C22/AEI/10.13039/501100011033; in part by the Spanish Ministerio de Ciencia e Innovacion and European ERDF under Grant PID2021-123627OB-C51 and Grant TED2021-130233B-C32; in part by European Union-NextGenerationE under Grant PDC2023-145851-00/MCIN/AEI/10.13039/501100011033; and in part by the Department of Science, University, and Knowledge Society, Government of Aragon under Grant gaZ: T58_23R research group.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Power, energy, and performance analysis of single-and multi-threaded applications in the ARM ThunderX2

  • Calero, Ibai
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Energy efficiency has been a major concern in data centers, and the problem is exacerbated as its size continues to rise. However, the lack of tools to measure and handle this energy at a fine granularity (e.g., processor core or last-level cache) has translated into slow research advances in this topic. Understanding where (i.e., which components) and when (the point in time) energy consumption translates into minor performance improvements is of paramount importance to design any energy-aware scheduler. This paper characterizes the relationship between energy consumption and performance in a 28-core ARM ThunderX2 processor for both single-threaded and multi-threaded applications. This paper shows that single-threaded applications with high CPU activity maintain their performance in spite of the inter-application interference at shared resources, but this comes at the expense of higher power consumption. Conversely, applications that heavily utilize the L3 cache and memory consume less power but suffer significant performance degradation as interference levels rise. In contrast, multi-threaded applications show two distinct behaviors. On the one hand, some of them experience significant performance gains when they execute in a higher number of cores with more threads, which outweighs the increase in power consumption, leading to high energy efficiency., This work has been partially supported by the Spanish Ministerio de Ciencia e Innovacion and European ERDF under grants PID2021-123627OB-C51 and TED2021-130233B-C32.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A modular approach to build a hardware testbed for cloud resource management research

  • Pons-Escat, Lucía|||0000-0002-4582-7744
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Pons Terol, Julio|||0000-0002-5654-6753
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Research on resource management focuses on optimizing system performance and energy efficiency by distributing shared resources like processor cores, caches, and main memory among competing applications. This research spans a wide range of applications, including those from high-performance computing, machine learning, and mobile computing. Existing research frameworks often simplify research by concentrating on specific characteristics, such as the architecture of the computing nodes, resource monitoring, and representative workloads. For instance, this is typically the case with cloud systems, which introduce additional complexity regarding hardware and software requirements. To avoid this complexity during research, experimental frameworks are being developed. Nevertheless, proposed frameworks often fail regarding the types of nodes included, virtualization support, and management of critical shared resources. This paper presents Stratus, an experimental framework that overcomes these limitations. Stratus includes different types of nodes, a comprehensive virtualization stack, and the ability to partition the major shared resources of the system. Even though Stratus was originally conceived to perform cloud research, its modular design allows Stratus to be extended, broadening its research use on different computing domains and platforms, matching the complexity of modern cloud environments, as shown in the case studies presented in this paper., This work has been supported by the Spanish Ministerio de Universidades under the grant FPU18/01948 and by the Spanish Ministerio de Ciencia e Innovación and European ERDF under grants PID2021-123627OB-C51 and TED2021-130233B-C32, and by Generalitat Valenciana under Grant AICO/2021/266.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity

  • Steinberg, Matthew
  • Bandic, Medina
  • Szkudlarek, Sacha
  • Sarkar, Aritra
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Efficiently mapping quantum circuits onto hardware is integral for the quantum compilation process, wherein a circuit is modified in accordance with a quantum processor¿s connectivity. Many techniques currently exist for solving this problem, wherein SWAP-gate overhead is usually prioritized as a cost metric. We reconstitute quantum circuit mapping using tools from quantum information theory, showing that a lower bound, which we dub the lightcone bound, emerges for a circuit executed on hardware. We also develop an initial placement algorithm based on graph similarity search, aiding us in optimally placing circuit qubits onto a device. 600 realistic benchmarks using the IBM Qiskit compiler and a brute-force method are then tested against the lightcone bound, with results unambiguously verifying the veracity of the bound, while permitting trustworthy estimations of minimal overhead in near-term realizations of quantum algorithms. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing., Quantum circuit mapping; Quantum compilation; Lightcone bound; Graph similarity; Qubit placement; Quantum information theory
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Interaction graph-based profiling of quantum benchmarks for improving quantum circuit mapping techniques

  • Bandic, Medina
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] To execute quantum circuits on a quantum processor, they must be modifed to meet the physical constraints of the quantum device. This process, called quantum circuit mapping, results in a gate/circuit depth overhead that depends on both the circuit properties and the hardware constraints, being the limited qubit connectivity a crucial restriction. In this paper, we propose to extend the characterization of quantum circuits by including qubit interaction graph properties using graph theorybased metrics in addition to previously used circuit-describing parameters. This approach allows for an in-depth analysis and clustering of quantum circuits and a comparison of performance when run on diferent quantum processors, aiding in developing better mapping techniques. Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing confgurations of quantum devices. We also provide a comprehensive collection of quantum circuits and algorithms for benchmarking future compilation techniques and quantum devices., This work has been partially supported by the Spanish Ministerio de Ciencia e Innovación and European ERDF under grant PID2021-123627OB-C51 and by the QuantERA grant EQUIP, by the Ministerio de Ciencia e Innovación and Agencia Estatal de Investigación, MCIN/AEI/10.13039/501100011033, and by the European Union NextGenerationEU/PRTR (CGA).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

WAPA: A Microarchitecture- and Workload-Agnostic Universal SMT Scheduler

  • Navarro-Edo, Marta|||0000-0002-4334-460X
  • Pons-Escat, Lucía|||0000-0002-4582-7744
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
  • Pallardó-Julià, Vicent
[EN] This paper presents WAPA, a thread-to-core allocation policy for SMT processors grounded in OT theory, and demonstrates its effectiveness in achieving two key design goals: microarchitecture agnosticism and workload agnosticism. WAPA is implemented on both Intel Xeon and ARM ThunderX2 platforms without requiring modifications, leveraging universally available performance counters. Experimental results show that WAPA consistently outperforms both the default Linux scheduler and state-of-the-art model-based approaches, achieving up to 110% improvement in turnaround time on Intel and over 30% average gains on ARM. Furthermore, we show WAPA is extensible to support alternative cost metrics beyond CPI, such as energy consumption or fairness. These findings position WAPA as a practical and portable solution for integration into modern operating system schedulers., The work of Marta Navarro was supported by Generalitat Valencianathrough "Subvenciones para la contratacion de personal investigador pre-doctoral" under Grant CIACIF/2021/413. This work was supported in partby MICIU/AEI/10.13039/501100011033/ FEDER, UE under Grant PID2024-158682OB-C31 and Grant PID2021-123627OB-C51 and in part by GeneralitatValenciana under Grant CIPROM/2024/7.