Scott M. Pike

Department of Computer Science, Texas A&M University

Department of Computer Science, Texas A&M University
  • home »
  • Scott Pike's home page
back

Links

  • Home
  • +  Research
    • Main research page
    • Research Project 1
    • Research Project 2
  • +  Teaching
    • Main teaching page
    • CPSC-668
    • CPSC-689
    • CPSC-410/611
  • +  Publications
    • All publications
    • Book Chapters
    • Conference Proceedings
    • Workshop Papers
  • Service
  • New Students
  • Resources
  • CV
  • Personal

Contact

  • pike [at] cs.tamu.edu
  • Office: 325 HRBB
  • Phone: +1 979.845.2369
  • Fax: +1 979.847.8578
  Photo of  Scott M Pike

Ph.D. Computer Science & Engineering, Ohio State University, 2004
M.S.  Computer & Information Science, Ohio State University, 2000
B.A.  Philosophy, Yale University, 1996

I am an assistant professor in the Department of Computer Science at Texas A&M University. My research investigates theoretical and practical techniques for isolating partial failures within small, local neighborhoods of impact in distributed systems. A representative sample of the kind of work I do can be found here. My previous work addresses a variety of intersecting topics in software engineering, distributed systems, and programming languages.

New: Eventually k-Bounded Wait-Free Distributed Daemons. This paper demonstrates the sufficiency of the eventually-perfect failure detector for wait-free and eventually fair scheduling in environments subject to process crashes. A companion paper demonstrates the necessity of this failure detector, in the sense that wait-free, eventually fair scheduling is impossible using any weaker oracle for crash-fault detection. As such, our results present an optimal oracle for wait-free, eventually fair scheduling.


Last Modified: Mon Aug 25 03:29:33 BST 2008
© Scott M. Pike (some rights reserved...)     My Erdös Number | Copyright | Site Map | Contact | About