the proceedings contain 47 papers. the topics discussed include: Fault-Tolerant Meshes with Small Degree;the verification of cache coherence protocols;fault diagnosis in a small constant number of parallel testing rou...
ISBN:
(纸本)0897915992
the proceedings contain 47 papers. the topics discussed include: Fault-Tolerant Meshes with Small Degree;the verification of cache coherence protocols;fault diagnosis in a small constant number of parallel testing rounds;tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults;on Gazit and Miller�s parallel algorithm for planar separators: achieving greater efficiency through random sampling;parallel and output sensitive algorithms for combinatorial and linear algebra problems;efficient parallel shortest-paths in digraphs with a separator decomposition;components for computing and communications;highly efficient dictionary matching in parallel;optimal parallel two dimensional pattern matching;and parallel construction and query of suffix trees for two-dimensional matrices.
We introduce Autonomous SIMD (ASIMD) massively parallel architecture, then look at the flexibility, cost, and effectiveness of MIMD and ASIMD parallel systems. We show that ASIMD systems such as the MasPar MP-1 and MP...
详细信息
this paper discusses a parallel implementation of the e-relaxation algorithm for the min-cost flow problem on the CM-5. there is considerable loss in efficiency in going from one processor sequential implementation to...
详细信息
this paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntax-directed analysis and translation. In particular, we address the problem of how to exploit parallelism du...
详细信息
Chips (or chip sets) which include one or more CPUs, some local memory, and rudimentary communications and routing hardware are becoming common (eg. transputers, SRCs HNet, the nodes of most MIMD machines). these chip...
详细信息
the primary purpose of Cray Research computer systems is the timely solution of complex problems in science and engineering. A few examples illustrate that the CRAY C90 is currently the world's most powerful tool ...
详细信息
We present a parallel algorithm for two dimensional matching. this algorithm is optimal in two ways. First, the total number of operations on the text is linear. Second, the algorithm takes time O(logm) on a CREW PRAM...
详细信息
We describe an efficient parallel algorithm to solve the single function coarsest partition problem. the algorithm runs in O(logn) time using 0(n log log n) operations on the Arbitrary CRCW PRAM. the previous best kno...
详细信息
We give tight bounds on the parallel complexity of some problems involving random graphs. Specifically, we show that a Hamiltonian cycle, a breadth first spanning tree, and a maximal matching can all be constructed in...
详细信息
暂无评论