252-5251-00L Seminar in Computational Science
Spring semester 2018
Tuesday 15-17, CAB G52
2 ECTS credits
In this students seminar participants read and present a basic paper from the area of Computational Science and Engineering. The topics of the talks are suggested by the professors in the first week of the semester. The students have to choose a paper (talk) right away. The 30 minutes talk is to be prepared in interaction with the responsible professor. It is to be presented to the professor in advance. The talk should be presented such that the fellow students can follow. Participants have to attend all talks.
Program
February 20: | Professors | Start paper assignments |
March 6: | Peter Arbenz | Complete paper assignments |
How to give a talk. | ||
April 10: | Sebastian Leisinger | D. E. Shaw, J.P. Grossman, et al. |
Anton 2: Raising the Bar for Performance and Programmability in a Special-Purpose Molecular Dynamics Supercomputer | ||
Proceedings Supercomputing SC'14, pp. 41-53. | ||
Emmanouil Angelis | S. Di and F. Cappelo: | |
Fast error-bounded lossy HPC data compression with SZ. | ||
Proceedings IPDPS 2016, pp. 730-739. | ||
April 17: | Sibylle Jeker | M. Anderson, G. Ballard, J. Demmel, and K. Keutzer: |
Communication-avoiding QR decomposition for GPUs | ||
Proceedings IPDPS 2011, pp. 48-58. | ||
Christelle Gloor | A. Y. Grama, A. Gupta, and V. Kumar: | |
Isoefficiency: measuring the scalability of parallel algorithms and architectures | ||
IEEE Parallel & Distributed Technology: Systems & Applications 1(3):12-21, 1993. | ||
April 24: | Belkhayat Kamil | J. Wu and J. JaJa: |
High performance FFT based Poisson solver on a CPU-GPU heterogeneous platform. | ||
Proceedings IPDPS 2013, pp. 115-125. | ||
Amir Joudaki | J. Barnes and P. Hut: | |
A hierarchical O(N logN) force-calculation algorithm. | ||
Nature, 324: 446-449, 1986. |
Comments to arbenz@inf.ethz.ch