Comparing the schedulers and power saving strategies with SPARTS

We have developed SPARTS, a simulator of a generic embedded real-time device. It is designed to be extensible to accommodate different task properties, scheduling algorithms and/or hardware models for the wide variety of applications. SPARTS was developed to help the community investigate the behaviour of the real-time embedded systems and to quantify the associated constraints/overheads.

Optimal virtual cluster-based multiprocessor scheduling

Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of us-edf{m/(2m−1)} can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.

Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.

An implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks: theory and practice

Timeliness guarantee is an important feature of the recently standardized IEEE 802.15.4 protocol, turning it quite appealing for Wireless Sensor Network (WSN) applications under timing constraints. When operating in beacon-enabled mode, this protocol allows nodes with real-time requirements to allocate Guaranteed Time Slots (GTS) in the contention-free period. The protocol natively supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTS may be underutilized, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of one GTS by multiple nodes, still guaranteeing that all their (delay, bandwidth) requirements are satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our approach improves the bandwidth utilization as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons. Finally, an experimental evaluation on a real system that validates our theoretical analysis and demonstrates the implementation of i-GAME is also presented

i-GAME: an implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks

The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling technology for time sensitive wireless sensor networks thanks to its Guaranteed-Time Slot (GTS) mechanism in the beacon-enabled mode. However, the protocol only supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTSs may be only partially used, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of a GTS by multiple nodes, while all their (delay, bandwidth) requirements are still satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our proposal improves the bandwidth utilization compared to the explicit allocation used in the IEEE 802.15.4 protocol standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons.

A new approach to assess defragmentation strategies in dynamically reconfigurable FPGAs

Fragmentation on dynamically reconfigurable FPGAs is a major obstacle to the efficient management of the logic space in reconfigurable systems. When resource allocation decisions have to be made at run-time a rearrangement may be necessary to release enough contiguous resources to implement incoming functions. The feasibility of run-time relocation depends on the processing time required to set up rearrangements. Moreover, the performance of the relocated functions should not be affected by this process or otherwise the whole system performance, and even its operation, may be at risk. Relocation should take into account not only specific functional issues, but also the FPGA architecture, since these two aspects are normally intertwined. A simple and fast method to assess performance degradation of a function during relocation and to speed up the defragmentation process, based on previous function labelling and on the application of the Euclidian distance concept, is proposed in this paper.

A qualidade de vida dos profissionais de saúde mental

Os profissionais de saúde mental são o principal instrumento de intervenção nesta área considerada como prioridade de Saúde Pública e estão sujeitos a desgaste emocional e stress, que pode afetar negativamente a sua qualidade de vida. Com este estudo pretende-se avaliar a perceção do estado de saúde e da qualidade de vida relacionada com a saúde nos profissionais de saúde mental. Para responder ao objetivo traçado optou-se por realizar um estudo observacional analítico transversal, com abordagem quantitativa. Foi utilizado o SF36v2 como instrumento genérico de avaliação da Qualidade de Vida, que já se encontra validado para a população portuguesa, complementado por um questionário socioprofissional. A recolha de dados decorreu online, de 28 de Janeiro a 30 de Abril de 2013. A amostra foi constituída por 201 profissionais de saúde mental de Portugal Continental. Os profissionais de saúde mental que integraram a amostra revelaram pior perceção do estado de saúde e qualidade de vida, quando comparados com os valores de referência para a população portuguesa com nível de instrução alto. Em termos de domínios do instrumento, piores resultados foram encontrados para todos eles com exceção do domínio Saúde Mental. A avaliação da qualidade de vida dos profissionais de saúde mental possibilita a implementação alterações no funcionamento dos serviços de saúde mental, nomeadamente de programas de gestão de stress, de estratégias de coping e de competências de interação e comunicação entre os profissionais, podendo contribuir para uma melhoria na prestação dos cuidados de saúde aos utentes.

Race-to-halt energy saving strategies

Energy consumption is one of the major issues for modern embedded systems. Early, power saving approaches mainly focused on dynamic power dissipation, while neglecting the static (leakage) energy consumption. However, technology improvements resulted in a case where static power dissipation increasingly dominates. Addressing this issue, hardware vendors have equipped modern processors with several sleep states. We propose a set of leakage-aware energy management approaches that reduce the energy consumption of embedded real-time systems while respecting the real-time constraints. Our algorithms are based on the race-to-halt strategy that tends to run the system at top speed with an aim to create long idle intervals, which are used to deploy a sleep state. The effectiveness of our algorithms is illustrated with an extensive set of simulations that show an improvement of up to 8% reduction in energy consumption over existing work at high utilization. The complexity of our algorithms is smaller when compared to state-of-the-art algorithms. We also eliminate assumptions made in the related work that restrict the practical application of the respective algorithms. Moreover, a novel study about the relation between the use of sleep intervals and the number of pre-emptions is also presented utilizing a large set of simulation results, where our algorithms reduce the experienced number of pre-emptions in all cases. Our results show that sleep states in general can save up to 30% of the overall number of pre-emptions when compared to the sleep-agnostic earliest-deadline-first algorithm.

Reactive power management strategies in future smart grids

The reactive power management in distribution network with large penetration of distributed energy resources is an important task in future power systems. The control of reactive power allows the inclusion of more distributed recourses and a more efficient operation of distributed network. Currently, the reactive power is only controlled in large power plants and in high and very high voltage substations. In this paper, several reactive power control strategies considering a smart grids paradigm are proposed. In this context, the management of distributed energy resources and of the distribution network by an aggregator, namely Virtual Power Player (VPP), is proposed and implemented in a MAS simulation tool. The proposed methods have been computationally implemented and tested using a 32-bus distribution network with intensive use of distributed resources, mainly the distributed generation based on renewable resources. Results concerning the evaluation of the reactive power management algorithms are also presented and compared.

Digital marketing strategies

Internship Report presented to Instituto de Contabilidade e Administração do Porto for the Master’s degree in Marketing Digital under the guidance of Dr. José Magalhães Author Note This internship was carried out under the Erasmus Program for college students and under the agreement between the sending institution, Instituto Superior de Contabilidade e Administração do Porto and the host company, eRise, located in Budapest, Hungary, under the guidance of Vilmos Schwarz.

Strategies to assess web resources credibility: results of a case study in primary and secondary schools from Portugal

In this paper, three approaches for the assessment of credibility in a web environment will be presented, namely the checklists model, the cognitive authority model and the contextual model. This theoretical framework was used to conduct a study about the assessment of web resources credibility among a sample of 195 students, from elementary and secondary schools in a municipality in Oporto district (Portugal). The practices that young people and children claim to use regarding the use of criteria for web resources selection will be presented. In addition, these results will be discussed and compared with the perceptions that these respondents have demonstrated for the use of criteria to establish or assess authorship, originality, or information resources structure. These results will be also discussed and compared with the perceptions that these respondents have demonstrated for the elements that make up each of these criteria.

Interactional strategies between terminologist and domain specialist. Putting order into our universe: the concept of Blended Learning

A presente comunicação visa discutir as mais-valias de um desenho metodológico sustentado numa abordagem conceptual da Terminologia aplicado ao exercício de harmonização da definição do cenário educativo mais promissor do Ensino Superior actual: o blended learning. Sendo a Terminologia uma disciplina que se ocupa da representação, da descrição e da definição do conhecimento especializado através da língua a essência deste domínio do saber responde a uma necessidade fundamental da sociedade actual: putting order into our universe, nas palavras de Nuopponen (2011). No contexto descrito, os conceitos, enquanto elementos da estrutura do conhecimento (Sager, 1990) constituem um objecto de investigação de complexidade não despicienda, pois apesar do postulado de que a língua constitui uma ferramenta fundamental para descrever e organizar o conhecimento, o princípio isomórfico não pode ser tomado como adquirido. A abordagem conceptual em Terminologia propõe uma visão precisa do papel da língua no trabalho terminológico, sendo premissa basilar que não existe uma correspondência unívoca entre os elementos atomísticos do conhecimento e os elementos da expressão linguística. É pela razões enunciadas que as opções metodológicas circunscritas à análise do texto de especialidade serão consideradas imprecisas. Nesta reflexão perspectiva-se que o conceito-chave de uma abordagem conceptual do trabalho terminológico implica a combinação de um processo de elicitação do conhecimento tácito através de uma negociação discursiva orientada para o conceito e a análise de corpora textuais. Defende-se consequentemente que as estratégias de interacção entre terminólogo e especialista de domínio merecem atenção detalhada pelo facto de se reflectirem com expressividade na qualidade dos resultados obtidos. Na sequência do exposto, o modelo metodológico que propomos sustenta-se em três etapas que privilegiam um refinamento dessa interacção permitindo ao terminólogo afirmar-se como sujeito conceptualizador, decisor e interventor: (1) etapa exploratória do domínio-objecto de estudo; (2) etapa de análise onamasiológica de evidência textual e discursiva; (3) etapa de modelização e de validação de resultados. Defender-se-á a produtividade de uma sequência cíclica entre a análise textual e discursiva para fins onomasiológicos, a interacção colaborativa e a introspecção.