Seminar Topic WS19/20: Advanced Constructs for Shared-memory Parallel Programming

Seminar Style

The presence of each participant in all seminar presentations is obligatory.

Successful participation consist in

  1. choosing, reading and understanding 1-2 papers from a list,
  2. presenting the papers to the other participants (slides, 30 minutes),
  3. and writing a summary of the papers (10-15 pages).
The number of meetings depends on the number of participants. There will be usually two talks per meeting.

ECTS points: 3.0
Seminar ECTS points will be assigned where the topic presented fits the best:

Key Dates

Registration

Register on TISS until October 16, 2019! (Procedure will be explained during first meeting.)

Topics/Papers

paper/topic advised by:
SH - Sascha Hunold
JLT - Jesper Larsson Träff

Topic Advisor Paper ECTS Comment
1 JLT M. Herlihy and Z. Liu. “Well-Structured Futures and Cache Locality”. In: TOPC 2.4 (2016), 22:1–22:20. doi: 10.1145/2858650 SE, TI, AL, TH  
2 JLT D. Spoonhower, G. E. Blelloch, P. B. Gibbons, and R. Harper. “Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures”. In: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2009, pp. 91–100. doi: 10.1145/1583991.1584019 SE, TI, AL, TH  
3 JLT D. B. Wagner and B. Calder. “Leapfrogging: A Portable Technique for Implementing Efficient Futures”. In: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP). ACM, 1993, pp. 208–217. doi: 10.1145/155332.155354 SE, TI, AL  
4 JLT H. V. Simhadri, G. E. Blelloch, J. T. Fineman, P. B. Gibbons, and A. Kyrola. “Experimental Analysis of Space-Bounded Schedulers”. In: TOPC 3.1 (2016), 8:1–8:27. doi: 10.1145/2938389 SE, TI, AL, TH  
5 JLT W. Suksompong, C. E. Leiserson, and T. B. Schardl. “On the Efficiency of Localized Work Stealing”. In: CoRR abs/1804.04773 (2018) SE, TI, AL, TH  
6 JLT I. A. Lee, C. E. Leiserson, T. B. Schardl, Z. Zhang, and J. Sukha. “On-the-Fly Pipeline Parallelism”. In: TOPC 2.3 (2015), 17:1–17:42. doi: 10.1145/2809808 SE, TI, AL  
7 JLT I. A. Lee, A. Shafi, and C. E. Leiserson. “Memory-mapping support for reducer hyperobjects”. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2012, pp. 287–297. doi: 10.1145/2312005.2312056 SE, TI, AL  
    C. E. Leiserson and T. B. Schardl. “A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)”. In: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2010, pp. 303–314. doi: 10.1145/1810479.1810534    
    M. Frigo, P. Halpern, C. E. Leiserson, and S. Lewin-Berlin. “Reducers and other Cilk++ hyperobjects”. In: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2009, pp. 79–90. doi: 10.1145/1583991.1584017    
    M. Wimmer. “Wait-free Hyperobjects for Task-Parallel Programming Systems”. In: Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing (IPDPS). IEEE Computer Society, 2013, pp. 803–812. doi: 10.1109/IPDPS.2013.10    
8 JLT G. E. Blelloch, J. T. Fineman, P. B. Gibbons, and J. Shun. “Internally deterministic parallel algorithms can be fast”. In: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP). ACM, 2012, pp. 181–192. doi: 10.1145/2145816.2145840 SE, TI, AL  
9 SH E. Ayguadé, N. Copty, A. Duran, J. Hoeflinger, Y. Lin, F. Massaioli, X. Teruel, P. Unnikrishnan, and G. Zhang. “The Design of OpenMP Tasks”. In: IEEE Trans. Parallel Distrib. Syst. 20.3 (2009), pp. 404–418. doi: 10.1109/TPDS.2008.105 SE, TI, AL  
    J. LaGrone, A. Aribuki, C. Addison, and B. M. Chapman. “A Runtime Implementation of OpenMP Tasks”. In: Proceedings of the 7th International Workshop on OpenMP (IWOMP). vol. 6665. LNCS. Springer, 2011, pp. 165–178. doi: 10.1007/978-3-642-21487-5\13    
10 SH U. A. Acar, A. Charguéraud, and M. Rainey. “Scheduling parallel programs by work stealing with private deques”. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). ACM, 2013, pp. 219–228. doi: 10.1145/2442516.2442538 SE, TI, AL  
11 SH Y. Guo, J. Zhao, V. Cavé, and V. Sarkar. “SLAW: A scalable locality-aware adaptive work-stealing scheduler”. In: Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing (IPDPS). IEEE, 2010, pp. 1–12. doi: 10.1109/IPDPS.2010.5470425 SE, TI, AL  
12 SH Q. Chen, M. Guo, and H. Guan. “LAWS: locality-aware work-stealing for multi-socket multi-core architectures”. In: Proceedings of the International Conference on Supercomputing (ICS). ACM, 2014, pp. 3–12. doi: 10.1145/2597652.2597665 SE, TI, AL  
13 SH J. Lifflander, S. Krishnamoorthy, and L. V. Kalé. “Optimizing Data Locality for Fork/Join Programs Using Constrained Work Stealing”. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE Computer Society, 2014, pp. 857–868. doi: 10.1109/SC.2014.75 SE, TI, AL  

Dates

Contact

If you have further questions about the seminar, please contact Assistant Prof. Dr. Sascha Hunold.