95 resultados para Processament en paral·lel (Ordinadors)
em Universidad Politécnica de Madrid
Resumo:
En el presente artículo se muestran las ventajas de la programación en paralelo resolviendo numéricamente la ecuación del calor en dos dimensiones a través del método de diferencias finitas explícito centrado en el espacio FTCS. De las conclusiones de este trabajo se pone de manifiesto la importancia de la programación en paralelo para tratar problemas grandes, en los que se requiere un elevado número de cálculos, para los cuales la programación secuencial resulta impracticable por el elevado tiempo de ejecución. En la primera sección se describe brevemente los conceptos básicos de programación en paralelo. Seguidamente se resume el método de diferencias finitas explícito centrado en el espacio FTCS aplicado a la ecuación parabólica del calor. Seguidamente se describe el problema de condiciones de contorno y valores iniciales específico al que se va a aplicar el método de diferencias finitas FTCS, proporcionando pseudocódigos de una implementación secuencial y dos implementaciones en paralelo. Finalmente tras la discusión de los resultados se presentan algunas conclusiones. In this paper the advantages of parallel computing are shown by solving the heat conduction equation in two dimensions with the forward in time central in space (FTCS) finite difference method. Two different levels of parallelization are consider and compared with traditional serial procedures. We show in this work the importance of parallel computing when dealing with large problems that are impractical or impossible to solve them with a serial computing procedure. In the first section a summary of parallel computing approach is presented. Subsequently, the forward in time central in space (FTCS) finite difference method for the heat conduction equation is outline, describing how the heat flow equation is derived in two dimensions and the particularities of the finite difference numerical technique considered. Then, a specific initial boundary value problem is solved by the FTCS finite difference method and serial and parallel pseudo codes are provided. Finally after results are discussed some conclusions are presented.
Resumo:
Ultramafic rocks occur scattered along a 300 km long NNW-SSE trending belt, parallel to the central Peruvian Andes in the Cordillera Oriental, from Tarma (Junín Dept.) to Huancapallac and Tingo María (Huánuco Dept.). The Tarma occurrences (Tapo and Acobamba) are dealt with here, as the first step of a broader research. The Tapo massif comprises strongly tectonised serpentinites with scarce peridotitic relics, amphibolites and podiform chromitites. It was overthrust on early Carboniferous metasedimentary rocks of the Andean basement (Ambo Group), and it shows evidences of a pre-Andean deformational history, not observed in the Ambo Group; the basal thrust plane is folded by the Andean tectonics. The two smaller Acobamba occurrences are also allochtonous and show similar tectonic features. Major and trace element composition of amphibolites point to a tholeiitic basalt (to picrobasalt) protolith, compatible with an ocean-ridge or ocean-island environment. Small podiform chromitite lenses and chromite disseminations also occur; they are strongly deformed, metamorphosed and overprinted by hydrothermal alteration related to deformation, and were the subject of small scale mining. The ores comprise mainly chromite, ferritchromite, spinel, magnetite, ilmenite and scarce sulphides, as well as the secondary minerals stichtite and nimite. Results of this work exclude current interpretations of the Tarma ultramafites as autochtonous igneous intrusives, and point to a new interpretation for their emplacement.
Resumo:
We have developed a new projector model specifically tailored for fast list-mode tomographic reconstructions in Positron emission tomography (PET) scanners with parallel planar detectors. The model provides an accurate estimation of the probability distribution of coincidence events defined by pairs of scintillating crystals. This distribution is parameterized with 2D elliptical Gaussian functions defined in planes perpendicular to the main axis of the tube of response (TOR). The parameters of these Gaussian functions have been obtained by fitting Monte Carlo simulations that include positron range, acolinearity of gamma rays, as well as detector attenuation and scatter effects. The proposed model has been applied efficiently to list-mode reconstruction algorithms. Evaluation with Monte Carlo simulations over a rotating high resolution PET scanner indicates that this model allows to obtain better recovery to noise ratio in OSEM (ordered-subsets, expectation-maximization) reconstruction, if compared to list-mode reconstruction with symmetric circular Gaussian TOR model, and histogram-based OSEM with precalculated system matrix using Monte Carlo simulated models and symmetries.
Resumo:
The manipulation and handling of an ever increasing volume of data by current data-intensive applications require novel techniques for e?cient data management. Despite recent advances in every aspect of data management (storage, access, querying, analysis, mining), future applications are expected to scale to even higher degrees, not only in terms of volumes of data handled but also in terms of users and resources, often making use of multiple, pre-existing autonomous, distributed or heterogeneous resources.
Resumo:
Zernike polynomials are a well known set of functions that find many applications in image or pattern characterization because they allow to construct shape descriptors that are invariant against translations, rotations or scale changes. The concepts behind them can be extended to higher dimension spaces, making them also fit to describe volumetric data. They have been less used than their properties might suggest due to their high computational cost. We present a parallel implementation of 3D Zernike moments analysis, written in C with CUDA extensions, which makes it practical to employ Zernike descriptors in interactive applications, yielding a performance of several frames per second in voxel datasets about 2003 in size. In our contribution, we describe the challenges of implementing 3D Zernike analysis in a general-purpose GPU. These include how to deal with numerical inaccuracies, due to the high precision demands of the algorithm, or how to deal with the high volume of input data so that it does not become a bottleneck for the system.
Resumo:
This paper outlines the problems found in the parallelization of SPH (Smoothed Particle Hydrodynamics) algorithms using Graphics Processing Units. Different results of some parallel GPU implementations in terms of the speed-up and the scalability compared to the CPU sequential codes are shown. The most problematic stage in the GPU-SPH algorithms is the one responsible for locating neighboring particles and building the vectors where this information is stored, since these specific algorithms raise many dificulties for a data-level parallelization. Because of the fact that the neighbor location using linked lists does not show enough data-level parallelism, two new approaches have been pro- posed to minimize bank conflicts in the writing and subsequent reading of the neighbor lists. The first strategy proposes an efficient coordination between CPU-GPU, using GPU algorithms for those stages that allow a straight forward parallelization, and sequential CPU algorithms for those instructions that involve some kind of vector reduction. This coordination provides a relatively orderly reading of the neighbor lists in the interactions stage, achieving a speed-up factor of x47 in this stage. However, since the construction of the neighbor lists is quite expensive, it is achieved an overall speed-up of x41. The second strategy seeks to maximize the use of the GPU in the neighbor's location process by executing a specific vector sorting algorithm that allows some data-level parallelism. Al- though this strategy has succeeded in improving the speed-up on the stage of neighboring location, the global speed-up on the interactions stage falls, due to inefficient reading of the neighbor vectors. Some changes to these strategies are proposed, aimed at maximizing the computational load of the GPU and using the GPU texture-units, in order to reach the maximum speed-up for such codes. Different practical applications have been added to the mentioned GPU codes. First, the classical dam-break problem is studied. Second, the wave impact of the sloshing fluid contained in LNG vessel tanks is also simulated as a practical example of particle methods
Resumo:
Este trabajo tiene la vocación de dibujar el mapa de los dominios de oportunidad que hay a disposición de un arquitecto, al imaginar el aspecto sonoro de la ciudad en relación con la campana. Muchas de las dimensiones señaladas, tanto conocidas como desconocidas, son sencillamente despertadas al estudio de lo que un diseñador del espacio sonoro, como Llorenç Barber, viene a decirnos, desde una disciplina aparentemente contactada, pero muchas veces paralela a la arquitectónica. Tomando los conciertos de campanas celebrados hasta la fecha como puestas en práctica real de la condición instrumental de más de doscientas ciudades de todo el mundo, el estudio analiza los hallazgos, éxitos y fracasos, obtenidos a lo largo de estos últimos veinticinco años de experiencia, como resultados explícitos de un trabajo sonoro en la ciudad, probado, contrastado y afinado, del que extraer indicaciones concretas susceptibles de ser aplicadas en el diseño del espacio urbano. Mediante un análisis triangular de vértices definidos: emisor-campana, medio-ciudad, receptor-ciudadano; la investigación aborda los aspectos relativos a la producción y recepción del fenómeno sonoro generado por la campana en la ciudad. En relación con la producción, una parte del trabajo se dedica al estudio de los efectos acústicos observados, ordenado por escalas graduales en las que se produce una distribución del sonido susceptible de diseño: el vaso de la campana, la sala de campanas, el campanario, el cuerpo del edificio, la ciudad y el territorio. A modo de cajas de resonancia y leídas como muñecas rusas, unas dentro de otras, los espacios identificados muestran cualidades sonoras específicas, definidas tanto por sus condiciones geométricas, formales, constructivas o de uso; como por las correspondientes a las subsiguientes cajas que alojan. A fin de esclarecer la influencia de tales cuestiones en el aspecto sonoro de la ciudad, se propone un modelo ordenado de conexión y desconexión de escalas, utilizando una paramétrica puramente técnica creada ex profeso, junto con variables metodológicas más tradicionales. Al mismo tiempo, y tratando de esclarecer cómo, al ser puesta en vibración, la ciudad es aprehendida, disfrutada y rememorada por el ciudadano-oyente, otra parte del trabajo se dedica al estudio de los aspectos relativos a su recepción aural en deambulación compartida. En este caso la investigación se propone reclamar otras dimensiones más subversivas que, si bien escapan a los modos habituales de trabajar del arquitecto, se revelan intensamente en la experiencia plurifocal, multiplicando los efectos a considerar: efectos funcionales y significativos, de reconocimiento, integración y pertenencia a un cuerpo territorial y social de coordenadas históricas y geográficas de nuevo significadas; efectos perceptuales de inmersión, ubicuidad, temporalidad o inestabilidad; efectos estéticos, de rememoración, interpretación simbólica y recreación poética; e incluso efectos políticos, descubriendo un espacio urbano en continua regeneración, lugar para la exposición en su doble acepción, para la exhibición y el peligro, o como contenedor situacional del más profundo sentido ciudadano. Para afinar la relevancia de lo obtenido en cada una de las dimensiones señaladas, el trabajo se articula en tres aproximaciones graduales: el corpus general de los conciertos celebrados hasta la fecha; los conciertos celebrados en España; los tres conciertos para Madrid: Magna Mater (1991), Festi Clamores (2000) y Aurea Catena (2007). Si bien el modelo propuesto nace a la luz de los conciertos de campanas de Llorenç Barber, a escala de una ciudad entera y con una intención compositiva individual, se entiende que sería útil para el uso ordenado de cualquier profesional interesado en el aspecto sonoro de la ciudad, faceta escasamente atendida, dicho sea de paso, desde la disciplina arquitectónica. ABSTRACT This work has the vocation of drawing out the numerous opportunities an architect has at his disposal, upon imagining the sonorous aspect of the city in relation to the bell. Many of the dimensions indicated, both known and unknown, are just awakened to the study of what a sound space designer, as Llorenç Barber, comes to tell us, from a discipline apparently contacted, but often parallel to the architecture. Taking the bell concerts held so far as actual implementation of the instrumental condition of over two hundred cities around the world, the study analyzes the findings, successes and failures, obtained over the last twenty years of experience, as explicit results of a sound work in the city, tested, verified and refined, from which to extract specific indications that can be applied in the design of urban space. By triangular analyzing of defined vertices: sender-bell, half-city, receptor-citizen; the research addresses issues relating to the production and reception of sound phenomenon generated by the bell in the city. In relation to production, part of the work is devoted to the study of observed acoustic effects, ordered gradual scale which produces a distribution of sound capable of design: the glass of the bell, the bell room, the bell tower and the body of the building, the city and territory. By way of sounding boards and read as if they were Russian dolls, one inside the other, the show spaces identified specific sound qualities, defined both for their geometric, formal, constructive use, such as those for hosting the subsequent boxes. In order to clarify the influence of such issues in the sound aspect of the city, we propose an ordered pattern of connection and disconnection of scales, using a purely parametric technique created on purpose, along with more traditional methodological variables. At the same time, and trying to clarify how, when set in vibration, the city is apprehended, enjoyed and remembered for the citizen-listener, another part of the work is devoted to the study of aspects of aural reception in shared ambulation. In this case the research aims to claim more subversive than other dimensions, but beyond the usual ways in which an architect works, the experience reveals intensely plurifocal multiplying effects to consider: functional effects and significant recognition and integration belonging to a body of territorial and social historical and geographical coordinates of new meaning and perceptual effects of immersion, ubiquity, timeliness or instability; aesthetic effects of recall, interpretation and recreation of symbolic poetic; and even political effects, revealing a continuous urban space regeneration site for the exhibition in its double meaning, for display and danger, or as a citizen sense container. To sharpen the relevance of what was obtained in each of the dimensions mentioned, the work is divided into three incremental approaches: the general corpus of the concerts held so far, the concerts in Spain, the three concerts for Madrid: Magna Mater (1991), Festi Clamores (2000) and Aurea Catena (2007). While the proposed model comes in the light of the bells concert Llorenç Barber, the scale of a whole city and individual compositional intent, it is understood that it would be useful for the orderly use of any professional interested in the sound aspect of the city, an aspect sparsely attended, incidentally, from the architectural discipline.
Resumo:
This article describes a new visual servo control and strategies that are used to carry out dynamic tasks by the Robotenis platform. This platform is basically a parallel robot that is equipped with an acquisition and processing system of visual information, its main feature is that it has a completely open architecture control, and planned in order to design, implement, test and compare control strategies and algorithms (visual and actuated joint controllers). Following sections describe a new visual control strategy specially designed to track and intercept objects in 3D space. The results are compared with a controller shown in previous woks, where the end effector of the robot keeps a constant distance from the tracked object. In this work, the controller is specially designed in order to allow changes in the tracking reference. Changes in the tracking reference can be used to grip an object that is under movement, or as in this case, hitting a hanging Ping-Pong ball. Lyapunov stability is taken into account in the controller design.
Resumo:
The main purpose of robot calibration is the correction of the possible errors in the robot parameters. This paper presents a method for a kinematic calibration of a parallel robot that is equipped with one camera in hand. In order to preserve the mechanical configuration of the robot, the camera is utilized to acquire incremental positions of the end effector from a spherical object that is fixed in the word reference frame. The positions of the end effector are related to incremental positions of resolvers of the motors of the robot, and a kinematic model of the robot is used to find a new group of parameters which minimizes errors in the kinematic equations. Additionally, properties of the spherical object and intrinsic camera parameters are utilized to model the projection of the object in the image and improving spatial measurements. Finally, the robotic system is designed to carry out tracking tasks and the calibration of the robot is validated by means of integrating the errors of the visual controller.
Resumo:
Rms voltage regulation may be an attractive possibility for controlling power inverters. Combined with a Hall Effect sensor for current control, it keeps its parallel operation capability while increasing its noise immunity, which may lead to a reduction of the Total Harmonic Distortion (THD). Besides, as voltage regulation is designed in DC, a simple PI regulator can provide accurate voltage tracking. Nevertheless, this approach does not lack drawbacks. Its narrow voltage bandwidth makes transients last longer and it increases the voltage THD when feeding non-linear loads, such as rectifying stages. On the other hand, the implementation can fall into offset voltage error. Furthermore, the information of the output voltage phase is hidden for the control as well, making the synchronization of a 3-phase setup not trivial. This paper explains the concept, design and implementation of the whole control scheme, in an on board inverter able to run in parallel and within a 3-phase setup. Special attention is paid to solve the problems foreseen at implementation level: a third analog loop accounts for the offset level is added and a digital algorithm guarantees 3-phase voltage synchronization.
Resumo:
This paper presents a theoretical analysis and an optimization method for envelope amplifier. Highly efficient envelope amplifiers based on a switching converter in parallel or series with a linear regulator have been analyzed and optimized. The results of the optimization process have been shown and these two architectures are compared regarding their complexity and efficiency. The optimization method that is proposed is based on the previous knowledge about the transmitted signal type (OFDM, WCDMA...) and it can be applied to any signal type as long as the envelope probability distribution is known. Finally, it is shown that the analyzed architectures have an inherent efficiency limit.
Resumo:
In recent years, applications in domains such as telecommunications, network security or large scale sensor networks showed the limits of the traditional store-then-process paradigm. In this context, Stream Processing Engines emerged as a candidate solution for all these applications demanding for high processing capacity with low processing latency guarantees. With Stream Processing Engines, data streams are not persisted but rather processed on the fly, producing results continuously. Current Stream Processing Engines, either centralized or distributed, do not scale with the input load due to single-node bottlenecks. Moreover, they are based on static configurations that lead to either under or over-provisioning. This Ph.D. thesis discusses StreamCloud, an elastic paralleldistributed stream processing engine that enables for processing of large data stream volumes. Stream- Cloud minimizes the distribution and parallelization overhead introducing novel techniques that split queries into parallel subqueries and allocate them to independent sets of nodes. Moreover, Stream- Cloud elastic and dynamic load balancing protocols enable for effective adjustment of resources depending on the incoming load. Together with the parallelization and elasticity techniques, Stream- Cloud defines a novel fault tolerance protocol that introduces minimal overhead while providing fast recovery. StreamCloud has been fully implemented and evaluated using several real word applications such as fraud detection applications or network analysis applications. The evaluation, conducted using a cluster with more than 300 cores, demonstrates the large scalability, the elasticity and fault tolerance effectiveness of StreamCloud. Resumen En los útimos años, aplicaciones en dominios tales como telecomunicaciones, seguridad de redes y redes de sensores de gran escala se han encontrado con múltiples limitaciones en el paradigma tradicional de bases de datos. En este contexto, los sistemas de procesamiento de flujos de datos han emergido como solución a estas aplicaciones que demandan una alta capacidad de procesamiento con una baja latencia. En los sistemas de procesamiento de flujos de datos, los datos no se persisten y luego se procesan, en su lugar los datos son procesados al vuelo en memoria produciendo resultados de forma continua. Los actuales sistemas de procesamiento de flujos de datos, tanto los centralizados, como los distribuidos, no escalan respecto a la carga de entrada del sistema debido a un cuello de botella producido por la concentración de flujos de datos completos en nodos individuales. Por otra parte, éstos están basados en configuraciones estáticas lo que conducen a un sobre o bajo aprovisionamiento. Esta tesis doctoral presenta StreamCloud, un sistema elástico paralelo-distribuido para el procesamiento de flujos de datos que es capaz de procesar grandes volúmenes de datos. StreamCloud minimiza el coste de distribución y paralelización por medio de una técnica novedosa la cual particiona las queries en subqueries paralelas repartiéndolas en subconjuntos de nodos independientes. Ademas, Stream- Cloud posee protocolos de elasticidad y equilibrado de carga que permiten una optimización de los recursos dependiendo de la carga del sistema. Unidos a los protocolos de paralelización y elasticidad, StreamCloud define un protocolo de tolerancia a fallos que introduce un coste mínimo mientras que proporciona una rápida recuperación. StreamCloud ha sido implementado y evaluado mediante varias aplicaciones del mundo real tales como aplicaciones de detección de fraude o aplicaciones de análisis del tráfico de red. La evaluación ha sido realizada en un cluster con más de 300 núcleos, demostrando la alta escalabilidad y la efectividad tanto de la elasticidad, como de la tolerancia a fallos de StreamCloud.
Resumo:
Abstract is not available.
Resumo:
We present a technique to estimate accurate speedups for parallel logic programs with relative independence from characteristics of a given implementation or underlying parallel hardware. The proposed technique is based on gathering accurate data describing one execution at run-time, which is fed to a simulator. Alternative schedulings are then simulated and estimates computed for the corresponding speedups. A tool implementing the aforementioned techniques is presented, and its predictions are compared to the performance of real systems, showing good correlation.
Resumo:
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to it. This approach is very attractive in that by adding a few primitives any logic programming system can be turned into a generic constraint logic programming system in which constraint solving can be user deñned, and at source level - an extreme example of the "glass box" approach. In this paper we propose a different and novel use for the concept of attributed variables: developing a generic parallel/concurrent (constraint) logic programming system, using the same "glass box" flavor. We argüe that a system which implements attributed variables and a few additional primitives can be easily customized at source level to implement many of the languages and execution models of parallelism and concurrency currently proposed, in both shared memory and distributed systems. We illustrate this through examples and report on an implementation of our ideas.