main memory adaptive indexing for multi core systems
play

Main Memory Adaptive Indexing for Multi-core Systems Felix Martin - PowerPoint PPT Presentation

Dec 27, 2023 •447 likes •1.98k views

SIGMOD DaMoN 23.06.2014 Main Memory Adaptive Indexing for Multi-core Systems Felix Martin Schuhknecht Victor Alvarez Jens Dittrich Stefan Richter Information Systems Group Saarland University https://infosys.uni-saarland.de/ Problem:

  1. Single-threaded algorithms 1 Thread, 100 Million Elements 25 Accumulated Query Response Time [s] Standard Cracking (SC) Hybrid Crack Sort (HCS) Coarse-granular Index (CGI) 20 Radix Sort (RS) STL std::sort (STL-S) 15 10 5 0 1 10 100 1000 10000 Query Sequence [The Uncracked Pieces in Database Cracking. F. M. Schuhknecht, A. Jindal, J. Dittrich. In PVLDB 2013] 9 / 30

  2. Single-threaded algorithms 1 Thread, 100 Million Elements 25 Accumulated Query Response Time [s] Standard Cracking (SC) Hybrid Crack Sort (HCS) Coarse-granular Index (CGI) 20 Radix Sort (RS) STL std::sort (STL-S) 15 750 Queries 10 5 0 1 10 100 1000 10000 Query Sequence [The Uncracked Pieces in Database Cracking. F. M. Schuhknecht, A. Jindal, J. Dittrich. In PVLDB 2013] 9 / 30

  3. Single-threaded algorithms 1 Thread, 100 Million Elements 25 Accumulated Query Response Time [s] Standard Cracking (SC) Hybrid Crack Sort (HCS) Coarse-granular Index (CGI) 20 Radix Sort (RS) STL std::sort (STL-S) 15 750 Queries > 10000 10 Queries 5 0 1 10 100 1000 10000 Query Sequence [The Uncracked Pieces in Database Cracking. F. M. Schuhknecht, A. Jindal, J. Dittrich. In PVLDB 2013] 9 / 30

  4. Multi-threaded environments? Multi-threaded algorithms! 10 / 30

  5. Multi-threaded algorithms: Parallel Standard Cracking (P-SC) [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  6. Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Q1 [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  7. Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Q1 Q2 [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  8. Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Q1 T1 Q2 T2 [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  9. Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Requested Locks Q1 Q2 W Q1 R T1 R W R R R R Q2 T2 W R W [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  10. � � Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Requested Locks Q1 Q2 ✓ W Q1 ✓ R T1 ⚡ R W ✓ R R ✓ R R Q2 T2 ⚡ W R ✓ W [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  11. � � Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Requested Locks Q1 Q2 ✓ W Q1 ✓ R T1 ⚡ R W ✓ Inter-query R R parallelism ✓ R R Q2 T2 ⚡ W R ✓ W [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  12. � � Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Requested Locks Q1 Q2 ✓ W Q1 ✓ R T1 ⚡ R W ✓ Inter-query R R parallelism Lock ✓ contention R R Q2 T2 ⚡ W R ✓ W [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  13. � � Multi-threaded algorithms: Parallel Standard Cracking (P-SC) Requested Locks Q1 Q2 ✓ W Q1 ✓ R T1 ⚡ R W ✓ Inter-query R R parallelism Lock ✓ contention R R Q2 T2 ⚡ W R ✓ W Underutilize resources (T3, T4, T5, ...) [Concurrency control for adaptive indexing. G.Graefe, F.Halim, S.Idreos, H.Kuno, S.Manegold. In PVLDB 2013] 11 / 30

  14. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Query 12 / 30

  15. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Cracker Index Cracker Index Query Cracker Index Cracker Index k Chunks 12 / 30

  16. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Cracker Index Cracker Index Query Cracker Index Cracker Index k Chunks 12 / 30

  17. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Index T2 Cracker Index Query T3 Cracker Index Tk Cracker Index k Chunks 12 / 30

  18. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Local Result Cracker Index T2 Local Result Cracker Index Query T3 Local Result Cracker Index Tk Local Result Cracker Index k Chunks 12 / 30

  19. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Index T2 Cracker Index Query T3 Cracker Index Tk Cracker Index k Chunks 12 / 30

  20. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Index T2 Cracker Index Query T3 Cracker Index Tk Cracker Index k Chunks 13 / 30

  21. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Index T2 Cracker Index Query T3 Cracker Index Tk Cracker Index k Chunks 13 / 30

  22. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Index T2 Cracker Index Complete Query independence T3 Cracker Index Tk Cracker Index k Chunks 13 / 30

  23. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Fully utilize Index resources T2 Cracker Index Complete Query independence T3 Cracker Index Tk Cracker Index k Chunks 13 / 30

  24. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Fully utilize Index resources T2 Cracker Index Complete Query independence T3 Cracker Index No Tk consecutive Cracker Index result k Chunks 13 / 30

  25. Micro Benchmark Reading 1% from k locations using one thread 10 7.5 Time [s] 5 2.5 0 1 10 100 1000 10000 100000 1000000 Number of Chunks (k) 14 / 30

  26. Micro Benchmark Reading 1% from k locations using one thread 10 7.5 Time [s] 5 No problem for realistic k 2.5 0 1 10 100 1000 10000 100000 1000000 Number of Chunks (k) 14 / 30

  27. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) A 15 / 30

  28. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) A Index(A) Index on A 1. Range-partition while copying 1024 partitions 15 / 30

  29. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) A Index(A) Index on A 1. Range-partition while copying Cracker Index 1024 partitions 15 / 30

  30. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) A Index(A) Index on A 1. Range-partition while copying Cracker Index Query 2. Perform P-SC 1024 partitions 15 / 30

  31. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) A Index(A) Index on A 1. Range-partition while copying Cracker Index W Query R 2. Perform P-SC R W 1024 partitions 15 / 30

  32. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) A Index(A) Like starting ... Index on A 1. Range-partition while copying Cracker Index W Query R ... after 1000 2. Perform P-SC R cracks W 1024 partitions 15 / 30

  33. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) Reduces lock contention of P-SC A Index(A) Like starting ... Index on A 1. Range-partition while copying Cracker Index W Query R ... after 1000 2. Perform P-SC R cracks W 1024 partitions 15 / 30

  34. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) Reduces lock contention of P-SC A Index(A) Like starting ... Index on A 1. Range-partition while copying Cracker Index W Query R ... after 1000 2. Perform P-SC R cracks W 1024 partitions Reduces Variance 15 / 30

  35. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) Reduces lock contention of P-SC Adds (small) A Index(A) initialization time Like starting ... Index on A 1. Range-partition while copying Cracker Index W Query R ... after 1000 2. Perform P-SC R cracks W 1024 partitions Reduces Variance 15 / 30

  36. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI) Reduces lock contention of P-SC Adds (small) A Index(A) initialization time Like starting ... Index on A 1. Range-partition while copying Cracker Index How to do? W Query R ... after 1000 2. Perform P-SC R cracks W 1024 partitions Reduces Variance 15 / 30

  37. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements n t 1 Thread 1 # Threads (k) k Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 . . . t k Thread k . . . t k Thread k 16 / 30

  38. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements n t 1 Thread 1 # Threads (k) k Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 1. Build Histogram . . . t k Thread k . . . t k Thread k 16 / 30

  39. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements Range-partition n t 1 Thread 1 # Threads (k) k Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 1. Build Histogram . . . t k Thread k . . . t k Thread k 16 / 30

  40. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements Range-partition n t 1 Thread 1 # Threads (k) k Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 1. Build Histogram . . . t k Thread k 2. Copy entries . . . t k Thread k 16 / 30

  41. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements Range-partition n t 1 Thread 1 # Threads (k) k Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 1. Build Histogram . . . t k Thread k 2. Copy entries . . . t k Thread k 16 / 30

  42. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements Range-partition n t 1 Thread 1 # Threads (k) k Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 1. Build Histogram . . . t k Thread k 2. Copy entries . . . No locks required t k Thread k 16 / 30

  43. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements Range-partition n t 1 Thread 1 # Threads (k) k Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 1. Build Histogram . . . t k Thread k 2. Copy entries . . . No locks required Fully utilize t k Thread k resources 16 / 30

  44. Multi-threaded algorithms: Parallel Coarse-Granular Index (P-CGI): Parallel Range Partitioning Source Destination A B # Elements Range-partition n t 1 Thread 1 # Threads (k) k NUMA- fragmented memory Thread 2 t 2 t 1 Thread 1 t 2 Thread 2 1. Build Histogram . . . t k Thread k 2. Copy entries . . . No locks required Fully utilize t k Thread k resources 16 / 30

  45. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) T1 Cracker Index T2 Cracker Index T3 Cracker Index Tk Cracker Index k Chunks 17 / 30

  46. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Coarse-Granular Index (P-CCGI) T1 Cracker Index T2 Cracker Index T3 Cracker Index Tk Cracker Index k Chunks 17 / 30

  47. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Coarse-Granular Index (P-CCGI) Range-partitioning T1 Cracker Index T2 Cracker Index T3 Cracker Index Tk Cracker Index k Chunks 17 / 30

  48. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Coarse-Granular Index (P-CCGI) Range-partitioning T1 Cracker Index T2 Cracker Index Query T3 Cracker Index Tk Cracker Index k Chunks 17 / 30

  49. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Coarse-Granular Index (P-CCGI) Range-partitioning T1 Local Result Cracker Index T2 Local Result Cracker Index Query T3 Local Result Cracker Index Tk Local Result Cracker Index k Chunks 17 / 30

  50. Multi-threaded algorithms: Parallel-chunked Standard Cracking (P-CSC) Coarse-Granular Index (P-CCGI) P-CSC + Range Partitioning Range-partitioning T1 Local Result Cracker Index T2 Local Result Cracker Index Query T3 Local Result Cracker Index Tk Local Result Cracker Index k Chunks 17 / 30

  51. Multi-threaded algorithms: Parallel Range-Partitioned Radix Sort (P-RPRS) A 18 / 30

  52. Multi-threaded algorithms: Parallel Range-Partitioned Radix Sort (P-RPRS) A Index(A) 1. Range-partition while copying 1024 partitions 18 / 30

  53. Multi-threaded algorithms: Parallel Range-Partitioned Radix Sort (P-RPRS) Index(A) A Index(A) 2. Perform in-place 1. Range-partition radix sort on while copying each partition Fully sorted 1024 partitions 18 / 30

  54. Multi-threaded algorithms: Parallel Range-Partitioned Radix Sort (P-RPRS) Index(A) A Index(A) 2. Perform in-place 1. Range-partition radix sort on while copying each partition shared with P-CCGI Fully sorted 1024 partitions 18 / 30

Recommend

Merging Whats Cracked, Cracking Whats Merged Adaptive Indexing in Main-Memory Column-Stores

Merging Whats Cracked, Cracking Whats Merged Adaptive Indexing in Main-Memory Column-Stores

Merging Whats Cracked, Cracking Whats Merged Adaptive Indexing in Main-Memory Column-Stores Stratos Idreos, Stefan Manegold, (CWI) Harumi Kuno, Goetz Graefe (HP Labs) PVLDB 2011, 4(9) Physical design problem Database systems perform

1.24k views • 122 slides
Optimizing Application Performance in Large Multi-core Systems Waiman Long / Aug 19, 2015 HP

Optimizing Application Performance in Large Multi-core Systems Waiman Long / Aug 19, 2015 HP

Optimizing Application Performance in Large Multi-core Systems Waiman Long / Aug 19, 2015 HP Server Performance & Scalability Team Version 1.1 1 Agenda 1. Why Optimizing for Multi-Core Systems 2. Non-Uniform Memory Access (NUMA) 3.

313 views • 28 slides
Scalable Dense Matrix Multiplication on Multi-Socket Many-Core Systems with Fast Shared Memory

Scalable Dense Matrix Multiplication on Multi-Socket Many-Core Systems with Fast Shared Memory

Scalable Dense Matrix Multiplication on Multi-Socket Many-Core Systems with Fast Shared Memory Ricardo Magana, Natalia Vassilieva Acknowledgment Ricardo Magaa magania@gmail.com And also many thanks to prof. Robert Van De Geijn, Field Van

529 views • 26 slides
Motivation Memory is a shared resource Core Core Memory Core Core Threads requests

Motivation Memory is a shared resource Core Core Memory Core Core Threads requests

Thread Cluster Memory Scheduling : Exploiting Differences in Memory Access Behavior Yoongu Kim Michael Papamichael Onur Mutlu Mor Harchol-Balter Motivation Memory is a shared resource Core Core Memory Core Core Threads requests

738 views • 48 slides
Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems By Thomas

Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems By Thomas

Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems By Thomas Neumann, Tobias Mhlbauer, Alfons Kemper Presented by Samodya Abeysiriwardane Transaction Isolation ACID (Atomicity, Consistency, Isolation,

379 views • 20 slides
Efficient Wake-Up Scheduling for Efficient Wake-Up Scheduling for Multi-Core Systems Multi-Core

Efficient Wake-Up Scheduling for Efficient Wake-Up Scheduling for Multi-Core Systems Multi-Core

TH EDA Efficient Wake-Up Scheduling for Efficient Wake-Up Scheduling for Multi-Core Systems Multi-Core Systems Ming-Chao Lee*, Yiyu Shi**, Yu-Guan Chen*, Diana Marculescu***, Shih-Chieh Chang* * Dept. of CS, National Tsing Hua

338 views • 21 slides
Chapter 9: Memory Questions? What is main memory? CSCI [4|6]730 How does multiple

Chapter 9: Memory Questions? What is main memory? CSCI [4|6]730 How does multiple

Chapter 9: Memory Questions? What is main memory? CSCI [4|6]730 How does multiple processes share memory Operating Systems space? What is static and dynamic allocation? What is segmentation ? Main Memory 2 Maria

117 views • 10 slides
Cache Systems CPU Main Main CPU Memory Memory 400MHz 10MHz Cache 10MHz Memory Hierarchy

Cache Systems CPU Main Main CPU Memory Memory 400MHz 10MHz Cache 10MHz Memory Hierarchy

Cache Systems CPU Main Main CPU Memory Memory 400MHz 10MHz Cache 10MHz Memory Hierarchy Design Bus 66MHz Bus 66MHz Chapter 5 and Appendix C Data object Block transfer transfer Main CPU Cache Memory 1 4 Example: Two-level

353 views • 10 slides
Memory II. Memory improvement III. Problems with memory 3 systems/stages of Memory: memory

Memory II. Memory improvement III. Problems with memory 3 systems/stages of Memory: memory

Main Focus I. Memory as a process Memory II. Memory improvement III. Problems with memory 3 systems/stages of Memory: memory the process by which I. Sensory Memory information is - acquired, II. Short -Term Memory - stored,

169 views • 5 slides
Memory Questions? ! What is main memory? CSCI [4|6]730 ! How does multiple processes share memory

Memory Questions? ! What is main memory? CSCI [4|6]730 ! How does multiple processes share memory

Memory Questions? ! What is main memory? CSCI [4|6]730 ! How does multiple processes share memory Operating Systems space? Key is how do they refer to memory addresses? ! What is static and dynamic allocation? Main Memory ! What is

285 views • 10 slides
CSCI [4|6]730 Operating Systems Main Memory Maria Hybinette, UGA Maria Hybinette, UGA Memory

CSCI [4|6]730 Operating Systems Main Memory Maria Hybinette, UGA Maria Hybinette, UGA Memory

CSCI [4|6]730 Operating Systems Main Memory Maria Hybinette, UGA Maria Hybinette, UGA Memory Questions? What is main memory? How does multiple processes share memory space? Key is how do they refer to the memory addresses.

759 views • 31 slides
Lecture 25: Multi-core Processors Todays topics: Writing parallel programs SMT

Lecture 25: Multi-core Processors Todays topics: Writing parallel programs SMT

Lecture 25: Multi-core Processors Todays topics: Writing parallel programs SMT Multi-core examples Reminder: Assignment 9 due Tuesday 1 Shared-Memory Vs. Message-Passing Shared-memory: Well-understood programming

240 views • 20 slides
Memory Access Pattern-Aware DRAM Performance Model for Multi-core Systems ISPASS 2011 Hyojin Choi

Memory Access Pattern-Aware DRAM Performance Model for Multi-core Systems ISPASS 2011 Hyojin Choi

Memory Access Pattern-Aware DRAM Performance Model for Multi-core Systems ISPASS 2011 Hyojin Choi * , Jongbok Lee + , and Wonyong Sung * hjchoi@dsp.snu.ac.kr, jblee@hansung.ac.kr, wysung@snu.ac.kr * Seoul National University, + Hansung University

202 views • 19 slides
Memory Systems in the Many-Core Era: Some Challenges and Solution Directions Onur Mutlu

Memory Systems in the Many-Core Era: Some Challenges and Solution Directions Onur Mutlu

Memory Systems in the Many-Core Era: Some Challenges and Solution Directions Onur Mutlu http://www.ece.cmu.edu/~omutlu June 5, 2011 ISMM/MSPC Modern Memory System: A Shared Resource 2 The Memory System n The memory system is a fundamental

827 views • 64 slides
Memory Questions? What is main memory? CSCI [4|6]730 How does multiple processes share

Memory Questions? What is main memory? CSCI [4|6]730 How does multiple processes share

Memory Questions? What is main memory? CSCI [4|6]730 How does multiple processes share memory space? Operating Systems Key is how do they refer to the memory addresses. Utilizing memory access for everyone! Dynamically! What

338 views • 16 slides
Memory Access Latency Joshua San Miguel Natalie Enright Jerger Chip Multiprocessor main memory

Memory Access Latency Joshua San Miguel Natalie Enright Jerger Chip Multiprocessor main memory

Load Value Approximation: Approaching the Ideal Memory Access Latency Joshua San Miguel Natalie Enright Jerger Chip Multiprocessor main memory shared caches, network-on-chip private cache miss private cache private cache core core core

482 views • 18 slides
Multi-language Applications and Systems Chandra Krintz Laboratory for Research on Adaptive

Multi-language Applications and Systems Chandra Krintz Laboratory for Research on Adaptive

Multi-language Applications and Systems Chandra Krintz Laboratory for Research on Adaptive Compilation Environments (RACE) Computer Science Dept. Univ. of California, Santa Barbara VEESC September 3, 2010 Modern Software and Systems

827 views • 34 slides
1 Main memory usually divided into two partitions: Resident operating system, usually

1 Main memory usually divided into two partitions: Resident operating system, usually

Programs must be brought (from disk) into memory for them to be run Main memory and registers are only storage CPU can access directly Register access in one CPU clock (or less) Main memory can take many cycles Cache sits

285 views • 7 slides
Encrypted Non-volatile Main Memory Systems Yu Hua Huazhong University of Science and Technology

Encrypted Non-volatile Main Memory Systems Yu Hua Huazhong University of Science and Technology

Encrypted Non-volatile Main Memory Systems Yu Hua Huazhong University of Science and Technology https://csyhua.github.io/ Non-volatile Memory (NVM) Non-volatile memory is expected to replace or complement DRAM in memory hierarchy

847 views • 41 slides
Optimizing Out-of-Core Nearest Neighbor Problems on Multi-GPU Systems Using NVLink Rajesh

Optimizing Out-of-Core Nearest Neighbor Problems on Multi-GPU Systems Using NVLink Rajesh

Optimizing Out-of-Core Nearest Neighbor Problems on Multi-GPU Systems Using NVLink Rajesh Bordawekar IBM T. J. Watson Research Center bordaw@us.ibm.com Pidad DSouza IBM Systems pidsouza@in.ibm.com 1 Outline Out-of-core GPU

291 views • 25 slides
MIDAS: Multi-Attribute Indexing for Distributed Architecture Systems George Tsatsanifos (NTUA)

MIDAS: Multi-Attribute Indexing for Distributed Architecture Systems George Tsatsanifos (NTUA)

MIDAS: Multi-Attribute Indexing for Distributed Architecture Systems George Tsatsanifos (NTUA) Dimitris Sacharidis (R.C. Athena) Timos Sellis (NTUA, R.C. Athena) 12 th International Symposium on Spatial and Temporal Databases

587 views • 36 slides
Main Memory: Address Translation (Chapter 8) CS 4410 Operating Systems Cant We All Just Get

Main Memory: Address Translation (Chapter 8) CS 4410 Operating Systems Cant We All Just Get

Main Memory: Address Translation (Chapter 8) CS 4410 Operating Systems Cant We All Just Get Along? Physical Reality: different processes/threads share the same hardware need to multiplex CPU (temporal) Memory (spatial) Disk

386 views • 38 slides
Main Memory Tevfik Ko ar Louisiana State University February 28 th , 2008 1 Memory

Main Memory Tevfik Ko ar Louisiana State University February 28 th , 2008 1 Memory

CSC 4103 - Operating Systems Spring 2008 Lecture - XI Main Memory Tevfik Ko ar Louisiana State University February 28 th , 2008 1 Memory Management Requirements The O/S must fit multiple processes in memory memory needs to be

467 views • 11 slides
Main Memory: Address Translation (Chapter 12-17) CS 4410 Operating Systems Cant We All Just

Main Memory: Address Translation (Chapter 12-17) CS 4410 Operating Systems Cant We All Just

Main Memory: Address Translation (Chapter 12-17) CS 4410 Operating Systems Cant We All Just Get Along? Physical Reality: different processes/threads share the same hardware need to multiplex CPU (temporal) Memory (spatial)

513 views • 37 slides

More recommend