|
|
Mehmet Belgin
Mehmet Belgin is a Computer Science PhD candidate at Virginia Tech and provides programming support in VT-ARC.
His research focuses on sparse computation kernels that dominate most iterative solvers.
His is currently working on a framework that transparently stacks
multiple instances of sparse problems in process level and solve them
together for improved cache locality, better FPU utilization and reduced
memory bandwidth usage.
His general research interests include register
and cache level optimizations, sparse matrix representations, parallel
algorithms and multicore architectures.
|
|