A relação terapeuta-cliente: na perspectiva do cliente

O presente estudo resulta de uma crescente preocupação e percepção da importância da relação terapeuta-cliente e procura compreender a perspectiva do cliente e a forma como este sente e vive essa relação ao longo de todo o seu processo terapêutico. O estudo realizado, de natureza qualitativa e de carácter exploratório, visa sobretudo analisar a influência da relação terapeuta-cliente na perspectiva do cliente, identificar e descrever os fatores que a influenciam e perceber a mais-valia desta relação ao longo do processo terapêutico. Para tal, foram entrevistadas dezanove pessoas que estão a receber tratamento de terapia ocupacional. Para a recolha dos dados foi aplicada a entrevista semi-estruturada por se pretender um contributo mais envolvente, particularizado e subjetivo dos clientes. Através da realização do estudo e de acordo com a perspetiva dos clientes entrevistados, concluiu-se que a capacidade do terapeuta em construir e estabelecer um vínculo com o cliente ditará grande parte do sucesso ou insucesso do processo terapêutico. Porém, tão importante como formar e estabelecer um vínculo terapeuta-cliente é preciso ter a preocupação contínua de o manter sempre vivo e fortalecido. Para que tal aconteça, o terapeuta não pode menosprezar a experiência de vida e expectativas do cliente e deve assumir um papel de permanente preocupação e atenção a todas as transformações quotidianas pois estas influenciam o envolvimento do cliente nas suas atividades/ocupações e afetam a sua saúde e desempenho. O novo milénio requer dos profissionais de saúde em geral e dos terapeutas ocupacionais em particular, novas habilidades e competências. É fundamental adquirir a consciência de que os clientes são o centro de todo o processo terapêutico. É necessário ter uma visão holística e não fragmentada do cliente. É importante interagir com os clientes e permitir uma troca de conhecimento, entre o saber do cliente e o saber do terapeuta. Essa troca gera convergências, fortalece laços e o processo terapêutico avança. Nesse relacionamento, ambos aprendem, progridem e crescem.

Run-time defragmentation for dynamically reconfigurable hardware

Reconfigurable computing experienced a considerable expansion in the last few years, due in part to the fast run-time partial reconfiguration features offered by recent SRAM-based Field Programmable Gate Arrays (FPGAs), which allowed the implementation in real-time of dynamic resource allocation strategies, with multiple independent functions from different applications sharing the same logic resources in the space and temporal domains. However, when the sequence of reconfigurations to be performed is not predictable, the efficient management of the logic space available becomes the greatest challenge posed to these systems. Resource allocation decisions have to be made concurrently with system operation, taking into account function priorities and optimizing the space currently available. As a consequence of the unpredictability of this allocation procedure, the logic space becomes fragmented, with many small areas of free resources failing to satisfy most requests and so remaining unused. A rearrangement of the currently running functions is therefore necessary, so as to obtain enough contiguous space to implement incoming functions, avoiding the spreading of their components and the resulting degradation of system performance. A novel active relocation procedure for Configurable Logic Blocks (CLBs) is herein presented, able to carry out online rearrangements, defragmenting the available FPGA resources without disturbing functions currently running.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.