Sanjay Rajopadhye
Location: (Fort Collins, CO)
Personal Research Web Page: http://www.cs.colostate.edu/~svr
Keywords: data- and compute-intensive programs, polyhedral model, automatic parallelization, tiling and program transformation, equational and declarative programming, multi- and many-core platforms, energy-optimization
Posted on: Tuesday, May 11th, 2010
Broad Research Area: Numerical/Scientific Computing / HPC / Data-Intensive Scalable Computing, Programming Languages / Compilers
Research Interests:
The polyhedral model is a formalism for reasoning about compute-and data-intensive kernels that take up a huge part of most programs. Such computations arise in many applications in signal and image processing, scientific and engineering simulations, dense linear algebra, bio-informatics, numerical analysis, etc. In fact, most of four of the Berkeley “dwarfs” or motifs can be described very succinctly in the polyhedral model.
In the new era of multi- and many-core, programmer productivity is just as critical as performance (if not more so). The polyhedral model provides a framework for both, optimally compiling high-level equational programs to parallel architectures, and also improving programmer productivity.
I am seeking a postdoctoral researcher to work in this broad area. The specific topic can be determined based on mutual interest, and may range from low level (e.g., FPGA platforms) through discrete nonlinear optimization, program transformation systems to semantics of equational programs.
Contact Information:
Email (preferred) or phone (970) 491-7323
