Resume in pdf


Resumé
A.Siddhartha 646-239-7578
353 Serra Mall, Room 288, reddy@scs.stanford.edu
Stanford, CA - 94305. http://www.scs.stanford.edu/reddy

Objective

 To obtain a challenging full-time position in research.

Interests

 Distributed Systems, Operating Systems and Systems Security.

Education

New York University Jan. 2008
Ph.D. in Computer Science
Advisor: Prof. David Mazières

New York University Dec. 2004
M.S. in Computer Science

Indian Institute of Technology Madras Jul. 2002
B.Tech. in Computer Science
GPA: 8.88/10

Honours

2002 Henry-McCracken and the Dean's Fellowship by the New York University.
1999 First Prize in the Mathematics Olympiad conducted by the Department of Mathematics, IITM.
1998 Merit Prize for placing 88th of 100,000 candidates in the All India IIT-JEE.
1998 9th place in State Talent Search Examination (STSE) conducted by the A.S.Rao Awards Council.

Publications

Providing Video-on-Demand using Peer-to-Peer Networks.
Siddhartha Annapureddy, Christos Gkantsidis, Pablo Rodriguez Rodriguez.
Internet Protocol TeleVision (IPTV) workshop in conjunction with WWW '06, May 2006.

SHARK: Scaling File Servers via Cooperative Caching.
Siddhartha Annapureddy, Michael J. Freedman and David Mazières.
In Proc. of the Network Systems Design and Implementation (NSDI), May 2005.

P2PCAST: A Peer-to-Peer Multicast Scheme for Streaming Data.
Antonio Nicolosi and Siddhartha Annapureddy.
In Proc. of the the First IRIS Student Workshop on Peer-to-Peer Systems, Aug 2003.

Research

Redcarpet:

  The goal is to provide near-Video-on-Demand services over the Internet using unstructured P2P networks. A user should be able to watch a video without interruption, after waiting for a small setup time. In particular, addressed the challenges involved in scheduling the dissemination of the video blocks. We propose two techniques, pre-fetching and network coding, that significantly improve the performance of the system. Research done as an intern at Microsoft Research, Cambridge during the summer of 2005.

HydraFS:

  Designed a local filesystem on top of a P2P storage backend. The backend differs radically from traditional disk drives. It is content addressable, efficient only for large writes and data blocks expire after a certain time interval. Addressed these challenges and came up with a filesystem that also provides good resilience and continuous backup. The implementation of the system is in progress. Research done as part of an internship at NEC Labs during the summer of 2004.

SHARK:

  The goal is to enable a file server to handle a large volume of requests as the number of clients increases. Towards this end, designed and implemented a distributed file system where the participants cache the data that they fetch. These caches are used to satisfy requests from other clients, thereby alleviating the load on the server. Our design is both scalable and secure and ensures locality.

P2PCAST:

  The aim is to enable anyone behind a cable modem to disseminate streaming content with the cooperation of other interested users. Designed a novel P2P application-level multicast scheme by organizing the users into a forest of (almost) balanced trees. The scheme is fully decentralized, scalable and fault tolerant. Future work involves evaluating a prototype implementation and making the scheme secure against malicious users.

Experience

Cryptographic File System Spring '03, NYU
Implemented as an NFS loopback server. This server interposes between the client and the remote server and does encryption/decryption of data transparently. Also implemented an asynchronous caching web proxy that does cut-through routing and a simple tcp proxy. These projects were done as part of the Honors OS course.

Assembly Level Debugger 2002, IITM
Designed and implemented a debugger which boots from a floppy on powerup. Several commands like trace, dump, breakpoints, etc. are provided. Programs can also be loaded from a drive into memory with this debugger. A potential use would be to trace through the booting process of an OS.

Teaching Experience

Spring 2003, NYU TA for the Compilers course.
Fall 2002, NYU TA for the Fundamental Algorithms course.
Jul-Nov 2001, IITM TA for the Introduction to Computing course.

Extra-Curricular

I have a deep interest in Philosophy, History and Linguistics. I have helped in the translation of "Indian Idealism" by Rudolf Kassner and wrote a piece on Sacrifice in the Indian context.

Course Work

Systems Honors OS, Advanced Database Systems. Audited High Performance Architecture, Computer Systems Security.
Theory Honors Algorithms, Honors Theory of Computation, Advanced Topics in Cryptography, The Art of Counting, Introduction to Computational Number Theory and Algebra, Random Graphs.