José Vicente Busquets-Mataix
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
José Vicente Busquets-Mataix has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Martí-Campoy
Universitat Politècnica de València
5 shared publications A. Wellings
3 shared publications- Angel Perles
Instituto ITACA, Universitat Politècnica de València, 46022 Valencia, Spain
2 shared publications - Eugenio Tamura
Pontificia Universidad Javeriana – Cali
2 shared publications J.J. Serrano
2 shared publicationsJ.J. Serrano-Martin
2 shared publications
Latest Publications
- Open Access
- 26 January 2026
- Published by University of Zilina in Communications - Scientific letters of the University of Zilina
- Vol. 28 (1) , E1-E12
Dynamic Routing with Static Delivery Time Windows in Urban Last-Mile Transport Logistics
Journal Communications - Scientific Letters of the University of ?ilina is now a well-established open-access scientific journal aimed primarily at the topics connected with the field of transport.
- 26 January 2026
- Published by University of Zilina in Communications - Scientific letters of the University of Zilina
- Vol. 28 (1) , E1-E12
Open AccessDynamic Routing with Static Delivery Time Windows in Urban Last-Mile Transport Logistics
Journal Communications - Scientific Letters of the University of ?ilina is now a well-established open-access scientific journal aimed primarily at the topics connected with the field of transport.
- 5 April 2018
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (4) , 1849-1868
Human–computer cooperation platform for developing real-time robotic applications
- 5 April 2018
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (4) , 1849-1868
Human–computer cooperation platform for developing real-time robotic applications
- 1 January 2011
- Published by Springer Nature
- p. 43-52
Architecture Extensions for Efficient Management of Scratch-Pad Memory
- 1 January 2011
- Published by Springer Nature
- p. 43-52
Architecture Extensions for Efficient Management of Scratch-Pad Memory
- 11 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 49-56
Cache Contents Selection for Statically-Locked Instruction Caches: An Algorithm Comparison
This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical realtime applications. For ...
- 11 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 49-56
Cache Contents Selection for Statically-Locked Instruction Caches: An Algorithm Comparison
This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical realtime applications. For ...
- 8 December 2005
- Published by Springer Nature
- p. 462-465
A Comparison of Three Genetic Algorithms for Locking-Cache Contents Selection in Real-Time Systems
- 8 December 2005
- Published by Springer Nature
- p. 462-465
A Comparison of Three Genetic Algorithms for Locking-Cache Contents Selection in Real-Time Systems
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 150-159
On Using Locking Caches in Embedded Real-Time Systems
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 150-159
On Using Locking Caches in Embedded Real-Time Systems
- 21 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1283-1286
Static use of locking caches vs. dynamic use of locking caches for real-time systems
- 21 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1283-1286
Static use of locking caches vs. dynamic use of locking caches for real-time systems
- 24 December 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 195-202
Using harmonic task-sets to increase the schedulable utilization of cache-based preemptive real-time systems
Cache memories have been traditionally precluded in real-time systems because of their unpredictable behavior. The needs of better performance have motivated the development of tools to obtain tighter bounds on the worst-case execution time (WCET) of cached programs. However, they do not allow preemption, because from the point of view of program analysis, the number of preemptions is unknown. To face this problem, the cache-related preemption cost can be considered in the schedulability analysis, or annulled by the use of private cache partitions. Regarding the first approach, in a previous paper we described how to incorporate the effect of the cache to the Response Time schedulability Analysis (RTA). RTA is an efficient analysis for preemptive fixed-priority schedulers. In this paper, we have improved such a technique by taking into account the harmonic relations amongst task frequencies. The resulting analysis is applied to sample task-sets to illustrate the potential gains in terms of schedulable utilization, particularly for highly demanding task-sets.
- 24 December 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 195-202
Using harmonic task-sets to increase the schedulable utilization of cache-based preemptive real-time systems
Cache memories have been traditionally precluded in real-time systems because of their unpredictable behavior. The needs of better performance have motivated the development of tools to obtain tighter bounds on the worst-case execution time (WCET) of cached programs. However, they do not allow preemption, because from the point of view of program analysis, the number of preemptions is unknown. To face this problem, the cache-related preemption cost can be considered in the schedulability analysis, or annulled by the use of private cache partitions. Regarding the first approach, in a previous paper we described how to incorporate the effect of the cache to the Response Time schedulability Analysis (RTA). RTA is an efficient analysis for preemptive fixed-priority schedulers. In this paper, we have improved such a technique by taking into account the harmonic relations amongst task frequencies. The resulting analysis is applied to sample task-sets to illustrate the potential gains in terms of schedulable utilization, particularly for highly demanding task-sets.
- 22 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 56-63
Hybrid instruction cache partitioning for preemptive real-time systems
- 22 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 56-63
Hybrid instruction cache partitioning for preemptive real-time systems