With the increasing importance of multiple multiplaform remote sensing missions, fast and automatic integration of digital data from disparate sources has become critical to the success of these endeavors. Firstly, an...
详细信息
ISBN:
(纸本)0769523803
With the increasing importance of multiple multiplaform remote sensing missions, fast and automatic integration of digital data from disparate sources has become critical to the success of these endeavors. Firstly, an overview of development of automatic and parallel global image registration is given. And then, based on the analyses of existing three parallelmethods of wavelet-based global registration, a new parallel strategy is proposed. Moreover, towards the quantitative evaluation, first results of the intercomparision of four parallel global registration algorithms are presented in theory and in experiments.
Architectural imperatives due to the slowing it Moore's Law, the broad acceptance of relaxed semantics and the O(nl) worst case verification complexity of generating sequential histories motivate a new approach to...
详细信息
ISBN:
(纸本)9781665414555
Architectural imperatives due to the slowing it Moore's Law, the broad acceptance of relaxed semantics and the O(nl) worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness. Desiderata for a new correctness condition are that it he independent of sequential histories, compositional, flexible as to timing, modular as to semantics and free of inherent locking or waiting. We propose Quantifiability, a novel correctness condition that models a system in vector space to launch a new mathematical analysis of concurrency. The vector space model is suitable for a wide range of concurrent systems and their associated data structures. This paper formally defines quantifiability and demonstrates that quantifiability is compositional and non-blocking. Analysis is facilitated with linear algebra, better supported and of much more efficient time complexity than traditional combinatorial methods.
Photo-Acoustic Tomography (PAT) combines ultrasound resolution and penetration with endogenous optical contrast of tissue. Real-time PAT imaging is limited by the number of parallel data acquisition channels and pulse...
详细信息
ISBN:
(纸本)9781479983391
Photo-Acoustic Tomography (PAT) combines ultrasound resolution and penetration with endogenous optical contrast of tissue. Real-time PAT imaging is limited by the number of parallel data acquisition channels and pulse repetition rate of the laser. Typical photoacoustic signals afford sparse representation. Additionally, PAT transducer configurations exhibit significant intra-and inter-signal correlation. In this work, we formulate photoacoustic signal recovery in the distributed Compressed Sensing (DCS) framework to exploit this correlation. Reconstruction using the proposed method achieves better image quality than compressed sensing with significantly fewer samples. Through our results, we demonstrate that DCS has the potential to achieve real-time PAT imaging.
Sparse triangular linear systems are ubiquitous in a wide range of science and engineering fields, and represent one of the most important building blocks of Sparse Numerical Lineal Algebra methods. For this reason, t...
详细信息
ISBN:
(纸本)9781538649756
Sparse triangular linear systems are ubiquitous in a wide range of science and engineering fields, and represent one of the most important building blocks of Sparse Numerical Lineal Algebra methods. For this reason, their parallel solution has been subject of exhaustive study, and efficient implementations of this kernel can be found for almost every hardware platform. However, the strong data dependencies that serialize a great deal of the execution and the load imbalance inherent to the triangular structure poses serious difficulties for its parallel performance, specially in the context of massively-parallel processors such as GPUs. To this day, the most widespread GPU implementation of this kernel is the one distributed in NVIDIA CUSPARSE library, which relies on a preprocessing stage to determine the parallel execution schedule. Although the solution phase is highly efficient, this strategy pays the cost of constant synchronizations with the CPU. In this work, we present a synchronization-free GPU algorithm to solve sparse triangular linear systems for the CSR format. The experimental evaluation shows performance improvements over CUSPARSE and a recently proposed synchronization-free method for the CSC matrix format.
Integrating parallel functions into the manipulation for persistent objects on a network-based shared memory architecture is a proposal currently under consideration. The cost associated with manipulating a large amou...
详细信息
ISBN:
(纸本)0818675799
Integrating parallel functions into the manipulation for persistent objects on a network-based shared memory architecture is a proposal currently under consideration. The cost associated with manipulating a large amount of distributed persistent objects is expected to improve from sequence to parallelprocessing. However, it is a complex task to combine persistence with the capability of parallel and distributedprocessing. This paper puts forth the design and implementation methods concerning this. Based on a C++-based language called INADA, in which functions for handling persistent objects are introduced, we present a language construct for accessing distributed persistent objects in parallel, and a new approach for supporting a transparent parallel and distributedprocessing. The transparency assures that distributed persistent objects are manipulated in parallel on multiple threads of remote computers as if they were manipulated in a local multiprocessor machine. A key point of this proposal is that we have made a combination of persistence, multithread primitives, network-based shared-memory, and agent-oriented paradigm.
This paper presents the design, development, and implementation of Kulla, a virtual container-centric construction model that mixes loosely coupled structures with a parallel programming model for building infrastruct...
详细信息
This paper presents the design, development, and implementation of Kulla, a virtual container-centric construction model that mixes loosely coupled structures with a parallel programming model for building infrastructure-agnostic distributed and parallel applications. In Kulla, applications, dependencies and environment settings, are mapped with construction units called Kulla-Blocks. A parallel programming model enables developers to couple those interoperable structures for creating constructive structures named Kulla-Bricks. In these structures, continuous dataflow and parallel patterns can be created without modifying the code of applications. methods such as Divide&Containerize (data parallelism), Pipe&Blocks (streaming), and Manager/Block (task parallelism) were developed to create Kulla-Bricks. Recursive combinations of Kulla instances can be grouped in deployment structures called Kulla-Boxes, which are encapsulated into VCs to create infrastructure-agnostic parallel and/or distributed applications. Deployment strategies were created for Kulla-Boxes to improve the IT resource profitability. To show the feasibility and flexibility of this model, solutions combining real-world applications were implemented by using Kulla instances to compose parallel and/or distributed system deployed on different IT infrastructures. An experimental evaluation based on use cases solving satellite and medical imageprocessing problems revealed the efficiency of Kulla model in comparison with some traditional state-of-the-art solutions. (C) 2020 Published by Elsevier Inc.
GroupBy-Join queries in SQL are queries involving the group by clause joining several tables. In this paper, we describe three parallelization techniques for GroupBhy-Join queries, particularly the queries where the g...
详细信息
ISBN:
(纸本)0769524664
GroupBy-Join queries in SQL are queries involving the group by clause joining several tables. In this paper, we describe three parallelization techniques for GroupBhy-Join queries, particularly the queries where the group-by clause can be performed before the join operation. We subsequently call this query "GroupBy-Before-Join" queries. Performance evaluation of the three parallelprocessingmethods is also carried out.
Based on the requirements of large-scale and high-resolution remote sensing image data processing, this paper proposes a distributedparallelprocessing model based on sea and land segmentation tasks. Based on the tra...
详细信息
ISBN:
(数字)9781510650435
ISBN:
(纸本)9781510650435;9781510650428
Based on the requirements of large-scale and high-resolution remote sensing image data processing, this paper proposes a distributedparallelprocessing model based on sea and land segmentation tasks. Based on the trained DeepUnet model, the mpi4py function library is used for parallel algorithm design to realize multi-process synchronization processing. Increase the number of processors and reduce the processing time of large-scale and high-resolution remote sensing image data. The experimental results show that on the basis of ensuring the detection accuracy, the parallel sea- land segmentation technology can significantly shorten the imageprocessing time compared with the traditional serial sea-land segmentation technology, and has strong scalability.
This paper presents a method to translate a given synchronous system to a multithreaded system where process nodes communicate via channels with each other. It is well-known that the reduction of communication has bee...
详细信息
ISBN:
(纸本)9781479927289
This paper presents a method to translate a given synchronous system to a multithreaded system where process nodes communicate via channels with each other. It is well-known that the reduction of communication has been identified to be a crucial key for efficient utilization of multiprocessor systems. For this reason, we first use synchronous elastic design methods to generate a distributed/multithreaded system from a synchronous system, and then, reduce communication overhead between the obtained process nodes. Our benchmarks show that we can save up to 67.5% of communication costs using our method and can achieve an average speed-up of up to 1.09.
The task management is a critical component for the computational grids. The aim is to assign tasks on nodes according to a global scheduling policy and a view of local resources of nodes. A peer-to-peer approach for ...
详细信息
ISBN:
(纸本)9780769535449
The task management is a critical component for the computational grids. The aim is to assign tasks on nodes according to a global scheduling policy and a view of local resources of nodes. A peer-to-peer approach for the task management involves a better scalability for the grid and a higher fault tolerance. But some mechanisms have to be proposed to avoid the computation of replicated tasks that can reduce the efficiency and increase the load of nodes. In the same way, these mechanisms have to limit the number of exchanged messages to avoid the overload of the network. In [1], we have proposed two methods for the task management called active and passive. These methods are based on a random walk: they are fully distributed and fault tolerant. Each node owns a local tasks states set updated thanks to a random walk and each node is in charge of the local assignment. Here, we propose three methods to improve the efficiency of the active method. These new methods are based on a circulating word. The nodes local tasks states sets are updated thanks to periodical diffusions along trees built from the circulating word. Particularly, we show that these methods increase the efficiency of the active method: they produce less replicated tasks. These three methods are also fully distributed and fault tolerant. On the other way, the circulating word can be exploited for other applications like the resources management or the nodes synchronization.
暂无评论