inferring models of concurrent systems from logs of their
play

Inferring Models of Concurrent Systems from Logs of Their Behavior - PowerPoint PPT Presentation

Nov 27, 2023 •456 likes •1.22k views

Inferring Models of Concurrent Systems from Logs of Their Behavior with CSight A?a-1 timeout s0 send(m) s1 M!m-0 s2 A?a-1 Sender Receiver A?a-0 A?a-1 2,1 M?m-0 1,0 send(m) A?a-0 s5 M!m-1 s4 send(m) s3 2,2 recv(m) 2,0 M!m-0

  1. Inferring Models of Concurrent Systems from Logs of Their Behavior with CSight A?a-1 timeout s0 send(m) s1 M!m-0 s2 A?a-1 Sender Receiver A?a-0 A?a-1 2,1 M?m-0 1,0 send(m) A?a-0 s5 M!m-1 s4 send(m) s3 2,2 recv(m) 2,0 M!m-0 2,3 A!a-0 3,3 A?a-0 timeout 5,4 M?m-1 4,3 send(m) (a) Sender 5,5 recv(m) 5,3 M!m-1 A 5,6 A!a-1 M 6,6 A?a-1 8,7 M?m-0 7,6 send(m) 8,8 recv(m) 8,6 M!m-0 8,9 A!a-0 9,9 A?a-0 r0 M?m-0 r1 recv(m) r2 11,10 M?m-1 M?m-0 10,9 send(m) 11,11 recv(m) 11,9 M!m-1 A!a-1 M?m-1 M?m-0 A!a-0 11,12 A!a-1 12,12 A?a-1 M?m-1 r5 recv(m) r4 M?m-1 r3 (b) Receiver University of British Columbia Ivan Beschastnikh ! ! ! ! ! ! ! ! ! ! ! ! Yuriy Brun ! ! ! ! Michael D. Ernst ! UMass Amherst Arvind Krishnamurthy University of Washington

  2. A?a-1 timeout s0 send(m) s1 M!m-0 s2 A?a-1 A?a-0 A?a-1 A?a-0 s5 M!m-1 s4 send(m) s3 Sender Receiver timeout 2,1 M?m-0 (a) Sender 1,0 send(m) 2,2 recv(m) 2,0 M!m-0 A CSight M 2,3 A!a-0 3,3 A?a-0 5,4 M?m-1 4,3 send(m) 5,5 recv(m) 5,3 M!m-1 5,6 A!a-1 6,6 A?a-1 r0 M?m-0 r1 recv(m) r2 M?m-0 8,7 M?m-0 7,6 send(m) 8,8 recv(m) A!a-1 M?m-1 8,6 M!m-0 M?m-0 A!a-0 8,9 A!a-0 9,9 A?a-0 M?m-1 r5 recv(m) r4 M?m-1 r3 11,10 M?m-1 10,9 send(m) 11,11 recv(m) 11,9 M!m-1 11,12 A!a-1 12,12 A?a-1 (b) Receiver Input log Output model Ivan Beschastnikh University of British Columbia 2

  3. Challenges of logging for debugging ... • Logs present a low-level host1 host2 host3 view of the system • Developers are not sure what src : 2, dst : 0, timestamp : 0, type : prepare src : 2, dst : 0, timestamp : 0, type : prepare src : 2, dst : 0, timestamp : 0, type : prepare src : 2, dst : 1, timestamp : 1, type : prepare src : 2, dst : 1, timestamp : 1, type : prepare src : 2, dst : 1, timestamp : 1, type : prepare to look for, or where ! src : 0, dst : 2, timestamp : 2, type : commit src : 0, dst : 2, timestamp : 2, type : commit src : 0, dst : 2, timestamp : 2, type : commit src : 1, dst : 2, timestamp : 3, type : commit src : 1, dst : 2, timestamp : 3, type : commit src : 1, dst : 2, timestamp : 3, type : commit src : 2, dst : 0, timestamp : 4, type : tx_commit src : 2, dst : 0, timestamp : 4, type : tx_commit src : 2, dst : 0, timestamp : 4, type : tx_commit src : 2, dst : 1, timestamp : 5, type : tx_commit src : 2, dst : 1, timestamp : 5, type : tx_commit src : 2, dst : 1, timestamp : 5, type : tx_commit src : 0, dst : 2, timestamp : 6, type : ack src : 0, dst : 2, timestamp : 6, type : ack src : 0, dst : 2, timestamp : 6, type : ack src : 1, dst : 2, timestamp : 7, type : ack src : 1, dst : 2, timestamp : 7, type : ack src : 1, dst : 2, timestamp : 7, type : ack src : 2, dst : 0, timestamp : 8, type : prepare src : 2, dst : 0, timestamp : 8, type : prepare src : 2, dst : 0, timestamp : 8, type : prepare src : 2, dst : 1, timestamp : 9, type : prepare src : 2, dst : 1, timestamp : 9, type : prepare src : 2, dst : 1, timestamp : 9, type : prepare src : 0, dst : 2, timestamp : 10, type : commit src : 0, dst : 2, timestamp : 10, type : commit src : 0, dst : 2, timestamp : 10, type : commit • Reasoning about logged src : 1, dst : 2, timestamp : 11, type : commit src : 1, dst : 2, timestamp : 11, type : commit src : 1, dst : 2, timestamp : 11, type : commit src : 2, dst : 0, timestamp : 12, type : tx_commit src : 2, dst : 0, timestamp : 12, type : tx_commit src : 2, dst : 0, timestamp : 12, type : tx_commit src : 2, dst : 1, timestamp : 13, type : tx_commit src : 2, dst : 1, timestamp : 13, type : tx_commit src : 2, dst : 1, timestamp : 13, type : tx_commit src : 0, dst : 2, timestamp : 14, type : ack src : 0, dst : 2, timestamp : 14, type : ack src : 0, dst : 2, timestamp : 14, type : ack src : 1, dst : 2, timestamp : 15, type : ack src : 1, dst : 2, timestamp : 15, type : ack src : 1, dst : 2, timestamp : 15, type : ack ... src : 2, dst : 0, timestamp : 16, type : prepare src : 2, dst : 0, timestamp : 16, type : prepare src : 2, dst : 0, timestamp : 16, type : prepare concurrency is a nightmare ! src : 2, dst : 1, timestamp : 17, type : prepare src : 2, dst : 1, timestamp : 17, type : prepare src : 2, dst : 1, timestamp : 17, type : prepare src : 0, dst : 2, timestamp : 18, type : commit src : 0, dst : 2, timestamp : 18, type : commit src : 0, dst : 2, timestamp : 18, type : commit src : 1, dst : 2, timestamp : 19, type : commit src : 1, dst : 2, timestamp : 19, type : commit src : 1, dst : 2, timestamp : 19, type : commit src : 2, dst : 0, timestamp : 20, type : tx_commit src : 2, dst : 0, timestamp : 20, type : tx_commit src : 2, dst : 0, timestamp : 20, type : tx_commit src : 2, dst : 1, timestamp : 21, type : tx_commit src : 2, dst : 1, timestamp : 21, type : tx_commit src : 2, dst : 1, timestamp : 21, type : tx_commit src : 0, dst : 2, timestamp : 22, type : ack src : 0, dst : 2, timestamp : 22, type : ack src : 0, dst : 2, timestamp : 22, type : ack src : 1, dst : 2, timestamp : 23, type : ack src : 1, dst : 2, timestamp : 23, type : ack src : 1, dst : 2, timestamp : 23, type : ack src : 2, dst : 0, timestamp : 0, type : prepare src : 2, dst : 0, timestamp : 0, type : prepare src : 2, dst : 0, timestamp : 0, type : prepare src : 2, dst : 1, timestamp : 1, type : prepare src : 2, dst : 1, timestamp : 1, type : prepare src : 2, dst : 1, timestamp : 1, type : prepare src : 0, dst : 2, timestamp : 2, type : commit src : 0, dst : 2, timestamp : 2, type : commit src : 0, dst : 2, timestamp : 2, type : commit src : 1, dst : 2, timestamp : 3, type : commit src : 1, dst : 2, timestamp : 3, type : commit src : 1, dst : 2, timestamp : 3, type : commit • Must connect clues across src : 2, dst : 0, timestamp : 4, type : tx_commit src : 2, dst : 0, timestamp : 4, type : tx_commit src : 2, dst : 0, timestamp : 4, type : tx_commit src : 2, dst : 1, timestamp : 5, type : tx_commit src : 2, dst : 1, timestamp : 5, type : tx_commit src : 2, dst : 1, timestamp : 5, type : tx_commit src : 0, dst : 2, timestamp : 6, type : ack src : 0, dst : 2, timestamp : 6, type : ack src : 0, dst : 2, timestamp : 6, type : ack src : 1, dst : 2, timestamp : 7, type : ack src : 1, dst : 2, timestamp : 7, type : ack src : 1, dst : 2, timestamp : 7, type : ack src : 2, dst : 0, timestamp : 8, type : prepare src : 2, dst : 0, timestamp : 8, type : prepare src : 2, dst : 0, timestamp : 8, type : prepare host and execution logs src : 2, dst : 1, timestamp : 9, type : prepare src : 2, dst : 1, timestamp : 9, type : prepare src : 2, dst : 1, timestamp : 9, type : prepare src : 0, dst : 2, timestamp : 10, type : commit src : 0, dst : 2, timestamp : 10, type : commit src : 0, dst : 2, timestamp : 10, type : commit src : 1, dst : 2, timestamp : 11, type : commit src : 1, dst : 2, timestamp : 11, type : commit src : 1, dst : 2, timestamp : 11, type : commit src : 2, dst : 0, timestamp : 12, type : tx_commit src : 2, dst : 0, timestamp : 12, type : tx_commit src : 2, dst : 0, timestamp : 12, type : tx_commit src : 2, dst : 1, timestamp : 13, type : tx_commit src : 2, dst : 1, timestamp : 13, type : tx_commit src : 2, dst : 1, timestamp : 13, type : tx_commit src : 0, dst : 2, timestamp : 14, type : ack src : 0, dst : 2, timestamp : 14, type : ack src : 0, dst : 2, timestamp : 14, type : ack src : 1, dst : 2, timestamp : 15, type : ack src : 1, dst : 2, timestamp : 15, type : ack src : 1, dst : 2, timestamp : 15, type : ack src : 2, dst : 0, timestamp : 16, type : prepare src : 2, dst : 0, timestamp : 16, type : prepare src : 2, dst : 0, timestamp : 16, type : prepare src : 2, dst : 1, timestamp : 17, type : prepare src : 2, dst : 1, timestamp : 17, type : prepare src : 2, dst : 1, timestamp : 17, type : prepare log1.txt log2.txt log3.txt Ivan Beschastnikh University of British Columbia 3

Recommend

How Live is Live Streaming over HTTP? Inferring Playback Delay from Server Logs Megumi Ninomiya,

How Live is Live Streaming over HTTP? Inferring Playback Delay from Server Logs Megumi Ninomiya,

How Live is Live Streaming over HTTP? Inferring Playback Delay from Server Logs Megumi Ninomiya, Kenjiro Cho IIJ Research Lab. Live streaming of Summer Koshien" Peak Smartphone browsers, and dedicated Users can watch games on PC and

292 views • 5 slides
Chapter 3 Concurrent Execution DM519 Concurrent Programming 1 Repetition (Concepts, Models,

Chapter 3 Concurrent Execution DM519 Concurrent Programming 1 Repetition (Concepts, Models,

Chapter 3 Concurrent Execution DM519 Concurrent Programming 1 Repetition (Concepts, Models, and Practice) u Concepts: l We adopt a model-based approach for the design and construction of concurrent programs u Safe model => safe

919 views • 43 slides
Modeling and Analyzing Concurrent Systems Robert B. France 1

Modeling and Analyzing Concurrent Systems Robert B. France 1

Modeling and Analyzing Concurrent Systems Robert B. France 1 Overview Why model and analyze concurrent systems? How are concurrent systems modeled?

1.39k views • 83 slides
Logs on Logs on Logs No More Append Atomic & Remap Eric Mackay Venkatesh Srinivas Basics

Logs on Logs on Logs No More Append Atomic & Remap Eric Mackay Venkatesh Srinivas Basics

Logs on Logs on Logs No More Append Atomic & Remap Eric Mackay Venkatesh Srinivas Basics of Block Device Interfaces I/O is done in granularity of blocks 512 bytes is pretty standard Writing is slooooooow Data is

898 views • 15 slides
Modeling and Analyzing Concurrent Systems Robert B. France 1 Overview Why model and analyze

Modeling and Analyzing Concurrent Systems Robert B. France 1 Overview Why model and analyze

Modeling and Analyzing Concurrent Systems Robert B. France 1 Overview Why model and analyze concurrent systems? How are concurrent systems modeled? How are concurrent systems analyzed? What tools are available for modeling and

1.13k views • 85 slides
Revisiting AI and Testing Methods to Infer FSM Models of Black-Box Systems Roland Groz, Nicolas

Revisiting AI and Testing Methods to Infer FSM Models of Black-Box Systems Roland Groz, Nicolas

Revisiting AI and Testing Methods to Infer FSM Models of Black-Box Systems Roland Groz, Nicolas Bremond, Catherine Oriat, U. Grenoble Alpes, France Adenilso Simao, U. So Paulo, Brasil Global context: inferring models thru testing n

782 views • 18 slides
Inferring protein functions by matching binding surfaces through evolutionary models Jie Liang

Inferring protein functions by matching binding surfaces through evolutionary models Jie Liang

Inferring protein functions by matching binding surfaces through evolutionary models Jie Liang (Joint work with Jeffrey Tseng) Dept. of Bioengineering University of Illinois at Chicago Outline Methodology: Computational geometry of

630 views • 32 slides
Inferring Biological Regulatory Networks from Process Hitting models Maxime FOLSCHETTE 1 , 2

Inferring Biological Regulatory Networks from Process Hitting models Maxime FOLSCHETTE 1 , 2

MOVEP2012 10 th School for young researchers about Modelling and Verifying Parallel processes Inferring Biological Regulatory Networks from Process Hitting models Maxime FOLSCHETTE 1 , 2 MeForBio / IRCCyN / cole Centrale de Nantes

1.04k views • 78 slides
Concurrent Message Service M. Clemencic CERN - LHCb Forum on Concurrent Programming Models and

Concurrent Message Service M. Clemencic CERN - LHCb Forum on Concurrent Programming Models and

Concurrent Message Service M. Clemencic CERN - LHCb Forum on Concurrent Programming Models and Frameworks 24-10-2012 M. Clemencic (CERN - LHCb) Concurrent Message Service 24-10-2012 1 / 11 Outline Introduction 1 Gaudi Concurrent

777 views • 32 slides
CS510 Concurrent Systems Why the Grass May Not Be Greener

CS510 Concurrent Systems Why the Grass May Not Be Greener

CS510 Concurrent Systems Why the Grass May Not Be Greener on the Other Side: A Comparison of Locking and TransacConal Memory Why Do Concurrent

391 views • 17 slides
Inferring Test Models from Kates Bug Reports using Multi-objective Search Yuanyuan Zhang

Inferring Test Models from Kates Bug Reports using Multi-objective Search Yuanyuan Zhang

Inferring Test Models from Kates Bug Reports using Multi-objective Search Yuanyuan Zhang Mark Harman Yue Jia and Federica Sarro University College London SSBSE 2015 Challenge Track Paper Which page should we put more effort to proofread?

589 views • 28 slides
Inferring Sparse Gaussian Graphical Models for Biological Network Christophe Ambroise Camille

Inferring Sparse Gaussian Graphical Models for Biological Network Christophe Ambroise Camille

Inferring Sparse Gaussian Graphical Models for Biological Network Christophe Ambroise Camille Charbonnier, Julien Chiquet, Gilles Grasseau, Catherine Matias, Yves Grandvalet Laboratoire Statistique et G enome, e d UMR CNRS 8071 -

1.48k views • 110 slides
Parallel Analysis of Parallelism Verifying Concurrent Software System Designs Using GPUs GTC

Parallel Analysis of Parallelism Verifying Concurrent Software System Designs Using GPUs GTC

Parallel Analysis of Parallelism Verifying Concurrent Software System Designs Using GPUs GTC 2015 Anton Wijs Correctness of Concurrent Systems Distributed, concurrent systems common-place, but very

633 views • 52 slides
Inferring Networked System Models from Behavior Traces Ivan Beschastnikh Yuriy Brun Michael D.

Inferring Networked System Models from Behavior Traces Ivan Beschastnikh Yuriy Brun Michael D.

Inferring Networked System Models from Behavior Traces Ivan Beschastnikh Yuriy Brun Michael D. Ernst Arvind Krishnamurthy University of Washington U. Mass. Amherst Thomas E. Anderson Motivating question A developer often asks.. Why does

600 views • 10 slides
Shared Memory Consistency Models: A Tutorial Outline Concurrent programming on a uniprocessor

Shared Memory Consistency Models: A Tutorial Outline Concurrent programming on a uniprocessor

CS533 Concepts of Operating Systems Jonathan Walpole Shared Memory Consistency Models: A Tutorial Outline Concurrent programming on a uniprocessor The effect of optimizations on a uniprocessor The effect of the same optimizations on

1.02k views • 81 slides
Why are UI Logs Important? UI logs will help you identify Trends and Patterns that need to be

Why are UI Logs Important? UI logs will help you identify Trends and Patterns that need to be

2/17/2015 Unusual Incident Log Reviews January 23, 2015 Why are UI Logs Important? UI logs will help you identify Trends and Patterns that need to be addressed to ensure the Health and Welfare of those you serve. To ensure that sound

589 views • 24 slides
What Came First? The Ordering of Events in Systems @kavya719 kavya the design of concurrent

What Came First? The Ordering of Events in Systems @kavya719 kavya the design of concurrent

What Came First? The Ordering of Events in Systems @kavya719 kavya the design of concurrent systems Slack architecture on AWS systems with multiple independent actors . threads nodes in a multithreaded program. in a distributed system.

1.01k views • 72 slides
Mining Invariants from Logs for System Problem Detection Jian-Guang LOU, Qiang FU Software

Mining Invariants from Logs for System Problem Detection Jian-Guang LOU, Qiang FU Software

Mining Invariants from Logs for System Problem Detection Jian-Guang LOU, Qiang FU Software Analytics Microsoft Research Asia Background Many systems produce log messages for trouble-shooting. Logs usually record important system actions

706 views • 31 slides
On Inferring and Characterizing On Inferring and Characterizing Internet Routing Policies

On Inferring and Characterizing On Inferring and Characterizing Internet Routing Policies

On Inferring and Characterizing On Inferring and Characterizing Internet Routing Policies Internet Routing Policies Feng Wang Lixin Gao Department of Electrical and Computer Engineering University of Massachusetts, Amherst MA 01002, USA 1

450 views • 18 slides
Diagrammatic Algebra: from Linear to Concurrent Systems Filippo Bonchi, Joshua Holland, Robin

Diagrammatic Algebra: from Linear to Concurrent Systems Filippo Bonchi, Joshua Holland, Robin

Diagrammatic Algebra: from Linear to Concurrent Systems Filippo Bonchi, Joshua Holland, Robin Piedeleu, Pawe l Soboci nski and Fabio Zanasi PoPL 19, Cascais, Portugal Bonchi et al. From Linear to Concurrent Systems 18 Jan 2019 1 /

405 views • 39 slides
Concurrent Systems Doing many things at the same time Computadores II / 2004-2005

Concurrent Systems Doing many things at the same time Computadores II / 2004-2005

Concurrent Systems Doing many things at the same time Computadores II / 2004-2005 Characteristics of RTS Large and complex Large and complex Concurrent control of separate system components Facilities to interact with special

858 views • 59 slides
Anomaly Detection and Troubleshooting of Large Scale Systems from Event Logs Presented By Niloy

Anomaly Detection and Troubleshooting of Large Scale Systems from Event Logs Presented By Niloy

Anomaly Detection and Troubleshooting of Large Scale Systems from Event Logs Presented By Niloy Ganguly Bivas Mitra, Subhendu Khatuya Also in collaboration with NetApp Department of Computer Science and Engineering Indian Institute of

689 views • 53 slides
Introduction to Concurrency Why Study Concurrency? We are well into the era of concurrent

Introduction to Concurrency Why Study Concurrency? We are well into the era of concurrent

CS510 Concurrent Systems Jonathan Walpole Introduction to Concurrency Why Study Concurrency? We are well into the era of concurrent hardware - Moores law still holds (more or less) - processor cycles per sec is not increasing - cores per

1.01k views • 46 slides
Inferring Country-Level Transit Influence of Autonomous Systems Alexander Gamero-Garrido * ,

Inferring Country-Level Transit Influence of Autonomous Systems Alexander Gamero-Garrido * ,

Inferring Country-Level Transit Influence of Autonomous Systems Alexander Gamero-Garrido * , Esteban Carisimo 3* , Shuai Hao * , Bradley Hufgaker * , kc clafgy * , Alex C. Snoeren 2 , Alberto Dainotti * , and Amogh Dhamdhere * * CAIDA/UC San Diego

315 views • 3 slides

More recommend