|non-constant-bound Loops email@example.com (1994-12-02)|
|From:||firstname.lastname@example.org (Yeong-Sheng Chen)|
|Keywords:||optimize, question, parallel|
|Organization:||National Taiwan University|
|Date:||Fri, 2 Dec 1994 23:59:18 GMT|
The following is a loop nest. Does anyone know which machines can
efficiently execute it?
DoSequentially 200 I=1, N1
DoAll 100 J=1, f(I)
where f(I) is a function of I.
When max(f(I)) processors are allocated to this program, it can be
executed in maximal speed. However, it is not efficient because some
processors will be idle. So, does any system (compiler, architecture,
OS ...) provides good method to execute this program (Efficiently achieve
Is "dynamically allocate processors to this program" a good way? Which
machine can do it? And, how about the overhead of dynamic allocation?
Eric Y.S. Chen
Return to the
Search the comp.compilers archives again.