Please use this identifier to cite or link to this item: http://theses.ncl.ac.uk/jspui/handle/10443/2162
Title: On the synthesis of integral and dynamic recurrences
Authors: Rapanotti, Lucia
Issue Date: 1996
Publisher: Newcastle University
Abstract: Synthesis techniques for regular arrays provide a disciplined and well-founded approach to the design of classes of parallel algorithms. The design process is guided by a methodology which is based upon a formal notation and transformations. The mathematical model underlying synthesis techniques is that of affine Euclidean geometry with embedded lattice spaces. Because of this model, computationally powerful methods are provided as an effective way of engineering regular arrays. However, at present the applicability of such methods is limited to so-called affine problems. The work presented in this thesis aims at widening the applicability of standard synthesis methods to more general classes of problems. The major contributions of this thesis are the characterisation of classes of integral and dynamic problems, and the provision of techniques for their systematic treatment within the framework of established synthesis methods. The basic idea is the transformation of the initial algorithm specification into a specification with data dependencies of increased regularity, so that corresponding regular arrays can be obtained by a direct application of the standard mapping techniques. We will complement the formal development of the techniques with the illustration of a number of case studies from the literature.
Description: PhD Thesis
URI: http://hdl.handle.net/10443/2162
Appears in Collections:School of Computing Science

Files in This Item:
File Description SizeFormat 
Rapanotti, L. 1996.pdfthesis8.51 MBAdobe PDFView/Open
dspacelicence.pdfLicence43.82 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.