Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications of SPCL

T. Hoefler, G. Kwasniewski:

 Automatic Complexity Analysis of Explicitly Parallel Programs

(. Vol , Nr. , In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14), presented in Prague, Czech Republic, pages , ACM, ISSN: , ISBN: , Jun. 2014, )


The doubling of cores every two years requires programmers to expose maximum parallelism. Applications that are developed on today’s machines will often be required to run on many more cores. Thus, it is necessary to understand how much parallelism codes can expose. The work and depth model provides a convenient mental framework to assess the required work and the maximum parallelism of algorithms and their parallel efficiency. We propose an automatic analysis to extract work and depth from a source-code. We do this by statically counting the number of loop iterations depending on the set of input parameters. The resulting ex- pression can be used to assess work and depth with regards to the program inputs. Our method supports the large class of practically relevant loops with affine update functions and generates additional parameters for other expressions. We demonstrate how this method can be used to determine work and depth of several real-world applications. Our technique enables us to prove if the theoretically maximum parallelism is exposed in a practical implementation of a problem. This will be most important for future-proof software development.


download article:


  author={T. Hoefler and G. Kwasniewski},
  title={{Automatic Complexity Analysis of Explicitly Parallel Programs}},
  booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14)},
  location={Prague, Czech Republic},