5 resultados para graph entropy
em Universidade Complutense de Madrid
Resumo:
We analyze the entropy production and the maximal extractable work from a squeezed thermal reservoir. The nonequilibrium quantum nature of the reservoir induces an entropy transfer with a coherent contribution while modifying its thermal part, allowing work extraction from a single reservoir, as well as great improvements in power and efficiency for quantum heat engines. Introducing a modified quantum Otto cycle, our approach fully characterizes operational regimes forbidden in the standard case, such as refrigeration and work extraction at the same time, accompanied by efficiencies equal to unity.
Resumo:
Reconfigurable hardware can be used to build a multitasking system where tasks are assigned to HW resources at run-time according to the requirements of the running applications. These tasks are frequently represented as direct acyclic graphs and their execution is typically controlled by an embedded processor that schedules the graph execution. In order to improve the efficiency of the system, the scheduler can apply prefetch and reuse techniques that can greatly reduce the reconfiguration latencies. For an embedded processor all these computations represent a heavy computational load that can significantly reduce the system performance. To overcome this problem we have implemented a HW scheduler using reconfigurable resources. In addition we have implemented both prefetch and replacement techniques that obtain as good results as previous complex SW approaches, while demanding just a few clock cycles to carry out the computations. We consider that the HW cost of the system (in our experiments 3% of a Virtex-II PRO xc2vp30 FPGA) is affordable taking into account the great efficiency of the techniques applied to hide the reconfiguration latency and the negligible run-time penalty introduced by the scheduler computations.
Resumo:
Reconfigurable hardware can be used to build multi tasking systems that dynamically adapt themselves to the requirements of the running applications. This is especially useful in embedded systems, since the available resources are very limited and the reconfigurable hardware can be reused for different applications. In these systems computations are frequently represented as task graphs that are executed taking into account their internal dependencies and the task schedule. The management of the task graph execution is critical for the system performance. In this regard, we have developed two dif erent versions, a software module and a hardware architecture, of a generic task-graph execution manager for reconfigurable multi-tasking systems. The second version reduces the run-time management overheads by almost two orders of magnitude. Hence it is especially suitable for systems with exigent timing constraints. Both versions include specific support to optimize the reconfiguration process.
Resumo:
We study nonequilibrium processes in an isolated quantum system-the Dicke model-focusing on the role played by the transition from integrability to chaos and the presence of excited-state quantum phase transitions. We show that both diagonal and entanglement entropies are abruptly increased by the onset of chaos. Also, this increase ends in both cases just after the system crosses the critical energy of the excited-state quantum phase transition. The link between entropy production, the development of chaos, and the excited-state quantum phase transition is more clear for the entanglement entropy.
Resumo:
We point out that in the early universe, for temperatures in the approximate interval 150-80 MeV (after the quark-gluon plasma), pions carried a large share of the entropy and supported the largest inhomogeneities. Its thermal conductivity (previously calculated) allows the characterization of entropy production due to equilibration (damping) of thermal fluctuations. Simple model distributions of thermal fluctuations are considered and the associated entropy production evaluated.