Tamás Kozsik

Eötvös Loránd University (Hungary)

Tamás is associate professor at Eötvös Loránd University (Budapest, Hungary), where he is vice dean for academic affairs at the Faculty of Informatics. He teaches programming paradigms and languages (Ada, Eiffel, Erlang, Haskell, Java, Scala) and tries to hide which his favourite language is. During the nights, he does research in refactoring and parallel programming.

Routines implementing divide-and-conquer algorithms are good candi- dates for parallelization. Their identifying property is that such a routine divides its input into “smaller” chunks, calls itself recursively on these smaller chunks, and combines the outputs into one. We set up conditions which characterize a wide range of d&c routine definitions. These conditions can be verified by static program analysis. This way d&c routines can be found automatically in existing program texts, and their parallelization based on semi-automatic refactoring can be facilitated. We work out the details in the context of the Erlang programming language.

Video ←Back