 |
 |
 |
 |
 |
 |
 |
 |
|
|
 |
|
| Research Areas | ||
| Combinatorial optimization,
Algorithm design and analysis, Scheduling, |
||
Biography |
||
I received the BSE degree in Electrical Engineering from Princeton University in 1990, and the MS and PhD degrees in Computer Science and Engineering from the University of Michigan in 1992 and 1996. In 1996 I joined the Computer Engineering Group of the Department of Electrical and Computer Engineering at Northeastern University.
My research is on developing and evaluating algorithms and bounds for combinatorially difficult optimization problems. I have made contributions to the following areas:
- Optimal scheduling
and register allocation, with spill code, for multiple-issue processors
- Microprocessor-aware scheduling algorithms for modern compilers
- Algorithms for weighted-completion time scheduling
- Design and analysis of tight lower bounds on schedule length
- Backtracking acyclic schedulers
- Parallel and scalable processing systems and programming toolsets.
- Computational infrastructure for seamless, inter-site Grid computing
- Applications of combinatorial optimization to switching, testing, and
reconfigurable computing
- Multiagent machine learning for distributed combinatorial optimization