Increasing parallelizing compiler efficiency using commutative functions

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/146278
Download file(s):
File Description SizeFormat 
146278.pdfFulltext475.68 kBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Increasing parallelizing compiler efficiency using commutative functions
Authors: Lidman, Jacob
Abstract: The need for suitable software abstractions is proportional to the complexity of the underlying computer architecture. Even though language technology has made significant contributions over the years, many hard decisions have been delegated to the compiler. Naturally, compilers are only as efficient as the algorithms they contain. In this thesis we consider an approach to detecting commuting operations that give the same result independent of execution order. Our approached is based on analyzing commutativity of any pair of statements rather than just consecutive function calls. This will allow us to detect opportunities for parallelization that previous conservative approaches would ignore or miss be- cause of context-insensitivity.
Keywords: Datorteknik;Computer Engineering
Issue Date: 2011
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/146278
Collection:Examensarbeten för masterexamen // Master Theses



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