Stavros Harizopoulos M.I.T.

Slides:



Advertisements
Similar presentations
Communication-Avoiding Algorithms Jim Demmel EECS & Math Departments UC Berkeley.
Advertisements

1 Optimizing compilers Managing Cache Bercovici Sivan.
Arjun Suresh S7, R College of Engineering Trivandrum.
Exadata Distinctives Brown Bag New features for tuning Oracle database applications.
Daniel Schall, Volker Höfner, Prof. Dr. Theo Härder TU Kaiserslautern.
Challenges and Opportunities for System Software in the Multi-Core Era or The Sky is Falling, The Sky is Falling!
Operating Systems ECE344 Ding Yuan Final Review Lecture 13: Final Review.
Out-of core Streamline Generation Using Flow-guided File Layout Chun-Ming Chen 788 Project 1.
What Do You See In The Lab? Adapted by Mrs. Christie from the story Brown Bear, Brown Bear by Bill Martin, Jr.
Shimin Chen Big Data Reading Group.  Energy efficiency of: ◦ Single-machine instance of DBMS ◦ Standard server-grade hardware components ◦ A wide spectrum.
Recap.
Welcome to CS201!!! Introduction to Programming Using Visual Basic.
1 External Sorting for Query Processing Yanlei Diao UMass Amherst Feb 27, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
The Power of Magazine Advertising for brand building 1.
Energy Model for Multiprocess Applications Texas Tech University.
Optimizing RAM-latency Dominated Applications
Analyzing the Energy Efficiency of a Database Server Hanskamal Patel SE 521.
Tape is Dead Disk is Tape Flash is Disk RAM Locality is King Jim Gray Microsoft December 2006 Presented at CIDR2007 Gong Show
C-Store: Column Stores over Solid State Drives Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY Jun 19, 2009.
Flash research report Da Zhou Outline Query Processing Techniques for Solid St ate Drives (Research Paper) Join Processing for Flash SSDs: Rememb.
© Stavros Harizopoulos 2006 Performance Tradeoffs in Read-Optimized Databases Stavros Harizopoulos MIT CSAIL joint work with: Velen Liang, Daniel Abadi,
CS 153 Design of Operating Systems Spring 2015 Final Review.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 1 Introduction Read:
10 Things All BI Administrators Should Know Robert L Davis.
Performance Tradeoffs in Read-Optimized Databases Stavros Harizopoulos * MIT CSAIL joint work with: Velen Liang, Daniel Abadi, and Sam Madden massachusetts.
© Stavros Harizopoulos 2006 Performance Tradeoffs in Read- Optimized Databases: from a Data Layout Perspective Stavros Harizopoulos MIT CSAIL Modified.
So far we have covered … Basic visualization algorithms Parallel polygon rendering Occlusion culling They all indirectly or directly help understanding.
I/O Management and Disk Structure Introduction to Operating Systems: Module 14.
CS Operating System & Database Performance Tuning Xiaofang Zhou School of Computing, NUS Office: S URL:
Database Systems Carlos Ordonez. What is “Database systems” research? Input? large data sets, large files, relational tables How? Fast external algorithms;
Implications of Emerging Hardware Tom Wenisch (University of Michigan) Nikos Hardavellas (Northwestern University) Sangyeun Cho (University of Pittsburgh)
Memory Hierarchy Adaptivity An Architectural Perspective Alex Veidenbaum AMRM Project sponsored by DARPA/ITO.
Processor Level Parallelism. Improving the Pipeline Pipelined processor – Ideal speedup = num stages – Branches / conflicts mean limited returns after.
CS 153 Design of Operating Systems Spring 2015 Final Review 2.
Rensselaer Polytechnic Institute CSC 432 – Operating Systems David Goldschmidt, Ph.D.
Operating Systems ECE344 Ding Yuan Final Review Lecture 13: Final Review.
Operating Systems: Wrap-Up Questions answered in this lecture: What is an Operating System? Why are operating systems so interesting? What techniques can.
Mapping the Data Warehouse to a Multiprocessor Architecture
CS 390 Unix Programming Environment
Hybrid Multi-Core Architecture for Boosting Single-Threaded Performance Presented by: Peyman Nov 2007.
Embedded System Lab. 오명훈 Addressing Shared Resource Contention in Multicore Processors via Scheduling.
Computer Organization CS224 Fall 2012 Lesson 52. Introduction  Goal: connecting multiple computers to get higher performance l Multiprocessors l Scalability,
Lecture 27 Multiprocessor Scheduling. Last lecture: VMM Two old problems: CPU virtualization and memory virtualization I/O virtualization Today Issues.
1 Cache-Oblivious Query Processing Bingsheng He, Qiong Luo {saven, Department of Computer Science & Engineering Hong Kong University of.
On Transactional Memory, Spinlocks and Database Transactions Khai Q. Tran Spyros Blanas Jeffrey F. Naughton (University of Wisconsin Madison)
Spiros Papadimitriou Google Research Project re:Cycle Recycling CPU Cycles Stavros Harizopoulos HP Labs.
Lecture 1: Introduction CprE 585 Advanced Computer Architecture, Fall 2004 Zhao Zhang.
Processor Level Parallelism 2. How We Got Here Developments in PC CPUs.
Ramesh Meyyappan SQL Server Performance Tuning Consultant & Trainer SQLWorkshops.comSQLWorkshops.com / SQLIO.comSQLIO.com.
- History and Motivations
Introduction to Parallel Computing: MPI, OpenMP and Hybrid Programming
So far we have covered … Basic visualization algorithms
Auburn University COMP7500 Advanced Operating Systems I/O-Aware Load Balancing Techniques (2) Dr. Xiao Qin Auburn University.
“the free coffee is over”
Outline Every Joule is Previous: The Case for Revisiting Operating System Design for Energy Efficiency 19-Sep-18 Ubiquitous Computing.
Lecture 28: Virtual Memory-Address Translation
Mapping the Data Warehouse to a Multiprocessor Architecture
Hard Disk Drive Property Notes Insert Image Type of Storage
Lecture 27: Virtual Memory
ECE 445 – Computer Organization
CSC Classes Required for TCC CS Degree
Simulation of computer system
KISS-Tree: Smart Latch-Free In-Memory Indexing on Modern Architectures
Computer system 돈벌자
موضوع: تفكر مثبت استاد: جناب آقای مهندس عطار محقق: انيس مهديپور.
Tape is Dead Disk is Tape Flash is Disk RAM Locality is King
(A Research Proposal for Optimizing DBMS on CMP)
Tape is Dead Disk is Tape Flash is Disk RAM Locality is King
Optimal Co-design of FPGA Implementations for MPC
Presentation transcript:

Stavros Harizopoulos M.I.T. Beyond cache-consciousness Stavros Harizopoulos M.I.T.

Cache-conscious DB research Page layouts Cache partitioning algorithms Cache-conscious indexes But is this still the tip of the iceberg?

Hardware advances e.g., L2 data prefetcher: Main Memory 6GB/sec!! CPU cache L1 6GB/sec!!

So, are we reaching a point of diminishing returns? Amdahl’s law stall #1 stall #2 total CPU time at most X% So, are we reaching a point of diminishing returns?

There are more important challenges Many-core CPUs (think 100s) Parallelization (you think this is solved?) Resource management Scheduling!! Flash drives Flash drives are going to be the new disk drives Disk drives are going to be the old tape drives Revisit query processing, energy-aware techniques

Shameless self-advertising I am in the job market! I am interested in both Academia & Labs US & Europe PhD @ CMU, PostDoc @ MIT http://nms.csail.mit.edu/~stavros