parallel algorithms of the hypercube allocation strategies are considered. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities expo...
详细信息
The center problem of a graph is motivated by a number of facility location problems. In this paper, we propose parallel algorithms for finding the center of interval graphs and circular-arc graphs. Our algorithms run...
详细信息
The center problem of a graph is motivated by a number of facility location problems. In this paper, we propose parallel algorithms for finding the center of interval graphs and circular-arc graphs. Our algorithms run in O(log n) time algorithm using O(n/log n) processors while the intervals and arcs are given in sorted order. Our algorithms are on the EREW PRAM model.
Ranking a tree is defined as a mapping rho of the nodes to the set (1, 2,...) such that if there is a path from u to v and rho (u)= rho (v) then there is a node w on the path from u to v such that rho (w)> rho (u)....
详细信息
COUPL+ is a programming environment for applications using unstructured and hybrid grids for numerical simulations. It automates parallelization by handling the partitioning of data and dependent data and maintaining ...
详细信息
COUPL+ is a programming environment for applications using unstructured and hybrid grids for numerical simulations. It automates parallelization by handling the partitioning of data and dependent data and maintaining halo interfaces and copy coherency. We explore some algorithms behind this package. A multi-level partitioning method is described which is effective in the presence of skewed data, solving the multi-set median-finding problem. Partitioning elements over a set of pre-partitioned nodes is explored and a novel method is suggested for reducing communication in the resulting distribution. (C) 2001 Elsevier Science B.V. All rights reserved.
The orthogonal multiprocessor is a partially shared memory architecture. The architecture exhibits attractive characteristics specially with regards to the simplicity of the interconnection network. This architecture ...
详细信息
Analysis of parallel algorithms for graphics processors allows you to determine the bottlenecks of the algorithm that affect its performance on a particular computing system. algorithms can be analyzed both at the AGM...
详细信息
parallel algorithms for high level signal processing functions common to tracking and data fusion are presented and studied. The algorithms are general techniques for clustering, partitioning and ermumeration and are ...
详细信息
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, constructs a tree decomposition or path decomposition of minimum width of G. The algorithm uses O(n) o...
详细信息
We consider the following partition problem: Given a set S of n elements that is organized as k sorted subsets of size n/k each and given a parameter h with 1/k ≤ h ≤ n/k, partition S into g = O(n/(hk)) subsets D1,...
详细信息
Motivated by the significantly higher cost of writing than reading in emerging memory technologies, we consider parallel algorithm design under such asymmetric read-write costs, with the goal of reducing the number of...
详细信息
暂无评论