PPT-Low Depth Cache-Oblivious Algorithms

Guy E Blelloch Phillip B Gibbons Harsha Vardhan Simhadri Slides by Endrias Kahssay Why Parallel Cache Oblivious Algorithms Modern machines have multiple layers of cache L1 L2 L3 Roughly 4 cycles 10 cycles and 40 cycles respectively . Xiao Shaun Wang, . Kartik . Nayak. , Chang Liu, T-H. Hubert Chan, Elaine Shi, Emil . Stefanov. , Yan Huang. 1. Emails. Photos. Videos. Financial data. Medical records. Genome data. ……. Sensitive Data in the Cloud. Jayesh Gaur. 1. , . Mainak Chaudhuri. 2. , Sreenivas Subramoney. 1. 1. Intel Architecture Group,. Intel Corporation, Bangalore, India. 2. Department of Computer Science and Engineering,. Indian Institute of Technology Kanpur, India. : Parallel Secure Computation Made Easy. . Kartik . Nayak. With Xiao . Shaun . Wang, . Stratis. Ioannidis, Udi . Weinsberg. , Nina Taft, Elaine Shi. 1. 2. Users. Data. Data. Privacy concern!. Data Mining Engine. Erin Carson, Jim Demmel, Laura . Grigori. , Nick Knight, . Penporn. . Koanantakool. , . Oded. Schwartz, . Harsha. . Simhadri. Slides based on. ASPIRE Retreat, June 2015. 1. Outline. Strassen. A Dissection and Experimental Evaluation. Zhao Chang, Dong Xie, Feifei Li. Introduction. A lot of “. big. ” data. Rise of . cloud computing. Pay-as-you-go model . for . public clouds. Outsourced. Alejandro . López. -Ortiz , . Alejandro Salinger. University . of Waterloo. Outline. Paging . Paging . with cache usage. Interval Scheduling. Online algorithms. Simulations. Conclusions. 2. Paging. 3. ECE/CS 498AM. University of Illinois. Problem:. Software piracy. Oded. . Goldreich. :. Existing “solutions” are ad-hoc. What is the minimal protected hardware required?. Approach:. Physically-shielded (i.e., tamper-proof) CPU. . Kartik . Nayak. With Xiao . Shaun . Wang, . Stratis. Ioannidis, Udi . Weinsberg. , Nina Taft, Elaine Shi. 1. 2. Users. Data. Data. Privacy concern!. Data Mining Engine. Data Model. Data Mining on User Data. . Kartik . Nayak. With Xiao . Shaun . Wang, . Stratis. Ioannidis, Udi . Weinsberg. , Nina Taft, Elaine Shi. 1. 2. Users. Data. Data. Privacy concern!. Data Mining Engine. Data Model. Data Mining on User Data. Xiao Shaun Wang, . Kartik . Nayak. , Chang Liu, T-H. Hubert Chan, Elaine Shi, Emil . Stefanov. , Yan Huang. 1. Emails. Photos. Videos. Financial data. Medical records. Genome data. ……. Sensitive Data in the Cloud. with Applications to . Private Set Intersection. Vladimir Kolesnikov (Bell Labs), . Ranjit Kumaresan (MIT), . Mike Rosulek (Oregon State University). Ni Trieu . (Oregon State University). 1. Private Set Intersection (PSI). Caching Problem. Yin Tat Lee. 1. 2. Last Lecture. Greedy . Analysis Strategies. Greedy algorithm stays ahead: Induction. Structural: Come up with a lower bound. Exchange argument: transform OPT to . greedy. Yin Tat Lee. 1. 2. Optimal Caching/Paging. Memory systems . Many levels of storage with different access times. Smaller storage has shorter access time. To access an item it must be brought to the lowest level of the memory system. CS 295: Modern Systems Cache-Efficient Algorithms Sang-Woo Jun Spring, 2019 Back To The Matrix Multiplication Example Blocked matrix multiplication recap C1 sub-matrix = A1×B11 + A1×B21 + A1×B31 …