Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

2015

Task partitioning and priority assignment for distributed hard real-time systems

Autores
Garibay Martinez, R; Nelissen, G; Ferreira, LL; Pinho, LM;

Publicação
JOURNAL OF COMPUTER AND SYSTEM SCIENCES

Abstract
In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley's algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

2015

Logic-based schedulability analysis for compositional hard real-time embedded systems

Autores
Matos Pedro, Ad; Pereira, D; Pinho, LM; Pinto, JS;

Publicação
SIGBED Rev.

Abstract
Over the past decades several approaches for schedulability analysis have been proposed for both uni-processor and multi-processor real-time systems. Although different techniques are employed, very little has been put forward in using formal specifications, with the consequent possibility for misinterpretations or ambiguities in the problem statement. Using a logic based approach to schedulability analysis in the design of hard real-time systems eases the synthesis of correct-by-construction procedures for both static and dynamic verification processes. In this paper we propose a novel approach to schedulability analysis based on a timed temporal logic with time durations. Our approach subsumes classical methods for uni-processor scheduling analysis over compositional resource models by providing the developer with counter-examples, and by ruling out schedules that cause unsafe violations on the system. We also provide an example showing the effectiveness of our proposal.

2015

Electric vehicles contribution for frequency control with inertial emulation

Autores
Rocha Almeida, PMR; Soares, FJ; Pecas Lopes, JAP;

Publicação
ELECTRIC POWER SYSTEMS RESEARCH

Abstract
This work proposes a novel primary frequency control technique with electric vehicles (EV), the combination of inertial emulation and droop control, for isolated systems. Being EV dispersed along the grids, the impacts of possible delayed actions are assessed. Islanded systems have reduced inertia and so load/generation imbalance situations may lead to large frequency deviations. Therefore, this paper focuses essentially on the EV contribution for primary reserves provision, in order to allow a safe integration of further intermittent Renewable Energy Sources (RES). An avant-garde generation dispatch was adopted for the test system used in this work, fully reliant on RES, mainly conventional hydro units and some wind generation. The studied disturbances include a rapid shortfall on wind power production and a sequence of consecutive events caused by the variability of the wind resource in an ordinary situation.

2015

Dynamic self-organization in holonic multi-agent manufacturing systems: The ADACOR evolution

Autores
Barbosa, J; Leitao, P; Adam, E; Trentesaux, D;

Publicação
COMPUTERS IN INDUSTRY

Abstract
Nowadays, systems are becoming increasingly complex, mainly due to an exponential increase in the number of entities and their interconnections. Examples of these complex systems can be found in manufacturing, smart-grids, traffic control, logistics, economics and biology, among others. Due to this complexity, particularly in manufacturing, a lack of responsiveness in coping with demand for higher quality products, the drastic reduction in product lifecycles and the increasing need for product customization are being observed. Traditional solutions, based on central monolithic control structures, are becoming obsolete as they are not suitable for reacting and adapting to these perturbations. The decentralization of the complexity problem through simple, intelligent and autonomous entities, such as those found in multi-agent systems, is seen as a suitable methodology for tackling this challenge in industrial scenarios. Additionally, the use of biologically inspired self-organization concepts has proved to be suitable for being embedded in these approaches enabling better performances to be achieved. According to these principals, several approaches have been proposed but none can be truly embedded and extract all the potential of self-organization mechanisms. This paper proposes an evolution to the ADACOR holonic control architecture inspired by biological and evolutionary theories. In particular, a two-dimensional self-organization mechanism was designed taking the behavioural and structural vectors into consideration, thus allowing truly evolutionary and reconfigurable systems to be achieved that can cope with emergent requirements. The approach proposed is validated with two simulation use cases.

2015

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures Supported by an FTT-SE Network

Autores
Garibay Martinez, R; Nelissen, G; Ferreira, LL; Pinho, LM;

Publicação
ARCHITECTURE OF COMPUTING SYSTEMS - ARCS 2015

Abstract
Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.

2015

Proceedings of the 6th International Conference on Software Development for Enhancing Accessibility and Fighting Info-exclusion, DSAI 2015, Sankt Augustin, Germany, June 10-12, 2015

Autores
Velasco, CA; Weber, G; Barroso, J; Mohamad, Y; Paredes, H;

Publicação
DSAI

Abstract

  • 2649
  • 4377