Patricia Balbastre

Dr. Patricia Balbastre

Universitat Politècnica de València (UPV)
orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 November 2007 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
Patricia BalbastrePatricia Balbastre
Patricia Balbastre
IRIsmael Ripoll
Ismael Ripoll
Alfons CrespoAlfons Crespo
Alfons Crespo
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in order to improve system performance. Sensitivity analysis in real-time systems has focused on changes in task computation times using fixed priority analysis. Only a few studies deal with the modification of deadlines in dynamic-priority scheduling. The aim of this work is to provide a sensitivity analysis for task deadlines in the context of dynamic-priority, preemptive, uniprocessor scheduling. In this paper, we present a deadline minimization method that computes the shortest deadline of a periodic task. As undertaken in other studies concerning computation times, we also define and calculate the critical scaling factor for task deadlines. Our proposal is evaluated and compared with other works. The deadline minimization proposed strongly reduces jitter and the response time of control tasks, which can lead to a significant improvement in system performance.

13 November 2004
Verified
Conference Paper
Closed access
LML. Marzario
L. Marzario
GLG. Lipari
G. Lipari
Patricia BalbastrePatricia Balbastre
Patricia Balbastre
Alfons CrespoAlfons Crespo
Alfons Crespo
In this paper we present a new algorithm for CPU resource reservation in real-time systems that allows the coexistence of hard, soft and non real-time tasks. The proposed algorithm is specifically designed to handle computational overload. A task that needs more CPU-time than reserved can reuse the spare bandwidth, without interfering with the others tasks. With respect to other reclamation schemes, the novelty of the proposed algorithm is that the spare bandwidth is fairly distributed among the needing servers. The effectiveness of the algorithm is demonstrated with an extensive set of experiments. We also propose a methodology to set scheduling parameters depending on the type of the task and on the time constraints needed.

13 November 2002
Verified
Conference Paper
Closed access
PAPedro Albertos
Pedro Albertos
Alfons CrespoAlfons Crespo
Alfons Crespo
IRI. Ripoll
I. Ripoll
MVMarina Vallés
Marina Vallés
Patricia BalbastrePatricia Balbastre
Patricia Balbastre

1 September 2004 in Real-Time Systems
Verified
Journal Article
Closed access
PDF file
Patricia BalbastrePatricia Balbastre
Patricia Balbastre
IRIsmael Ripoll-Ripoll
Ismael Ripoll-Ripoll
JVJosep Vidal
Josep Vidal
Alfons CrespoAlfons Crespo
Alfons Crespo

1 September 2011
Verified
Conference Paper
Closed access
VBVicent Brocal
Vicent Brocal
Patricia BalbastrePatricia Balbastre
Patricia Balbastre
RBRafael Ballester
Rafael Ballester
IRIsmael Ripoll
Ismael Ripoll
In this paper a new task model with periods defined as ranges is proposed with the main goal of drastically reduce the hyperperiod of the task set. The model is focused to be applied in cyclic scheduling, where the length of the major cycle of the plan is determined by the hyperperiod. But it also can be applied in synthetic task sets generation, where having a small hyperperiod reduces complexity and simulation time. A new algorithm, which allows to calculate the minimum hyperperiod of such a set of tasks, is presented. This algorithm calculates the minimum value even with a large number of tasks, where exhaustive search becomes intractable.

9 April 2008 in Real-Time Systems
Verified
Journal Article
Closed access
PDF file
MMMiguel Masmano
Miguel Masmano
IRIsmael Ripoll-Ripoll
Ismael Ripoll-Ripoll
Patricia BalbastrePatricia Balbastre
Patricia Balbastre
Alfons CrespoAlfons Crespo
Alfons Crespo