- talks - lists.cs.princeton.edu

Colloquium Speaker-Jose Faleiro, TODAY at 12:30
by Emily C. Lawrence 09 Apr '18

09 Apr '18

CS Department Colloquium Speaker Jose Faleiro from Yale University Monday, April 9, 2018 - 12:30pm Computer Science - Room 105 Host: Wyatt Lloyd "High Performance Serializable Transactions via Deterministic Execution" Abstract: Concurrency, the processing of multiple requests simultaneously, is one of the most challenging problems large-scale server applications face in practice. Accordingly, database systems research has long made the case for automatically handling concurrency in the database by guaranteeing serializability . Serializability shields applications from reasoning about concurrency, and allows developers to focus entirely on implementing application logic. Unfortunately, in the 40-plus years since its inception, serializability has not seen wide adoption in practice. This is because weaker guarantees, which expose applications to concurrency and the inevitable bugs that arise, perform significantly better. In this talk, I will discuss my research on addressing the performance limitations of serializability via deterministic transaction execution. Deterministic transaction execution exploits the fact that a large class of modern server applications do not require the full generality of conventional database transactions. By tailoring transaction execution mechanisms for this class of applications, my research shows that it is possible to achieve serializability with minimal performance overhead. I will first describe a serializable multi-versioning mechanism that decouples conflicting reads and writes, and subsequently outperforms a state-of-the-art implementation of the weaker guarantee of snapshot isolation by over 3x. Next, I will describe piecewise visibility, a concurrency control mechanism that isolates requests at a finer granularity than entire transactions, which consequently permits aggressive serializable transaction interleavings and outperforms the weaker guarantee of read committed by over 3x. Finally, I will discuss ongoing work that applies deterministic transaction execution principles to address replication lag in Facebook’s production MySQL infrastructure. Bio: Jose Faleiro is a PhD candidate in computer science at Yale University. His research interests are in data management systems, multi-core systems, and distributed systems. His thesis research investigates the use of deterministic execution to enable scalable and efficient transaction processing on main-memory multi-core database systems. In addition to his academic research at Yale, Jose has worked on large-scale real world systems, including Microsoft’s Orleans cloud programming framework, and Facebook’s production MySQL infrastructure. He is the recipient of the Alan J. Perlis Fellowship at Yale, and a Microsoft Research Tech Transfer Award. He has an undergraduate degree in computer science from the Birla Institute of Technology and Science (BITS), Pilani , India.a

1 0

Reminder: Colloquium Speaker-Jose Faleiro, tomorrow at 12:30
by Emily C. Lawrence 08 Apr '18

08 Apr '18

CS Department Colloquium Speaker Jose Faleiro from Yale University Monday, April 9, 2018 - 12:30pm Computer Science - Room 105 Host: Wyatt Lloyd "High Performance Serializable Transactions via Deterministic Execution" Abstract: Concurrency, the processing of multiple requests simultaneously, is one of the most challenging problems large-scale server applications face in practice. Accordingly, database systems research has long made the case for automatically handling concurrency in the database by guaranteeing serializability . Serializability shields applications from reasoning about concurrency, and allows developers to focus entirely on implementing application logic. Unfortunately, in the 40-plus years since its inception, serializability has not seen wide adoption in practice. This is because weaker guarantees, which expose applications to concurrency and the inevitable bugs that arise, perform significantly better. In this talk, I will discuss my research on addressing the performance limitations of serializability via deterministic transaction execution. Deterministic transaction execution exploits the fact that a large class of modern server applications do not require the full generality of conventional database transactions. By tailoring transaction execution mechanisms for this class of applications, my research shows that it is possible to achieve serializability with minimal performance overhead. I will first describe a serializable multi-versioning mechanism that decouples conflicting reads and writes, and subsequently outperforms a state-of-the-art implementation of the weaker guarantee of snapshot isolation by over 3x. Next, I will describe piecewise visibility, a concurrency control mechanism that isolates requests at a finer granularity than entire transactions, which consequently permits aggressive serializable transaction interleavings and outperforms the weaker guarantee of read committed by over 3x. Finally, I will discuss ongoing work that applies deterministic transaction execution principles to address replication lag in Facebook’s production MySQL infrastructure. Bio: Jose Faleiro is a PhD candidate in computer science at Yale University. His research interests are in data management systems, multi-core systems, and distributed systems. His thesis research investigates the use of deterministic execution to enable scalable and efficient transaction processing on main-memory multi-core database systems. In addition to his academic research at Yale, Jose has worked on large-scale real world systems, including Microsoft’s Orleans cloud programming framework, and Facebook’s production MySQL infrastructure. He is the recipient of the Alan J. Perlis Fellowship at Yale, and a Microsoft Research Tech Transfer Award. He has an undergraduate degree in computer science from the Birla Institute of Technology and Science (BITS), Pilani , India.a

1 0

Colloquium Speaker-Saurabh Gupta, Thursday, April 12
by Emily C. Lawrence 06 Apr '18

06 Apr '18

Saurabh Gupta, University of California at Berkeley Thursday, April 12, 2018 - 12:30pm Computer Science - Room 105 Host: Szymon Rusinkiewicz “Visual Perception and Navigation in 3D Scenes” Abstract: In recent times, computer vision has made great leaps towards 2D understanding of sparse visual snapshots of the world. This is insufficient for robots that need to exist and act in the 3D world around them based on a continuous stream of multi-modal inputs. In this talk, I will present some of my efforts in bridging this gap between computer vision and robotics. I will show how thinking about computer vision and robotics together, brings out limitations of current computer vision tasks and techniques, and motivates joint study of perception and action for robotic tasks. I will showcase these aspects via three examples: 3D scene understanding, representation learning for varied modalities, and visual navigation. I will conclude by pointing out future research directions at the intersection of computer vision and robotics, thus showing how the two fields are ready to get back together. Bio: Saurabh Gupta is a Ph.D. student at UC Berkeley, where he is advised by Jitendra Malik. His research interests include computer vision, robotics and machine learning. His PhD work focuses on 3D scene understanding, and visual navigation. His work is supported by a Berkeley Fellowship and a Google Fellowship in Computer Vision.

1 0

Colloquium Speaker-Amit Levy, Tuesday, April 10
by Emily C. Lawrence 04 Apr '18

04 Apr '18

Amit Levy from Stanford University Tuesday, April 10, 2018 - 12:30pm Computer Science - Room 105 Host: Mike Freedman "Closing the Loop on Secure System Design" Abstract: Despite decades of research building secure operating systems, many deployed systems must still choose between flexible application APIs and security. As a result, the vast majority of programmers are unable to improve these systems. This is not merely a result of poor system building. It is hard to design highly extensible systems that are both secure and useful. Moreover, evaluating novel designs with actual developers is critical in order to make sure system builders can adopt research systems in practice. Fortunately, in emerging application domains, such as the Internet of Things, there are no entrenched operating systems and application portability is less important. This makes it possible evaluate research techniques for building more secure and extensible systems with developers who are willing to adopt them. I'll describe Tock, an operating system for microcontrollers that enables third-party developers to extend the system. Tock uses the Rust type-system to isolate kernel extensions and the hardware to isolate applications. I'll discuss how we continuously evaluate Tock by engaging with practitioners, and how lessons from practitioners have fed back into the system's design. Bio: Amit Levy is a PhD candidate in Computer Science at Stanford University. He builds secure operating system kernels, web platforms, and network systems that help make computers more programmable by third-party application developers.

1 0

Colloquium Speaker-Jose Faleiro, Monday, April 9
by Emily C. Lawrence 04 Apr '18

04 Apr '18

CS Department Colloquium Speaker Jose Faleiro from Yale University Monday, April 9, 2018 - 12:30pm Computer Science - Room 105 Host: Wyatt Lloyd "High Performance Serializable Transactions via Deterministic Execution" Abstract: Concurrency, the processing of multiple requests simultaneously, is one of the most challenging problems large-scale server applications face in practice. Accordingly, database systems research has long made the case for automatically handling concurrency in the database by guaranteeing serializability . Serializability shields applications from reasoning about concurrency, and allows developers to focus entirely on implementing application logic. Unfortunately, in the 40-plus years since its inception, serializability has not seen wide adoption in practice. This is because weaker guarantees, which expose applications to concurrency and the inevitable bugs that arise, perform significantly better. In this talk, I will discuss my research on addressing the performance limitations of serializability via deterministic transaction execution. Deterministic transaction execution exploits the fact that a large class of modern server applications do not require the full generality of conventional database transactions. By tailoring transaction execution mechanisms for this class of applications, my research shows that it is possible to achieve serializability with minimal performance overhead. I will first describe a serializable multi-versioning mechanism that decouples conflicting reads and writes, and subsequently outperforms a state-of-the-art implementation of the weaker guarantee of snapshot isolation by over 3x. Next, I will describe piecewise visibility, a concurrency control mechanism that isolates requests at a finer granularity than entire transactions, which consequently permits aggressive serializable transaction interleavings and outperforms the weaker guarantee of read committed by over 3x. Finally, I will discuss ongoing work that applies deterministic transaction execution principles to address replication lag in Facebook’s production MySQL infrastructure. Bio: Jose Faleiro is a PhD candidate in computer science at Yale University. His research interests are in data management systems, multi-core systems, and distributed systems. His thesis research investigates the use of deterministic execution to enable scalable and efficient transaction processing on main-memory multi-core database systems. In addition to his academic research at Yale, Jose has worked on large-scale real world systems, including Microsoft’s Orleans cloud programming framework, and Facebook’s production MySQL infrastructure. He is the recipient of the Alan J. Perlis Fellowship at Yale, and a Microsoft Research Tech Transfer Award. He has an undergraduate degree in computer science from the Birla Institute of Technology and Science (BITS), Pilani , India.a

1 0

Colloquium Speaker-Samira Khan, TODAY at 12:30pm
by Emily C. Lawrence 03 Apr '18

03 Apr '18

Samira Khan from the University of Virginia Tuesday, April 3, 2018 - 12:30pm Computer Science - Room 105 Host: Margaret Martonosi "Solving the DRAM Scaling Challenge" Abstract: Technology scaling of DRAM cells has enabled higher capacity memory for the last few decades. Unfortunately, DRAM cells become vulnerable to failure as they scale down to a smaller size. Enabling high-performance, energy-efficient, scalable memory systems without sacrificing the reliability is a major research challenge. My work focuses on designing a scalable memory system by rethinking the traditional assumptions in abstraction and separation of responsibilities across system layers. In this talk, I will discuss three fundamental ways to enable DRAM scaling. First, we can enable scaling by letting the manufacturers build smaller cells without providing any strict reliability guarantee. I envision manufacturers shipping DRAMs without fully ensuring correct operation, and the system being responsible for detecting and mitigating DRAM failures while operating in the field. However, designing such a system is difficult due to intermittent DRAM failures. In this talk, I will discuss a system design, capable of providing reliability guarantees even in the presence of intermittent failures. Second, we can enable high-capacity memory leveraging the emerging non-volatile memory technologies that are predicted to be more scalable. I will present my vision to redefine the hardware and operating system interface to unify memory and storage system with non-volatile memory and discuss the opportunities and challenges of such a system. Third, tolerating failures in the application can improve memory scalability. The fundamental challenge of such a system is how to assure, verify, and quantify the quality of the results. I envision a system that limits the impact of memory failures such that it is possible to statically determine the worst-case results from the maximum possible error in the input. Bio: Samira Khan is an Assistant Professor at the University of Virginia ( UVa ). Prior to joining UVa , she was a Post Doctoral Researcher at Carnegie Mellon University, funded by Intel Labs. Her research focuses on improving the performance, efficiency, and reliability of the memory system. She is the recipient of NSF CRII Award, NSF GOALI Award, and Rising Stars in EECS Award. She received her PhD from the University of Texas at San Antonio. During her graduate studies, she worked at Intel, AMD, and EPFL.

1 0

Reminder: Colloquium Speaker-Samira Khan, tomorrow at 12:30pm
by Emily C. Lawrence 02 Apr '18

02 Apr '18

Samira Khan from the University of Virginia Tuesday, April 3, 2018 - 12:30pm Computer Science - Room 105 Host: Margaret Martonosi "Solving the DRAM Scaling Challenge" Abstract: Technology scaling of DRAM cells has enabled higher capacity memory for the last few decades. Unfortunately, DRAM cells become vulnerable to failure as they scale down to a smaller size. Enabling high-performance, energy-efficient, scalable memory systems without sacrificing the reliability is a major research challenge. My work focuses on designing a scalable memory system by rethinking the traditional assumptions in abstraction and separation of responsibilities across system layers. In this talk, I will discuss three fundamental ways to enable DRAM scaling. First, we can enable scaling by letting the manufacturers build smaller cells without providing any strict reliability guarantee. I envision manufacturers shipping DRAMs without fully ensuring correct operation, and the system being responsible for detecting and mitigating DRAM failures while operating in the field. However, designing such a system is difficult due to intermittent DRAM failures. In this talk, I will discuss a system design, capable of providing reliability guarantees even in the presence of intermittent failures. Second, we can enable high-capacity memory leveraging the emerging non-volatile memory technologies that are predicted to be more scalable. I will present my vision to redefine the hardware and operating system interface to unify memory and storage system with non-volatile memory and discuss the opportunities and challenges of such a system. Third, tolerating failures in the application can improve memory scalability. The fundamental challenge of such a system is how to assure, verify, and quantify the quality of the results. I envision a system that limits the impact of memory failures such that it is possible to statically determine the worst-case results from the maximum possible error in the input. Bio: Samira Khan is an Assistant Professor at the University of Virginia ( UVa ). Prior to joining UVa , she was a Post Doctoral Researcher at Carnegie Mellon University, funded by Intel Labs. Her research focuses on improving the performance, efficiency, and reliability of the memory system. She is the recipient of NSF CRII Award, NSF GOALI Award, and Rising Stars in EECS Award. She received her PhD from the University of Texas at San Antonio. During her graduate studies, she worked at Intel, AMD, and EPFL.

1 0

Young Kun Ko PreFPO today, March 29, 2018 at 3:00 pm in CS402.
by Barbara A. Mooring 29 Mar '18

29 Mar '18

Young Kun Ko will present his PreFPO today, March 29, 2018 at 3:00 pm in CS402. Members of the Committee: Mark Braverman - Princeton University Omri Weinstein - Princeton University Gillat Kol - Princeton University Ran Raz - Princeton University Zeev Dvir - Princeton University All are welcomed to attend. Title : Hardness amplification for two prover game and communication complexity Abstract : Whether repeating a task n-times in parallel amplifies the complexity measure in question by n-times is a key technical challenge in complexity theory. >From computational perspective, we first investigate the power and limits of parallel repetition of two-prover games. We characterize the amortized behavior of the game via how much information one needs to win the game with good probability — providing an intuitive explanation on why odd-cycle game introduced by [Raz’07] serves as a counter-example to strong parallel repetition. As an alternative to parallel repetition, we investigate set-based repetition techniques. First we explore the applications of Birthday repetition, first introduced in [AIM’14] for quasi-polynomial time hardness results. Then as an alternative to parallel repetition, we introduce symmetric parallel repetition, that is parallel repetition without coordinates. We show that symmetric parallel repetition indeed beats parallel repetition in some regimes and odd-cycle game is not a counterexample for symmetric parallel repetition. This sheds some light on possible attack route for infamous Unique Games Conjecture. >From communication complexity perspective, we introduce semi-direct sum as a mean to amplify hardness for asymmetric communication. As an application, we reprove and improve the lower bound for \ell_\infty approximate nearest neighbor search. Barbara A. Mooring Interim Graduate Coordinator Computer Science Department Princeton University

1 0

Colloquium Speaker-Justin Johnson, TODAY at 12:30
by Emily C. Lawrence 29 Mar '18

29 Mar '18

CS Department Colloquium Speaker Justin Johnson from Stanford University Thursday, March 29, 2018 - 12:30pm Computer Science - Room 105 Host: Olga Russakovsky “Compositional Visual Intelligence” Abstract: The field of computer vision has made enormous progress in the last few years, largely due to convolutional neural networks. Despite success on traditional computer vision tasks, our systems are still a long way from the general visual intelligence of people. I will argue that an important facet of visual intelligence is composition - understanding of the whole derives from an understanding of the parts. To achieve the goal of compositional visual intelligence, we must explore new computer vision tasks, create new datasets, and develop new models that exploit compositionality. I will discuss the Visual Genome dataset which we created in service of these goals, and three research directions enabled by this new data where incorporating compositionality results in systems with richer visual intelligence. I will first discuss image captioning: traditional systems generate short sentences describing images, but by decomposing images into regions and descriptions into phrases we can that generate two types of richer descriptions: dense captions and paragraphs. Second, I will discuss visual question answering: existing datasets (including Visual Genome) consist primarily of short, simple questions; to study more complex questions requiring compositional reasoning, we built the CLEVR dataset and show that existing methods fall short on this new benchmark. We then propose an explicitly compositional model for visual question answering that internally converts questions to functional programs, and executes these programs by composing neural modules. Third, I will discuss text-to-image synthesis: existing systems can generate simple images of a single object conditioned on text descriptions, but struggle with more complex descriptions. By replacing freeform natural language with compositional scene graphs of objects and relationships, we can generate complex images containing multiple objects. I will conclude by discussing future areas where compositionality can be used to enrich visual intelligence. Bio: Justin is a PhD candidate in Computer Science at Stanford University, advised by Fei-Fei Li. His research interests lie at the intersection of computer vision and machine learning. Since 2015 he has co-taught a Stanford course on convolutional neural networks and deep learning with Andrej Karpathy , Serena Yeung, and Fei-Fei Li which has been viewed hundreds of thousands of times online. He received his BS in Mathematics and Computer Science at the California Institute of Technology, and during his PhD he has spent time at Google Cloud AI, Facebook AI Research, and Yahoo Research.

1 0

Reminder: Colloquium Speaker-Justin Johnson, tomorrow at 12:30
by Emily C. Lawrence 28 Mar '18

28 Mar '18

CS Department Colloquium Speaker Justin Johnson from Stanford University Thursday, March 29, 2018 - 12:30pm Computer Science - Room 105 Host: Olga Russakovsky “Compositional Visual Intelligence” Abstract: The field of computer vision has made enormous progress in the last few years, largely due to convolutional neural networks. Despite success on traditional computer vision tasks, our systems are still a long way from the general visual intelligence of people. I will argue that an important facet of visual intelligence is composition - understanding of the whole derives from an understanding of the parts. To achieve the goal of compositional visual intelligence, we must explore new computer vision tasks, create new datasets, and develop new models that exploit compositionality. I will discuss the Visual Genome dataset which we created in service of these goals, and three research directions enabled by this new data where incorporating compositionality results in systems with richer visual intelligence. I will first discuss image captioning: traditional systems generate short sentences describing images, but by decomposing images into regions and descriptions into phrases we can that generate two types of richer descriptions: dense captions and paragraphs. Second, I will discuss visual question answering: existing datasets (including Visual Genome) consist primarily of short, simple questions; to study more complex questions requiring compositional reasoning, we built the CLEVR dataset and show that existing methods fall short on this new benchmark. We then propose an explicitly compositional model for visual question answering that internally converts questions to functional programs, and executes these programs by composing neural modules. Third, I will discuss text-to-image synthesis: existing systems can generate simple images of a single object conditioned on text descriptions, but struggle with more complex descriptions. By replacing freeform natural language with compositional scene graphs of objects and relationships, we can generate complex images containing multiple objects. I will conclude by discussing future areas where compositionality can be used to enrich visual intelligence. Bio: Justin is a PhD candidate in Computer Science at Stanford University, advised by Fei-Fei Li. His research interests lie at the intersection of computer vision and machine learning. Since 2015 he has co-taught a Stanford course on convolutional neural networks and deep learning with Andrej Karpathy , Serena Yeung, and Fei-Fei Li which has been viewed hundreds of thousands of times online. He received his BS in Mathematics and Computer Science at the California Institute of Technology, and during his PhD he has spent time at Google Cloud AI, Facebook AI Research, and Yahoo Research.

1 0