|info sought on parallel mapping (compiler) problems email@example.com (1992-06-24)|
|From:||firstname.lastname@example.org (Chokchai Leangsuksun)|
|Organization:||Math & CS, Kent state University|
|Date:||Wed, 24 Jun 1992 15:21:05 GMT|
|Keywords:||parallel, theory, question|
I am interested in compiler problems, more specifically mapping
problems, on heterogeneous processing systems. So far what I have come
across in some literature in the mapping field are mainly for homogeneous
multiprocessor and in graphical approaches (since the general mapping
problems are NP-complete in strong sense, most I found using heuristic
Here are ideas on the problems extracted from some literature.
1. The problems start from finding a suitable program abstraction
(task graph) which can be derived from users' program. More methods may be
involved such as task clustering, partitioning and etc. These methods
require information on target architectures.
2. Finding near-optimal algorithms for mapping the program
abstraction onto a target machine. Some use architecture abstraction
Any pointers , suggestions and comments (bibliography) on the
topics are greatly appreciative. I'll summarize the result.
Department of Mathematics and Computer Science
Kent State University
Kent Ohio 44242
Return to the
Search the comp.compilers archives again.