Skip to main content

COMPUTACION DE ALTAS PRESTACIONES EFICIENTE Y SEGURA PARA APLICACIONES DE SERVICIOS DE SALUD INTELIGENTES

PID2020-112496GB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A Metaheuristic Search Algorithm based on Sampling and Clustering

  • Harita Rascon, María de los Ángeles|||0000-0002-3732-4717
  • Wong, Álvaro|||0000-0002-8394-9478
  • Suppi, Remo|||0000-0002-0373-8292
  • Rexachs, Dolores|||0000-0001-5500-850X
  • Luque, Emilio|||0000-0002-2884-3232
As optimization problems become more complicated and extensive, parameterization becomes complex, resulting in a difficult task requiring significant amounts of time and resources. In this paper we propose a heuristic search algorithm we call MCSA (Montecarlo-Clustering Search Algorithm), which is based on Montecarlo sampling, and a clustering strategy involving two techniques. Our objective is to apply MCSA, an inherently stochastic method, to address optimization problems. To assess its performance, we conducted an evaluation using classical benchmark optimization functions. Additionally, we leveraged the CEC2017 benchmark suite to comprehensively evaluate the algorithm, highlighting the pivotal role of the Exploration stage in our methodology. Subsequently, we extended our methodology to tackle a practical combinatorial problem, the Knapsack problem. This NP-Hard problem holds significant real-world applications in resource allocation, scheduling, planning, logistics, and more. Our contributions lie in parameterizing the Knapsack Problem to align with MCSA's parameters for reference indicators adjustment and achieving high-quality solutions, surpassing 90% in comparison to exhaustive methods such as branch and bound.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Methodology to Define a Static Allocation Mapping based on Memory Access Patterns and the Signature of MPI Applications in HPC Systems, Metodología para Definir una Política de Asignación Estática de Procesos basada en Patrones de Acceso a Memoria y la Firma de Aplicaciones MPI en Sistemas HPC

  • Enrique, Gerard|||0000-0002-4991-2196
  • Bruballa, Eva|||0000-0002-5094-3563
  • Suppi, Remo|||0000-0002-0373-8292
  • Wong, Álvaro|||0000-0002-8394-9478
  • Luque, Emilio|||0000-0002-2884-3232
  • Rexachs, Dolores|||0000-0001-5500-850X
Tools for identifying problems and improving MPI applications performance running on an HPC system require information from both the application and the system. In this work, we will focus on defining a methodology to analyze how memory usage affects an MPI application's performance running on an HPC system. This methodology will obtain valid and comparable data based on different memory access patterns, which will allow us to define key performance values used to characterize the HPC system behaviour facing these access patterns, as well as to characterize the Application Signature behaviour. This is obtained from Parallel Application Signatures for Performance Prediction (PAS2P) tool which obtains the representative phases of the MPI application, facing these same access patterns. With this methodology, we will be able to detect memory access application problems, suggest improvements and define a mapping policy for this application in this HPC system, in order to improve its performance and to determine limits to these improvements., Las herramientas para identificar problemas y mejorar el rendimiento de las aplicaciones MPI que se ejecutan en un sistema HPC requieren información de la aplicación y del sistema. En este trabajo nos centraremos en definir una metodología para analizar cómo el uso de la memoria afecta el rendimiento de una aplicación MPI que se ejecuta en este sistema HPC. Esta metodología obtendrá datos válidos y comparables basados en diferentes patrones de acceso a la memoria que permitirán definir valores clave de rendimiento utilizados para caracterizar el comportamiento de un sistema HPC frente a estos patrones de acceso y para caracterizar el comportamiento de la Firma de la Aplicación, (obtenida de la herramienta Parallel Application Signatures for Performance Prediction (PAS2P) que obtiene las fases representativas de la aplicación MPI) frente a estos mismos patrones de acceso. Con esta metodología, podremos detectar problemas de la aplicación de acceso a la memoria, sugerir mejoras y definir una política de mapeo para esta aplicación en este sistema HPC para mejorar su rendimiento y determinar los límites de estas mejoras.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Impact of the Population Pyramid on the Emergency Department, Impacto de la Piramide Poblacional en el Servicio de Urgencias Hospitalarias

  • Galeano Galeano, Ramona Elizabeth|||0009-0007-0272-1281
  • Wong, Álvaro|||0000-0002-8394-9478
  • Rexachs, Dolores|||0000-0001-5500-850X
  • Suppi, Remo|||0000-0002-0373-8292
  • Bruballa, Eva|||0000-0002-5094-3563
  • Epelde, Francisco|||0000-0001-5547-4025
  • Luque, Emilio|||0000-0002-2884-3232
A country's population pyramid can affect the quality and demand for emergency departments (ED) in several ways. EDs may need specialized resources and equipment to meet the population's needs. In this research, we present an analysis of scenarios through agent-based modeling and simulation. We analyzed the population pyramids of Spain, Argentina, and Paraguay to provide insight into how demographic structure impacts the length of stay (LoS) and the need for medical and nursing staff. This can help policymakers and health managers better plan health resources and services in each country. We verified the evolution of the parameters, length of stay (LoS), and the occupation of doctors and nurses depending on different scenarios, such as the age of the patients and the number of patients arriving, and how it can lead to saturation of the ED. Through several scenarios analyzed using simulations of the age pyramids of Spain, Argentina, and Paraguay, we conclude that the age pyramid of patients treated in ED affects the demand for services, the need for specialized care regarding human and material resources, and waiting time. Implementing measures to manage demand and optimize available resources is essential to ensure adequate patient care., La pirámide poblacional de un país puede afectar la calidad y la demanda de los servicios de urgencias hospitalarias de varias maneras. En esta investigación, presentamos un análisis de escenarios mediante modelado y simulación basados en agentes. Analizamos las pirámides poblacionales de España, Argentina y Paraguay para proporcionar información sobre cómo la estructura demográfica impacta la duración de la estancia (LoS) y la necesidad de personal médico y de enfermería. Esto puede ayudar a los responsables y a los gestores sanitarios a planificar los recursos y servicios sanitarios. Verificamos la evolución de los parámetros, la duración de la estancia (LoS) y la ocupación de médicos y enfermeras en función de diferentes escenarios, como la edad de los pacientes y el número de pacientes, y cómo puede conducir a la saturación de los servicios de urgencias hospitalarias. A través de varios escenarios analizados mediante simulaciones de las pirámides de edad de España, Argentina y Paraguay, concluimos que la pirámide de edad de los pacientes en urgencias afecta a la demanda de servicios, la necesidad de atención especializada, y el tiempo de espera. Implementar medidas para gestionar la demanda y optimizar los recursos es esencial para garantizar una atención adecuada al paciente.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Deep learning data handling, exploring file formats and access strategies

  • Parraga Pinzon, Edixon Alexander|||0000-0002-5038-7827
  • León, Betzabeth|||0000-0003-1778-0237
  • Méndez, Sandra Adriana|||0000-0003-3228-0134
  • Rexachs, Dolores|||0000-0001-5500-850X
  • Franco Puntes, Daniel|||0000-0003-0002-7046
  • Luque, Emilio|||0000-0002-2884-3232
Accessing large volumes of data presents a significant challenge when finding the best strategies to manage the data efficiently. Deep learning applications require the processing of massive amounts of data, which implies a considerable access Input/Output (I/O) load on computer systems. During training, interaction with the I/O system intensifies as files are continuously accessed to read data sets. This persistent access could overload the file system, which, in turn, adversely impacts application performance and efficient storage system utilization. Several factors influence the I/O of these applications, and one of the most relevant is the variety of file formats in which datasets can be stored. The choice of file format depends on the use case, as each format defines how information is stored. Some file formats have features that promote efficient access to datasets during the training phase, which can improve the performance of deep learning applications. Likewise, it is also important that the format adapts to the context, in this case, to an HPC system with a parallel file system. We will propose an image preprocessing method for cases where performance improves with parallel file access. This method will transform image data sets from their original JPEG format to the more efficient HDF5 format. Thus, our research will focus on the importance of understanding the mode of data access, spatial and temporal patterns, and the level of parallelism in file access to determine whether it is advisable to change the storage format.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Application of a sampling and clustering-based heuristic search algorithm to find an efficient staff configuration in an emergency department

  • Harita Rascon, María de los Ángeles|||0000-0002-3732-4717
  • Wong, Álvaro|||0000-0002-8394-9478
  • Rexachs, Dolores|||0000-0001-5500-850X
  • Luque, Emilio|||0000-0002-2884-3232
  • Bruballa, Eva|||0000-0002-5094-3563
  • Epelde, Francisco|||0000-0001-5547-4025
Emergency Departments (EDs) are among the most complex areas in healthcare, requiring immediate medical attention for acute and urgent conditions. Optimizing staff configurations to reduce patient Length of Stay (LoS) and improve operational efficiency poses a significant challenge due to the combinatorial and high-dimensional nature of the problem. To identify the most effective staff configuration, we propose a heuristic optimization strategy that is based on the Montecarlo Clustering Search Algorithm (MCSA), which efficiently explores the multidimensional solution space. MCSA leverages an agent-based simulation (ABM) model that evaluates each proposed staff configuration under realistic operational conditions, providing Key Performance Indicator (KPI) feedback values related to each proposed staff configuration. Through this strategy, we explore staff configurations capable of handling patient volumes with varying acuity levels in an ED to optimize the LoS KPI. Results demonstrate that our methodology is capable to find a solution as a staff configuration that reduces LoS compared to a baseline, offering a computationally efficient and practical tool for decision-makers. We identified solutions by exploring less than 1% of the total search space, demonstrating the efficiency of the proposed approach in addressing complex optimization problems. This approach supports informed planning in healthcare environments while maintaining system feasibility and scalability.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A model of checkpoint behavior for applications that have I/O

  • León, Betzabeth|||0000-0003-1778-0237
  • Méndez, Sandra|||0000-0002-5793-1928
  • Franco Puntes, Daniel|||0000-0003-0002-7046
  • Rexachs, Dolores|||0000-0001-5500-850X
  • Luque, Emilio|||0000-0002-2884-3232
Due to the increase and complexity of computer systems, reducing the overhead of fault tolerance techniques has become important in recent years. One technique in fault tolerance is checkpointing, which saves a snapshot with the information that has been computed up to a specific moment, suspending the execution of the application, consuming I/O resources and network bandwidth. Characterizing the files that are generated when performing the checkpoint of a parallel application is useful to determine the resources consumed and their impact on the I/O system. It is also important to characterize the application that performs checkpoints, and one of these characteristics is whether the application does I/O. In this paper, we present a model of checkpoint behavior for parallel applications that performs I/O; this depends on the application and on other factors such as the number of processes, the mapping of processes and the type of I/O used. These characteristics will also influence scalability, the resources consumed and their impact on the IO system. Our model describes the behavior of the checkpoint size based on the characteristics of the system and the type (or model) of I/O used, such as the number I/O aggregator processes, the buffering size utilized by the two-phase I/O optimization technique and components of collective file I/O operations. The BT benchmark and FLASH I/O are analyzed under different configurations of aggregator processes and buffer size to explain our approach. The model can be useful when selecting what type of checkpoint configuration is more appropriate according to the applications' characteristics and resources available. Thus, the user will be able to know how much storage space the checkpoint consumes and how much the application consumes, in order to establish policies that help improve the distribution of resources.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Scalable performance analysis method for SPMD applications

  • Tirado, Felipe|||0000-0003-2001-658X
  • Wong, Álvaro|||0000-0002-8394-9478
  • Rexachs, Dolores|||0000-0001-5500-850X
  • Luque, Emilio|||0000-0002-2884-3232
The analysis of parallel scientific applications allows us to understand their computational and communication behavior. One way of obtaining performance information is through performance tools. One such tool is parallel application signatures for performance prediction (PAS2P), based on parallel application repeatability, focusing on performance analysis and prediction. The same resources that execute the parallel application are used to perform its analysis, creating a machine independent model of the application and identifying its common patterns. However, the analysis is costly in terms of execution time due to the high number of synchronization communications performed by PAS2P, degrading performance as the number of processes increases. To solve this problem, we propose a model that reduces data dependency between processes, reducing the number of communications performed by PAS2P in the analysis stage and taking advantage of the characteristics of single program, multiple sata applications. Our analysis proposal allows us to decrease the analysis time by 29 times when the application scales to 256 processes, while keeping error levels below 11% in the runtime prediction. It is important to mention that the analysis time is not considerably affected by increasing the number of application processes.