Skip to main content

# Christopher Moretti

Title/Position
Senior Lecturer
Degree
Ph.D., University of Notre Dame, 2010
cmoretti (@cs.princeton.edu) (609) 258-5388 036 Corwin Hall
Homepage
https://www.cs.princeton.edu/~cmoretti

## Research

Interests: Distributed systems, computer science education

## Short Bio

Christopher Moretti is a lecturer in computer science at Princeton University. Prior to coming to Princeton in 2010, he earned his doctorate in computer science and engineering from the University of Notre Dame. At Princeton he has taught and developed for the CS I course (COS126), the systems-track CS II course (COS217), the functional programming course (COS326), and the project-based software engineering course (COS333). He has also served as an academic advisor for engineering freshman and upperclass computer science majors. His research interests focus on distributed computing and storage, and computer science education. He has directed junior and senior independent work research projects in these areas, as well as sports analytics, programming tools, and software engineering.

## Selected Publications

- Teaching CS to CS Teachers: Addressing the Need for Advanced Content in K-12 Professional Development
  D. Leyzberg, C. Moretti
  ACM SIGCSE Technical Symposium on Computer Science Education
- Framework for Scalable Genome Assembly on Clusters, Clouds, Grids
  C. Moretti, A. Thrasher, L. Yu, M. Olson, S. Emrich, and D. Thain
  IEEE Transactions on Parallel and Distributed Systems, 2012.
- All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids
  C. Moretti, H. Bui, K. Hollingsworth, B. Rich, P. Flynn, and D. Thain
  IEEE Transactions on Parallel and Distributed Systems, 2010.
- Chirp: A Practical Global Filesystem for Cluster and Grid Computing
  D. Thain, C. Moretti, and J. Hemmes
  Journal of Grid Computing, 7(1) 51--72, March 2009.
- Abstractions for Cloud Computing with Condor
  D. Thain and C. Moretti
  Cloud Computing and Software Services, ed. Ahson and Ilyas, CRC Press, 2009.

Follow us: