Mapping strategies in message based multiprocessor systems
Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
GraphEd.: an interactive graph editor
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Hypercube embedding heuristics: an evaluation
International Journal of Parallel Programming
A network-topology independent task allocation strategy for parallel computers
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Fast path-disjoint routing in transputer networks
Microprocessing and Microprogramming
The Computer Journal - Special issue on safety and security parallel computation
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Parallel Algorithms and Architectures
Parallel Algorithms and Architectures
A Network Flow Model for Load Balancing in Circuit-Switched Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Algorithms for Drawing Graphs: An Annotated Bibliography
Algorithms for Drawing Graphs: An Annotated Bibliography
| Hi-index | 0.00 |
Mapping of parallel programs onto parallel computers for efficient execution is a fundamental problem of great significance in parallel processing. This paper presents an architecture-independent software tool for contention-free mapping of arbitrary parallel programs onto parallel computers with arbitrary configurations. This mapping tool is based on an efficient heuristic algorithm that runs in time O(n3+m4) in the worst case for mapping n tasks onto m processors, where m ≪ n in most practical cases. It is fully implemented and incorporated into a graph editing system to produce a graphical mapping tool which enables its user to monitor and control the mapping process. The user can assist the mapping process or employ the algorithm to map automatically. Our mapping tool has been tested and its performance evaluated extensively. Experimental results show that our tool combines user intuition and mapping heuristics effectively to make it a powerful mapping tool which is practical to use. Our mapping tool can be easily extended for use in the more general case when the link contention-degree is bounded to a fixed system-specified value without increasing its complexity.