the paper presents the results of a statistical analysis by which the blocking behavior is investigated of interconnection structures that are major candidates for large distributed memory systems. the analysis answer...
详细信息
Synthesis methods for high-performance generalized bitvoting and word-voting networks are described and the resultant designs are evaluated with respect to speed and cost. Both ordinary and generalized m-out-of-n voti...
this paper presents an analysis that leads to the complete characterization of the node disjoint (parallel) paths in a star graph. It is shown that by exploiting the cycle structure of permutations (same as the conjug...
In this paper, we present a complete characterization of the shortest paths and node disjoint (parallel) paths between any two nodes in an interesting class of graphs called orthogonal graphs with minimum non-disjoint...
详细信息
this paper presents empirical performance of parallel algorithms for computing a spanning tree (SPT) and a minimum spanning tree (MST) of connected graphs on the Transputer and Unix systems, where processors are confi...
详细信息
this paper addresses the problem of creating software tools for visualizing the dynamic behavior of parallel applications and systems. PARADISE (parallel Animated Debugging and Simulation Environment) approaches this ...
详细信息
作者：
Kim, KichulRaghavendra, C.S.SAL-300
Department of Electrical Engineering-Systems University of Southern California Los AngelesCA90089-0781 United States
In this paper, we present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Our algorithm is based on balanced matrices and do not require any backtracking. this property ...
In this paper, we improve the performance of the original Iterative Aggregation/Disaggregation Gradient Projection (IAD-GP) algorithm based on the idea of A/D only. the A/D concept naturally fits the hierarchical stru...
详细信息
the split and merge model is a reasonable method for architecture-independent programming of global image processing operations on parallel architectures. We consider image connected components from the point of view ...
详细信息
Two sequences of items sorted in increasing order are given: a sequence A of size n and a sequence 8 of size m. It is required to determine, for every item of A, the smallest item of B (if one exists) that is larger t...
详细信息
暂无评论