Deadlock Detection in Distributed Process Networks – Alex Olson Process Networks (PN)  Determinate dataflow model [Kahn, 1974].  Concurrent processes.

Slides:

Advertisements

Similar presentations

University of South Australia Distributed Reconfiguration Avishek Chakraborty, David Kearney, Mark Jasiunas.

Advertisements

Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.

CHAPTER3 Higher-Level Synchronization and Communication

Effective Static Deadlock Detection

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Termination Detection of Diffusing Computations Chapter 19 Distributed Algorithms by Nancy Lynch Presented by Jamie Payton Oct. 3, 2003.

Iterative Context Bounding for Systematic Testing of Multithreaded Programs Madan Musuvathi Shaz Qadeer Microsoft Research.

CS 5204 – Operating Systems 1 Scheduler Activations.

JADE: The Bully Algorithm. Problem Context of distributed computing Problem of leader election: leader election is the process of designating a single.

Requirements on the Execution of Kahn Process Networks Marc Geilen and Twan Basten 11 April 2003 /e.

Bookshelf.EXE - BX A dynamic version of Bookshelf –Automatic submission of algorithm implementations, data and benchmarks into database Distributed computing.

CS444/CS544 Operating Systems Introduction to Synchronization 2/07/2007 Prof. Searleman

DATAFLOW PROCESS NETWORKS Edward A. Lee Thomas M. Parks.

Causality & Global States. P1 P2 P Physical Time 4 6 Include(obj1 ) obj1.method() P2 has obj1 Causality violation occurs when order.

A denotational framework for comparing models of computation Daniele Gasperini.

Using Interfaces to Analyze Compositionality Haiyang Zheng and Rachel Zhou EE290N Class Project Presentation Dec. 10, 2004.

CS603 Advanced Topics in Distributed Systems MWF 13:30-14:30 RHPH 162 Professor Chris Clifton.

Copyright © 2001 Stephen A. Edwards All rights reserved Dataflow Languages Prof. Stephen A. Edwards.

FunState – An Internal Design Representation for Codesign A model that enables representations of different types of system components. Mixture of functional.

AR vs. CFSM Abdallah Tabbara. CFSM Overview 4 CFSM has: –a finite state machine part –a data computation part –a locally synchronous behavior transitions.

1 Quasi-Static Scheduling of Embedded Software Using Free-Choice Petri Nets Marco Sgroi, Alberto Sangiovanni-Vincentelli Luciano Lavagno University of.

A Denotational Semantics For Dataflow with Firing Edward A. Lee Jike Chong Wei Zheng Paper Discussion for.

Hierarchical Reconfiguration of Dataflow Graphs Stephen Neuendorffer UC Berkeley Poster Preview May 10, 2004.

Real-Time Kernels and Operating Systems. Operating System: Software that coordinates multiple tasks in processor, including peripheral interfacing Types.

A Platform-based Design Flow for Kahn Process Networks Abhijit Davare Qi Zhu December 10, 2004.

On G-network and resource allocation in multimedia systems 報告者 : 王敬育.

Copyright © 2001 Stephen A. Edwards All rights reserved More About the Project Prof. Stephen A. Edwards.

1 Simulation Methodology H Plan: –Introduce basics of simulation modeling –Define terminology and methods used –Introduce simulation paradigms u Time-driven.

1 Correct and efficient implementations of synchronous models on asynchronous execution platforms Stavros Tripakis UC Berkeley and Verimag EC^2 Workshop,

Bioinformatics Protein structure prediction Motif finding Clustering techniques in bioinformatics Sequence alignment and comparison Phylogeny Applying.

Chapter 7: Architecture Design Omar Meqdadi SE 273 Lecture 7 Department of Computer Science and Software Engineering University of Wisconsin-Platteville.

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Hardware/Software Codesign of Embedded Systems Voicu Groza SITE Hall, Room.

Lecture #12 Distributed Algorithms (I) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.

Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.

Replication March 16, Replication What is Replication?  A technique for increasing availability, fault tolerance and sometimes, performance 

Pallavi Joshi* Mayur Naik † Koushik Sen* David Gay ‡ *UC Berkeley † Intel Labs Berkeley ‡ Google Inc.

1 Nasser Alsaedi. The ultimate goal for any computer system design are reliable execution of task and on time delivery of service. To increase system.

SYNCHRONIZATION TECHNIQUES BASED ON TWO-PHASE LOCKING

CE342 :OPERATING SYSTEM. I nstructor: Prof Dr. Saleh Shehaby Office Hours: E622 Thursday 10:30-2:30 Teacher Assistant.

Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.

Scalable Multi-core Sonar Beamforming with Computational Process Networks Motivation Sonar beamforming requires significant computation and input/output.

System-level power analysis and estimation September 20, 2006 Chong-Min Kyung.

OBJECTIVE: To learn about the various system calls. To perform the various CPU scheduling algorithms. To understand the concept of memory management schemes.

Ptolemy & Models of Computation -by Hao Chen, Zhuang Fan, Jin Xiao School of Computer Science University of Waterloo Claudius Ptolemaeus, the second century.

SCJ and EV3 Robots Leadership Election. Background Safety Critical Java – A safety critical programming model in Java EV3 mindstorms Lego Robot – A robot.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Concurrency & Dynamic Programming.

Silberschatz and Galvin  Chapter 3:Processes Processes –State of a process, process control block, –Scheduling of processes  Long term scheduler,

Bronis R. de Supinski and Jeffrey S. Vetter Center for Applied Scientific Computing August 15, 2000 Umpire: Making MPI Programs Safe.

Memory-Aware Scheduling for LU in Charm++ Isaac Dooley, Chao Mei, Jonathan Lifflander, Laxmikant V. Kale.

Efficient Group Key Management in Wireless LANs Celia Li and Uyen Trang Nguyen Computer Science and Engineering York University.

Tasks and Task Management : --Time-critical tasks --Contending tasks --Communicating tasks.

Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings.

Deadlock Detection for Distributed Process Networks Alex Olson Embedded Software Spring 2004.

Fault tolerance and related issues in distributed computing Shmuel Zaks GSSI - Feb

Hwajung Lee. Some applications - computing network topology - termination detection - deadlock detection Chandy Lamport algorithm does a partial job.

Clock Synchronization (Time Management) Deadlock Avoidance Using Null Messages.

Parallel and Distributed Simulation Deadlock Detection & Recovery: Performance Barrier Mechanisms.

Distributed Systems Lecture 6 Global states and snapshots 1.

PDES Introduction The Time Warp Mechanism

Chapter 3: Windows7 Part 5.

Parallel and Distributed Simulation

Applied Operating System Concepts -

Capriccio – A Thread Model

Chapter 3: Windows7 Part 5.

CS 143A – Winter 2013 Quiz 2 Solutions.

أنماط الإدارة المدرسية وتفويض السلطة الدكتور أشرف الصايغ

Deadlock Detection for Distributed Process Networks

Performance-Robust Parallel I/O

LabVIEW Based Embedded Design

Presentation transcript:

Deadlock Detection in Distributed Process Networks – Alex Olson Process Networks (PN)  Determinate dataflow model [Kahn, 1974].  Concurrent processes communicate via one-way channels (queues).  Allows for dynamic I/O behavior (e.g. data-dependent)  Suitable for distributed implementations.

Deadlock Detection in Distributed Process Networks – Alex Olson PN Scheduling  Bounded scheduling may introduce artificial deadlock.  On detection of deadlock, enlarge smallest queue. [Parks,1995]  How can one detect deadlock in a distributed implementation?

Deadlock Detection in Distributed Process Networks – Alex Olson Mitchell-Merritt Algorithm [1984]  Developed for distributed databases.  “Single-Resource” algorithm.  Exactly one process detects local deadlock.  Highly suitable for non-distributed & distributed PN implementations.