Marcin Zalewski
Research Associate
Educational Background
- Ph.D., 2008, Computer Science, Chalmers University, Göteborg, Sweden
- M.S., 2003, Computer Science, Rensselaer Polytechnic Institute
- B.S., 2001, Computer Science, Rensselaer Polytechnic Institute
Research Interests
- Development, enchancement, and application of generic programming technologies and tools, specifically in production-grade languages such as C++
- High-level, generic optimization techniques
- Support for active libraries using modular metaprogramming techniques
Recent Research Projects
- Currently working on PXGL
Recent Professional Activity
- Co-chair, 6th ACM SIGPLAN Workshop on Generic Programming (WGP), 2010
- PC Member, 5th ACM SIGPLAN Workshop on Generic Programming (WGP), 2009
- Steering Committee Member, Workshop on Generic Programming
Image:
Last Name:
Zalewski
Title:
Research Associate
Email:
zalewski(at)indiana.edu
People Category:
People ID:
Rank:
Scientists
publication:
Recent Publications
- Jesun Sahariar Firoz,
Marcin Zalewski,
Thejaka Amila Kanewala,
Martina Barnas,
and Andrew Lumsdaine.
Importance of Runtime Considerations in Performance Engineering of Large-Scale Distributed Graph Algorithms.
In 1st Workshop on Performance Engineering for Large Scale Graph Analytics at EuroPar,
August 2015.
Springer.
![]()
Keywords:HPC, SSSP, parallelism, runtime, coalescing. [bibtex-entry] - Marcin Zalewski,
Nicholas Edmonds,
and Andrew Lumsdaine.
Declarative Patterns for Imperative Distributed Graph Algorithms.
In Graph Algorithms Building Blocks Workshop (GABB),
pages 796--803,
June 2015.
IEEE Computer Society.
![]()
[bibtex-entry]
- Marcin Zalewski,
Thejaka Amila Kanewala,
Jesun Sahariar Firoz,
and Andrew Lumsdaine.
Distributed Control: Priority Scheduling for Single Source Shortest Paths Without Synchronization.
In Proceedings of the Fourth Workshop on Irregular Applications: Architectures and Algorithms,
November 2014.
IEEE Press.
![]()
![]()
Keywords:HPC, SSSP, parallelism, scheduling. [bibtex-entry]
First Name:
Marcin
