Dissertations / Theses on the topic 'Distributed unit'

Power constraints led to the end of exponential growth in single–processor performance, which characterized the semiconductor industry for many years. Single–chip multiprocessors allowed the performance growth to continue so far. Yet, Amdahl’s law asserts that the overall performance of future single–chip multiprocessors will depend crucially on single–processor performance. In a multiprocessor a small growth in single–processor performance can justify the use of significant resources. Partitioning the layout of critical components can improve the energy–efficiency and ultimately the performance of a single processor. In a clustered microarchitecture parts of these components form clusters. Instructions are processed locally in the clusters and benefit from the smaller size and complexity of the clusters components. Because the clusters together process a single instruction stream communications between clusters are necessary and introduce an additional cost. This thesis proposes the design of a distributed memory unit and first level cache in the context of a clustered microarchitecture. While the partitioning of other parts of the microarchitecture has been well studied the distribution of the memory unit and the cache has received comparatively little attention. The first proposal consists of a set of cache bank predictors. Eight different predictor designs are compared based on cost and accuracy. The second proposal is the distributed memory unit. The load and store queues are split into smaller queues for distributed disambiguation. The mapping of memory instructions to cache banks is delayed until addresses have been calculated. We show how disambiguation can be implemented efficiently with unordered queues. A bank predictor is used to map instructions that consume memory data near the data origin. We show that this organization significantly reduces both energy usage and latency. The third proposal introduces Dispatch Throttling and Pre-Access Queues. These mechanisms avoid load/store queue overflows that are a result of the late allocation of entries. The fourth proposal introduces Memory Issue Queues, which add functionality to select instructions for execution and re-execution to the memory unit. The fifth proposal introduces Conservative Deadlock Aware Entry Allocation. This mechanism is a deadlock safe issue policy for the Memory Issue Queues. Deadlocks can result from certain queue allocations because entries are allocated out-of-order instead of in-order like in traditional architectures. The sixth proposal is the Early Release of Load Queue Entries. Architectures with weak memory ordering such as Alpha, PowerPC or ARMv7 can take advantage of this mechanism to release load queue entries before the commit stage. Together, these proposals allow significantly smaller and more energy efficient load queues without the need of energy hungry recovery mechanisms and without performance penalties. Finally, we present a detailed study that compares the proposed distributed memory unit to a centralized memory unit and confirms its advantages of reduced energy usage and of improved performance.

Prior to using hydraulic and spatially distributed modelling softwares, the theory of the unit hydrograph was a commonly used tool for modelling of surface and runoff water. While distributed models often provide detailed results from extensive calculation durations, the unit hydrograph have been questioned for simplifying the physical characteristics of the watershed modelled. Typically, the unit hydrograph theory does not explicitly take the flow paths of the watershed in consideration during calculation. With the rise of geographical information systems, methods of deriving spatially distributed unit hydrographs have been developed. The aim of these have commonly been to find a spatially varied form of hydrological modelling, while still keeping the computation times low. The method is commonly built by calculating the travel time to the watershed outlet along the flow path. In this study, spatially distributed unit hydrographs are derived separately for the watershed’s pervious and impervious surfaces in a Python script using map algebra and the Esri’s Python wrapper module Arcpy. The travel times are generated from a velocity field calculated using Maidment and Olivera’s velocity equation. The velocity equation contains three unknown parameters; one for an average velocity and two calibration parameters. The excess precipitation is calculated of a 100 year return period Chicago Design Storm hyetograph using the SCS-CN method. The direct runoff hydrographs are calculated over three semi-urban watersheds in Smedby in southern Sweden, and the results are compared to MIKE 21 hydrograph data of each corresponding watershed and rain input. The result obtained showed to replicate the hydrograph response quite well, but only if the unknown parameters in the velocity equation were calibrated to match the MIKE 21 data. The unknown parameters of the velocity equations produces uncertainties of using the method without calibration data, which implies that the script is not well adapted to use for modelling predictions. It may be of interest to calculate the travel times of the locations within the watershed using a different formula. The script tool could be tested using different design storms as input, and areas of different characteristics compared to Smedby could be tested.
Innan det blev vanligt att använda hydrauliska och rumsliga modellerings- mjukvaror användes ofta teorin bakom enhetshydrografen för modellering av avrinning. Medan de rumsliga mjukvarorna ofta erbjuder detaljerade resultat till priset av långa beräkningstider, har enhetshydrografen ifrågasatts för att förenkla den fysiska karaktären av avrinningsområdet. Typiskt sett tar inte enhetshydrografen avrinningsområdets flödesvägar direkt i hänseende vid beräkning. Utveckling och ökad tillgänglighet av geografiska informations- system förenklade möjligheterna att utveckla beräkning av enhetshydrografer som tar hänsyn till avrinningsområdets karaktär, typiskt sett genom att beräkna rinntiden från varje läge i avrinningsområdet, längs rinnvägarna och till utloppet. I den här studien beräknas spatiala enhetshydrografer separat för avrinningsområdets hårdgjorda och icke hårdgjorda ytor, genom att utveckla ett Python skript med hjälp av karalgebra och Esri’s wrapper modul ArcPy. Rinntiderna från olika lägen i avrinningsområdet beräknas med Maidments och Oliveras formel för hastighet, vilken innehåller okända parametrar för en uppskattad medelhastighet samt två kalibreringsparametrar. Effektivt regn från ett Chicago Design Storm regn med en återkomsttid på 100 år beräknas med hjälp av SCS-CN metoden. Hydrograferna för direkt avrinning faltas för tre semi-urbana avrinningsområden i Smedby i södra Sverige för att sedan jämföras mot MIKE 21 genererad hydrograf data för respektive motsvarade avrinningsområde. Hydrografdata producerat av MIKE 21 har tagits fram med lika CDS-regn data som input. Resultatet visar att hydrografer snarlika MIKE 21 hydrograferna kan tas fram med Maidments spatialt fördelade enhetshydrograf, om de okända parametrarna i Maidments formel kalibrerades mot MIKE 21 data. Utan kalibreringsdata för att bestämma de okända parametrarna kan resultatet anses vara mycket osäkert, vilket antyder att Python skriptet ej bör användas för använda metoden för att förutspå responser av regnevent. Andra beräkningar än Maidments ekvation kan vara av intresse att implementera. Olika typer av regninput samt spatial data över andra platser än Smedby kan vara av intresse att testa Python skriptet för.

Synthetic unit hydrographs, which assume uniform rainfall excess distribution and static watershed conditions, are frequently used to estimate hydrograph characteristics when observed data are unavailable. The objective of this research was to develop a spatially distributed unit hydrograph (SDUH) model that directly reflects spatial variation in the watershed in generating runoff hydrographs.

The SDUH model is a time-area unit hydrograph technique that uses a geographic information system (GIS) to develop a cumulative travel time map of the watershed based on cell by cell estimates of overland and channel flow velocities. The model considers slope, land use, watershed position, channel characteristics, and rainfall excess intensity in determining flow velocities. The cumulative travel time map is divided into isochrones which are used to generate a time-area curve and the resulting unit hydrograph.

Predictions of the SDUH model along with the Snyder, SCS, and Clark synthetic unit hydrographs were compared with forty observed storm events from an 1153-ha Virginia Piedmont watershed. The SDUH model predictions were comparable or slightly better than those from the other models, with the lowest relative error in the peak flow rate prediction for 12 of the 40 storms, and a model efficiency of at least 0.90 for 21 of the storms. Despite the good predictions of the hydrograph peak flow rate and shape, the time to peak was underpredicted for 34 of the 40 storms.

Runoff from the 40 storms was also generated for two subwatersheds (C: 462 ha; D: 328 ha) in Owl Run to assess the effect of scale on the SDUH model. Peak flow rate predictions were more accurate for the entire watershed than for either subwatershed. The time to peak prediction and model efficiency statistics were comparable for the entire watershed and subwatershed D. Subwatershed C had poorer predictions, which were attributed to a large pond in the main channel, rather than to scale effects.

The SDUH model provides a framework for predicting runoff hydrographs for ungauged watersheds that can reflect the spatially distributed nature of the rainfall-runoff process. Predictions were comparable to the other synthetic unit hydrograph techniques. Because the time to peak and model efficiency statistics were similar for the 1153-ha watershed and a 328-ha subwatershed, scale does not have a major impact on the accuracy of the SDUH model.
Master of Science

Keeping a contingency reserve in power systems is necessary to preserve the security of real-time operations. This work studies two different approaches to the optimal allocation of energy and reserves in the day-ahead generation scheduling process. Part I presents a stochastic security-constrained unit commitment model to co-optimize energy and the locational reserves required to respond to a set of uncertain generation contingencies, using a novel state-based formulation. The model is applied in an offer-based electricity market to allocate contingency reserves throughout the power grid, in order to comply with the N-1 security criterion under transmission congestion. The objective is to minimize expected dispatch and reserve costs, together with post contingency corrective redispatch costs, modeling the probability of generation failure and associated post contingency states. The characteristics of the scheduling problem are exploited to formulate a computationally efficient method, consistent with established operational practices. We simulated the distribution of locational contingency reserves on the IEEE RTS96 system and compared the results with the conventional deterministic method. We found that assigning locational spinning reserves can guarantee an N-1 secure dispatch accounting for transmission congestion at a reasonable extra cost. The simulations also showed little value of allocating downward reserves but sizable operating savings from co-optimizing locational nonspinning reserves. Overall, the results indicate the computational tractability of the proposed method. Part II presents a distributed generation scheduling model to optimally allocate energy and spinning reserves among competing generators in a day-ahead market. The model is based on the coordination between individual generators and a market entity. The proposed method uses forecasting, augmented pricing and locational signals to induce efficient commitment of generators based on firm posted prices. It is price-based but does not rely on multiple iterations, minimizes information exchange and simplifies the market clearing process. Simulations of the distributed method performed on a six-bus test system showed that, using an appropriate set of prices, it is possible to emulate the results of a conventional centralized solution, without need of providing make-whole payments to generators. Likewise, they showed that the distributed method can accommodate transactions with different products and complex security constraints.

Approved for public release; distribution is unlimited
Swarm attacks are of great concern to the U.S. Navy as well as to navies around the world and commercial ships transiting through waters with high volume of marine traffic. A large group of hostile ships can hide themselves among various other small ships, like pleasure crafts, fishing boats and transport vessels, and can make a coordinated attack against a High Value Unit (HVU) while it passes by. The HVU can easily be overwhelmed by the numbers and sustain heavy damage or risk being taken over. The objective of this thesis is to develop heuristic algorithms that multiple defenders can use to intercept and stop the advances of multiple attackers. The attackers are in much larger numbers compared to the defenders, and are moving in on a slow moving HVU. Pursuit guidance laws and proportional navigation (PN) guidance laws, commonly used in missile guidance strategies, are modified to be used by the defenders to try intercepting attackers that outnumber them. Another objective is to evaluate the effectiveness of the heuristic algorithms in defending the HVU against the swarm attack. The probability that the HVU survives the swarm attack will be used as a measure of effectiveness of the algorithms. The impact of various parameters, like the number of defenders and the speed of defenders, on the effectiveness of the algorithms are also evaluated.

Approved for public release; distribution is unlimited
Platforms throughout the military and other government agencies (such as FEEMA and police departments) have become more networked; the last link in each network chain, however, has always been the individuals themselves. This structure requires a network that can process large amounts of data in order to provide the individuals with succinct and actionable information. Information, such as individual positions, weapons orientation, and friendly positions, serve to greatly enhance the situational awareness and improve the likelihood of mission success. The goal of this research is to use networking to improve the infantry’s situational awareness. The Robotic Operating System (ROS) is the foundation of a prototype network investigated in this thesis. It enables rapid prototyping of components and functionality through an open-source library with multi-language and multi-platform support. The network was constructed with software and hardware modules consisting of wearable sensors and various computational platforms. Future development will include linking the network to autonomous units and other assets with simplified controls. The deliverable is a mobile ad-hoc network (MANET) with hardware designed to be operational for infantry squads and software designed to deliver contextual situational awareness to all of its members. The data distribution is handled through a brokered publish and subscribe network implemented via ROS.

The role of information technology within health care is getting more central and prominent. The purpose of this change is both to make the health care more efficient and to heighten patient safety. This exploratory case study of four care units aims to provide a glimpse into the clinical work of nurses, and to indentify and describe their communication and information needs. The analytical framework used in this study is distributed cognition and the research method used is cognitive ethnography. The study provides a peek into the complex system of health care, and how the central artifacts such as patient records, whiteboards and different alarm systems are used in this context. The result of the study describes the current work practices and information flows in the studied care units. From these results general system design implications are made.

Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) optimization problem. Sequential Minimal Optimization (SMO) is a decomposition-based algorithm which breaks this large QP problem into a series of smallest possible QP problems. However, it still costs O(n2) computation time. In our SVM implementation, we can do training with huge data sets in a distributed manner (by breaking the dataset into chunks, then using Message Passing Interface (MPI) to distribute each chunk to a different machine and processing SVM training within each chunk). In addition, we moved the kernel calculation part in SVM classification to a graphics processing unit (GPU) which has zero scheduling overhead to create concurrent threads. In this thesis, we will take advantage of this GPU architecture to improve the classification performance of SVM.

The future power grid will effectively utilize renewable energy resources and distributed generation to respond to energy demand while incorporating information technology and communication infrastructure for their optimum operation. This dissertation contributes to the development of real-time techniques, for wide-area monitoring and secure real-time control and operation of hybrid power systems. To handle the increased level of real-time data exchange, this dissertation develops a supervisory control and data acquisition (SCADA) system that is equipped with a state estimation scheme from the real-time data. This system is verified on a specially developed laboratory-based test bed facility, as a hardware and software platform, to emulate the actual scenarios of a real hybrid power system with the highest level of similarities and capabilities to practical utility systems. It includes phasor measurements at hundreds of measurement points on the system. These measurements were obtained from especially developed laboratory based Phasor Measurement Unit (PMU) that is utilized in addition to existing commercially based PMU’s. The developed PMU was used in conjunction with the interconnected system along with the commercial PMU’s. The tested studies included a new technique for detecting the partially islanded micro grids in addition to several real-time techniques for synchronization and parameter identifications of hybrid systems. Moreover, due to numerous integration of renewable energy resources through DC microgrids, this dissertation performs several practical cases for improvement of interoperability of such systems. Moreover, increased number of small and dispersed generating stations and their need to connect fast and properly into the AC grids, urged this work to explore the challenges that arise in synchronization of generators to the grid and through introduction of a Dynamic Brake system to improve the process of connecting distributed generators to the power grid. Real time operation and control requires data communication security. A research effort in this dissertation was developed based on Trusted Sensing Base (TSB) process for data communication security. The innovative TSB approach improves the security aspect of the power grid as a cyber-physical system. It is based on available GPS synchronization technology and provides protection against confidentiality attacks in critical power system infrastructures.

The project idea was created from the demand of a renewal for a Power Distributor Unit also known as a PDU. The current product had successively turned in to a cable mess because of short term solutions. This made the product non user friendly, inconvenient and non-agile to handle troubleshooting. To develop this project, a PCB design was created by simplifying and improving circuit diagrams until satisfied. Once the final circuit diagram was obtained, a PCB layout design was created. The result of the project, due to limited time, was only theoretical. The finished product was not tested as there was no time allowing this.

Time synchronization between systems having no external reference can be an issue in small wireless node-based systems. In this thesis a transceiver is designed and implemented in two separate systems. Then the timing algorithm of "TwoWay Time Transfer" is then chosen to correct any timing error between the two free running clocks of the systems. In conclusion the results are compared towards having both systems get their timing based on GPS timing.
Tidssynkronisering mellan två system som saknar externa referenser kan bli ett problem i små nodbaserade system. I det här arbetet har en sändtagare designats och implementerats i två system. Sedan valdes algoritmen "TwoWay Time Transfer"för att rätta till de timing fel som uppstår mellan systemens separata klockor.I sammanfattningen så jämnförs uppkommna resultat med att ha systemens tid från GPS.

The world-wide application of Phasor Measurement Units (PMUs) brings great benefit to power system state estimation. The synchronised measurements from PMUs can increase estimation accuracy, synchronise states among different systems, and provide greater applicability of state estimation in the transient condition. However, the integration of synchronised measurements with state estimation can introduce efficiency problems due to the substantial burden of data. The research is divided into two parts: finding a solution to cope with the computational efficiency problem and developing a transient state estimation algorithm based on synchronised measurements from PMUs. The computational efficiency problems constitute important considerations in the operation of state estimation. To improve the low computational efficiency, two distributed algorithms are proposed in Chapters 4 and 5. In these two algorithms, the modelling, structure, and solution are described, and the corresponding procedures of bad data processing are presented. Numerical results on the IEEE 30-bus, 118-bus and 300-bus systems can verify the effectiveness of the two proposed algorithms. A novel transient state estimation algorithm based on synchronised measurements is proposed in Chapter 6. Considering the scanning cycle and sampling rate of PMU measurements, the proposed algorithm can estimate transient states in a practical way. The performance of the proposed algorithm is demonstrated in a transient simulation on the IEEE 14-bus system.

The aim of the thesis is to design a special purpose tool for sag measurement. Three possible solutions are proposed, for each the production cycle time is calculated and its approximate costs are estimated. The best solution in terms of a trade-off between both key quantities is suggested. Next part of the work deals with the selection of suitable drives for the manipulator as well as of the other components for the whole electrical device. Finally, a possible automated control of the complete machinery, including the electrical wiring diagram, is presented.

Bibliography: pages 104-110.
Two technologies, distributed operating systems and UNIX are very relevant in computing today. Many distributed systems have been produced and many are under development. To a large extent, distributed systems are considered to be the only way to solve the computing needs of the future. UNIX, on the other hand, is becoming widely recognized as the industry standard for operating systems. The transputer, unlike. UNIX and distributed systems is a relatively new innovation. The transputer is a concurrent processing machine based on mathematical principles. Increasingly, the transputer is being used to solve a wide range of problems of a parallel nature. This thesis combines these three aspects in creating a distributed implementation of UNIX on a network of transputers. The design is based on the satellite model. In this model a central controlling processor is surrounded by worker processors, called satellites, in a master/ slave relationship.

Master of Science
Department of Electrical and Computer Engineering
Noel N. Schulz
As the size of electric power systems are increasing, the techniques to protect, monitor and control them are becoming more sophisticated. Government, utilities and various organizations are striving to have a more reliable power grid. Various research projects are working to minimize risks on the grid. One of the goals of this research is to discuss a robust and accurate state estimation (SE) of the power grid. Utilities are encouraging teams to change the conventional way of state estimation to real time state estimation. Currently most of the utilities use traditional centralized SE algorithms for transmission systems. Although the traditional methods have been enhanced with advancement in technologies, including PMUs, most of these advances have remained localized with individual utility state estimation. There is an opportunity to establish a coordinated SE approach integration using PMU data across a system, including multiple utilities and this is using Distributed State Estimation (DSE). This coordination will minimize cascading effects on the power system. DSE could be one of the best options to minimize the required communication time and to provide accurate data to the operators. This project will introduce DSE techniques with the help of PMU data for a system snapshot. The proposed DSE algorithm will split the traditional central state estimation into multiple local state estimations and show how to reduce calculation time compared with centralized state estimation. Additionally these techniques can be implemented in micro-grid or islanded system.

L'affinement successif de programmes parallèles à partir de spécifications formelles permet de s'assurer de la correction du programme obtenu par rapport a la specification initiale, puisque la transformation est fondée sur la préservation de propriétés telles que celles d'invariance et celles de fatalité. Cependant, les programmes obtenus sont écrits dans une notation abstraite éloignée des langages de programmation parallèles classiques et il convient de développer des techniques de transformation de programmes (ensemble d'actions) en des programmes écrits dans des langages de programmation parallèles (linda, occam). Bien entendu, cela conduit à analyser les techniques possibles de parallélisation de systèmes d'actions ou de distribution de systèmes d'actions. Notre travail de thèse s'appuie sur le formalisme unity de Chandy et Misra pour lequel nous avons construit un outil d'aide à la preuve dans l'outil b et nous avons examiné plusieurs types de transformations de programmes unity en d'autres langages ainsi que des stratégies de répartition. Nous proposons un langage intermédiaire que nous dénommons UCL (unity communication language) qui facilite l'implantation d'unity sur une architecture parallèle, et qui assure la correction formelle de cette implantation vis-à-vis de la spécification initiale. Le langage UCL est ensuite utilisé comme nouveau point de départ de la transformation et permet de produire soit un programme Clinda, soit un programme Occam. Cette approche favorise la réutilisation de cette première étape de transformation avant de cibler une architecture particulière

Within the past decade, talk has arisen of shifting the utility grid from centralized, radial sources to a distributed network of sources, also known as distributed generation (DG); in the wake of deregulation, the California energy crisis, and northeastern blackouts. Existing control techniques for DG systems are designed to operate a system either in the connected or disconnected (islanding) mode to the utility; thus not allowing for both modes to be implemented and transitioned between. Existing detection and re-closure algorithms can also be improved upon. Dependent upon the method implemented, detection algorithms can either cause distortions in the output or completely miss a disturbance. The present re-closure process to reconnect to the utility is to completely shutdown and wait five minutes. The proposed methods of this study improve upon existing methods, via simulation and hardware experimentation, for DG systems that can intentionally islanding themselves. The proposed, â switched-modeâ , control allows for continuous operation of the system during disturbances by transitioning the mode of control to reflect the change in the system mode (grid-connected or islanding). This allows for zero downtimes without detrimental transients. The proposed detection method can sense disturbances that other methods cannot; and within 25 ms (approximately 1.5 line-cycles at 60 Hz). This method is an improvement over other methods because it eliminates the need to purposely distort the outputs to sense a disturbance. The proposed re-closure method is an improvement over the existing method due to the fact that it does not require the system to de-energize before re-synchronizing and reconnecting to the utility. This allows for DGs to continuously supply power to the system without having to shut down. Results show that the system is generally ready to reconnect after 2 to 5 line cycles.
Master of Science

Bibliography: pages 90-94.
The DISTRIX operating system is a multiprocessor distributed operating system based on UNIX. It consists of a number of satellite processors connected to central servers. The system is derived from the MINIX operating system, compatible with UNIX Version 7. A remote procedure call interface is used in conjunction with a system wide, end-to-end communication protocol that connects satellite processors to the central servers. A cached file server provides access to all files and devices at the UNIX system call level. The design of the file server is discussed in depth and the performance evaluated. Additional information is given about the software and hardware used during the development of the project. The MINIX operating system has proved to be a good choice as the software base, but certain features have proved to be poorer. The Inmos transputer emerges as a processor with many useful features that eased the implementation.

This report investigates if an HLA-plugin for the game engine Unity can be made and whether or not it would lead to any drawbacks in regard to data exchange and performance. An implementation of a plugin and performance tests on it proceeds to show that the possibilities of running HLA as a plugin in Unity shows a lot of promise for 3D-applications designed in Unity communicating over HLA.

Le développement massif des énergies renouvelables intermittentes dans les systèmes de puissance affecte le fonctionnement des systèmes électriques. En raison des techniques limitées et des investissements nécessaires pour maintenir le niveau de sécurité électrique actuel, les questions liées à l'envoi, à la stabilité statique et dynamique pourraient arrêter le développement de ces sources. Le sujet de la thèse est de développer un outil pour mesurer l'incertitude sur la disponibilité de la puissance produite par les générateurs photovoltaïques dans un réseau urbain. Premièrement, l'incertitude est modélisée par l'étude de la nature incertaine de la PV énergie production et de la charge. Avec les méthodes stochastiques, on calcule la réserve de puissance (OR) un jour d'avance en tenant compte d'un indice de risque de fiabilité associé. Ensuite, l'OR est distribué en différents générateurs (générateurs photovoltaïques actifs et micro-turbines à gaz). Afin de minimiser le coût opérationnel total et/ou les émissions équivalentes de CO2, une planification optimale et une répartition quotidienne de l'OR dans différents générateurs d'énergie sont mises en œuvre. Enfin, un logiciel libre «Un système de gestion de l'énergie convivial et un superviseur de la planification opérationnelle» est développé à partir de l'interface utilisateur graphique de Matlab pour conceptualiser le fonctionnement global du système
The massive development of intermittent renewable energy technologies in power systems affects the operation of electrical systems. Due to technical limitations and investments needed to maintain the current electrical security level, issues related to dispatching, static and dynamic stability could stop the development of these distributed renewable energy sources (RES). The subject of the PhD is to develop a tool to study the uncertainties of PV power and load forecasting in an urban network. Firstly, the uncertainties are modeled by studying the uncertainty nature of PV power and load. With stochastic methods, the day-ahead operating reserve (OR) is quantified by taking into account an associated reliability risk index. Then the OR is dispatched into different power generators (active PV generators and micro gas turbines). To minimize the microgrid total operational cost and/or equivalent CO2 emissions, day-ahead optimal operational planning and dispatching of the OR into different power generators is implemented. Finally, a freeware “A User-friendly Energy Management System and Operational Planning Supervisor” is developed based on the Matlab GUI to conceptualize the overall system operation

Modern computers can no longer rely on increasing CPU speed to improve their performance as further increasing the clock speed of single CPU machines will make them too difficult to cool, or the cooling require too much power. Hardware manufacturers must now use parallelism to drive performance to the levels expected by Moore's Law. More recently, High Performance Computers (HPCs) have adopted heterogeneous architectures, i.e.having multiple types of computing hardware (such as CPU & GPU) on a single node. These architectures allow the opportunity to extract performance from non-CPU architectures, while still providing a general purpose platform for less modern codes. In this thesis we investigate Task-Based Parallelism, a shared-memory paradigm for parallel computing. Task-Based Parallelism requires the programmer to divide the work into chunks (known as tasks) and describe the data dependencies between tasks. The tasks are then scheduled amongst the threads automatically by the task-based scheduler. In this thesis we examine how Task-Based Parallelism can be used with GPUs and hybrid shared-distributed memory, in particular we examine how data transfer can be incorporated into a task-based framework, either to the GPU from the host, or between separate nodes. We also examine how we can use the task graph to load balance the computation between multiple nodes or GPUs. We test our task-based methods with Molecular Dynamics, a tiled QR decomposition, and a new task-based Barnes-Hut algorithm. These are problems with different dependency structures which tests the ability of the scheduler to handle a variety of different types of computation. The results with these testcases show improved performance when we use asynchronous data transfer to and from the GPU, and show reasonable parallel efficiency over a small number of MPI ranks.

De nombreux problèmes d'optimisation propres à différents secteurs industriels et académiques (énergie, chimie, transport, etc.) nécessitent de concevoir des méthodes de plus en plus efficaces pour les résoudre. Afin de répondre à ces besoins, l'objectif de cette thèse est de développer une bibliothèque composée de plusieurs métaheuristiques hybrides distribuées et massivement parallèles. Dans un premier temps, nous avons étudié le problème du voyageur de commerce et sa résolution par la méthode colonie de fourmis afin de mettre en place les techniques d'hybridation et de parallélisation. Ensuite, deux autres problèmes d'optimisation ont été traités, à savoir, le problème d'affectation quadratique (QAP) et le problème de la résolution structurale des zéolithes (ZSP). Pour le QAP, plusieurs variantes basées sur une recherche taboue itérative avec des diversifications adaptatives ont été proposées. Le but de ces propositions est d'étudier l'impact de : l'échange des données, des stratégies de diversification et des méthodes de coopération. Notre meilleure variante est comparée à six des meilleurs travaux de la littérature. En ce qui concerne le ZSP, deux nouvelles formulations de la fonction objective sont proposées pour évaluer le potentiel des structures zéolitiques trouvées. Ces formulations sont basées sur le principe de pénalisation et de récompense. Deux algorithmes génétiques hybrides et parallèles sont proposés pour générer des structures zéolitiques stables. Nos algorithmes ont généré actuellement six topologies stables, parmi lesquelles trois ne sont pas répertoriées sur le site Web du SC-IZA ou dans l'Atlas of Prospective Zeolite Structures
Many optimization problems specific to different industrial and academic sectors (energy, chemicals, transportation, etc.) require the development of more effective methods in resolving. To meet these needs, the aim of this thesis is to develop a library of several hybrid metaheuristics distributed and massively parallel. First, we studied the traveling salesman problem and its resolution by the ant colony method to establish hybridization and parallelization techniques. Two other optimization problems have been dealt, which are, the quadratic assignment problem (QAP) and the zeolite structure problem (ZSP). For the QAP, several variants based on an iterative tabu search with adaptive diversification have been proposed. The aim of these proposals is to study the impact of: the data exchange, the diversification strategies and the methods of cooperation. Our best variant is compared with six from the leading works of the literature. For the ZSP two new formulations of the objective function are proposed to evaluate the potential of the zeolites structures founded. These formulations are based on reward and penalty evaluation. Two hybrid and parallel genetic algorithms are proposed to generate stable zeolites structures. Our algorithms have now generated six stable topologies, three of them are not listed in the SC-JZA website or in the Atlas of Prospective Zeolite Structures

Feeder reconfiguration is performed by changing the open/close status of two types of switches: normally open tie switches and normally closed sectionalizing switches. A whole feeder or part of a feeder may be served from another feeder by closing a tie switch linking the two while an appropriate sectionalizing switch must be opened to maintain the radial structure of the system. Feeder reconfiguration is mainly aiming to reduce the system overall power losses and improve voltage profile. In this dissertation, several approaches have been proposed to reconfigure the radial distribution networks including the potential impact of integrating Distributed Energy Resources (DER) into the grid. These approaches provide a Fast-Genetic Algorithm “FGA” in which the size and convergence speed is improved compared to the conventional genetic algorithm. The size of the population matrix is also smaller because of the simple way of constructing the meshed network. Additionally, FGA deals with integer variable instead of a binary one, which makes FGA a unique method. The number of the mesh/loop is based on the number of tie switches in a particular network. The validity of the proposed FGA is investigated by comparing the obtained results with the one obtained from the most recent approaches. The second the approach is the implementation of the Differential Evolution (DE) algorithm. DE is a population-based method using three operators including crossover, mutation, and selection. It differs from GA in that genetic algorithms rely on crossover while DE relies on mutation. Mutation is based on the differences between randomly sampled pairs of solutions in the population. DE has three advantages: the ability to find the global optimal result regardless of the initial values, fast convergence, and requirement of a few control parameters. DE is a well-known and straightforward population-based probabilistic approach for comprehensive optimization. In distribution systems, if a utility company has the right to control the location and size of distributed generations, then the location and size of DGs may be determined based on some optimization methods. This research provides a promising approach to finding the optimal size and location of the planned DER units using the proposed DE algorithm. DGs location is obtained using the sensitivity of power losses with respect to real power injection at each bus. Then the most sensitive bus is selected for installing the DG unit. Because the integration of the DG adds positive real power injections, the optimal location is the one with the most negative sensitivity in order to get the largest power loss reduction. Finally, after the location is specified, the proposed Differential Evolution Algorithm (DEA) is used to obtain the optimal size of the DG unit. Only the feasible solutions that satisfy all the constraints are considered. The objective of installing DG units to the distribution network is to reduce the system losses and enhance the network voltage profile. Nowadays, these renewable DGs are required to equip with reactive power devices (such as static VAR compensators, capacitor banks, etc.), to provide reactive power as well as to control the voltage at their terminal bus. DGs have various technical benefits such as voltage profile improvement, relief in feeder loading, power loss minimization, stability improvement, and voltage deviation mitigation. The distributed generation may not achieve its full potential of benefits if placed at any random location in the system. It is necessary to investigate and determine the optimum location and size of the DG. Most distribution networks are radial in nature with limited short-circuit capacity. Therefore, there is a limit to which power can be injected into the distribution network without compromising the power quality and the system stability. This research is aiming to investigate this by applying DG technologies to the grid and keeping the system voltage within a defined boundary [0.95 - 1.05 p.u]. The requirements specified in IEEE Standard 1547 are considered. This research considers four objectives related to minimization of the system power loss, minimization of the deviations of the nodes voltage, minimization of branch current constraint violation, and minimization of feeder’s currents imbalance. The research formulates the problem as a multi-objective problem. The effectiveness of the proposed methods is demonstrated on different revised IEEE test systems including 16 and 33-bus radial distribution system.

Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2010.
Committee Chair: Anderson, David V.; Committee Member: Ferri, Bonnie H.; Committee Member: Hasler, Paul E.; Committee Member: Kang, Sung Ha; Committee Member: McClellan, James H.; Committee Member: Wolf, Wayne H. Part of the SMARTech Electronic Thesis and Dissertation Collection.

International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada
GPS user equipment has matured and is now available to support the use of live players in integrated ranges and simulations. P-code GPS provides true WGS-84 based coordinate information anywhere in the world at any time and to accuracies at the 5 ft (1s) level (demonstrated in high dynamic aircraft using differential P-code GPS). C/A code GPS shows lower accuracy and is especially vulnerable to multipath degradation over water. In supporting networked ranges with simulations, GPS is directly applicable to the dead reckoning requirements of the Distributed Interactive Simulation (DIS) community. DIS dead reckoning provides the capability of much reduced data rates in recovering TSPI information from platforms. The on-board state vector for an integrated GPS/Inertial Reference Unit provides accurate position, velocity and acceleration as well as attitude and attitude rate information so that dead reckoning thresholds can be both position and attitude driven. A simplified analysis is presented in the paper to derive dead reckoning update rates from the G loading levels of various player dynamics. Also, information is provided which results in word length requirements for GPS-based state vector information for transmission over minimum word length DIS Field Instrumentation Protocol Data Units (PDUs, which are the data block formats). The coordinate frame problem in use of GPS-based state vector information from fixed ranges is also addressed, showing that the use of a local geodetic frame is preferable to the use of an earth centered earth fixed frame, in that it is more efficient of network PDU word length.

Zvýšení efektivity výměny tepla vede k poklesu spotřeby energie, což se následně projeví sníženými provozními náklady, poklesem produkce emisí a potažmo také snížením dopadu na životní prostředí. Běžné způsoby zefektivňování přenosu tepla jako např. přidání žeber či vestaveb do trubek ovšem nemusí být vždy vhodné nebo proveditelné -- zvláště při rekuperaci tepla z proudů s vysokou zanášivostí. Jelikož intenzita přestupu tepla závisí i na charakteru proudění, distribuci toku a zanášení, které lze všechny výrazně ovlivnit tvarem jednotlivých součástí distribučního systému, bylo sestaveno několik zjednodušených modelů pro rychlou a dostatečně přesnou predikci distribuce a také aplikace pro tvarovou optimalizaci distribučních systémů využívající právě tyto modely. Přesnost jednoho z modelů byla dále zvýšena pomocí dat získaných analýzou 282 distribučních systémů v softwaru ANSYS FLUENT. Vytvořené aplikace pak lze využít během návrhu zařízení na výměnu tepla ke zvýšení jejich výkonu a spolehlivosti.

Este trabalho se inicia com uma discussão sobre as principais características dos Sistemas de Arquivos Distribuídos, ou seja, espaço de nomes, localização, cache, consistência, replicação, disponibilidade, escalabilidade, heterogeneidade, tolerância a falhas e segurança. Analisamos diversos sistemas de arquivos existentes quanto a estas características dando especial atenção aos sistemas NFS, Andrew, Coda, Sprite, Zebra, Harp, Frolic e Echo. Descrevemos alguns modelos analíticos para o comportamento de sistemas de arquivos distribuídos e, em seguida, apresentamos um novo modelo para sistemas baseados em leases - um mecanismo para a garantia de consistência em sistemas distribuídos. Finalmente, descrevemos a nossa implementação do sistema de arquivos distribuído SODA - que utiliza leases - apresentando dados sobre o seu desempenho.
We begin with a discussion of some of the main characteristics of Distributed File Systems, namely locality, name space, cache, consistency, replication, availability, scalability, heterogeneity, fault tolerance and security. We analyze several file systems based on these characteristics. We focus mainly on NFS, Andrew, Coda, Sprite, Zebra, Harp, Frolic, and Echo. We then describe some analytical models of the behavior of distributed file systems. After that we present a new model of systems based on leases - a mechanism to assure consistency on a distributed system. Finally we describe our implementation of the SODA distributed file system - which uses leases - presenting some results on its performance.

Achieving the reductions in carbon dioxide emissions which are necessary will require improvements in the way in which domestic space heating is supplied. Air Source Heat Pumps and micro-Combined Heat and Power units both have the potential to reduce emissions while using primary energy resources more efficiently. The performance which these technologies can achieve is fundamental to fulfilling this potential and yet it is still subject to some uncertainty. This thesis analyses the performance of Air Source Heat Pumps and micro-Combined Heat and Power units in terms of their energy and exergy requirements and in terms of the carbon dioxide emissions associated with their operation. A review of the literature identified that it was appropriate to develop a novel modelling approach. Models of many components currently exist and these are adopted and extended wherever possible within this modelling approach. However, it is the unique way in which this research combines these models and adds additional components which delivers performance data relating to a wider range of conditions at a greater level of detail than that which was previously available. The model which was developed can dynamically simulate the heating and power demands in many dwellings simultaneously, facilitating meaningful study of effects which are dependent upon the sum of their power flows. Consideration of the effect of operating conditions includes permutations of climate, control systems (including those which engage with demand side management), grid generation mixes and building properties. Efficient Air Source Heat Pumps units have the potential to make energy and carbon emissions savings at present but their performance is sensitive to the conditions studied. In particular, appropriate control of the units can yield energy savings of around 25%. Additionally, the carbon emissions intensity of the grid is an important consideration which is explored in depth. Currently, energy requirements and carbon emissions can be reduced by the use of micro-Combined Heat and Power units. Their potential to further reduce carbon emissions diminishes if the grid is predominantly decarbonised but units with high electrical efficiencies can still save energy. The effect of the control approach which is adopted is also significant and has different effects on fuel-cell based units compared to combustion-based units. The key contribution of this work is the analysis of performance data for a selection of units operating under a range of conditions, calculated with a consistent, accurate methodology. Comparison is made between the technologies and between the effects of different operating conditions. A second significant contribution of this work is the development of the model which was used to generate the performance results. These advances allow more detailed comparative analysis of performance data in a wider range of conditions than previously possible.

Les travaux exposés dans cette thèse sont de natures multiples mais visent tous à une meilleure compréhension du geste de saisie chez l'homme, que ce soit d'un point de vue comportemental, cinématique ou de contrôle. Lorsqu'il doit saisir un objet, l'homme s'appuie sur une structure de contrôle multi-niveaux ainsi que son expérience, ce qui lui permet d'estimer les mouvements à effectuer de manière très efficace avant même d'avoir commencé à bouger. Nous pensons que ce mode de commande peut apporter une solution innovante au double problème de l'atteinte et de la saisie par une main artificielle. Nous avons donc développé une architecture de commande distribuée reproduisant en partie ces mécanismes et capable de contrôler ce genre d'artefacts de manière efficace, déclinée en plusieurs versions en fonction du niveau de contrôle souhaité. Elle est constituée d'un ensemble d'unités d'appariement s'inspirant des structures présentes dans le Système Nerveux Central : chacune a en charge une partie du problème global à résoudre, elles intègrent des informations en provenance de la consigne et/ou d'autres unités à travers des échanges parfois redondants, et elles s'appuient sur un algorithme d'apprentissage supervisé. Afin de mieux comprendre les principes qui sous-tendent le mouvement humain nous nous sommes aussi intéressés à la modélisation de la main et du geste de saisie, que ce soit à travers un protocole d'expérimentation chez l'homme ou l'analyse de données médicales et vidéos chez le singe

International Telemetering Conference Proceedings / October 29-November 02, 1990 / Riviera Hotel and Convention Center, Las Vegas, Nevada
The Loral Instrumentation System 500 configured as an Advanced Commanding and Telemetry System (ACTS) supports the acquisition of multiple telemetry downlink streams, and simultaneously supports multiple uplink command streams for today’s satellite vehicles. By using industry and federal standards, the system is able to support, without relying on a host computer, a true distributed dataflow architecture that is complemented by state-of-the-art RISC-based workstations and file servers.

International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, California
This paper discusses the requirements and design of a multi-platform system software for control, status, calibration and testing of a telemetry system.

Doutoramento em Engenharia Electrotécnica
Interest on using teams of mobile robots has been growing, due to their potential to cooperate for diverse purposes, such as rescue, de-mining, surveillance or even games such as robotic soccer. These applications require a real-time middleware and wireless communication protocol that can support an efficient and timely fusion of the perception data from different robots as well as the development of coordinated behaviours. Coordinating several autonomous robots towards achieving a common goal is currently a topic of high interest, which can be found in many application domains. Despite these different application domains, the technical problem of building an infrastructure to support the integration of the distributed perception and subsequent coordinated action is similar. This problem becomes tougher with stronger system dynamics, e.g., when the robots move faster or interact with fast objects, leading to tighter real-time constraints. This thesis work addressed computing architectures and wireless communication protocols to support efficient information sharing and coordination strategies taking into account the real-time nature of robot activities. The thesis makes two main claims. Firstly, we claim that despite the use of a wireless communication protocol that includes arbitration mechanisms, the self-organization of the team communications in a dynamic round that also accounts for variable team membership, effectively reduces collisions within the team, independently of its current composition, significantly improving the quality of the communications. We will validate this claim in terms of packet losses and communication latency. We show how such self-organization of the communications can be achieved in an efficient way with the Reconfigurable and Adaptive TDMA protocol. Secondly, we claim that the development of distributed perception, cooperation and coordinated action for teams of mobile robots can be simplified by using a shared memory middleware that replicates in each cooperating robot all necessary remote data, the Real-Time Database (RTDB) middleware. These remote data copies, which are updated in the background by the selforganizing communications protocol, are extended with age information automatically computed by the middleware and are locally accessible through fast primitives. We validate our claim showing a parsimonious use of the communication medium, improved timing information with respect to the shared data and the simplicity of use and effectiveness of the proposed middleware shown in several use cases, reinforced with a reasonable impact in the Middle Size League of RoboCup.
O interesse na utilização de equipas multi-robô tem vindo a crescer, devido ao seu potencial para cooperarem na resolução de vários problemas, tais como salvamento, desminagem, vigilância e até futebol robótico. Estas aplicações requerem uma infraestrutura de comunicação sem fios, em tempo real, suportando a fusão eficiente e atempada dos dados sensoriais de diferentes robôs bem como o desenvolvimento de comportamentos coordenados. A coordenação de vários robôs autónomos com vista a um dado objectivo é actualmente um tópico que suscita grande interesse, e que pode ser encontrado em muitos domínios de aplicação. Apesar das diferenças entre domínios de aplicação, o problema técnico de construir uma infraestrutura para suportar a integração da percepção distribuída e das acções coordenadas é similar. O problema torna-se mais difícil à medida que o dinamismo dos robôs se acentua, por exemplo, no caso de se moverem mais rápido, ou de interagirem com objectos que se movimentam rapidamente, dando origem a restrições de tempo-real mais apertadas. Este trabalho centrou-se no desenvolvimento de arquitecturas computacionais e protocolos de comunicação sem fios para suporte à partilha de informação e à realização de acções coordenadas, levando em consideração as restrições de tempo-real. A tese apresenta duas afirmações principais. Em primeiro lugar, apesar do uso de um protocolo de comunicação sem fios que inclui mecanismos de arbitragem, a auto-organização das comunicações reduz as colisões na equipa, independentemente da sua composição em cada momento. Esta afirmação é validada em termos de perda de pacotes e latência da comunicação. Mostra-se também como a auto-organização das comunicações pode ser atingida através da utilização de um protocolo TDMA reconfigurável e adaptável sem sincronização de relógio. A segunda afirmação propõe a utilização de um sistema de memória partilhada, com replicação nos diferentes robôs, para suportar o desenvolvimento de mecanismos de percepção distribuída, fusão sensorial, cooperação e coordenação numa equipa de robôs. O sistema concreto que foi desenvolvido é designado como Base de Dados de Tempo Real (RTDB). Os dados remotos, que são actualizados de forma transparente pelo sistema de comunicações auto-organizado, são estendidos com a respectiva idade e são disponibilizados localmente a cada robô através de primitivas de acesso eficientes. A RTDB facilita a utilização parcimoniosa da rede e bem como a manutenção de informação temporal rigorosa. A simplicidade da integração da RTDB para diferentes aplicações permitiu a sua efectiva utilização em diferentes projectos, nomeadamente no âmbito do RoboCup.

Fault location reveals the exact information needed for utility crews to timely and promptly perform maintenance and system restoration. Therefore, accurate fault location is a key function in reducing outage time and enhancing power system reliability. Modern power systems are witnessing a trend of integrating more distributed generations (DG) into the grid. DG power outputs may be intermittent and can no longer be treated as constants in fault location method development. DG modeling is also difficult for fault location purpose. Moreover, most existing fault location methods are not applicable to simultaneous faults. To solve the challenges, this dissertation proposes three impedance-based fault location algorithms to pinpoint simultaneous faults for power transmission systems and distribution systems with high penetration of DGs. The proposed fault location algorithms utilize the voltage and/or current phasors that are captured by phasor measurement units. Bus impedance matrix technique is harnessed to establish the relationship between the measurements and unknown simultaneous fault locations. The distinct features of the proposed algorithms are that no fault types and fault resistances are needed to determine the fault locations. In particular, Type I and Type III algorithms do not need the information of source impedances and prefault measurements to locate the faults. Moreover, the effects of shunt capacitance are fully considered to improve fault location accuracy. The proposed algorithms for distribution systems are validated by evaluation studies using Matlab and Simulink SimPowerSystems on a 21 bus distribution system and the modified IEEE 34 node test system. Type II fault location algorithm for transmission systems is applicable to untransposed lines and is validated by simulation studies using EMTP on a 27 bus transmission system. Fault area identification method is proposed to reduce the number of line segments to be examined for fault location. In addition, an optimal fault location method that can identify possible bad measurement is proposed for enhanced fault location estimate. Evaluation studies show that the optimal fault location method is accurate and effective. The proposed algorithms can be integrated into the existing energy management system for enhanced fault management capability for power systems.

[EN] The field of audio signal processing has undergone a major development in recent years. Both the consumer and professional marketplaces continue to show growth in audio applications such as immersive audio schemes that offer optimal listening experience, intelligent noise reduction in cars or improvements in audio teleconferencing or hearing aids. The development of these applications has a common interest in increasing or improving the number of discrete audio channels, the quality of the audio or the sophistication of the algorithms. This often gives rise to problems of high computational cost, even when using common signal processing algorithms, mainly due to the application of these algorithms to multiple signals with real-time requirements. The field of High Performance Computing (HPC) based on low cost hardware elements is the bridge needed between the computing problems and the real multimedia signals and systems that lead to user's applications. In this sense, the present thesis goes a step further in the development of these systems by using the computational power of General Purpose Graphics Processing Units (GPGPUs) to exploit the inherent parallelism of signal processing for multichannel audio applications. The increase of the computational capacity of the processing devices has been historically linked to the number of transistors in a chip. However, nowadays the improvements in the computational capacity are mainly given by increasing the number of processing units and using parallel processing. The Graphics Processing Units (GPUs), which have now thousands of computing cores, are a representative example. The GPUs were traditionally used to graphic or image processing, but new releases in the GPU programming environments such as CUDA have allowed the use of GPUS for general processing applications. Hence, the use of GPUs is being extended to a wide variety of intensive-computation applications among which audio processing is included. However, the data transactions between the CPU and the GPU and viceversa have questioned the viability of the use of GPUs for audio applications in which real-time interaction between microphones and loudspeakers is required. This is the case of the adaptive filtering applications, where an efficient use of parallel computation in not straightforward. For these reasons, up to the beginning of this thesis, very few publications had dealt with the GPU implementation of real-time acoustic applications based on adaptive filtering. Therefore, this thesis aims to demonstrate that GPUs are totally valid tools to carry out audio applications based on adaptive filtering that require high computational resources. To this end, different adaptive applications in the field of audio processing are studied and performed using GPUs. This manuscript also analyzes and solves possible limitations in each GPU-based implementation both from the acoustic point of view as from the computational point of view.
[ES] El campo de procesado de señales de audio ha experimentado un desarrollo importante en los últimos años. Tanto el mercado de consumo como el profesional siguen mostrando un crecimiento en aplicaciones de audio, tales como: los sistemas de audio inmersivo que ofrecen una experiencia de sonido óptima, los sistemas inteligentes de reducción de ruido en coches o las mejoras en sistemas de teleconferencia o en audífonos. El desarrollo de estas aplicaciones tiene un propósito común de aumentar o mejorar el número de canales de audio, la propia calidad del audio o la sofisticación de los algoritmos. Estas mejoras suelen dar lugar a sistemas de alto coste computacional, incluso usando algoritmos comunes de procesado de señal. Esto se debe principalmente a que los algoritmos se suelen aplicar a sistemas multicanales con requerimientos de procesamiento en tiempo real. El campo de la Computación de Alto Rendimiento basado en elementos hardware de bajo coste es el puente necesario entre los problemas de computación y los sistemas multimedia que dan lugar a aplicaciones de usuario. En este sentido, la presente tesis va un paso más allá en el desarrollo de estos sistemas mediante el uso de la potencia de cálculo de las Unidades de Procesamiento Gráfico (GPU) en aplicaciones de propósito general. Con ello, aprovechamos la inherente capacidad de paralelización que poseen las GPU para procesar señales de audio y obtener aplicaciones de audio multicanal. El aumento de la capacidad computacional de los dispositivos de procesado ha estado vinculado históricamente al número de transistores que había en un chip. Sin embargo, hoy en día, las mejoras en la capacidad computacional se dan principalmente por el aumento del número de unidades de procesado y su uso para el procesado en paralelo. Las GPUs son un ejemplo muy representativo. Hoy en día, las GPUs poseen hasta miles de núcleos de computación. Tradicionalmente, las GPUs se han utilizado para el procesado de gráficos o imágenes. Sin embargo, la aparición de entornos sencillos de programación GPU, como por ejemplo CUDA, han permitido el uso de las GPU para aplicaciones de procesado general. De ese modo, el uso de las GPU se ha extendido a una amplia variedad de aplicaciones que requieren cálculo intensivo. Entre esta gama de aplicaciones, se incluye el procesado de señales de audio. No obstante, las transferencias de datos entre la CPU y la GPU y viceversa pusieron en duda la viabilidad de las GPUs para aplicaciones de audio en las que se requiere una interacción en tiempo real entre micrófonos y altavoces. Este es el caso de las aplicaciones basadas en filtrado adaptativo, donde el uso eficiente de la computación en paralelo no es sencillo. Por estas razones, hasta el comienzo de esta tesis, había muy pocas publicaciones que utilizaran la GPU para implementaciones en tiempo real de aplicaciones acústicas basadas en filtrado adaptativo. A pesar de todo, esta tesis pretende demostrar que las GPU son herramientas totalmente válidas para llevar a cabo aplicaciones de audio basadas en filtrado adaptativo que requieran elevados recursos computacionales. Con este fin, la presente tesis ha estudiado y desarrollado varias aplicaciones adaptativas de procesado de audio utilizando una GPU como procesador. Además, también analiza y resuelve las posibles limitaciones de cada aplicación tanto desde el punto de vista acústico como desde el punto de vista computacional.
[CAT] El camp del processament de senyals d'àudio ha experimentat un desenvolupament important als últims anys. Tant el mercat de consum com el professional segueixen mostrant un creixement en aplicacions d'àudio, com ara: els sistemes d'àudio immersiu que ofereixen una experiència de so òptima, els sistemes intel·ligents de reducció de soroll en els cotxes o les millores en sistemes de teleconferència o en audiòfons. El desenvolupament d'aquestes aplicacions té un propòsit comú d'augmentar o millorar el nombre de canals d'àudio, la pròpia qualitat de l'àudio o la sofisticació dels algorismes que s'utilitzen. Això, sovint dóna lloc a sistemes d'alt cost computacional, fins i tot quan es fan servir algorismes comuns de processat de senyal. Això es deu principalment al fet que els algorismes se solen aplicar a sistemes multicanals amb requeriments de processat en temps real. El camp de la Computació d'Alt Rendiment basat en elements hardware de baix cost és el pont necessari entre els problemes de computació i els sistemes multimèdia que donen lloc a aplicacions d'usuari. En aquest sentit, aquesta tesi va un pas més enllà en el desenvolupament d'aquests sistemes mitjançant l'ús de la potència de càlcul de les Unitats de Processament Gràfic (GPU) en aplicacions de propòsit general. Amb això, s'aprofita la inherent capacitat de paral·lelització que posseeixen les GPUs per processar senyals d'àudio i obtenir aplicacions d'àudio multicanal. L'augment de la capacitat computacional dels dispositius de processat ha estat històricament vinculada al nombre de transistors que hi havia en un xip. No obstant, avui en dia, les millores en la capacitat computacional es donen principalment per l'augment del nombre d'unitats de processat i el seu ús per al processament en paral·lel. Un exemple molt representatiu són les GPU, que avui en dia posseeixen milers de nuclis de computació. Tradicionalment, les GPUs s'han utilitzat per al processat de gràfics o imatges. No obstant, l'aparició d'entorns senzills de programació de la GPU com és CUDA, han permès l'ús de les GPUs per a aplicacions de processat general. D'aquesta manera, l'ús de les GPUs s'ha estès a una àmplia varietat d'aplicacions que requereixen càlcul intensiu. Entre aquesta gamma d'aplicacions, s'inclou el processat de senyals d'àudio. No obstant, les transferències de dades entre la CPU i la GPU i viceversa van posar en dubte la viabilitat de les GPUs per a aplicacions d'àudio en què es requereix la interacció en temps real de micròfons i altaveus. Aquest és el cas de les aplicacions basades en filtrat adaptatiu, on l'ús eficient de la computació en paral·lel no és senzilla. Per aquestes raons, fins al començament d'aquesta tesi, hi havia molt poques publicacions que utilitzessin la GPU per implementar en temps real aplicacions acústiques basades en filtrat adaptatiu. Malgrat tot, aquesta tesi pretén demostrar que les GPU són eines totalment vàlides per dur a terme aplicacions d'àudio basades en filtrat adaptatiu que requereixen alts recursos computacionals. Amb aquesta finalitat, en la present tesi s'han estudiat i desenvolupat diverses aplicacions adaptatives de processament d'àudio utilitzant una GPU com a processador. A més, aquest manuscrit també analitza i resol les possibles limitacions de cada aplicació, tant des del punt de vista acústic, com des del punt de vista computacional.
Lorente Giner, J. (2015). Adaptive signal processing for multichannel sound using high performance computing [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/58427
TESIS

This thesis describes the reconstruction network 10 kV HV networks in a teaching hospital in the transition to a new 22 kV voltage level according to valid regulations. The paper describes the current state of technological equipment and its gradual replacement with new technology at 22 kV voltage level in each power units so as not to limit the operation of the hospital. For this purpose, the new backup system for rotating spare resources. The thesis deals with new input distribution, which will serve as a transfer point between the customer and distributor of electricity as well as advance the existing technological equipment.

Cette thèse aborde le problème du support pour les applications distribuées coopératives. La notion de groupes de processus auxquels sont délivrés des messages est l'un des mécanismes fondamentaux de la construction de telles applications. L'état de l'art présente les différentes sémantiques pour de tels protocoles et les principales réalisations. Le protocole retenu pour l'implantation est une version dérivée du protocole d'Amoeba modifié pour le support de groupes opaques. Diverses optimisations ont aussi été ajoutées. La mise en oeuvre est basée sur une couche générique permettant de s'abstraire des dépendances système et de faciliter la réalisation de nouveaux protocoles. La réalisation initiale a été faite en mode utilisateur sur le micro-noyau Mach 3.0 et a été suivie de portages sur diverses plates-formes Unix. Cette thèse analyse en détail les performances du protocole et leur évolution en fonction de nombreux critères. Enfin, une étude fine du temps d'exécution du protocole implanté en mode utilisateur valide les choix d'implantation.

The aim of the thesis was to design, implement and evaluate the results of automatic tests for the JavaScript Restrictor project, which is being developed as a web browser extension. The tests are divided into three levels - unit, integration, and system. The Unit Tests verify the behavior of individual features, the Integration Tests verify the correct wrapping of browser API endpoints, and the System Tests check that the extension does not suppress the desired functionality of web pages. The System Tests are implemented for parallel execution in a distributed environment which has succeeded in achieving an almost directly proportional reduction in time with respect to the number of the tested nodes. The benefit of this work is detection of previously unknown errors in the JavaScript Restrictor extension and provision of the necessary information that allowed to fix some of the detected bugs.

Ce travail présente un modèle de noyau de communication pour les systèmes répartis. Son architecture, basée sur le modèle de CSP proposé par HOARE, a été définie pour un type particulier de système, les systèmes "temps réel" répartis sur un réseau local. Il s'agit donc d'un modèle adapté à une classe précise d'application, à l'opposé de la plupart des études qui traitent des noyaux de systèmes répartis généraux. Ce noyau est basé sur deux classes d'objets : les processus "normaux" pour exprimer les traitements séquentiels et de processus appelés canaux pour implémenter à la fois la communication et la synchronisation. Une implémentation de ce noyau a été réalisée sur UNIX

The diploma thesis deals with the analysis of problems of unevenly stratified air flow in air handling units and subsequent optimization with respect to speed ratios, energy efficiency and legislative requirements. Methods of solving the problem are theoretical and experimental, while the theoretical part deals with air distribution by means of air-conditioning fans with a focus on their aerodynamics, pressure conditions and other requirements, which are an integral part of properly designed equipment. In the experimental part of the thesis was applied a proposal of an innovative technical approach to a specific model of air conditioning assembly, which was implemented in the laboratories of the Institute of Building Services.

The diploma thesis deals with the problems of the indoor environment of swimming pool halls. Firstly, it describes issues and principles of designing HVAC system in the areas with high humidity production. Thesis then focuses on various approaches to calculations of evaporation from the water surface and different possibilities of dehumidification including different types of HVAC units. This knowledge was applied to the design of HVAC system for particular assigned building, for which are proposed two different solutions. Thesis includes experimental part, its aim is to analyse one specific critical part of the hall. Based on local surveying and long-term measurements a few possibilities of improvement are suggested.