A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Journal of the ACM (JACM)
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Reducing the Diameters of Computer Networks
IEEE Transactions on Computers
Assignment of job modules onto array processors
IEEE Transactions on Computers
A Mapping Strategy for Parallel Processing
IEEE Transactions on Computers
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Nearest-neighbor mapping of finite element graphs onto processor meshes
IEEE Transactions on Computers
Effects of communication characteristics on task mapping quality on a 2-D mesh with wormhole routing
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Mapping Parallel Programs onto Distributed Computer Systems with Faulty Elements
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Min-Cut Methods for Mapping Dataflow Graphs
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Mapping heterogeneous task graphs onto heterogeneous system graphs
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Optimal task assignment in heterogeneous computing systems
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
A state-of-the-art SIMD two-dimensional FFT array processor
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Clustering and Reassignment-Based Mapping Strategy for Message-Passing Architectures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A Fixed-Structure Learning Automaton Solution to the Stochastic Static Mapping Problem
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19
Performance analysis of dynamic load balancing algorithms with variable number of processors
Journal of Parallel and Distributed Computing
Optimal partitioning of nodes to space-sharing parallel tasks
Parallel Computing
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Mapping with Space Filling Surfaces
IEEE Transactions on Parallel and Distributed Systems
Broadcast filtering-aware task assignment techniques for low-power MPSoCs
MEDEA '07 Proceedings of the 2007 workshop on MEmory performance: DEaling with Applications, systems and architecture
A performance study of multiprocessor task scheduling algorithms
The Journal of Supercomputing
Journal of Systems Architecture: the EUROMICRO Journal
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Dynamic topology aware load balancing algorithms for molecular dynamics applications
Proceedings of the 23rd international conference on Supercomputing
A Case Study of Communication Optimizations on 3D Mesh Interconnects
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
A modified noising algorithm for the graph partitioning problem
Integration, the VLSI Journal
Optimal RFID networks scheduling using genetic algorithm and swarm intelligence
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Solving multiconstraint assignment problems using learning automata
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Paper: Simulating modular neural networks on message-passing multiprocessors
Parallel Computing
Topology-aware task mapping for reducing communication contention on large parallel machines
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
How many threads to spawn during program multithreading?
LCPC'10 Proceedings of the 23rd international conference on Languages and compilers for parallel computing
Generic topology mapping strategies for large-scale parallel architectures
Proceedings of the international conference on Supercomputing
Mapping communication layouts to network hardware characteristics on massive-scale blue gene systems
Computer Science - Research and Development
Modeling and analysis of composite network embeddings
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Load balanced allocation of multiple tasks in a distributed computing system
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A method for estimating the execution time of a parallel task on a grid node
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
A heuristic algorithm for mapping parallel applications on computational grids
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Productive Parallel Linear Algebra Programming with Unstructured Topology Adaption
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Scalable communications for a million-core neural processing architecture
Journal of Parallel and Distributed Computing
The maximum common edge subgraph problem: A polyhedral investigation
Discrete Applied Mathematics
Heuristic static load-balancing algorithm applied to the fragment molecular orbital method
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Mapping applications with collectives over sub-communicators on torus networks
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Topology configuration in hybrid EPS/OCS interconnects
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Inspector/executor load balancing algorithms for block-sparse tensor contractions
Proceedings of the 27th international ACM conference on International conference on supercomputing
Task mapping in rectangular twisted tori
Proceedings of the High Performance Computing Symposium
Predicting application performance using supervised learning on communication features
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Maximum common induced subgraph parameterized by vertex cover
Information Processing Letters
Dynamic thread mapping of shared memory applications by exploiting cache coherence protocols
Journal of Parallel and Distributed Computing
Mapping parallel programs onto multicore computer systems by Hopfield networks
Optical Memory and Neural Networks
| Hi-index | 15.00 |
In array processors it is important to map problem modules onto processors such that modules that communicate with each other lie, as far as possible, on adjacent processors. This mapping problem is formulated in graph theoretic terms and shown to be equivalent, in its most general form, to the graph isomorphism problem. The problem is also very similar to the bandwidth reduction problem for sparse matrices and to the quadratic assignment problem.