Jorge Real
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jorge Real has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Alfons Crespo
Universitat Politècnica de València
12 shared publications Alfons Crespo
6 shared publicationsAndy Wellings
University of York Heslington, Great Britain
4 shared publicationsMiguel Masmano
Universidad Politécnica de Valencia
4 shared publicationsIsmael Ripoll
Universidad Politécnica de Valencia
3 shared publicationsSergio Sáez
3 shared publications
Latest Publications
- Open Access
- 1 December 2019
- Published by Elsevier in Journal of Systems Architecture
- Vol. 101
A hierarchical architecture for time- and event-triggered real-time systems
- 1 December 2019
- Published by Elsevier in Journal of Systems Architecture
- Vol. 101
Open AccessA hierarchical architecture for time- and event-triggered real-time systems
- Open Access
- 23 July 2018
- Published by Association for Computing Machinery (ACM) in ACM SIGAda Ada Letters
- Vol. 38 (1) , 41-54
Ravenscar Support for Time-Triggered Scheduling
This position paper follows from a previous proposal to integrate a time-triggered scheduler in a priority- based, preemptive scheduler such as that supported by Ada's task dispatching policy FIFO Within Priorities . The resulting combined scheduling carries the advantages of both time-triggered and priority-based scheduling, and helps mitigating their drawbacks. The paper presents a system model for the time-triggered subsystem that extends the original proposal, and describes a Ravenscar implementation of the scheduler at the run-time system level, in the form of a new package Ada.Dispatching.TTS. Multiple programming patterns can be implemented on top of this scheduler. With respect to the previously proposed full-Ada implementation, only patterns that implied the use of asynchronous transfer of control have been excluded. On the other hand, the extension of the original model enables new patterns, not supported in our previous proposal, using the new types of continuation and optional slots. We hold that bringing the time-triggered paradigm to Ravenscar is both feasible and convenient for the High-Integrity and Embedded application domains.
- 23 July 2018
- Published by Association for Computing Machinery (ACM) in ACM SIGAda Ada Letters
- Vol. 38 (1) , 41-54
Open AccessRavenscar Support for Time-Triggered Scheduling
This position paper follows from a previous proposal to integrate a time-triggered scheduler in a priority- based, preemptive scheduler such as that supported by Ada's task dispatching policy FIFO Within Priorities . The resulting combined scheduling carries the advantages of both time-triggered and priority-based scheduling, and helps mitigating their drawbacks. The paper presents a system model for the time-triggered subsystem that extends the original proposal, and describes a Ravenscar implementation of the scheduler at the run-time system level, in the form of a new package Ada.Dispatching.TTS. Multiple programming patterns can be implemented on top of this scheduler. With respect to the previously proposed full-Ada implementation, only patterns that implied the use of asynchronous transfer of control have been excluded. On the other hand, the extension of the original model enables new patterns, not supported in our previous proposal, using the new types of continuation and optional slots. We hold that bringing the time-triggered paradigm to Ravenscar is both feasible and convenient for the High-Integrity and Embedded application domains.
- 26 May 2018
- Published by Springer Nature
- p. 105-122
Combined Scheduling of Time-Triggered and Priority-Based Task Sets in Ravenscar
- 26 May 2018
- Published by Springer Nature
- p. 105-122
Combined Scheduling of Time-Triggered and Priority-Based Task Sets in Ravenscar
- 31 May 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 195-212
Combining Time-Triggered Plans with Priority Scheduled Task Sets
- 31 May 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 195-212
Combining Time-Triggered Plans with Priority Scheduled Task Sets
- 1 January 2016
- Published by Elsevier
- p. 239-268
Minimizing the mode-change latency in real-time image processing applications
- 1 January 2016
- Published by Elsevier
- p. 239-268
Minimizing the mode-change latency in real-time image processing applications
- 1 January 2014
- Published by Springer Nature
- p. 74-90
Reliable Handling of Real-Time Scheduling Attributes on Multiprocessor Platforms in Ada 2012
- 1 January 2014
- Published by Springer Nature
- p. 74-90
Reliable Handling of Real-Time Scheduling Attributes on Multiprocessor Platforms in Ada 2012
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 18-34
An Integrated Framework for Multiprocessor, Multimoded Real-Time Applications
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 18-34
An Integrated Framework for Multiprocessor, Multimoded Real-Time Applications
- Open Access
- 30 August 2010
- Published by Association for Computing Machinery (ACM) in ACM SIGAda Ada Letters
- Vol. 30 (2) , 27-52
Ada and the software vulnerabilities project
Given the large focus on software vulnerabilities in the current market place, ISO/IEC JTC 1/SC 22/WG 23 has developed a Technical Report (TR) on Vulnerabilities [1]. This TR contains vulnerabilities that may be applicable to a programming language or application. This article provides a synopsis of these vulnerabilities with respect to the Ada programming language [2].
- 30 August 2010
- Published by Association for Computing Machinery (ACM) in ACM SIGAda Ada Letters
- Vol. 30 (2) , 27-52
Open AccessAda and the software vulnerabilities project
Given the large focus on software vulnerabilities in the current market place, ISO/IEC JTC 1/SC 22/WG 23 has developed a Technical Report (TR) on Vulnerabilities [1]. This TR contains vulnerabilities that may be applicable to a programming language or application. This article provides a synopsis of these vulnerabilities with respect to the Ada programming language [2].
- 26 October 2007
- Published by Wiley in Software: Practice and Experience
- Vol. 38 (10) , 995-1026
Implementation of a constant‐time dynamic storage allocator
This paper describes the design criteria and implementation details of a dynamic storage allocator for real‐time systems. The main requirements that have to be considered when designing a new allocator are concerned with temporal and spatial constraints. The proposed algorithm, called TLSF (two‐level segregated fit), has an asymptotic constant cost,O(1), maintaining a fast response time (less than 200 processor instructions on a x86 processor) and a low level of memory usage (low fragmentation). TLSF uses two levels of segregated lists to arrange free memory blocks and anincomplete searchpolicy. This policy is implemented with word‐size bitmaps and logical processor instructions. Therefore, TLSF can be categorized as a good‐fit allocator. The incomplete search policy is shown also to be a good policy in terms of fragmentation. The fragmentation caused by TLSF is slightly smaller (better) than that caused by best fit (which is one of the best allocators regarding memory fragmentation). In order to evaluate the proposed allocator, three analyses are presented in this paper. The first one is based on worst‐case scenarios. The second one provides a detailed consideration of the execution cost of the internal operations of the allocator and its fragmentation. The third analysis is a comparison with other well‐known allocators from the temporal (number of cycles and processor instructions) and spatial (fragmentation) points of view. In order to compare them, a task model has been presented. Copyright © 2007 John Wiley & Sons, Ltd.
- 26 October 2007
- Published by Wiley in Software: Practice and Experience
- Vol. 38 (10) , 995-1026
Implementation of a constant‐time dynamic storage allocator
This paper describes the design criteria and implementation details of a dynamic storage allocator for real‐time systems. The main requirements that have to be considered when designing a new allocator are concerned with temporal and spatial constraints. The proposed algorithm, called TLSF (two‐level segregated fit), has an asymptotic constant cost,O(1), maintaining a fast response time (less than 200 processor instructions on a x86 processor) and a low level of memory usage (low fragmentation). TLSF uses two levels of segregated lists to arrange free memory blocks and anincomplete searchpolicy. This policy is implemented with word‐size bitmaps and logical processor instructions. Therefore, TLSF can be categorized as a good‐fit allocator. The incomplete search policy is shown also to be a good policy in terms of fragmentation. The fragmentation caused by TLSF is slightly smaller (better) than that caused by best fit (which is one of the best allocators regarding memory fragmentation). In order to evaluate the proposed allocator, three analyses are presented in this paper. The first one is based on worst‐case scenarios. The second one provides a detailed consideration of the execution cost of the internal operations of the allocator and its fragmentation. The third analysis is a comparison with other well‐known allocators from the temporal (number of cycles and processor instructions) and spatial (fragmentation) points of view. In order to compare them, a task model has been presented. Copyright © 2007 John Wiley & Sons, Ltd.
- Open Access
- 1 January 2007
- Published by Association for Computing Machinery (ACM)
- Vol. XXVII (2) , 72-74
Introduction
- 1 January 2007
- Published by Association for Computing Machinery (ACM)
- Vol. XXVII (2) , 72-74
Open AccessIntroduction