Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s 1 ,…, s n } of n points in the Euclidean plane, consider the problem of finding the largest area subrectangle r in R with ...
详细信息
Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s 1 ,…, s n } of n points in the Euclidean plane, consider the problem of finding the largest area subrectangle r in R with sides parallel to the coordinate axes that contains no point of S . We present optimal parallel algorithms for solving this problem on one- and two-dimensional arrays of processors.
In this paper, we study the problem of implementing standard data structures on a hypercube multiprocessor. We present a technique for efficiently executing multiple independant search processes on a class of graphs c...
详细信息
The main problem for the design of dictionary machines on coarse grained hypercube multiprocessors, in comparison to the widely studied dictionary problem for fine grained hypercube multiprocessors, is that due to une...
详细信息
The authors study the parallel implementation of a traditional frame-based knowledge representation system for a general-purpose massively parallel hypercube architecture (such as the Connection Machine). It is shown ...
详细信息
The authors study the parallel implementation of a traditional frame-based knowledge representation system for a general-purpose massively parallel hypercube architecture (such as the Connection Machine). It is shown that, using a widely available parallel system (instead of a special-purpose architecture), it is possible to provide multiple users with efficient shared access to a large-scale knowledge-base. parallel algorithms are presented for answering multiple inference assert, and retract queries on both single and multiple inheritance hierarchies. In addition to theoretical time complexity analysis, empirical results obtained from extensive testing of a prototype implementation are presented.< >
Identification, characterization, and construction of fault patterns that are catastrophic for linear systolic arrays are discussed. It is shown that for a given link configuration in the array, it is possible to iden...
详细信息
Identification, characterization, and construction of fault patterns that are catastrophic for linear systolic arrays are discussed. It is shown that for a given link configuration in the array, it is possible to identify all PE (processing element) catastrophic fault patterns. The requirement on the minimum number of faults in a fault pattern and its spectrum (spread out) for it to be catastrophic is shown to be a function of the length of the longest bypass link available, and not of the total number of bypass links. The paper also gives bounds on the width of a catastrophic fault spectrum.< >
In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to b...
详细信息
In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to be represented in digitized form by a √ n × √ n nibary image. The algorithm is designed for a Mesh-of-Processors architecture with n processors (using the canonical representation of an image on a processor array) and has an execution time of O(√ n ) which is asymptotically optimal.
A systolic screen of size M is a √M × √M mesh-of-processors where each processing element Pij represents the pixel (i,j) of a digitized plane П of √M × √M pixels. In this paper we study the computation ...
详细信息
An efficient branch and bound algorithm for fine-grained hypercube multiprocessors is presented. The method uses a global storage allocation scheme where all processors collectively store all back-up paths such that e...
详细信息
An efficient branch and bound algorithm for fine-grained hypercube multiprocessors is presented. The method uses a global storage allocation scheme where all processors collectively store all back-up paths such that each processor needs to store only a constant amount of information. At each iteration of the algorithm, all nodes of the current back-up tree may decide whether they need to create new children, be pruned, or remain unchanged. An algorithm that, on the basis of these decisions, updates the current back-up tree and distributes global information in O(log m) steps, where m is the current number of nodes, is described. This method also provides a dynamic allocation mechanism that obtains optimal load balancing. Another important property of the method is that, even if very drastic changes in the current back-up tree occur, the performance of the load balancing mechanism remains constant. The method is currently being implemented on the Connection Machine.< >
暂无评论