We design efficient parallel algorithms for solving several problems on interval graphs. The problems include finding a BFS-tree and DFS-tree, articulation points and bridges, and minimum coloring. Each of our algorit...
详细信息
Studies the parallel algorithms in image processing based on the YH supercomputer, and pay attention to the parallel algorithms of image enhancement and edge detection. These algorithms are programmed in VECTAN. The e...
详细信息
The paper classifies the problems solvable very fast in parallel with a feasible number of processors and contrasts them with problems hard to parallelize. The notions of NC1-reducibilities, RNC1-reducibilities, log-s...
详细信息
External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. For certain large scale applications this ...
详细信息
ISBN:
(纸本)9780897918909
External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. For certain large scale applications this is necessarily true. Typically, the cost models proposed for external memory algorithms have measured only the number of I/O operations, and the algorithms have been specially crafted for the EM situation. In the past, several attempts have been made to relate the large body of work based on parallel algorithms to EM, but with limited success. In this paper we provide simulation techniques which produce efficient EM algorithms from efficient algorithms developed under BSP-like parallel computing models. Our techniques can accommodate one or multiple processors on the EM target machine, each with one or more disks, and they also adapt to the disk blocking factor of the target machine. In addition to the main simulation result we obtain a more comprehensive cost model for EM algorithms, which considers the total costs incurred by the algorithm including computation, I/O and communication costs.
We present a class of new parallel algorithms for solving large sparse linear systems with special structure on distributed memory multiprocessor systems such as PC clusters. The objective of these algorithms is to re...
详细信息
In this paper, we describe two related techniques for delivering instructional animations of parallel algorithms - one that runs on a Microsoft Windows workstation and another that is Web-based. After discussing the t...
详细信息
We improve here the expected performance of parallel algorithms for graph coloring. This is achieved through new adaptive techniques that may be useful for the average-case analysis of many graph algorithms. We apply ...
详细信息
The problem of computing the maximum of n inputs on an asynchronous parallel computer is considered. In general, the inputs may arrive staggered in time, the number of processors available to the maximization algorith...
详细信息
The paper presents an approach to the performance analysis of heterogeneous parallel algorithms. As a typical heterogeneous parallel algorithm is just a modification of some homogeneous one, the idea is to compare the...
详细信息
ISBN:
(纸本)3540406735
The paper presents an approach to the performance analysis of heterogeneous parallel algorithms. As a typical heterogeneous parallel algorithm is just a modification of some homogeneous one, the idea is to compare the heterogeneous algorithm with its homogeneous prototype, and to assess the heterogeneous modification rather than to analyse the algorithm as an isolated entity. A criterion of optimality of heterogeneous parallel algorithms is suggested. A parallel algorithm of matrix multiplication on heterogeneous clusters is used to demonstrate the proposed approach.
Until recently, a large majority of theoretical work in parallel algorithms has ignored communication costs and other realities of parallel computing. This paper attempts to address this issue by developing parallel a...
详细信息
暂无评论