James H. Anderson Professor Department of Computer Science University of North Carolina at Chapel Hill 362 Sitterson Hall CB #3175 Chapel Hill, NC 27599-3175 (919) 962 - 1757 (voice) (919) 962 - 1799 (fax) (919) 962 - 1943 (secretary, Whitney Vaughan) anderson at cs.unc.edu

Education

• Ph.D., Computer Sciences, The University of Texas at Austin, 1990.
• M.S., Computer Science, Purdue University, 1983.
• B.S., Computer Science, Michigan State University, 1982.

Honors

• Alfred P. Sloan Research Fellow, 1996.
• U.S. Army Research Office Young Investigator Award, 1995.
• Computer Science Student Association Teaching Award, 1995, 2002, and 2005.

Research Interests

• Distributed and Concurrent Algorithms
• Real-Time Systems
• Formal Methods

The LITMUS^RT (Linux Testbed for MUltiprocessor Scheduling in Real-Time systems) page is available.

Index of My Papers

Current Research Projects

• Real-Time Fine-Grained Adaptivity on Multiprocessors: Acoustic Tracking as a Test Case

• Multiprocessor Real-Time Computing: Formal Foundations

• Real-Time Computing on Multicore Platforms

• Jae-Heon Yang, Ph.D. received August 1994 (at Maryland). Assistant Professor of Computer Science, Korea Advanced Institute for Science and Technology, Kusong-dong, Yusong-gu, Taejon, Korea. Dissertation: Scalable Synchronization in Shared Memory Multiprocessing Systems. Download dissertation in postscript or PDF .

• Mark Moir, Ph.D. received August 1996. Currently employed by Sun Microsystems. Formerly, Assistant Professor of Computer Science, the University of Pittsburgh. Dissertation: Efficient Object Sharing in Shared-Memory Multiprocessors. Download dissertation in postscript or PDF .

• Srikanth Ramamurthy, Ph.D. received December 1997. Member of the Technical Staff, Panasas, Inc., Pittsburgh, PA. Dissertation: A Lock-Free Approach to Object Sharing in Real-Time Systems. Download dissertation in postscript or PDF .

• Ed Overton, M.S. received December 1997 (Math Department). Currently employed by SAS. Thesis: A Foray into Uniprocessor Real-Time Scheduling Algorithms and Intractability. Download thesis in postscript or PDF .

• Rohit Jain, M.S. received May 1998. Last known employer: Microsoft.

• Yong-Jik Kim , Ph.D. received December 2003. Currently back home in Korea working for Tmax, Inc. Dissertation: Time Complexity Bounds for Shared-memory Mutual Exclusion. Download dissertation in postscript or PDF .

• Anand Srinivasan , Ph.D. received December 2003. Currently employed by Bell Labs, India. Dissertation: Efficient and Flexible Fair Scheduling of Real-time Tasks on Multiprocessors. Download dissertation in postscript or PDF .

• Phil Holman , Ph.D. received August 2004. Currently employed by SAS. Dissertation: On the Implementation of Pfair-scheduled Multiprocessor Systems. Download dissertation in postscript or PDF .

• Vasile Bud , M.S. received May 2005. Currently employed somewhere in NYC.

• Umamaheswari Devi , Ph.D. received December 2006. Currently employed by IBM Research. Dissertation: Soft Real-Time Scheduling on Multiprocessors. Download dissertation in postscript or PDF .

Current Students

• Aaron Block

• John Calandrino

• Hennadiy Leontyev

• Bjoern B. Brandenburg

Click here for proof that my students are the hardest working students in the department.

Teaching

• Fall 1995, Comp 202, Algorithm Analysis.
• Spring 1996, Comp 181, Models of Languages and Computation.
• Fall 1996, sabbatical.
• Spring 1997, Comp 247, Distributed and Concurrent Algorithms.
• Fall 1997, Comp 202, Algorithm Analysis.
• Spring 1998, Comp 181, Models of Languages and Computation.
• Fall 1998, Comp 202, Algorithm Analysis.
• Spring 1999, Comp 247, Distributed and Concurrent Algorithms.
• Fall 1999, Comp 202, Algorithm Analysis.
• Spring 2000, Comp 232, Real-time Systems.
• Fall 2000, Comp 290-062, Advanced Real-time Systems.
• Spring 2001, Comp 247, Distributed and Concurrent Algorithms.
• Fall 2001, Comp 202, Algorithm Analysis.
• Spring 2002, Comp 232, Real-time Systems.
• Fall 2002, sabbatical.
• Spring 2003, Comp 247, Distributed and Concurrent Algorithms.
• Fall 2003, Comp 202, Algorithm Analysis.
• Spring 2004, Comp 232, Real-time Systems.
• Fall 2004, Comp 181, Models of Languages and Computation.
• Spring 2005, Comp 247, Distributed and Concurrent Algorithms.
• Fall 2005, Comp 202, Algorithm Analysis.
• Spring 2006, Comp 232, Real-time Systems.
• Fall 2006, Comp 750[202], Algorithm Analysis.
• Spring 2007, Comp 735[247], Distributed and Concurrent Algorithms.
• Fall 2007, Comp 455[181], Models of Languages and Computation.
• Spring 2008, Comp 737[232], Real-time Systems.