Improving the Performance of the Vertex Elimination Algorithm for Derivative Calculation.

Simple item page
dc.contributor.authorTadjouddine, Mohamed-
dc.contributor.authorBodman, Frances-
dc.contributor.authorPryce, John D.-
dc.contributor.authorForth, Shaun A.-
dc.date.accessioned2011-11-21T23:01:25Z
dc.date.available2011-11-21T23:01:25Z
dc.date.issued2006-01-01T00:00:00Z-
dc.description.abstractIn previous work [TOMS, 2004, 30(3), 266--299], we used Markowitz-like heuristics aiming to find elimination sequences that minimise the number of floating-point operations (flops) for vertex elimination Jacobian code. We also used the depth-first traversal algorithm to reorder the statements of the Jacobian code with the aim of reducing the number of memory accesses. In this work, we study the effects of reducing flops or memory accesses within the vertex elimination algorithm for Jacobian calculation. On RISC processors, we observed that for data residing in registers, the number of flops gives a good estimate of the execution time, while for out-of-register data, the execution time is dominated by the time for memory access operations. We also present a statement reordering scheme based on a greedy-list scheduling algorithm using ranking functions. This statement reordering will enable us to trade-off the exploitation of the instruction level parallelism of such processors with the reduction in memory accesses.en_UK
dc.identifier.citationTadjouddine M, Bodman F, Pryce JD, Forth SA. (2006) Improving the performance of the vertex elimination algorithm for derivative calculation. Automatic Differentiation: Applications, Theory, and Implementations, Lecture Notes in Computational Science & Engineering, Volume 50, February 2006, pp. 111-120-
dc.identifier.isbn3-540-28403-6-
dc.identifier.urihttp://dspace.lib.cranfield.ac.uk/handle/1826/3133
dc.identifier.urihttp://dx.doi.org/10.1007/3-540-28438-9_10
dc.subjectvertex eliminationen_UK
dc.subjectJacobian accumulationen_UK
dc.subjectperformance analysisen_UK
dc.subjectstatement reorderingen_UK
dc.subjectgreedy-list scheduling algorithmsen_UK
dc.titleImproving the Performance of the Vertex Elimination Algorithm for Derivative Calculation.en_UK
dc.typeBook chapter

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Improving the Performance of the Vertex Elimination Algorithm for Derivative Calculation-2006.pdf
Size:
389.31 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
18 B
Format:
Plain Text
Description:
Download

Collections

Staff publications (CDS)