Data can be replicated to improve availability and performance in distributed systems. To ensure one copy serializability, many protocols have been proposed. Most of these protocols are based on the quorum set approac...
详细信息
ISBN:
(纸本)081864222X
Data can be replicated to improve availability and performance in distributed systems. To ensure one copy serializability, many protocols have been proposed. Most of these protocols are based on the quorum set approach. However, some of them are dominated. Hence, these protocols can be further improved. We devise a paradigm for refining protocols for managing replicated data based on theoretical analysis. Examples are presented to illustrate the usefulness of our methodology.
The demand of processing speed in modern digital signal processing is huge and requires more computational power than a single processor can provide. To address these demands, distributed and parallelprocessing in em...
详细信息
ISBN:
(纸本)9780769533483
The demand of processing speed in modern digital signal processing is huge and requires more computational power than a single processor can provide. To address these demands, distributed and parallelprocessing in embedded systems is becoming a requirement. So it is essential to do research on algorithm and the parallel programming in the parallel embedded system. MPI (Message Passing Interface) is one of the most important parallel programming standards. Porting MPI to the embedded system will enhance application portability and make parallel programming much easier. This paper presents a novel design and implementation of MPI based on link DMA for DSP-based systems. Through computation the value of pi and PingPong, the results show that the implementation is suitable for parallel programming, especially suitable for large volume of data.
This paper introduces the APHID (Asynchronous parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on t...
详细信息
This paper introduces the APHID (Asynchronous parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated game-tree and all of the leaves of that tree are searched in parallel. APHID has been programmed as an easy to implement, game-independent αβ library, and has been tested on several game-playing programs. Results for an Othello program are presented here. The algorithm yields good parallel performance on a network of workstations, without using a shared transposition table.
The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distributed over the processors according to t...
详细信息
ISBN:
(纸本)0769523129
The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distributed over the processors according to their performances and data are distributed between processes evenly. The paper presents an algorithm that computes optimal number of the processes and their distribution over processors minimizing the execution time of an application. The processor performance is considered as a function of the number of processes running on the processor and the amount of the data processing by the processor.
Using a large HPC platform, we investigate the effectiveness of "symbiotic space-sharing", a technique that improves system throughput by executing parallel applications in combinations and configurations th...
详细信息
ISBN:
(纸本)1424403073
Using a large HPC platform, we investigate the effectiveness of "symbiotic space-sharing", a technique that improves system throughput by executing parallel applications in combinations and configurations that alleviate pressure on shared resources. We demonstrate that relevant benchmarks commonly suffer a 10-60% penalty in runtime efficiency due to memory resource bottlenecks and up to several orders of magnitudefor I/O. We show that this penalty can be often mitigated, and sometimes virtually eliminated, by symbiotic space-sharing techniques and deploy a prototype scheduler that leverages these findings to improve system throughput by 20%.
This paper describes optimization techniques for translating out-of-core programs written in a data parallel language to message passing node programs with explicit parallel I/O. We demonstrate that straightforward ex...
详细信息
ISBN:
(纸本)0818677937
This paper describes optimization techniques for translating out-of-core programs written in a data parallel language to message passing node programs with explicit parallel I/O. We demonstrate that straightforward extension of in-core compilation techniques does not work well for out-of-core programs. I-ire then describe how the compiler can optimize the code by (I) determining appropriate file layouts for our-of-core arrays, (2) permuting the loops in the nest(s) to allow efficient file access, and (3) partitioning the available node memory among references based on VO cost estimation. Our experimental results indicate that these optimizations can reduce the amount of time spent in I/O by as much as an order of magnitude.
Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quanti...
详细信息
ISBN:
(纸本)0769520693
Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.
In the past couple of years, significant progress has been made in the development of message-passing libraries for parallel and distributed computing, and in the area of high-speed networking. These advances in compu...
详细信息
In the past couple of years, significant progress has been made in the development of message-passing libraries for parallel and distributed computing, and in the area of high-speed networking. These advances in computing technology have also led to a tremendous increase in the amount of data being manipulated and produced by scientific and commercial application programs. Despite their popularity, message-passing libraries only provide part of the support necessary for most high performance distributed computing applications - support for high speed parallel I/O is still lacking. In this paper, we provide an overview of the conceptual design of a parallel and distributed I/O file system, the Virtual parallel File System (VIP-FS), and describe its implementation. VIP-FS makes use of message-passing libraries to provide a parallel and distributed file system which can execute over multi-processor machines or heterogeneous network environments.
This report presents our experiences parallelizing and implementing search problems. We take the sequential A* search and parallelize it by combining with bidirectional search, called parallel Bidirectional A* Search ...
详细信息
ISBN:
(纸本)081864222X
This report presents our experiences parallelizing and implementing search problems. We take the sequential A* search and parallelize it by combining with bidirectional search, called parallel Bidirectional A* Search (PBiA*S). To identify the effectiveness of the PBiA*S, we implement two search problems, the Eight Puzzle and the Tower of Hanoi, on a Symmetry multiprocessor. Execution results demonstrate that the PBiA*S can be an effective parallel search method as it gives two to 12-fold speedup over the unidirectional A* search for the two search problems.
The following topics are dealt with: parallelprocessing of database operations;parallel machines;parallel joins;parallel algorithms;distributed systems;and distributed query processing.
ISBN:
(纸本)0818620528
The following topics are dealt with: parallelprocessing of database operations;parallel machines;parallel joins;parallel algorithms;distributed systems;and distributed query processing.
暂无评论