209 search results - page 1 / 42 » Using Run-Time Data for Program Comprehension |
IWPC
2003
IEEE
13 years 10 months ago
2003
IEEE
Traditional approaches for program comprehension use static program analysis or dynamic program analysis in the form of execution traces. Our approach, however, makes use of runti...
GPCE
2005
Springer
13 years 10 months ago
2005
Springer
Saving the internal data of an application in an external form is called marshalling. A generic marshaller is difficult to optimize because the format of the data that will be mars...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
ASPLOS
1996
ACM
13 years 8 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...