fact a dsl for timing sensitive computation
play

FaCT: A DSL for Timing-Sensitive Computation Sunjay Cauligi , UC San - PowerPoint PPT Presentation

Oct 02, 2023 •37 likes •1.26k views

FaCT: A DSL for Timing-Sensitive Computation Sunjay Cauligi , UC San Diego Gary Soeller, Brian Johannesmeyer, Fraser Brown, Riad Wahby, John Renner, Benjamin Gregoire, Gilles Barthe, Ranjit Jhala, Deian Stefan What does this code do? for (i =

  1. Transform everything? Slower but necessary if (secret) { x = -secret & 19 | (secret-1) & x; x = 19; } if (public) { y = -public & 42 | (public-1) & y; y = 42; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  2. Transform everything? Slower but necessary if (secret) { x = -secret & 19 | (secret-1) & x; x = 19; } Slower and unnecessary ! if (public) { y = -public & 42 | (public-1) & y; y = 42; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  3. Transform everything? Slower but necessary if (secret) { x = -secret & 19 | (secret-1) & x; x = 19; } Slower and unnecessary ! if (public) { y = -public & 42 | (public-1) & y; y = 42; } Only transform if code leaks secret values FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  4. Explicit secrecy in the type system secret uint32 decrypt( secret uint32 key, public uint32 msg) { if (key > 40) { ... } ... } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  5. Explicit secrecy in the type system secret uint32 decrypt( secret uint32 key, public uint32 msg) { if (key > 40) { ... } ... } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  6. Explicit secrecy in the type system secret uint32 decrypt( secret uint32 key, public uint32 msg) { if (key > 40) { ... } We can detect secret leakage! ... } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  7. Type system detects leaks via... ● Conditional branches ● Early termination ● Function side effects ● Memory access patterns ● Direct assignment ● … FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  8. Type system detects leaks via... ● Conditional branches ● Early termination FaCT transforms these ● Function side effects ● Memory access patterns ● Direct assignment ● … FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  9. Type system detects leaks via... ● Conditional branches ● Early termination FaCT transforms these ● Function side effects ● Memory access patterns FaCT disallows these ● Direct assignment ● … FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  10. Transforming to constant-time ● What to transform? ● How to transform? ● What not to transform? ● Evaluation FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  11. Transforming to constant-time ● What to transform? ● How to transform? ● What not to transform? ● Evaluation FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  12. Transforming control flow ● Conditional branches ● Early termination ● Function side effects FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  13. Transforming control flow ● Conditional branches ● Early termination ● Function side effects FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  14. Transform secret conditionals if (s) { x = 40; } else { x = 19; y = x + 2; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  15. Transform secret conditionals if (s) { x = 40; x = -s & 40 | (s-1) & x; } else { x = 19; y = x + 2; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  16. Transform secret conditionals if (s) { x = 40; x = -s & 40 | (s-1) & x; } else { x = 19; y = x + 2; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  17. Transform secret conditionals if (s) { x = 40; x = -s & 40 | (s-1) & x; } else { x = (s-1) & 19 | -s & x; x = 19; y = x + 2; y = (s-1) & (x + 2) | -s & y; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  18. Transform secret conditionals if (s) { x = 40; x = -s & 40 | (s-1) & x; } else { x = (s-1) & 19 | -s & x; x = 19; y = x + 2; y = (s-1) & (x + 2) | -s & y; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  19. Secret returns are conditionals too if (s) { return 40; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  20. Secret returns are conditionals too if (s) { if (!done) { if (s) { rval = 40; return 40; done = true; } } } ... return rval; FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  21. Secret returns are conditionals too if (s) { if (!done) { if (s) { rval = 40; return 40; done = true; } } } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  22. Secret returns are conditionals too if (s) { if (!done) { if (s) { rval = 40; return 40; done = true; } } } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  23. Secret returns are conditionals too if (s) { if (!done) { if (s) { rval = 40; rval = (-s & (done-1)) & 40 | ... return 40; done = (-s & (done-1)) & true | ... done = true; } } } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  24. Transforming to constant-time ● What to transform? ● How to transform? ● What not to transform? ● Evaluation FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  25. Transforming to constant-time ● What to transform? ● How to transform? ● What not to transform? ● Evaluation FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  26. Not all transformations are good ● May produce inefficient code ● May produce unsafe code FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  27. Not all transformations are good ● May produce inefficient code ● May produce unsafe code Type system rejects such programs FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  28. Inefficient transformations x = buffer[ secret_index ]; FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  29. Inefficient transformations for (uint32 i from 0 to len buffer) { if (i == secret_index) { x = buffer[ secret_index ]; x = buffer[i]; } } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  30. Inefficient transformations O(1) O(n) for (uint32 i from 0 to len buffer) { if (i == secret_index) { x = buffer[ secret_index ]; x = buffer[i]; } } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  31. Inefficient transformations O(1) O(n) for (uint32 i from 0 to len buffer) { if (i == secret_index) { x = buffer[ secret_index ]; x = buffer[i]; } } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  32. Inefficient transformations O(1) O(n) for (uint32 i from 0 to len buffer) { if (i == secret_index) { x = buffer[ secret_index ]; x = buffer[i]; } } Reject if transformation is inefficient FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  33. Unsafe transformations if (j < secret_len) { x = arr[j]; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  34. Unsafe transformations x = -(j < secret_len) & arr[j] if (j < secret_len) { | ((j < secret_len)-1) & x; x = arr[j]; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  35. Unsafe transformations x = -(j < secret_len) & arr[j] if (j < secret_len) { | ((j < secret_len)-1) & x; x = arr[j]; } FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  36. Unsafe transformations x = -(j < secret_len) & arr[j] if (j < secret_len) { | ((j < secret_len)-1) & x; x = arr[j]; } What if j > len arr ? FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  37. Unsafe transformations x = -(j < secret_len) & arr[j] if (j < secret_len) { | ((j < secret_len)-1) & x; x = arr[j]; } What if j > len arr ? Out of bounds access! FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  38. Type system checks safety Check for out-of-bounds accesses Solve constraints using Z3 Path sensitive except secret branches Reject if transformation is unsafe FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  39. Type system checks safety Check for out-of-bounds accesses Solve constraints using Z3 Path sensitive except secret branches Reject if transformation is unsafe FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  40. Type system checks safety Check for out-of-bounds accesses Solve constraints using Z3 Path sensitive except secret branches Reject if transformation is unsafe FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  41. Type system checks safety Check for out-of-bounds accesses Solve constraints using Z3 Path sensitive except secret branches Reject if transformation is unsafe FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  42. Type system checks safety Check for out-of-bounds accesses Solve constraints using Z3 Path sensitive except secret branches Reject if transformation is unsafe FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  43. Transforming to constant-time ● What to transform? ● How to transform? ● What not to transform? ● Evaluation FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  44. Transforming to constant-time ● What to transform? ● How to transform? ● What not to transform? ● Evaluation FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  45. Evaluating FaCT ● Can FaCT express real code? ● Is FaCT code as fast as C? ● Is FaCT more readable than C? FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  46. Evaluating FaCT ● Can FaCT express real code? ● Is FaCT code as fast as C? ● Is FaCT more readable than C? FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  47. Porting code to FaCT ● Rewrite the whole library ● Rewrite a function (and callees) ● Rewrite a chunk of code FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  48. Porting code to FaCT ● Rewrite the whole library ● Rewrite a function (and callees) ● Rewrite a chunk of code FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  49. Porting code to FaCT ● Rewrite the whole library ● Rewrite a function (and callees) ● Rewrite a chunk of code FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  50. Porting code to FaCT ● Rewrite the whole library ● Rewrite a function (and callees) ● Rewrite a chunk of code FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  51. Porting code to FaCT ● Rewrite the whole library ● Rewrite a function (and callees) ● Rewrite a chunk of code FaCT obj .fact FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  52. Porting code to FaCT ● Rewrite the whole library ● Rewrite a function (and callees) ● Rewrite a chunk of code FaCT obj .fact clang linker Final binary .c obj FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  53. Porting code to FaCT ● Rewrite the whole library: donna curve25519 ● Rewrite a function (and callees): libsodium secretbox ● Rewrite a chunk of code: OpenSSL ssl3/TLS record verification FaCT obj .fact clang linker Final binary .c obj FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  54. Porting code to FaCT ● Rewrite the whole library: donna curve25519 ● Rewrite a function (and callees): libsodium secretbox ● Rewrite a chunk of code: OpenSSL ssl3/TLS record verification Lines of code donna secretbox ssl3 TLS FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  55. Real code needs escape hatches ● Declassify ○ ○ ● Assume ○ ○ ● Extern FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  56. Real code needs escape hatches ● Declassify secrets to public ○ ○ ● Assume ○ ○ ● Extern FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  57. Real code needs escape hatches ● Declassify secrets to public ○ secretbox: if (! declassify (crypto_verify(...)) return false; ○ ● Assume ○ ○ ● Extern FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  58. Real code needs escape hatches ● Declassify secrets to public ○ secretbox: if (! declassify (crypto_verify(...)) return false; ○ TLS: b = pmac[ declassify (i)]; ● Assume ○ ○ ● Extern FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  59. Real code needs escape hatches ● Declassify secrets to public ○ secretbox: if (! declassify (crypto_verify(...)) return false; ○ TLS: b = pmac[ declassify (i)]; ● Assume constraints for solver ○ ○ ● Extern FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

  60. Real code needs escape hatches ● Declassify secrets to public ○ secretbox: if (! declassify (crypto_verify(...)) return false; ○ TLS: b = pmac[ declassify (i)]; ● Assume constraints for solver ○ Function preconditions ○ ● Extern FaCT: A DSL for Timing-Sensitive Computation PLDI 2019 Sunjay Cauligi

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

FaCT: A DSL for Timing-Sensitive Computation Sunjay Cauligi, Gary Soeller, Brian Johannesmeyer,

FaCT: A DSL for Timing-Sensitive Computation Sunjay Cauligi, Gary Soeller, Brian Johannesmeyer,

FaCT: A DSL for Timing-Sensitive Computation Sunjay Cauligi, Gary Soeller, Brian Johannesmeyer, Fraser Brown, Riad Wahby, John Renner, Benjamin Gregoire, Gilles Barthe, Ranjit Jhala, Deian Stefan Presented by Mengjia Yan MIT 6.888 Fall 2020

262 views • 24 slides
Structure of Talk Workload-sensitive Timing Behavior Anomaly Detection 1 Motivation in Large

Structure of Talk Workload-sensitive Timing Behavior Anomaly Detection 1 Motivation in Large

Workload-sensitive Timing Behavior Anomaly Detection in Large Software Systems Workload-sensitive Timing Behavior Anomaly Detection in Large Software Systems Structure of Talk Workload-sensitive Timing Behavior Anomaly Detection 1 Motivation

690 views • 12 slides
Timing-Sensitive Information-Flow Security Danfeng Zhang , Yao Wang, G. Edward Suh and Andrew C.

Timing-Sensitive Information-Flow Security Danfeng Zhang , Yao Wang, G. Edward Suh and Andrew C.

A Hardware Design Language for Timing-Sensitive Information-Flow Security Danfeng Zhang , Yao Wang, G. Edward Suh and Andrew C. Myers Cornell University ASPLOS 2015 Information Security via Isolation memory memory memory space 1 space 2

692 views • 35 slides
Context-sensitive Analysis Attribute Grammar And Type Checking cs5363 1 Context-Sensitive

Context-sensitive Analysis Attribute Grammar And Type Checking cs5363 1 Context-Sensitive

Context-sensitive Analysis Attribute Grammar And Type Checking cs5363 1 Context-Sensitive Analysis To understand the input computation, a compiler/interpreter need to discover The types of values stored in each variable The types

576 views • 39 slides
A6: Sensitive Data Exposure A6 Sensitive Data Exposure Sensitive data stored or transmitted

A6: Sensitive Data Exposure A6 Sensitive Data Exposure Sensitive data stored or transmitted

A6: Sensitive Data Exposure A6 Sensitive Data Exposure Sensitive data stored or transmitted insecurely Failure to protect all sensitive data Usernames, passwords, password hashes, credit-card information, identity info Session

415 views • 17 slides
Coherence Spaces for Resource-Sensitive Computation in Analysis K e i M a t s u mo t o

Coherence Spaces for Resource-Sensitive Computation in Analysis K e i M a t s u mo t o

Coherence Spaces for Resource-Sensitive Computation in Analysis K e i M a t s u mo t o ( R I M S , K y o t o U n i v e r s i t y ) 1 Background C o mp u t a b l e a n a l y s i s s t u d

917 views • 55 slides
What solves this equation? Equation: n : if n = 0 then 1 else n 1 ) ? fact fact ( n

What solves this equation? Equation: n : if n = 0 then 1 else n 1 ) ? fact fact ( n

What solves this equation? Equation: n : if n = 0 then 1 else n 1 ) ? fact fact ( n = The factorial function! Factorial in lambda calculus Wish for: fact = \n.(zero? n) 1 (times n (fact (pred n))); But: on right-hand side, fact is

471 views • 14 slides
FaCT A Flexible, Constant-Time Sunjay Cauligi , Gary Soeller, Programming Language Fraser Brown,

FaCT A Flexible, Constant-Time Sunjay Cauligi , Gary Soeller, Programming Language Fraser Brown,

FaCT A Flexible, Constant-Time Sunjay Cauligi , Gary Soeller, Programming Language Fraser Brown, Brian Johannesmeyer, Yunlu Huang, Ranjit Jhala, Deian Stefan Timing side channels Secret key Crypto Plaintext Encrypted FaCT SecDev 2017

652 views • 40 slides
Cache Timing Side-Channel Vulnerability Checking with Computation Tree Logic Shuwen Deng , Wenjie

Cache Timing Side-Channel Vulnerability Checking with Computation Tree Logic Shuwen Deng , Wenjie

Cache Timing Side-Channel Vulnerability Checking with Computation Tree Logic Shuwen Deng , Wenjie Xiong and Jakub Szefer Yale University HASP June 2, 2018 Memory System Cache Memory CPU Typical set-associative cache sets ways cache

640 views • 25 slides
Constant-time programming in FaCT Sunjay Cauligi , UC San Diego Fraser Brown, Ranjit Jhala, Brian

Constant-time programming in FaCT Sunjay Cauligi , UC San Diego Fraser Brown, Ranjit Jhala, Brian

Constant-time programming in FaCT Sunjay Cauligi , UC San Diego Fraser Brown, Ranjit Jhala, Brian Johannesmeyer, John Renner, Gary Soeller, Deian Stefan, Riad Wahby Timing side channels Crypto Constant-time programming with FaCT Strange Loop

1.63k views • 114 slides
Protecting Sensitive Data Implementation of a Sensitive Data Manager Recommendation Briefed

Protecting Sensitive Data Implementation of a Sensitive Data Manager Recommendation Briefed

Protecting Sensitive Data Implementation of a Sensitive Data Manager Recommendation Briefed Presidents Executive Council on 13 Jan: recommended to proceed with deploying a Sensitive Data Manager tool on all UND owned computers to

321 views • 6 slides
Value-Sensitive Design Informatics 161: Group 2 Overview What is Value Sensitive Design

Value-Sensitive Design Informatics 161: Group 2 Overview What is Value Sensitive Design

Value-Sensitive Design Informatics 161: Group 2 Overview What is Value Sensitive Design (VSD)? Definition of values HUSH Tripartite Methodology Conceptual HORIZON Empirical Technical What is VSD? Design approach

647 views • 25 slides
Timing Analysis Timing Path Groups and Types Timing paths are grouped into path groups

Timing Analysis Timing Path Groups and Types Timing paths are grouped into path groups

Introduction to Digital VLSI Logic Synthesis Timing Analysis Timing Path Groups and Types Timing paths are grouped into path groups according to the clock associated with the endpoint of the path. There is a default path group that

540 views • 18 slides
FORMAL MODELING AND VERIFICATION FOR TIMING PREDICTABILITY Mathieu Jan, Mihail Asavoae, Belgacem

FORMAL MODELING AND VERIFICATION FOR TIMING PREDICTABILITY Mathieu Jan, Mihail Asavoae, Belgacem

FORMAL MODELING AND VERIFICATION FOR TIMING PREDICTABILITY Mathieu Jan, Mihail Asavoae, Belgacem Ben Hedia ERTS 2020 Toulouse Outline of the talk Motivations and goals Timing anomalies in Worst-Case Timing Reasoning An example of a timing

286 views • 16 slides
Top 5 Timing Closure Techniques Greg Daughtry Correct Timing Constraints Analyze Before

Top 5 Timing Closure Techniques Greg Daughtry Correct Timing Constraints Analyze Before

Top 5 Timing Closure Techniques Greg Daughtry Correct Timing Constraints Analyze Before Doing Implementation Strategies and Directives Congestion and Complexity Advanced Physical Optimization Create Good Timing Constraints

658 views • 31 slides
X-ray ray Timing and Timing and Polarizati Polarization on mi missi ssion &amp; &amp; inst

X-ray ray Timing and Timing and Polarizati Polarization on mi missi ssion &amp; &amp; inst

X-ray ray Timing and Timing and Polarizati Polarization on mi missi ssion &amp; &amp; inst strumen mentation DONG Y Yongw ngwei Center fo r for r Parti rticle A Astroph trophysics Ins nstitute o of High Ene igh Energy P gy

437 views • 15 slides
1 Prefetching Prefetching or Streaming or Streaming Prediction Prediction Compiler-driven

1 Prefetching Prefetching or Streaming or Streaming Prediction Prediction Compiler-driven

I/O Buffering and Caching I/O Buffering and Caching I/O accesses are reads or writes (e.g., to files) Application access is arbitary (offset, len) Convert accesses to read/write of fixed-size blocks or pages I/O Buffering and Streaming I/O

362 views • 4 slides
Reorder Buffer Method Issue Execute Write Classic 5-stage pipeline In-order In-order

Reorder Buffer Method Issue Execute Write Classic 5-stage pipeline In-order In-order

Reorder Buffer Method Issue Execute Write Classic 5-stage pipeline In-order In-order In-order Multi-cycle FP pipeline In-order In-order Out-of-order Scoreboard In-order Out-of-order Out-of-order Tomasulo

394 views • 16 slides
Buffer Trees Lars Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms . In

Buffer Trees Lars Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms . In

Buffer Trees Lars Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms . In Proceedings of Fourth Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science Vol. 955, Springer-Verlag, 1995, 334-345. 1

518 views • 27 slides
Enlightenment as Standalone Wayland Compositor Christopher Michael &amp; Stefan Schmidt FOSDEM

Enlightenment as Standalone Wayland Compositor Christopher Michael &amp; Stefan Schmidt FOSDEM

Enlightenment as Standalone Wayland Compositor Christopher Michael &amp; Stefan Schmidt FOSDEM 2014 Intro Who are we? EFL upstream developers Working for Samsung Open Source Group UK Direct upstream work Agenda Quick EFL

414 views • 18 slides
High Performance PostgreSQL, Tuning and Optimization Guide Ibrar Ahmed Senior Software Engineer

High Performance PostgreSQL, Tuning and Optimization Guide Ibrar Ahmed Senior Software Engineer

High Performance PostgreSQL, Tuning and Optimization Guide Ibrar Ahmed Senior Software Engineer @ Percona LLC PostgreSQL Consultant PostgreSQL Why? One of the finest open source relational Support? database which has some

397 views • 21 slides
P ostgreSQ L B u fg ers Vi k Feari ng PG C onf. EU W arsaw O ctober 25, 20 17 V i k

P ostgreSQ L B u fg ers Vi k Feari ng PG C onf. EU W arsaw O ctober 25, 20 17 V i k

P ostgreSQ L B u fg ers Vi k Feari ng PG C onf. EU W arsaw O ctober 25, 20 17 V i k Feari n g Change and and to and. i rc: xocol atl Tw i tter: @ pg_ xocol atl P ostgreSQ L B u fg ers B acken d D ata D i

556 views • 37 slides
SYSC3601 Microprocessor Systems Unit 4: 8086/88 Hardware &amp; Bus Structure Topics/Reading

SYSC3601 Microprocessor Systems Unit 4: 8086/88 Hardware &amp; Bus Structure Topics/Reading

SYSC3601 Microprocessor Systems Unit 4: 8086/88 Hardware &amp; Bus Structure Topics/Reading Brey Chapter 9: Hardware specifications Pin-outs &amp; pin functions 8274 Clock generator Bus buffering &amp; latching Bus

872 views • 30 slides
Cisco IOS Embedded Packet Capture (EPC) Cisco IOS Embedded Packet Capture (EPC) The Cisco IOS

Cisco IOS Embedded Packet Capture (EPC) Cisco IOS Embedded Packet Capture (EPC) The Cisco IOS

Cisco IOS Embedded Packet Capture (EPC) Cisco IOS Embedded Packet Capture (EPC) The Cisco IOS Embedded Packet Capture (EPC) delivers a powerful troubleshooting and tracing tool. The feature allows for network administrators to capture data

518 views • 24 slides

More recommend