the proceedings contain 17 papers. the topics discussed include: automatic traffic light preemption for intelligent transportation systems;towards an elastic lock-free Hash Trie design;a novel server-side aggregation ...
ISBN:
(纸本)9781665432818
the proceedings contain 17 papers. the topics discussed include: automatic traffic light preemption for intelligent transportation systems;towards an elastic lock-free Hash Trie design;a novel server-side aggregation strategy for federated learning in non-IID situations;an asynchronous distributed-memory optimization solver for two-stage stochastic programming problems;translation based self-reconfiguration algorithm for 6-lattice modular robots;curator - a system for creating data sets for behavioral malware detection;parallel and distributed task-based Kirchhoff seismic pre-stack depth migration application;periodicity detection algorithm and applications on IoT data;parallel cloud movement forecasting based on a modified boids flocking algorithm;and efficient real-time earliest deadline first based scheduling for Apache spark.
Symbolic computing is one of fastest growing areas of scientific computing. An overview of the state-of-the-art in symbolic computations on distributed architectures, in particular Web and Grid architectures, is prese...
详细信息
ISBN:
(纸本)9780769529172
Symbolic computing is one of fastest growing areas of scientific computing. An overview of the state-of-the-art in symbolic computations on distributed architectures, in particular Web and Grid architectures, is presented. the background information, including typical application areas, is followed by a list of past and on-going projects involving symbolic computations on distributedcomputing environments. To illustrate in more details issues involved in porting computer algebra systems to the Grid, some case studies involving popular environments are presented.
Network coordinates facilitate delay estimation in large-scale networks. In particular they support the creation of Peer-to-Peer-based Desktop Grid overlay structures. Landmark-based approaches to computing such coord...
详细信息
ISBN:
(纸本)9780769529172
Network coordinates facilitate delay estimation in large-scale networks. In particular they support the creation of Peer-to-Peer-based Desktop Grid overlay structures. Landmark-based approaches to computing such coordinates have gained widespread acceptance in recent years. Several of these approaches produce coordinates by solving sequences of nonlinear unconstrained optimization problems. Apparently, Simplex Downhill has been the preferred method for solving such problems in the network coordinates context. In this paper we propose a replacement for this algorithm. Our method works more accurately than Simplex Downhill and refrains from imposing additional requirements on the objective function.
this paper presents a checkpoint and recovery (C&R) protocol to support fault-tolerance for PVM (parallel Virtual Machine). the protocol helps to mask fail-stop failures from an application. the C&R activities...
详细信息
ISBN:
(纸本)9780769529172
this paper presents a checkpoint and recovery (C&R) protocol to support fault-tolerance for PVM (parallel Virtual Machine). the protocol helps to mask fail-stop failures from an application. the C&R activities are transparent and do not require any change in the PVM library nor operating system. In PVM, an application can change the number of processes during execution. this paper focuses on solving problems raised by the dynamic spawn and the asynchronous exit of tasks in PVM. the proposed protocol is a non-blocking one, so it reduces side-effect of checkpoint activities of original programs.
the Caravela platform has been proposed by the authors of this paper to perform distributed stream-based computing on general purpose computation. this platform uses a secured execution unit called flow-model that pre...
详细信息
ISBN:
(纸本)9780769529172
the Caravela platform has been proposed by the authors of this paper to perform distributed stream-based computing on general purpose computation. this platform uses a secured execution unit called flow-model that prevents remote users to touch local information in a computer the flow-model is assigned to local or remote processing units that execute its program. this paper is focused on a new execution mechanism that defines a pipeline composed by flow-models, called meta-pipeline, and is designed as a set of additional functions of the Caravela platform. the pipeline is executed automatically by the meta-pipeline runtime environment. this paper describes the execution mechanism and also presents an application example.
this paper presents a solution for real-time satellite image processing. the focus is on the detection of changes in MODIS images. We present a distributed algorithm for change detection which is based on extracting r...
详细信息
ISBN:
(纸本)9780769529172
this paper presents a solution for real-time satellite image processing. the focus is on the detection of changes in MODIS images. We present a distributed algorithm for change detection which is based on extracting relevant parameters from MODIS spectral bands. the algorithm detects the changes between two images of the same geographical area at different time moments. the algorithm, able to run in a Grid system, is scalable, fault-tolerant. We present the experimental results of this algorithm considering three spectral bands and different input images. We also propose a method to integrate applications based on this algorithm into the MedioGRJID architecture.
We present a new data partitioning strategy for parallelcomputing on three interconnected clusters. this partitioning has two advantages over existing partitionings. First it can reduce communication time due to a lo...
详细信息
ISBN:
(纸本)9780769529172
We present a new data partitioning strategy for parallelcomputing on three interconnected clusters. this partitioning has two advantages over existing partitionings. First it can reduce communication time due to a lower total volume of communication and a more efficient communication schedule. When the network topology is a linear array this partitioning always results in a lower total volume of communication compared to existing partitionings, provided the most powerful node is at the center of the array. When the topology is fully connected this partitioning results in a lower total volume of communication for all but a few power ratios. Second, it allows for the overlapping of communication and computation. these two inherent advantages work together to reduce overall execution time significantly.
A novel approach for extracting coarse-grained parallelism being represented with independent and synchronization-requiring slices is presented. Each slice is composed of dependent iterations of perfectly nested loops...
详细信息
ISBN:
(纸本)9780769529172
A novel approach for extracting coarse-grained parallelism being represented with independent and synchronization-requiring slices is presented. Each slice is composed of dependent iterations of perfectly nested loops. Presented algorithms work for both uniform and non-uniform loops. Our approach, based on operations on relations and sets, requires exact dependence analysis. Examples illustrating the proposed algorithm and results of experiments are presented.
A new class of Java multithreading based parallel approximate inverse preconditioning is introduced, for efficiently solving sparse arrow-type linear systems. the parallel Explicit Preconditioned Biconjugate Conjugate...
详细信息
ISBN:
(纸本)9780769529172
A new class of Java multithreading based parallel approximate inverse preconditioning is introduced, for efficiently solving sparse arrow-type linear systems. the parallel Explicit Preconditioned Biconjugate Conjugate Gradient - STAB method for shared memory systems is presented in order to examine the parallel behavior of this scheme using explicit approximate inverses as the suitable preconditioner. Design and implementation issues of Java's multithreading techniques are also discussed the performance in terms of speedups and parallel efficiencies of the method using Java multithreading, is illustrated by solving sparse arrow-type linear systems. Static and dynamic workload scheduling systems implemented in Java and the results of their use are presented and discussed
Coupled clusters usually exhibit a heterogeneous but also hierarchical structure in terms of communication and computation. therefore, it is inevitable to adapt parallel applications to such systems in order to gain r...
详细信息
ISBN:
(纸本)9780769529172
Coupled clusters usually exhibit a heterogeneous but also hierarchical structure in terms of communication and computation. therefore, it is inevitable to adapt parallel applications to such systems in order to gain reasonable performance results. Moreover, also regular benchmark tools are not capable of exposing the latent potential of such coupled cluster systems. though without adapted (or better self-adapting) benchmark tools for such systems, it is almost not possible to forecast the scalability of well-adapted applications and one is not able to compare the possibly achievable performance in an application independent manner In this paper we present such a fair, self-adapting and meaningful benchmark tool for heterogeneous coupled cluster systems, following the MPI standard.
暂无评论