linearizability cap announcements
play

Linearizability & CAP Announcements No hours this week. - PowerPoint PPT Presentation

Nov 18, 2023 •317 likes •2.18k views

Linearizability & CAP Announcements No hours this week. Announcements No hours this week. Sorry am traveling starting tomorrow. Announcements No hours this week. Sorry am traveling starting tomorrow. Lab 1 goes out

  1. Is Linearizable? A: q.enq(x) A: q.enq(x) A: q.enq(x) A: q.OK() A: q.OK() A: q.OK() B: q.enq(y) B: q.enq(y) B: q.enq(y) B: q.OK() B: q.OK() B: q.OK() A: q.enq(z) A: q.enq(z) A: q.enq(z) B: q.deq() Yes No B: q.deq() B: q.deq() B: q.OK(x) B: q.OK(y) B: q.OK(x) A: q.OK() A: q.OK() A: q.OK() A: q.deq() A: q.deq() A: q.deq() B: q.deq() B: q.deq() B: q.OK(y) B: q.OK(x) A: q.OK(z) A: q.OK(z)

  2. Is Linearizable? A: q.enq(x) A: q.enq(x) A: q.enq(x) A: q.OK() A: q.OK() A: q.OK() B: q.enq(y) B: q.enq(y) B: q.enq(y) B: q.OK() B: q.OK() B: q.OK() A: q.enq(z) A: q.enq(z) A: q.enq(z) B: q.deq() Yes No B: q.deq() Yes B: q.deq() B: q.OK(x) B: q.OK(y) B: q.OK(x) A: q.OK() A: q.OK() A: q.OK() A: q.deq() A: q.deq() A: q.deq() B: q.deq() B: q.deq() B: q.OK(y) B: q.OK(x) A: q.OK(z) A: q.OK(z)

  3. Sequential Consistency • Operations in a single process happen in the same order. • Globally operations happen in some sequential order across processes. inv(op1) res(op1) inv(op2) res(op2) Process 1 Process 2 inv(op3) res(op3) inv(op4) res(op4)

  4. Sequential Consistency inv(op1) res(op1) inv(op2) res(op2) Process 1 Process 2 inv(op3) res(op3) inv(op4) res(op4)

  5. Sequential Consistency inv(op1) res(op1) inv(op2) res(op2) Process 1 Process 2 inv(op3) res(op3) inv(op4) res(op4) inv(op1) res(op1) inv(op3) res(op3) inv(op2) res(op2) inv(op4) res(op4)

  6. Sequential Consistency inv(op1) res(op1) inv(op2) res(op2) Process 1 Process 2 inv(op3) res(op3) inv(op4) res(op4) inv(op1) res(op1) inv(op3) res(op3) inv(op2) res(op2) inv(op4) res(op4) inv(op1) res(op1) inv(op2) res(op2) inv(op3) res(op3) inv(op4) res(op4)

  7. Sequential Consistency inv(op1) res(op1) inv(op2) res(op2) Process 1 Process 2 inv(op3) res(op3) inv(op4) res(op4) inv(op1) res(op1) inv(op3) res(op3) inv(op2) res(op2) inv(op4) res(op4) inv(op1) res(op1) inv(op2) res(op2) inv(op3) res(op3) inv(op4) res(op4) inv(op1) res(op1) inv(op4) res(op4) inv(op2) res(op2) inv(op3) res(op3)

  8. Sequential Consistency

  9. Sequential Consistency • Not real time. Why? • Not local. Why?

  10. Sequential Consistency A: p.enq(x) A: p.OK() B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  11. Sequential Consistency A: p.enq(x) p.enq(x) A: p.OK() B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  12. Sequential Consistency X A: p.enq(x) p.enq(x) A: p.OK() B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  13. Sequential Consistency X A: p.enq(x) p.enq(x) p.OK( ) A: p.OK() B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  14. Sequential Consistency X q.enq(Y) A: p.enq(x) p.enq(x) p.OK( ) A: p.OK() B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  15. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) p.OK( ) A: p.OK() B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  16. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) q.OK( ) p.OK( ) A: p.OK() B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  17. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) q.OK( ) p.OK( ) A: p.OK() q.enq(X) B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  18. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) X q.OK( ) p.OK( ) A: p.OK() q.enq(X) B: q.enq(y) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  19. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) X q.OK( ) p.OK( ) A: p.OK() q.enq(X) B: q.enq(y) q.OK( ) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  20. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) X q.OK( ) p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) q.OK( ) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  21. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) X Y q.OK( ) p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) q.OK( ) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  22. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) X Y q.OK( ) p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) p.OK( ) q.OK( ) B: q.OK() q.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  23. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) X Y q.OK( ) p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) p.OK( ) q.OK( ) B: q.OK() q.deq() p.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  24. Sequential Consistency X Y q.enq(Y) A: p.enq(x) p.enq(x) X Y q.OK( ) p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) p.OK( ) q.OK( ) B: q.OK() q.deq() p.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  25. Sequential Consistency A: p.enq(x) A: p.OK() B: q.enq(y) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  26. Sequential Consistency q.enq(Y) A: p.enq(x) A: p.OK() B: q.enq(y) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  27. Sequential Consistency Y q.enq(Y) A: p.enq(x) A: p.OK() B: q.enq(y) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  28. Sequential Consistency Y q.enq(Y) A: p.enq(x) q.OK( ) A: p.OK() B: q.enq(y) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  29. Sequential Consistency Y q.enq(Y) A: p.enq(x) q.OK( ) A: p.OK() p.enq(Y) B: q.enq(y) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  30. Sequential Consistency Y Y q.enq(Y) A: p.enq(x) q.OK( ) A: p.OK() p.enq(Y) B: q.enq(y) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  31. Sequential Consistency Y Y q.enq(Y) A: p.enq(x) q.OK( ) A: p.OK() p.enq(Y) B: q.enq(y) p.OK( ) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  32. Sequential Consistency Y Y p.enq(x) q.enq(Y) A: p.enq(x) q.OK( ) A: p.OK() p.enq(Y) B: q.enq(y) p.OK( ) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  33. Sequential Consistency Y Y p.enq(x) q.enq(Y) A: p.enq(x) q.OK( ) X A: p.OK() p.enq(Y) B: q.enq(y) p.OK( ) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  34. Sequential Consistency Y Y q.enq(Y) A: p.enq(x) p.enq(x) q.OK( ) X p.OK( ) A: p.OK() p.enq(Y) B: q.enq(y) p.OK( ) B: q.OK() A: q.enq(x) p q A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  35. Sequential Consistency Y q.enq(Y) A: p.enq(x) p.enq(x) X q.OK( ) X p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) p.OK( ) q.OK( ) B: q.OK() p.deq() A: q.enq(x) p q p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  36. Sequential Consistency Y q.enq(Y) A: p.enq(x) p.enq(x) X q.OK( ) X p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) p.OK( ) q.OK( ) B: q.OK() q.deq() p.deq() A: q.enq(x) p q p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  37. Sequential Consistency Y q.enq(Y) A: p.enq(x) p.enq(x) X q.OK( ) X p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) p.OK( ) q.OK( ) B: q.OK() q.deq() p.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  38. Sequential Consistency Y q.enq(Y) A: p.enq(x) p.enq(x) X q.OK( ) X p.OK( ) A: p.OK() p.enq(Y) q.enq(X) B: q.enq(y) p.OK( ) q.OK( ) B: q.OK() q.deq() p.deq() A: q.enq(x) p q q.ok(X) p.ok(Y) A: q.OK() B: p.enq(y) B: p.OK() A: p.deq() A: p.OK(y) Process A Process B B: q.deq() B: q.OK(x)

  39. Serializability and Strict Serializability • Common in databases, will deal with in a few classes.

  40. Serializability and Strict Serializability • Common in databases, will deal with in a few classes. • Basic extension: consider multiple operations at a time rather than one operation.

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

Linearizability & CAP Announcements No hours this week. Sorry am traveling starting

Linearizability & CAP Announcements No hours this week. Sorry am traveling starting

Linearizability & CAP Announcements No hours this week. Sorry am traveling starting tomorrow. Lab 1 goes out next week. On requiring summaries vs adding labs. Linearizability Concurrency not Distributed Systems?

532 views • 42 slides
Testing for Linearizability Gavin Lowe Testing for Linearizability 02 Linearizability

Testing for Linearizability Gavin Lowe Testing for Linearizability 02 Linearizability

Testing for Linearizability 01 Testing for Linearizability Gavin Lowe Testing for Linearizability 02 Linearizability Linearizability is a well-established and accepted correctness condition for concurrent datatypes. Informally, a concurrent

577 views • 18 slides
Between Linearizability and Quiescent Consistency Radha Jagadeesan James Riely DePaul

Between Linearizability and Quiescent Consistency Radha Jagadeesan James Riely DePaul

Between Linearizability and Quiescent Consistency Radha Jagadeesan James Riely DePaul University Chicago, USA ICALP 2014 Between Linearizability and Quiescent Consistency ICALP 2014 1 Linearizability (Herlihy/Wing 1990) Each method call

1.09k views • 92 slides
Checking Linearizability Using Hitting Families Burcu Kulahcioglu Ozkan 1 , Rupak Majumdar 1 ,

Checking Linearizability Using Hitting Families Burcu Kulahcioglu Ozkan 1 , Rupak Majumdar 1 ,

Checking Linearizability Using Hitting Families Burcu Kulahcioglu Ozkan 1 , Rupak Majumdar 1 , Filip Niksic 2 1 Max Planck Institute for Software Systems (MPI-SWS) 2 University of Pennsylvania Linearizability as a correctness condition Two

456 views • 26 slides
2PC, Linearizability, Spanner 2020-04-17 Nikita Borisov - UIUC 12 Topics for Today

2PC, Linearizability, Spanner 2020-04-17 Nikita Borisov - UIUC 12 Topics for Today

2PC, Linearizability, Spanner 2020-04-17 Nikita Borisov - UIUC 12 Topics for Today Two-phase commit Atomic commit protocol Crash-recovery, durability External consistency / linearizability Spanner Multi-version database

440 views • 16 slides
Review: Linearizability Defini3on Given some component C (say,

Review: Linearizability Defini3on Given some component C (say,

Review: Linearizability Defini3on Given some component C (say, a class) And some opera3ons O1, O2, .. (say, methods) An opera)on is linearizable

808 views • 56 slides
Sequential Consistency Versus Linearizability Hagit A(ya, and

Sequential Consistency Versus Linearizability Hagit A(ya, and

Sequential Consistency Versus Linearizability Hagit A(ya, and Jennifer L. Welch (ACM Transac<ons on Computer Systems 1994) Presented by: Haonan Lu 0

299 views • 8 slides
RIFL: Implementing Linearizability at Large Scale and Low Latency Jiaxin Wang Motivation

RIFL: Implementing Linearizability at Large Scale and Low Latency Jiaxin Wang Motivation

RIFL: Implementing Linearizability at Large Scale and Low Latency Jiaxin Wang Motivation Consistency Important issue in large-scale storage systems Linearizability Strongest form of consistency for concurrent systems

1.24k views • 21 slides
Linearizability, revisited Radha Jagadeesan Gustavo Petri Corin Pitcher James Riely

Linearizability, revisited Radha Jagadeesan Gustavo Petri Corin Pitcher James Riely

Linearizability, revisited Radha Jagadeesan Gustavo Petri Corin Pitcher James Riely DePaul University Purdue University ESOP 2010, FOSSACS 2012, TLDI 2012, ESOP 2013 Linearizability, revisited ESOP 2010, FOSSACS 2012,

1.24k views • 70 slides
Linearizability of Persistent Memory Objects Michael L. Scott Joint work with Joseph

Linearizability of Persistent Memory Objects Michael L. Scott Joint work with Joseph

Linearizability of Persistent Memory Objects Michael L. Scott Joint work with Joseph Izraelevitz & Hammurabi Mendes www.cs.rochester.edu / research/synchronization/ Dagstuhl seminar on New Challenges in Parallelism November 2017 based on

303 views • 18 slides
Proving linearizability & lock-freedom Viktor Vafeiadis MPI-SWS Michael & Scott

Proving linearizability & lock-freedom Viktor Vafeiadis MPI-SWS Michael & Scott

Proving linearizability & lock-freedom Viktor Vafeiadis MPI-SWS Michael & Scott non-blocking queue head tail null X 1 2 3 CAS compare & swap CAS (address, expectedValue, newValue) { atomic { if ( *address ==

1.03k views • 49 slides
Local Linearizability Ana Sokolova joint work with: Andreas Haas Tom Henzinger Andreas Holzer

Local Linearizability Ana Sokolova joint work with: Andreas Haas Tom Henzinger Andreas Holzer

Local Linearizability Ana Sokolova joint work with: Andreas Haas Tom Henzinger Andreas Holzer Christoph Kirsch Michael Lippautz Hannes Payer Ali Sezgin Helmut Veith Rigorous methods for engineering of and reasoning about reactive

1.32k views • 102 slides
Proving Linearizability Using Partial Orders Artem Khyzha Mike Dodds Alexey Gotsman Matthew

Proving Linearizability Using Partial Orders Artem Khyzha Mike Dodds Alexey Gotsman Matthew

Proving Linearizability Using Partial Orders Artem Khyzha Mike Dodds Alexey Gotsman Matthew Parkinson The Kent Concurrency Workshop July 22 nd 2016 In this talk Algorithms posing challenges for the linearization points method: the

649 views • 36 slides
Automatically proving linearizability Viktor Vafeiadis University of Cambridge CAV 2010

Automatically proving linearizability Viktor Vafeiadis University of Cambridge CAV 2010

Automatically proving linearizability Viktor Vafeiadis University of Cambridge CAV 2010 M&S non-blocking queue head tail null X 1 2 3 4 typedef struct Node_s *Node; struct Queue_s *Q; struct Node_s { init() { int val; n = new

379 views • 25 slides
NON-BLOCKING DATA STRUCTURES AND TRANSACTIONAL MEMORY Tim Harris, 21 November 2014 Lecture 7

NON-BLOCKING DATA STRUCTURES AND TRANSACTIONAL MEMORY Tim Harris, 21 November 2014 Lecture 7

NON-BLOCKING DATA STRUCTURES AND TRANSACTIONAL MEMORY Tim Harris, 21 November 2014 Lecture 7 Linearizability Lock-free progress properties Queues Reducing contention Explicit memory management Linearizability 3

1.07k views • 93 slides
NON-BLOCKING DATA STRUCTURES AND TRANSACTIONAL MEMORY Tim Harris, 18 November 2016 Lecture 7

NON-BLOCKING DATA STRUCTURES AND TRANSACTIONAL MEMORY Tim Harris, 18 November 2016 Lecture 7

NON-BLOCKING DATA STRUCTURES AND TRANSACTIONAL MEMORY Tim Harris, 18 November 2016 Lecture 7 Linearizability Lock-free progress properties Queues Reducing contention Explicit memory management Linearizability 3

1.17k views • 88 slides
An industrial case study of TACO Benjamin Lesage , Stephen Law, Iain Bate Icons courtesy of

An industrial case study of TACO Benjamin Lesage , Stephen Law, Iain Bate Icons courtesy of

An industrial case study of TACO Benjamin Lesage , Stephen Law, Iain Bate Icons courtesy of https://icons8.com/ Context 2 Rolls-Royce VISIUMCORE platform Integrated instruction tracing and timing Instructions execution is

931 views • 44 slides
Introduction TACO goal: develop tools, methods and a design flow for rapidly specifying,

Introduction TACO goal: develop tools, methods and a design flow for rapidly specifying,

TACO: Rapid Design Space Exploration for Protocol Processors Seppo Virtanen Johan Lilius Tero Nurmi Tomi Westerlund Turku Centre for Computer Science (TUCS) Lemminkaisenkatu 14 A, FIN-20520 Turku, Finland seppo.virtanen@utu.fi,

555 views • 11 slides
Using Machine Learning to Improve Automatic Vectorization Kevin Stock Louis-Nol Pouchet P .

Using Machine Learning to Improve Automatic Vectorization Kevin Stock Louis-Nol Pouchet P .

Using Machine Learning to Improve Automatic Vectorization Kevin Stock Louis-Nol Pouchet P . Sadayappan The Ohio State University January 24, 2012 HiPEAC Conference Paris, France Introduction: HiPEAC12 Vectorization Observations

346 views • 22 slides
IPOFRAZIONAMENTO NEL TUMORE PROSTATICO: dove s8amo andando e

IPOFRAZIONAMENTO NEL TUMORE PROSTATICO: dove s8amo andando e

IPOFRAZIONAMENTO NEL TUMORE PROSTATICO: dove s8amo andando e quanto siamo compe88vi " DICHIARAZIONE Relatore: FILIPPO ALONGI Come da nuova regolamentazione della Commissione Nazionale per la

611 views • 44 slides
Temporal Common Sense n Humans assume information when reading Not explicitly mentioned

Temporal Common Sense n Humans assume information when reading Not explicitly mentioned

Going on a vacation takes longer than Going for a walk : A Study of Temporal Commonsense Understanding Ben Zhou Daniel Khashabi* Qiang Ning* Dan Roth *Currently affiliated with AI2 Temporal Common Sense n Humans assume

1.1k views • 15 slides
and tacos! Who? Originally from Toronto, Canada Lives in Tallinn, Estonia Drupal since 2008

and tacos! Who? Originally from Toronto, Canada Lives in Tallinn, Estonia Drupal since 2008

Drupal 8 Cache API and tacos! Who? Originally from Toronto, Canada Lives in Tallinn, Estonia Drupal since 2008 Works for Chromatic! https:/ /chromatichq.com @ChromaticHQ What is Chromatic? Mostly Drupal-focused with Front End and

426 views • 30 slides
A Scalable System Design for Data Reduction in Modern Storage Servers Mohammadamin Ajdari

A Scalable System Design for Data Reduction in Modern Storage Servers Mohammadamin Ajdari

A Scalable System Design for Data Reduction in Modern Storage Servers Mohammadamin Ajdari Presentation at Dpt. Of Computer Engineering, Sharif Univ. of Tech. 2020/1/22 My Education Direct PhD in Computer Eng. Degree from POSTECH (South Korea)

1.13k views • 63 slides
MetaPost 1.207 (TEXLive 2009) EuroTEX 2009 SVG backend SVG backend SVG backend SVG backend A

MetaPost 1.207 (TEXLive 2009) EuroTEX 2009 SVG backend SVG backend SVG backend SVG backend A

MetaPost 1.207 (TEXLive 2009) EuroTEX 2009 SVG backend SVG backend SVG backend SVG backend A complete SVG example outputformat := "svg"; outputtemplate := "%j-%c.%o"; beginfig(1); fill fullcircle scaled 100 withcolor

680 views • 15 slides

More recommend