My research interests are in the areas of compilers and algorithms. More specifically, I am interested in applying combinatorial optimization techniques to hard problems in code generation and optimization, especially instruction scheduling and register allocation. I am also interested in developing precise and practically-efficient algorithms for solving NP-hard problems, such as the traveling salesman problem (TSP) and the sequential ordering problem (SOP). I am currently working on three major projects:
Compiler instruction scheduling for the GPU
Instruction scheduling using Ant Colony Optimization (ACO)
Parallel Branch-and-Bound algorithms for NP-hard problems
Links
Organizational Affiliations
Professor,
Computer Science Department
Education
University of Jordan (Jordan, Amman) - UJ
BS
University of California, Davis (United States, Davis) - UCD