Ana Guasque

Ana Guasque
Universitat Politècnica de València | UPV · Institute of Industrial Control Systems and Computing (ai2)

Doctor of Automation, Robotics and Industrial Computer Science

About

15
Publications
1,677
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
53
Citations
Citations since 2017
13 Research Items
50 Citations
201720182019202020212022202305101520
201720182019202020212022202305101520
201720182019202020212022202305101520
201720182019202020212022202305101520
Introduction

Publications

Publications (15)
Article
Full-text available
Multicore systems were developed to provide a substantial performance increase over monocore systems. But shared hardware resources are a problem as they add unpredictable delays that affect the schedulability of multicore hard real-time systems. In recent years much effort has been put into modelling interference and proposing scheduling technique...
Article
In order to obtain a feasible schedule of a hard real-time system, heuristic based techniques are the solution of choice. In the last few years, optimization solvers have gained attention from research communities due to their capability of handling large number of constraints. Recently, some works have used integer linear programming (ILP) for sol...
Chapter
En este trabajo se propone y evalúa una nueva política de planificación en sistemas multinúcleo de tiempo real. La planificación combinada trata de establecer una nueva estrategia de planificación que reduzca los cambios de contexto y las interferencias generadas con el uso de recursos compartidos entre los núcleos. Esta estrategia se basa en la id...
Article
Full-text available
In multicore scheduling of hard real-time systems, there is a significant source of unpredictability due to the interference caused by the sharing of hardware resources. This paper deals with the schedulability analysis of multicore systems where the interference caused by the sharing of hardware resources is taken into account. We rely on a task m...
Article
Full-text available
There has been a trend towards using multicore platforms for real-time embedded systems due to their high computing performance. In the scheduling of a multicore hard real-time system, there are interference delays due to contention of shared hardware resources. The main sources of interference are memory, cache memory, and the shared memory bus. T...
Article
Full-text available
En la planificación de sistemas de tiempo real crí­tico es clave encontrar un plan temporal en el que las tareas pueden ejecutarse antes de que venza el plazo establecido. Para lograr este objetivo se pueden utilizar diferentes tipos de algoritmos de planificación. Además de encontrar un plan factible, muchas veces es beneficioso, de todos los plan...
Article
In hard real-time embedded systems, switching to multicores is a step that most application domains delay as much as possible. This is mainly due to the number of sources of indeterminism, which mainly involve shared hardware resources, such as buses, caches, and memories. In this paper, a new task model that considers the interference that task ex...
Article
Full-text available
Embedded systems used in critical systems, such as aeronautics, have undergone continuous evolution in recent years. In this evolution, many of the functionalities offered by these systems have been adapted through the introduction of network services that achieve high levels of interconnectivity. The high availability of access to communications n...
Article
Full-text available
Hard real-time systems focus on obtaining a feasible schedule while satisfying different temporal requirements. In safety-critical applications, this schedule is generated offline. This article explores different integer linear programming techniques (ILP) to schedule uniprocessor hard real-time systems. The goal is to efficiently obtain a static s...
Article
Full-text available
This paper addresses the problem of energy management of mixed criticality applications in a multi-core partitioned architecture. Instead of focusing on new scheduling algorithms to adjust frequency in order to save energy, we propose a partition to CPU allocation that takes into account not only the different frequencies at which the CPU can opera...
Article
This paper addresses the problem of energy management of applications in a multi-core partitioned architecture. Instead of focusing on new scheduling algorithms to adjust frequency in order to save energy, we propose a partition to CPU allocation that takes into account the different frequencies at which the CPU can operate. The goal of this paper...
Article
Schedulability analysis of hierarchical real-time systems is based in the previous knowledge of the scheduling algorithms both in the local and the global levels. In a partitioned system with safety and security issues and certification assurance levels, the global scheduling is usually generated using a static table. Therefore, each partition must...

Questions

Question (1)
Question
Hello,
I'm trying to solve a bin-packing problem (I'm almost new with CPLEX), in which different weighted items are allocated into some bins. My problem is that the weights of the different items depend on another decision variable. For this reason, weights are not integers but integer variables.
Pack function is: pack(dvar int[ ],dvar int[ ],int[])
My problem is that I can not use the pack function in order to allocate the items in the bins because of the third parameter.
Could you give me a clue or hint in order to solve my problem? Thanks in advance.

Network

Cited By