Lawrence Livermore National Laboratory
Box 808, L-422
Livermore, CA 94551-0808
Deepak Rajan is an Operations Research expert in the Center for Applied Scientific Computing. His research broadly lies in the areas of computational optimization and integer programming, and more specifically in applying such techniques in solving large-scale problems. Recently, Deepak has been working on problems in the energy area (power generation, in particular). He has also worked on optimization problems that arise in scientific distributed computing, power-aware microprocessor scheduling, network design, and in a variety of other domains.
Deepak earned his M.S. and Ph.D. in Operations Research from the University of California at Berkeley. He also holds a B.Tech. from the Indian Institute of Technology at Madras, with a major in Mechanical Engineering. He joined LLNL in 2011.
Deepak is a member of the Institute for Operations Research and the Management Sciences (INFORMS).
Wolf, J., Balmin, A., Rajan, D., Hildrum, K., Khandekar, R., Parekh, S., Wu, K.-L., Vernica, R., "On the optimization of schedules for MapReduce workloads in the presence of shared scans," Accepted by VLDB Journal, (2012)
Wolf, J., Balmin, A., Rajan, D., Hildrum, K., Khandekar, R., Parekh, S., Wu, K.-L., Vernica, R., "CIRCUMFLEX: A scheduling optimizer for MapReduce workloads with shared scans." Operating Systems Review 46, (2012), 26-32.
Lucchese, C., Vlachos, M., Rajan, D., Yu, P. S., "Rights protection of trajectory datasets with nearest-neighbor preservation," VLDB Journal, 19(4), (2010), 531-556.
Atamtürk, A. and Rajan, D., "Partition inequalities for capacitated survivable network design based on directed p-cycles," Discrete Optimization, 5, (2008), 415-433
Rajan, D. and Atamtürk, A., "A directed cycle based column-and-cut generation method for capacitated survivable network design," Networks, 43, (2004), 201-211.
Atamtürk, A. and Rajan, D., "On splittable and unsplittable flow capacitated network-design arc-set polyhedra," Mathematical Programming, 92, (2002), 315-333.
Updated: 2013-02-24 17:15:33