An Architecture-Independent Graphical Tool for Automatic Contention-Free Process-to-Processor Mapping

摘要

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 softwary 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 0(n~3 + M~4) in the worst case for mapping n tasks onto a graph editing system to produce a graphical cases.