Mapping DNA by stochastic relaxation
Advances in Applied Mathematics
Computer
The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
Journal of Combinatorial Theory Series A
On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing
Optional linear arrangement of circuit components
Advances in VLSI and Computer Systems
ACM Transactions on Mathematical Software (TOMS)
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Bounded contractions of full trees
Journal of Parallel and Distributed Computing
Mapping techniques and performance analysis for an interconnection cached multiprocessor network
Mapping techniques and performance analysis for an interconnection cached multiprocessor network
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Hi-index | 0.01 |
The communication needs of many parallel applications exhibit what we call switching locality. In such applications, each computation entity (process, thread, etc.) tends to restrict its communication to a small set of other entities. The physical location or proximity of these entities can be arbitrary, as long as the communication degree is small. The Interconnection Cached Network (ICN) is a reconfigurable network ideally suited for exploiting such locality. The use of fast small crossbar switches (Interconnection Caches) with a larger, but slower, reconfigurable network (optimized for connectivity) lets the ICN adapt to the communication requirements of individual applications, potentially achieving higher performance. Embedding communication patterns efficiently in an ICN, requires finding a bounded$\ell$-contraction of the underlying communication graph.The problem of identifying whether a graph has a bounded $\ell$-contraction for a given integer $\ell$ is known to be NP-complete for $\ell 2$. We describe a heuristic algorithm based on simulated annealing for this problem. We test the effectiveness of our approach by using it to embed graphs, representing regular communication patterns, for which the best solutions are deterministically known. The algorithm does not rely on any structural information of the communication pattern and is therefore applicable to irregular patterns as well. The results of applying our heuristics to embed such irregular graphs are also presented. These embeddings in the ICN allow low latency communication paths to be established between the computation entities of parallel applications.