Portrait of Dushyanth Narayanan

Dushyanth Narayanan

Senior Researcher

About

Dushyanth Narayanan is a researcher in the Systems and Networking Group at Microsoft Research in Cambridge, England. He has worked on mobile computing, databases, storage, energy, and most recently on data center technologies and applications. He has a Ph.D. in Computer Science from Carnegie Mellon University (2002), and  B.Tech. in Computer Science and Engineering from the Indian Institute of Technology, Madras (1995).

Projects

Rack-scale Computing

Established: January 1, 2013

  New hardware technology such as systems- and networks-on-chip (SOCs and NOCs), switchless network fabrics, silicon photonics, and RDMA, are redefining the landscape of data center computing, enabling interconnecting thousands of cores at high speed at the scale of today's…

Publications

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1997

Other

Traces

The traces used in the DiskEnergy (FAST’08), Everest (OSDI ’08) and SSD analysis (Eurosys ’09) papers are available from the SNIA IOTTA trace repository, under “Block I/O Traces“. The MSR Cambridge traces are also available. Please read the README.txt file for details about the trace format, tracing methodology etc.

Erdős number

My Erdős number is 4.

  1. Dushyanth Narayanan, Eno Thereska, and Anastassia AilamakiContinuous resource monitoring for self-predicting DBMS. In Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2005), pages 239-248, Atlanta, GA, September 2005. IEEE Computer Society.
  2. Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbons, and Todd C. Mowry. Improving hash join performance through prefetching. In Proceedings of the 20th IEEE International Conference on Data Engineering (ICDE 2004), pages 116-127, Boston, MA, March-April 2004. IEEE Computer Society.
  3. Noga Alon, Phillip B. Gibbons, Yossi Matias, and Mario Szegedy. Tracking join and self-join sizes in limited storage. In Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 1999), pages 10-20, Philadelphia, PA, May 1999. ACM Press.
  4. Noga Alon and Paul Erdős. Disjoint Edges in Geometric Graphs. Discrete & Computational Geometry, 4: 287-290, 1989.