Alexander Heinecke, M.Sc: Difference between revisions
No edit summary |
No edit summary |
||
| Line 20: | Line 20: | ||
=== Publications === | === Publications === | ||
'''Volumne 2010''' | |||
'''Porting existing cache-oblivious Linear Algebra HPC Modules to Larrabee Architecture'''; Alexander Heinecke, Carsten Trinitis and Josef Weidendorfer; In Proceedings of the 2010 ACM/IBM Research Computing Frontiers Conference. p.91-92, May 2010. | '''Porting existing cache-oblivious Linear Algebra HPC Modules to Larrabee Architecture'''; Alexander Heinecke, Carsten Trinitis and Josef Weidendorfer; In Proceedings of the 2010 ACM/IBM Research Computing Frontiers Conference. p.91-92, May 2010. | ||
| Line 25: | Line 27: | ||
'''Realisierung einer Randbehandlung für adaptive Dünngittermethode mit Anwendungen im Data Mining und in der Finanzmathematik'''; Alexander Heinecke; Masterarbeit in Informatik, Technische Universitaet Muenchen, 2010. | '''Realisierung einer Randbehandlung für adaptive Dünngittermethode mit Anwendungen im Data Mining und in der Finanzmathematik'''; Alexander Heinecke; Masterarbeit in Informatik, Technische Universitaet Muenchen, 2010. | ||
'''Parallelizing a Black-Scholes Solver based on Finite Elements and Sparse Grids''; Hans-Joachim Bungartz, Alexander Heinecke, Dirk Pflüger and Stefanie Schraufstetter. In IEEE International Parallel & Distributed Processing Symposium, 2010. accepted for publication. | '''Parallelizing a Black-Scholes Solver based on Finite Elements and Sparse Grids'''; Hans-Joachim Bungartz, Alexander Heinecke, Dirk Pflüger and Stefanie Schraufstetter. In IEEE International Parallel & Distributed Processing Symposium, 2010. accepted for publication. | ||
'''Volumne 2009''' | |||
'''Towards Many-core Implementations of LU Decomposition using Peano Curves'''; Alexander Heinecke and Michael Bader; In proceedings of the 2009 ACM Computing Frontiers Conference and co-located workshops: UnConventional high performance computing/memory access: is the memory fit for manycore?, p.21-30, May 2009. | '''Towards Many-core Implementations of LU Decomposition using Peano Curves'''; Alexander Heinecke and Michael Bader; In proceedings of the 2009 ACM Computing Frontiers Conference and co-located workshops: UnConventional high performance computing/memory access: is the memory fit for manycore?, p.21-30, May 2009. | ||
'''Volumne 2008''' | |||
'''Cache Optimised Data Structures and Algorithms for Sparse Matrices'''; Alexander Heinecke; Bachelor’s Thesis; Technische Universität München, 2008. | '''Cache Optimised Data Structures and Algorithms for Sparse Matrices'''; Alexander Heinecke; Bachelor’s Thesis; Technische Universität München, 2008. | ||
Revision as of 07:25, 19 January 2011
Address:
- TU München
- Institut für Informatik
- Boltzmannstr. 3
- 85748 Garching b. München
- Office:
- MI 02.05.036
- Email:
- Phone:
- (089) 289 18 619
- Fax:
- (089) 289 18 607
- Office Hours:
- by arrangement
Publications
Volumne 2010
Porting existing cache-oblivious Linear Algebra HPC Modules to Larrabee Architecture; Alexander Heinecke, Carsten Trinitis and Josef Weidendorfer; In Proceedings of the 2010 ACM/IBM Research Computing Frontiers Conference. p.91-92, May 2010.
Realisierung einer Randbehandlung für adaptive Dünngittermethode mit Anwendungen im Data Mining und in der Finanzmathematik; Alexander Heinecke; Masterarbeit in Informatik, Technische Universitaet Muenchen, 2010.
Parallelizing a Black-Scholes Solver based on Finite Elements and Sparse Grids; Hans-Joachim Bungartz, Alexander Heinecke, Dirk Pflüger and Stefanie Schraufstetter. In IEEE International Parallel & Distributed Processing Symposium, 2010. accepted for publication.
Volumne 2009
Towards Many-core Implementations of LU Decomposition using Peano Curves; Alexander Heinecke and Michael Bader; In proceedings of the 2009 ACM Computing Frontiers Conference and co-located workshops: UnConventional high performance computing/memory access: is the memory fit for manycore?, p.21-30, May 2009.
Volumne 2008
Cache Optimised Data Structures and Algorithms for Sparse Matrices; Alexander Heinecke; Bachelor’s Thesis; Technische Universität München, 2008.
Cache Oblivious Dense and Sparse Matrix Multiplication Based on Peano Curves; Michael Bader and Alexander Heinecke; PARA 08 in Trondheim, accepted for publication
Parallel matrix multiplication based on space-filling curves on shared memory multicore platforms; Alexander Heinecke and Michael Bader; In Proceedings of the 2008 ACM/IBM Research Computing Frontiers Conference and co-located workshops: MAW'08 and WRFT'08, p. 385–392, May 2008.
Hardware-oriented Implementation of Cache Oblivious Matrix Operations Based on Space-filling Curves; Michael Bader, Robert Franz, Stefan Günther, Alexander Heinecke; In R. Wyrzykowski, J. Dongarra, K. Karczewski and J. Wasniewski (ed.), Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, Volume 4967 of Lecture Notes in Computer Science, p. 628–638. Springer, May 2008