The computer systems and networks group engages in a wide range of experimental and theoretical research. Our current projects span operating systems, network measurement and traffic analysis, peer-to-peer system design, network security, mobile code architectures, high-performance cluster computing and wireless networking. Our group consists of 7 faculty and over 25 graduate students, and is supported by research funds from government and industrial sources.
Computer Networks
The research in computer networks covers a broad range of topics; we focus on the use of modeling and analytical techniques to study fundamental problems in computer networks. The goal is to provide a rigorous basis for the design of next-generation computer networks. Our current projects are in the areas of wireless networks, peer-to-peer networks and content delivery networks.Internet Systems
The Internet Systems research group engages in a range of experimental projects on Internet systems and services. Our interests span Web-based and peer-to-peer systems design, network measurement and traffic analysis, fault-tolerant Internet systems, wireless networking and network security. Our mission is to investigate high-impact research avenues that will shape the next generation of Internet systems and services.Mobile and Pervasive Computing
Mobile and Pervasive Computing covers a broad set of issues, including content adaptation for mobile devices, indoor and outdoor localization technologies based on cellular technology, virtual machine migration, mobile ad hoc network simulators and delay-tolerant networks. Our research follows an experimental and empirical approach with an emphasis on system building.Operating Systems
Operating Systems is exploring the performance of a new compiler algorithm for inserting prefetch directives in multi-dimensional loops, such that the prefetches will be issued early enough to hide the I/O latency completely (we call this “scheduling the prefetches”). The previous algorithm only considered the innermost loop, which typically contains too few iterations for effective scheduling, given the large latencies involved. Our research is also looking at extending automatic prefetching techniques to irregular out-of-core programs that use pointer-based data structuresFaculty
Eyal de Lara
Angela Demke Brown
Yashar Ganjali
G. Scott Graham
Ryan Johnson
Peter Marbach
Bianca Schroeder