partial evaluation anyone?

partial evaluation anyone?

[Thorsten Ohl]

[ Sorry, no french version .... ]

Continuing the thread on optimizations for numerical code:

Is it possible to find out (at run-time) whether some components of a
function's return value are discarded by the caller?

Example (pseudo code, in real life this is an interface to LAPACK):

  let diagonalize matrix =
    (* Compute real and imaginary parts of the eigenvalues and
       the left and right eigenvectors of MATRIX.  *)
    (wr,wi,vl,vr)

Sometimes, one wants the eigenvalues only

  let (wr,wi,_,_) = diagonalize some_really_big_matrix

but since diagonalize doesn't know that the eigenvectors will be
thrown away, it will calculate them anyway, which can be substantial
overhead for large matrices.

One way out would be to clutter the namespace with many different
functions, one for each (likely) combination of return values, or to
pass this information as a seperate argument (like LAPACK does in
Fortran).

IMHO, both approaches are ugly kludges and it would be much nicer, if
a function could find out which parts of its return value are being
thrown away instantly.  (Note that I'm not asking for a complete
dependency analysis.  One level of function invocation would be
sufficient to allow the programmers to give the proper hints.)

Is there a trick to do this now?  Or is there a chance to get the
implementors interestet?

Cheers,
-Thorsten

Thorsten Ohl, Physics Department, TH Darmstadt --- PGP: AF 38 FF CE 03 8A 2E A7
http://crunch.ikp.physik.th-darmstadt.de/~ohl/ -------- 8F 2A C1 86 8C 06 32 6B

Re: partial evaluation anyone?

[Wolfgang Lux]

Thorsten Ohl wrote:
> [ Sorry, no french version .... ]
> 
> Continuing the thread on optimizations for numerical code:
> 
> Is it possible to find out (at run-time) whether some components of a
> function's return value are discarded by the caller?
> 
> Example (pseudo code, in real life this is an interface to LAPACK):
> 
>   let diagonalize matrix =
>     (* Compute real and imaginary parts of the eigenvalues and
>        the left and right eigenvectors of MATRIX.  *)
>     (wr,wi,vl,vr)
> 
> Sometimes, one wants the eigenvalues only
> 
>   let (wr,wi,_,_) = diagonalize some_really_big_matrix
> 
> but since diagonalize doesn't know that the eigenvectors will be
> thrown away, it will calculate them anyway, which can be substantial
> overhead for large matrices.

Hmmm, it's probably time for you to switch to Haskell. Due to its lazy
evaluation semantics it won't evaluate any arguments the caller
discards. And it even has the advantage, that you do not have to check
any runtime information in the function body yourself.

> One way out would be to clutter the namespace with many different
> functions, one for each (likely) combination of return values, or to
> pass this information as a seperate argument (like LAPACK does in
> Fortran).
> 
> IMHO, both approaches are ugly kludges and it would be much nicer, if
> a function could find out which parts of its return value are being
> thrown away instantly.  (Note that I'm not asking for a complete
> dependency analysis.  One level of function invocation would be
> sufficient to allow the programmers to give the proper hints.)

IMHO, this is no better kludge than the other two you
mentioned. Actually having a (perfomance) optimized version of a
function (i.e., the one which does not compute the eigenvectors at
all) under a different name seems cleaner to me (at least in a
language with strict semantics).

> Is there a trick to do this now?  Or is there a chance to get the
> implementors interestet?

Cheers
Wolfgang

----
Wolfgang Lux
WZH Heidelberg, IBM Germany             Internet: lux@heidelbg.ibm.com
+49-6221-59-4546                        VNET:     LUX at HEIDELBG
+49-6221-59-3500 (fax)	                EARN:     LUX at DHDIBMIP