Increasing parallelizing compiler efficiency using commutative functions

dc.contributor.author	Lidman, Jacob
dc.contributor.department	Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)	sv
dc.contributor.department	Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)	en
dc.date.accessioned	2019-07-03T12:39:32Z
dc.date.available	2019-07-03T12:39:32Z
dc.date.issued	2011
dc.description.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.
dc.identifier.uri	https://hdl.handle.net/20.500.12380/146278
dc.language.iso	eng
dc.setspec.uppsok	Technology
dc.subject	Datorteknik
dc.subject	Computer Engineering
dc.title	Increasing parallelizing compiler efficiency using commutative functions
dc.type.degree	Examensarbete för masterexamen	sv
dc.type.degree	Master Thesis	en
dc.type.uppsok	H

Visar 1 - 1 av 1