Communications of the ACM - Special section on computer architecture
Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks
IEEE Transactions on Computers
A Mapping Strategy for Parallel Processing
IEEE Transactions on Computers
Multiprocessor-based placement by simulated annealing
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Efficient algorithm for virtual topology design in multihop lightwave networks
IEEE/ACM Transactions on Networking (TON)
Dynamic Task Allocation Models for Large Distributed Computing Systems
IEEE Transactions on Parallel and Distributed Systems
Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations
IEEE Transactions on Parallel and Distributed Systems
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
Efficient Mapping Algorithms for a Class of Hierarchical Systems
IEEE Transactions on Parallel and Distributed Systems
A Framework for Mapping Periodic Real-Time Applications on Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Min-Cut Methods for Mapping Dataflow Graphs
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Optimal partitioning of nodes to space-sharing parallel tasks
Parallel Computing
Towards virtual networks for virtual machine grid computing
VM'04 Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3
Virtual Net: an efficient simulation for parallel computation
International Journal of Modelling and Simulation
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
A column generation approach to scheduling of periodic tasks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
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)
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 14.98 |
A graph-based solution to the mapping problem using the simulated annealing optimization heuristic is developed. An automated two-phase mapping strategy is formulated: process annealing assigns parallel processes to processing nodes, and connection annealing schedules traffic connections on network data links so that interprocess communication conflicts are minimized. To evaluate the quality of generated mappings. cost functions suitable for simulated annealing that accurately quantify communications overhead are derived. Communication efficiency is formulated to measure the quality of assignments when the optimal mapping is unknown. The mapping scheme is implemented using the hypercube as a host architecture, and results for several image graphs are presented.