Sanjeev Baskiyar, Ph.D.

Associate Professor

Project Director NSF-STEM: Educating Talented Scholars in CSSE

3127C Shelby Technology Center
Department of Computer Science & Software Engineering

354 Magnolia Ave
Auburn University, Auburn, AL 36849
Voice: (334)-844-6306, Fax (334)-844-6329
lastname@ eng·auburn·edu

$Description: W:\sanjeev.jpg$

Sanjeev Baskiyar received the PhD and MSEE degrees (major: Electrical (Computer) Engineering, minor: Computer Science) from the University of Minnesota, Twin Cities (Minneapolis), in 1993 and 1988 respectively and the BE (Electronics and Communications) degree from the Indian Institute of Science, Bangalore in 1984. He received the BS degree in Physics with honors and distinction in Mathematics in 1981. He was a recipient of several competitive national and state level scholarships. His academic record has been in the top decile. He was nominated for the Best Teaching Assistant of the Year award in the ECE dept. at the University of Minnesota, Minneapolis. He has taught courses in the areas of Real-time and Embedded Computing, Computer Architecture, Operating Systems, Microprocessor Programming and Interfacing and VLSI Design. His research interests are in the areas of Computer Architecture, Distributed Computing and Task Scheduling. His experience includes working as an Assistant Professor at Western Michigan University, as a Senior Software Engineer in Unisys Corporation, as a Programmer in IBM's ProjectWoksape, as a Project Manager in UofM, St. Paul and as a Computer Engineer in Tata Engineering and Locomotive Company Ltd., India. He has published in the areas of Computer Architecture and Task Scheduling on Multiprocessors. He is an Associate Editor of the International Journal of Computers and Applications, Acta Press. He is listed in Who’s Who in America. Dr. Baskiyar’s research has been supported by external grants from the National Science Foundation, NASA/MSGC, Wind-River Systems and Mentor Graphics. He is currently Associate Professor (with tenure) in the department of Computer Science and Software Engineering at Auburn University.

News

· Auburn University moves up to rank 38^th among public universities; among top 50 public universities for 18^thconsecutive year in U.S. News survey 2010.

· U.S. News ranked Auburn in the top ten in its 2009 list of best places to live in United States

Education

   Ph.D.                                      University of Minnesota, Minneapolis, 1993
   M.S.E.E                                  University of Minnesota, Minneapolis, 1988
   B.E.                                        Indian Institute of Science, Bangalore, 1984

Specialty Areas

Computer Architecture, Scheduling, Embedded Computing, Distributed Computing.

Research Projects

I am currently offering scholarships supported by NSF for US citizens and Permanent Residents. For information and application on these scholarships visit the STEM scholarship website.

I. Scheduling

v Resource and energy aware scheduling: This goal of this project is to develop and evaluate schedules for embedded systems, multi-core computers, clusters and grids. The target is to develop adaptable and scalable schedules that are resource aware (memory, computational power) as well as energy and thermal conscious.

II. Architecture

v Real-time micro-architecture: This project investigates the use of secondary bus between cache and memory to develop better micro-architectures. It also investigates the use of wireless technology to develop better fault tolerance and cache coherence techniques. It involves performance analysis and hardware design.

v Storage architecture: This project investigates novel data and meta-data organization within disks, disk-clusters and flash drives for better timing, energy, fault tolerance and wear.

III. Education

v This project involves development of concept graphs and cartoon strips for computer science education.

Fun stuff - Academic Genealogy

Arthur Kennelly--Vannevar Bush (Ph.D., MIT 1916)--Samuel Caldwell (Ph.D. MIT, 1933)--David A. Huffman (Ph.D., MIT 1953)--Richard Y. Kain (D.Sc., MIT 1962)--Sanjeev Baskiyar (Ph.D., Minnesota 1993)

Recent Students, Degree/Employment

1. Chen Zhang, MS

2. Meghanathan Natarajan, MS àUT, Dallas Assistant Professor, Jackson State Univ, MS

3. Arun Kannan, MS, Mentor Graphics, FL

4. Kiran Palli, MS, Intel Corporation, CA

5. C. S. Prashanth, PhD, Asst. Professor, Bangalore, India

6. Rabab Abdel-Kader, PhD, Assistant Professor, Suez Canal Univ, Egypt

7. Chiao Huang, Taiwan Energy

8. Rakshith Venkatesh, Sun/Oracle, CA

9. Cong Liu, MS, PhD student, Univ. of NC, Chapel Hill.

10.Yong-won Park, MS, PhD student, Auburn University.

11.Christopher Dickinson, MS, Entergy.

12.Sudhakar Jonnalgadda, Oracle, CA.

13.Ahmed Owian, BS (Honors thesis)àMS Univ. of Memphis, Sr. Programmer/Analyst, FedEx,Memphis.

14.Sreekanth Boga, MS, Embedded Systems Engineer, Syntech-Systems, Tallahassee, FL.

15.Yong-Won Park, PhD, Samsung S1 (Security)

16.Karthik Vemula, MS, InfoTech, Gainesville, FL.

17.Chengjun Wang, PhD, Assistant Professor, Albany State, GA.

18.John O’Farrell, PhD, Coraid, Inc, Athens.

Current Students

19.Vibudh Mishra, expected Fall 2011.

20.Bradley Smith

21.Swaroop Anupindi

22.Matthew Swann

23.James Tacey

24.Adarsh Jain

25.Sanjay Kulkarni

Research Milestones

1. First to design intra-chip wireless communication to enhance computer architectures.

2. First to identify and prove NP-completeness of the fundamental task in-tree scheduling problem on completely connected multiprocessors

3. Development of optimal schedules on a very wide set of restricted task in-trees on multiprocessors

4. First to introduce the concept of object-invocation graph in program decomposition and partitioning on multiprocessors for efficient execution

5. Development of an O(n³p) heuristic yielding optimal/very near-optimal schedule lengths for thousands of random and benchmark directed a-cyclic task graphs on homogeneous multiprocessors

6. Development of one of the fastest dynamic method resolution techniques for pure object-oriented programs that is usable for reentrant programs

7. First to introduce the concept of scheduling libraries

8. First to develop windows based interactive complete Smith Chart

Selected Refereed Journal Publications and Special Collections

(A * next to the name refers to graduate student)

1. Baskiyar, S. and Abdel-Kader, R, “Energy Aware DAG Scheduling on heterogeneous systems,” Cluster Computing, Springer, 2010 (to appear).

2. Liu, C.* and Baskiyar, S. “A General Distributed Scalable Grid Scheduler for Independent Tasks,” Journal of Parallel and Distributed Computing, vol. 69, no. 3, pp. 307-314, March 2009.

3. Liu, C.* and Baskiyar, S., “A Scalable Grid Scheduler for Real-Time Applications,” International Journal of Computers and Their Applications, 2009, to appear.

4. Liu, C*, Baskiyar, S. and Li, S.*, “A General Distributed Scalable Peer to Peer Scheduler for Mixed Tasks in Grids,” Lecture Notes on Computer Science, vol. 4873, pp. 320-330, Springer, 2007.

5. Baskiyar, S. and SaiRanga, P.*, “Scheduling DAGs on heterogeneous network of workstations to minimize finish time,” International Journal of Computers and Their Applications, vol. 13, no 4, Dec 2006.

6. Baskiyar, S. and Palli, K.K.*, Low-power scheduling of DAGs to minimize finish time, Lecture Notes in Computer Science, pp. 353 -362, 2006.

7. Baskiyar, S. and Dickinson, C.*, “Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication,” Journal of Parallel and Distributed Computing, vol. 8, no 65, pp 911-921, Elsevier, 2005.

8. Baskiyar, S. and Meghanathan, N., “A survey of contemporary real-time operating systems,” Informatica, vol. 29, no. 2, pp 233-240, 2005.

9. Baskiyar, S. and Meghanathan, N.*, “Binary codes for fast determination of ancestor-descendant relationship in trees and directed a-cyclic graphs,” International Journal of Computers and Their Applications, vol. 10, no. 3, pp. 67-71, 2003.

10.Baskiyar, S., A computer based educational Smith Chart,” Computers in Education Journal, vol. 13, no. 3, pp 76-80, 2003.

11.Baskiyar, S. and Dickinson, C*., “Scheduling directed a-cyclic task graphs on heterogeneous processors using task duplication,” LNCS, vol. 2913, pp. 259-267, Springer-Verlag, 2003.

12.Baskiyar, S., “Simulating DNA computing,” Lecture-Notes in Computer Science, v. 2552, pp. 411-419, Springer-Verlag, 2002.

13.Baskiyar, S., “Efficient execution of pure object-oriented programs by follow-up compilation,” Computing, Springer-Verlag, vol 69, no. 10, pp. 273-289, 2002. (This important research was favorably reviewed in ACM Computing Reviews: see the review article here).

14.Baskiyar, S., “Minimizing makespan of task in-trees,” IEICE Transactions on Information and Systems, Oxford Univ. Press, vol. E 84-D, no. 6, pp. 685-691, 2001.

15.Baskiyar, S., “Scheduling DAGs on message passing m-processors systems,” IEICE Transactions on Information and Systems, vol. E-83-D, no. 7, pp. 1497-1507, Oxford Univ. Press, 2000.

16.Baskiyar, S. and Kain, R. Y., “On the complexity of scheduling task trees on multiprocessors to minimize makespan,” Japan Society of Artificial Intelligence, vol. SIG-PP-93, 1993.

Selected Refereed Conference Proceedings and Special Collections

17.O’Farrell, J. and Baskiyar, S., “Improved Real-Time Performance Using a Secondary Bus,” Proceedings of the Computers And Their Applications,” Honolulu, HI, March, 2010, ISCA Press.

18.Park, Y.-w, Casey, K and Baskiyar, S., “A novel adaptive instance based leaning approach to task scheduling,” Proceedings of the 9^th International PDCN, Feb 2010, Innsbruck, Austria, IASTED Press.

19.Baskiyar, S. and Wang, C, “A split disk cache architecture to reduce read miss ratio,” Proceedings of the 9^th International PDCN, Feb 2010, Innsbruck, Austria, IASTED Press.

20.Liu, C.* and Baskiyar, S., “Scheduling Mixed Real-Time Tasks in Grids using Bin Packing,” Proceedings of the 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS), pp 229-236, IEEE Computer Society, Dec. 2008.

21.Liu, C.*, Qin, X., Kulkarni, S.*, Wang C.J.*, Manzanares A., Li S.*, and Baskiyar, S., Distributed Energy Efficient Scheduling for Real-Time Data-intensive Applications, Proceedings of the 27th IEEE International Performance Computing and Communications Conference (IPCCC), Dec. 2008

22.Soares, C., Page, G., MacDonald, J., Baskiyar, S., Hamilton, J., and Dozier, G., “Bowl championship series vulnerability analysis,” Proceedings of TAPIA Diversity in Computing, pp 1-4, Orlando, Florida, October 2007.

23.Abdel-Kader, R.* and Baskiyar, S., “Power managed task scheduling on heterogeneous systems,” Proc. of International Conference on Parallel and Distributed Computing, ISCA, 2006.

24.Cong, L.*, Baskiyar, S. and Wang, C.J.*, “A distributed peer to peer grid scheduler,” Proceedings of the International Conference on Parallel and Distributed Computing and Systems, IASTED, Nov. 2006.

25.SaiRanga, P.* and Baskiyar, S., “A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems,” 43^rd ACM SE conference, Kennesaw, GA, March 2005.

26.Baskiyar, S. and SaiRanga, P.C.*, “Scheduling directed a-cyclic graphs on heterogeneous computing systems, Workshop on CRTPC in Proc. 32^nd International Conference on Parallel Processing, 2003.

27.Baskiyar, S. and SaiRanga, P. C.*, “Scheduling DAGs on heterogeneous network of workstations to minimize finish time,” Proc. ISCA 16^th International Parallel and Distributed Computing Symposium, pp. 30-35, 2003.

28.Baskiyar, S., “A real-time fault tolerant intra-body network,” Proc. 27^th International LCN, pp 235-240, 2002, Tampa, FL, IEEE-ACM Press.

29.Baskiyar, S., “A survey on real-time operating systems,” Proc. IASTED-NPDA, 2002, Tsukuba, Japan, Acta Press.

30.Baskiyar, S., “A software simulation of DNA computing,” Proc. 15^th PDCS, 2002, pp 373-378, Louisville, KY, ISCA.

31.Baskiyar, S., “Scheduling task in-trees on distributed memory systems,” Proc. 15^th IPDPS, San Francisco, CA, 2001 (IEEE-ACM).

32.Baskiyar, S. and Meghanathan, N.*, “Scheduling and load balancing in mobile computing using tickets,” Proc. 39^th SE-ACM Conference, Athens, GA, 2001.

33.Baskiyar, S., “Speeding Smalltalk programs using follow-up compilation,” Proc. EIT Conf, Chicago, 2000, IEEE.

34.Baskiyar, S. and Kain, R.Y., “Smith chart with GUI,” Proc. NC-ASEE Conf., Erie, 1999.

35.Baskiyar, S. and Kain, R. Y., “Architectural support for enhancing object-oriented program execution times,” Proc. OOS, Jan. 1993, San Diego, CA.

36.Baskiyar, S. and Kain, R. Y., “On the complexity of scheduling task trees on multiprocessors to minimize makespan,” Proc. JSPP, Tokyo, Japan, 1993.

37.Liu, C., Baskiyar, S., P2PGS: A Distributed Grid Scheduler Adopting P2P Resource Discovery Strategy, Vodafone-U.S. Foundation Fellows Symposium (Poster Paper), Auburn, AL, Mar. 2007

Teaching

Spring 2010

COMP 3350 – Computer Organization and Assembly Programming

Fall 2009

COMP 3350 – Computer Organization and Assembly Programming

Spring 2009

COMP 3350 – Computer Organization and Assembly Programming

COMP 3700 – Software Modeling and Design

Spring 2008

COMP 3350 – Computer Organization and Assembly Programming

Fall 2007