This book presents the latest, innovative research findings on P2P, parallel, Grid, Cloud, and Internet computing. It gathers the proceedings of the 12th International Conference on P2P, parallel, Grid, Cloud and Inte...
ISBN:
(纸本)9783319698342
This book presents the latest, innovative research findings on P2P, parallel, Grid, Cloud, and Internet computing. It gathers the proceedings of the 12th International Conference on P2P, parallel, Grid, Cloud and Internet computing, held on November 810, 2017 in Barcelona, Spain. These computing technologies have rapidly established themselves as breakthrough paradigms for solving complex problems by enabling the aggregation and sharing of an increasing variety of distributed computational resources at large scale. Grid computing originated as a paradigm for high-performance computing, offering an alternative to expensive supercomputers through different forms of large-scale distributedcomputing, while P2P computing emerged as a new paradigm after client-server and web-based computing and has shown to be useful in the development of social networking, B2B (Business to Business), B2C (Business to Consumer), B2G (Business to Government), B2E (Business to Employee), and so on. Cloud computing has been defined as a computing paradigm where the boundaries of computing are determined by economic rationale rather than technical limits. Cloud computing has quickly been adopted in a broad range of application domains and provides utility computing at large scale. Lastly, Internet computing is the basis of any large-scale distributedcomputing paradigm; it has very rapidly developed into a flourishing field with an enormous impact on todays information societies, serving as a universal platform comprising a large variety of computing forms such as Grid, P2P, Cloud and Mobile computing. The aim of the book advances on P2P, parallel, Grid, Cloud and Internet computing is to provide the latest findings, methods and development techniques from both theoretical and practical perspectives, and to reveal synergies between these large-scale computing paradigms.
This book presents the latest research findings, as well as innovative theoretical and practical research results, methods and development techniques related to P2P, grid, cloud and Internet computing. It also reveals...
ISBN:
(纸本)9783030026066
This book presents the latest research findings, as well as innovative theoretical and practical research results, methods and development techniques related to P2P, grid, cloud and Internet computing. It also reveals the synergies among such large scale computing paradigms. P2P, Grid, Cloud and Internet computing technologies have rapidly become established as breakthrough paradigms for solving complex problems by enabling aggregation and sharing of an increasing variety of distributed computational resources on a large scale. Grid computing originated as a paradigm for high-performance computing, offering an alternative to expensive supercomputers through different forms of large-scale distributedcomputing. P2P computing emerged as a new paradigm following on from client-server and web-based computing and has proved useful in the development of social networking, B2B (Business to Business), B2C (Business to Consumer), B2G (Business to Government), and B2E (Business to Employee). Cloud computing has been described as a computing paradigm where the boundaries of computing are determined by economic rationale rather than technical limits. Cloud computing has fast become the computing paradigm with applicability and adoption in all domains and providing utility computing at large scale. Lastly, Internet computing is the basis of any large-scale distributedcomputing paradigm; it has very quickly developed into a vast and flourishing field with enormous impact on todays information societies and serving as a universal platform comprising a large variety of computing forms such as grid, P2P, cloud and mobile computing.
Anomaly detection from remote sensing images is to detect pixels whose spectral signatures are different from their background. Anomalies are often man-made targets. With such target signatures being unknown, anomaly ...
详细信息
Anomaly detection from remote sensing images is to detect pixels whose spectral signatures are different from their background. Anomalies are often man-made targets. With such target signatures being unknown, anomaly detection has many important applications, such as water quality monitoring, crop stress surveying, and law enforcement-related uses, where prior information of targets is often unavailable. The key to success is accurate background modeling. Anomaly detection from remote sensing images is challenging because spatial coverage is very large and the background is highly heterogeneous. For pixel-based anomaly detection, computing cost in background modeling and a spatial-convolution-type detection process is very expensive. Thus, parallel and distributedcomputing is critical in reducing execution time, which can fit the need for real-time or near real-time detection from airborne and spaceborne platforms in support of immediate decision-making. This article reviews the recent advances in anomaly detection from hyperspectral remote sensing images and their implementation using parallel and distributed systems. The classical methods, i.e., the Reed-Xiaoli (RX) algorithm and its variants, including its real-time processing version, are illustrated in commodity graphic processing units (GPUs), cloud, and field-programmable gate array (FPGA) implementations. Practical issues and future development trends are also discussed.
A parallel design and implementation of the Self-Organizing Map (SOM) neural computing model is proposed. The parallel design of SOM is implemented in a parallel virtual machine (PVM) environment of a distributed syst...
详细信息
A parallel design and implementation of the Self-Organizing Map (SOM) neural computing model is proposed. The parallel design of SOM is implemented in a parallel virtual machine (PVM) environment of a distributed system. A practical realization of SOM algorithm is investigated, the construction of computing module in parallel virtual machine is discussed, the communication methods and an optimization of messages passing between multiple processes are proposed, and the parallel programming technique and a PVM implementation of SOM neural computing model are given and discussed in detail.
This paper surveys the program dependence analysis technique for parallel and/or distributed programs and its applications from the viewpoint of software engineering. We present primary program dependences which may e...
详细信息
ISBN:
(纸本)0818678763
This paper surveys the program dependence analysis technique for parallel and/or distributed programs and its applications from the viewpoint of software engineering. We present primary program dependences which may exist in a parallel and/or distributed program, a general approach to define, analyze, and represent these program dependences formally, and applications of an explicit program dependence based representation for parallel and/or distributed programs in various software engineering activities. We also suggest some research problems on this direction.
advances in communication for parallel programming have yielded one-sided messaging systems. The MPI bindings for Ruby have been augmented to include the remote memory access functions of MPI-2.
ISBN:
(纸本)0780321754
advances in communication for parallel programming have yielded one-sided messaging systems. The MPI bindings for Ruby have been augmented to include the remote memory access functions of MPI-2.
computing systems are evolving rapidly. At the device level, emerging devices are beginning to compete with traditional CMOS systems. At the architecture level, novel architectures are successfully avoiding the commun...
详细信息
computing systems are evolving rapidly. At the device level, emerging devices are beginning to compete with traditional CMOS systems. At the architecture level, novel architectures are successfully avoiding the communication bottleneck that is a central feature, and a central limitation, of the von Neumann architecture. Furthermore, such systems are increasingly plagued by unreliability. This unreliability arises at device or gate-level in emerging devices, and can percolate up to processor or system-level if left unchecked. The goal of this article is to survey recent advances in reliable computing using unreliable elements, with an eye on nonsilicon and non-von Neumann architectures. We first observe that instead of aiming for generic computing problems, the community could use "dwarfs of modern computing," first noted in the high-performance computing (HPC) community, as a starting point. These computing problems are the basic building blocks of almost all scientific computing, machine learning, and data analytics today. Next, we survey the state of the art in "coded computing," which is an emerging area that advances on classical algorithm-based fault-tolerance (ABFT) and brings a fundamental information-theoretic perspective. By weaving error-correcting codes into a computing algorithm, coded computing provides dramatic improvements on solutions, as well as obtains novel fundamental limits, for problems that have been open for more than 30 years. We introduce existing and novel coded computing techniques in the context of "coded dwarfs," where a specific dwarf's computation is made resilient by applying coding. We discuss how, for the same redundancy, "coded dwarfs" are significantly more resilient compared to classical techniques such as replication. Furthermore, by examining a widely popular computation task-training large neural networks-we demonstrate how coded dwarfs can be applied to address this fundamentally nonlinear problem. Finally, we discuss practi
In this paper a parallel algorithm for solving tridiagonal equations based on recurrence is presented. Compared with the parallel prefix method (PP) [3] which is also based on the recursive method, the computation cos...
详细信息
ISBN:
(纸本)0818678763
In this paper a parallel algorithm for solving tridiagonal equations based on recurrence is presented. Compared with the parallel prefix method (PP) [3] which is also based on the recursive method, the computation cost is reduced by a factor of two while maintaining the same communication cost. The method can be viewed as a modified prefix method or prefix with substructuring. The complexity of the algorithm is analysed using the BSP model(Bulk Synchronous parallel). Experimental results are obtained on a Sun workstation using the Oxford BSP Library.
This paper introduces an algorithm that can generate huge node dataflow by compiling existing programs. The purpose of this algorithm is to improve the speed of parallel processing and utilize the large amount of exis...
详细信息
ISBN:
(纸本)0818678763
This paper introduces an algorithm that can generate huge node dataflow by compiling existing programs. The purpose of this algorithm is to improve the speed of parallel processing and utilize the large amount of existing program resourses. In addition, this idea of huge node data flow algorithm can also be used in distributed processing and multi-thread processing.
An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed environment. The assignment problem is well known to be NP-complete, except in a f...
详细信息
An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed environment. The assignment problem is well known to be NP-complete, except in a few special cases. Thus heuristics are used to obtain suboptimal solutions in reasonable amount of time. While a plethora of such heuristics have been documented in the literature, in this paper we aim to develop techniques for finding optimal solutions under the most relaxed assumptions. We propose a best-first search based parallel algorithm that generates optimal solution for assigning an arbitrary task graph to an arbitrary network of homogeneous or heterogeneous processors. The parallel algorithm running on the Intel Paragon gives optimal assignments for problems of medium to large sizes. We believe our algorithms to be novel in solving an indispensable problem in parallel and distributedcomputing.
暂无评论