An efficient parallel global router using random optimization that is independent of net ordering is *** approaches are described and strategies guaranteeing the routing quality are *** wire length model is implemente...
详细信息
An efficient parallel global router using random optimization that is independent of net ordering is *** approaches are described and strategies guaranteeing the routing quality are *** wire length model is implemented on multiprocessor,which enables the algorithm to approach feasibility of large scale *** driven model on multiprocessor and wire length model on distributed processors are also *** parallel algorithm greatly reduces the run time of *** experimental results show good speedups with no degradation of the routing quality.
An algorithm for the distance transform of a binary image was presented in L. Boxer and R. Miller ( Comput. Vision Image Understand. 80 , 2000, 379–383). The algorithm was stated for the Euclidean metric. In this Cor...
详细信息
An algorithm for the distance transform of a binary image was presented in L. Boxer and R. Miller ( Comput. Vision Image Understand. 80 , 2000, 379–383). The algorithm was stated for the Euclidean metric. In this Corrigendum, we show that the algorithm of Boxer and Miller (2000) is correct for the L 1 “Manhattan” or “city block” metric; however, the algorithm is not correct for the general class of L p metrics, including the Enclidean metric.
A framework based on graph theoretic notations is described for the design and analysis of a wide range of parallel tridiagonal matrix algorithms. It comprises of three basic types of graph transformation operations: ...
详细信息
A framework based on graph theoretic notations is described for the design and analysis of a wide range of parallel tridiagonal matrix algorithms. It comprises of three basic types of graph transformation operations: partition, selection, elimination and update. We use the framework to present a unified description of many known parallel algorithms for the solution of tridiagonal systems. We also discuss the use of this framework to design parallel algorithms. (C) 2001 Elsevier Science B.V. All rights reserved.
The distance transform and the nearest feature transform are useful operations in image processing. These transforms are based on various kinds of distance functions because the distance functions have different effic...
详细信息
The distance transform and the nearest feature transform are useful operations in image processing. These transforms are based on various kinds of distance functions because the distance functions have different efficiency or usefulness. In this paper, we consider these transforms based on the weighted distance, which is a generalization of many distances, such as city block, chessboard and chamfer distances. This paper presents a parallel algorithm for these transforms of an n x n binary image. The algorithm runs in O(log n) time using n(2)/log n processors on the EREW PRAM and in O(log log n) time using n(2)/log log n processors on the common CRCW PRAM. The algorithm also runs in O(n(2)/p(2) + n) time on a p x p mesh and in O(n(2)/p(2) + (n log p)/p) time on a p(2) processor hypercube (for 1 less than or equal to p less than or equal to n). From these complexities, the algorithm is cost optimal on all models. Also we obtained an Omega(log n) lower bound for the transform on the CREW PRAM. This implies that the algorithm is time optimal on the EREW PRAM. (C) 1999 Elsevier Science B.V. All rights reserved.
In this paper an efficient parallel algorithm to solve a three-dimensional problem of subsidence above exploited gas reservoirs is presented. The parallel program is developed on a cluster of workstations. The paralle...
详细信息
In this paper an efficient parallel algorithm to solve a three-dimensional problem of subsidence above exploited gas reservoirs is presented. The parallel program is developed on a cluster of workstations. The parallel virtual machine (PVM) system is used to handle communications among networked workstations. The method has advantages such as numbering of the finite element mesh in an arbitrary manner, simple programming organization, smaller core requirements and computation times. An implementation of this parallel method on workstations is discussed, the speed-up and efficiency of this method being demonstrated by a numerical example. Copyright (C) 1999 John Wiley & Sons, Ltd.
This paper presents the Optimality Principle in distributed and parallel environment. Base on this theory, a distributed and parallel K shortest paths (DP_KSP) algorithm is presented to determine K shortest paths from...
详细信息
ISBN:
(纸本)7506251817
This paper presents the Optimality Principle in distributed and parallel environment. Base on this theory, a distributed and parallel K shortest paths (DP_KSP) algorithm is presented to determine K shortest paths from source node to other nodes in acyclic directed networks. The correctness of this algorithm is proved and a series of computational test problems are performed on PC cluster. Factors such as the network size, network density and value of K which take effects on the performance are discussed in detail. Results of the experiment show that DP_KSP algorithm is efficient in determining K shortest paths especially when the network size, network density and value of K are large.
A new algorithm for the fast cosine transform (FCT) computation is proposed. The usual FCT algorithm features consecutive adding operations which in case of parallel FCT computation result in large timing latency or r...
详细信息
ISBN:
(纸本)078037164X
A new algorithm for the fast cosine transform (FCT) computation is proposed. The usual FCT algorithm features consecutive adding operations which in case of parallel FCT computation result in large timing latency or require significant additional hardware. There is the same number of parallel operations in the new FCT algorithm compared to the amount of consecutive operations in the usual FCT algorithm. This provides for simple implementation of parallel FCT computations without extra timing and hardware expenses.
The structure of an fMRI time series coregistration algorithm can be divided into modules (preprocessing, minimization procedure, interpolation method, cost function), for each of which there are many different approa...
详细信息
ISBN:
(纸本)0819440078
The structure of an fMRI time series coregistration algorithm can be divided into modules (preprocessing, minimization procedure, interpolation method, cost function), for each of which there are many different approaches. In our study we implemented some of the most recent techniques and compared their combinations with regard to both registration accuracy and runtime performance. Bidirectional inconsistency and difference image analysis served as quality measures. The result shows that with an appropriate choice of methods realignment results can be improved by far compared with standard solutions. Finally, an automatic parameter adaptation method was incorporated. Additionally, the algorithm was implemented to run on a distributed 48 processor PC cluster, surpassing the performance of conventional applications running on high end workstations.
A near-optimum parallel algorithm for solving the one-dimensional gate assignment problem is presented in this paper, where the problem is NP-hard and one of the most fundamental layout problems in VLSI design. The pr...
详细信息
A near-optimum parallel algorithm for solving the one-dimensional gate assignment problem is presented in this paper, where the problem is NP-hard and one of the most fundamental layout problems in VLSI design. The proposed system is composed of n x n processing elements based on the artificial two-dimensional maximum neural network for (n + 2)-gate assignment problems. Our algorithm has discovered improved solutions in the benchmark problems compared with the best existing algorithms. The proposed approach is applicable to Other VLSI layout problems such as th PLA (Programmable Logic Array) folding problem. (C) 1999 Scripta Technica, Electr Eng Jpn, 129(2): 71-77, 1999.
A parallel algorithm for the solution of tridiagnol system equation proposed in this paper is an integration of partition method and odd-even reduction method. Both efficiency and speedup of the algorithm is presented...
详细信息
A parallel algorithm for the solution of tridiagnol system equation proposed in this paper is an integration of partition method and odd-even reduction method. Both efficiency and speedup of the algorithm is presented. The algorithm gives better speedups when implemented on larger systems with communication cost of O (log2p). Mapping the equations to processor can optimize the communication cost of the above algorithm on hypercube computers by gray-coding. The dilation of the mapping is, however, two, meaning a message generally travels the distance two between two communicating processors.
暂无评论