Tag Archives: Tamás Kozsik

  • Free the Conqueror! (Refactoring divide-and-conquer functions) – Tamás Kozsik (Lambda Days 2017) – YouTube
    2017-03-20 youtube.com

    Videos



    http://www.lambdadays.org/lambdadays2017/tamas-kozsik   Functions implementing divide-and-conquer algorithms are good candidates for parallelization. Their identifying property is that such a function divides its input into “smaller” chunks, calls itself recursively on these smaller chunks, and combines the outputs into one. Last year I gave a talk on how such functions can be identified by static source code analysis. This year I explain how divide-and-conquer functions can be tr ...


    Read more


  • Tamas Kozsik – Static analysis to identify divide-and-conquer algorithms (Lambda Days 2016)
    2016-04-26 Erlang Central

    Videos



    Slides and more info: http://www.lambdadays.org/lambdadays2016/tamas-kozsik 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. ...


    Read more


  • Melinda Toth, Tamás Kozsik – Discovering Parallel Pattern Candidates – Erlang User Conference 2015
    2015-08-19 Erlang Central

    Videos



    Slides and more info: http://www.erlang-factory.com/euc2015/melinda-toth The ParaPhrase Refactoring Tool for Erlang (PaRTE) provides automatic, comprehensive and reliable pattern candidate discovery to locate parallelisable components in Erlang programs. It uses semi-automatic and semantics-preserving program transformations to reshape source code and to introduce high level parallel patterns that can be mapped adaptively to the available hardware resources. This talk introduces the main PaRT ...


    Read more


  • Lambda Days 2015 – Tamás Kozsik – Static analysis to identify divide-and-conquer algorithms
    2015-05-13 Erlang Central

    Videos



    Divide-and-conquer algorithms are good candidates for parallelization. Their identifying property is that a d&c 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 parallelizatio ...


    Read more


  • EUC 2014 – Tamás Kozsik – Where Shall I Parallelize?
    2014-08-07 Erlang Central

    Videos



    Due to the traditional, sequential view of program execution that many programmers have, code is often written in a style that hinders effective parallelization. This is an obstacle for deploying existing software or components on the multi- and manycore hardware of the near future. By restructuring the code it might be possible to eliminate unnecessary dependencies in the control flow, and thus make the code eligible for parallelization. If we replace certain sequentially designed constructs wi ...


    Read more