The "Almost Perfect" Paper -Christopher Francis Hyma Chilukiri.

Slides:



Advertisements
Similar presentations
Chapter 7: Deadlocks.
Advertisements

February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Deadlock 2.
Chapter 7: Deadlocks.
Chapter 7: Deadlocks (Continuation). 7.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts - 7 th Edition, Feb 14, 2005 Chapter 7: Deadlocks.
Resource Allocation, Deadlock and Banker’s Algorithm Supplementary Notes Dr. R. D. Kent Last modified: Dec. 11, 2006.
Operating System Concepts with Java – 7 th Edition, Nov 15, 2006 Silberschatz, Galvin and Gagne ©2007 Processes and Their Scheduling.
Deadlocks CS 3100 Deadlocks1. The Deadlock Problem A set of blocked processes each holding a resource and waiting to acquire a resource held by another.
1 Complexity of Network Synchronization Raeda Naamnieh.
Why static is bad! Hadoop Pregel MPI Shared cluster Today: static partitioningWant dynamic sharing.
1 Wednesday, June 28, 2006 Command, n.: Statement presented by a human and accepted by a computer in such a manner as to make the human feel that he is.
Chapter 7. Deadlocks.
Mesos A Platform for Fine-Grained Resource Sharing in the Data Center Benjamin Hindman, Andy Konwinski, Matei Zaharia, Ali Ghodsi, Anthony Joseph, Randy.
02/18/2008CSCI 315 Operating Systems Design1 Deadlock Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
Mesos A Platform for Fine-Grained Resource Sharing in the Data Center Benjamin Hindman, Andy Konwinski, Matei Zaharia, Ali Ghodsi, Anthony Joseph, Randy.
02/19/2008CSCI 315 Operating Systems Design1 Deadlock Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
5: CPU-Scheduling1 Jerry Breecher OPERATING SYSTEMS SCHEDULING.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 7: Deadlocks.
Deadlocks Gordon College Stephen Brinton. Deadlock Overview The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks.
Database Administration Part 1 Chapter Six CSCI260 Database Applications.
Maximum Entropy Model & Generalized Iterative Scaling Arindam Bose CS 621 – Artificial Intelligence 27 th August, 2007.
Cluster Scheduler Reference: Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center NSDI’2011 Multi-agent Cluster Scheduling for Scalability.
A Platform for Fine-Grained Resource Sharing in the Data Center
SHEAR AND BENDING MOMENT DIAGRAMS IN HORIZONTAL BEAMS WITH
1 Quincy: Fair Scheduling for Distributed Computing Clusters Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, and Andrew Goldberg.
Mesos A Platform for Fine-Grained Resource Sharing in the Data Center Benjamin Hindman, Andy Konwinski, Matei Zaharia, Ali Ghodsi, Anthony Joseph, Randy.
SOFTWARE / HARDWARE PARTITIONING TECHNIQUES SHaPES: A New Approach.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Deadlocks.
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion.
Cosc 4740 Chapter 6, Part 4 Deadlocks. The Deadlock Problem A set of blocked processes each holding a resource and waiting to acquire a resource held.
Matei Zaharia, Dhruba Borthakur *, Joydeep Sen Sarma *, Khaled Elmeleegy +, Scott Shenker, Ion Stoica UC Berkeley, * Facebook Inc, + Yahoo! Research Fair.
CY2003 Computer Systems Lecture 04 Interprocess Communication.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 7: Deadlocks.
Shanjiang Tang, Bu-Sung Lee, Bingsheng He, Haikun Liu School of Computer Engineering Nanyang Technological University Long-Term Resource Fairness Towards.
Chapter 8: Deadlocks Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock.
This Time - Deadlock Definition Conditions for deadlocks
Dr. Kalpakis CMSC 421, Operating Systems Deadlocks.
15.1 Transaction Concept A transaction is a unit of program execution that accesses and possibly updates various data items. E.g. transaction to transfer.
CS 346 – Chapter 7 Deadlock –Properties –Analysis: directed graph Handle –Prevent –Avoid Safe states and the Banker’s algorithm –Detect –Recover.
Outline Models Design of experiments Current Scheduler Completely Fair Scheduler(CFS) ◦ Since Linux ◦ /kernel/sched.c ◦ Maintain balance (fairness)
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 7: Deadlocks.
A Platform for Fine-Grained Resource Sharing in the Data Center
Chapter 8 Deadlocks. Objective System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection.
Chapter 7: Deadlocks. 7.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock.
CS307 Operating Systems Deadlocks Fan Wu Department of Computer Science and Engineering Shanghai Jiao Tong University Spring 2012.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 6 Deadlocks Slide 1 Chapter 6 Deadlocks.
Academic Year 2014 Spring Academic Year 2014 Spring.
CS3771 Today: Distributed Coordination  Previous class: Distributed File Systems Issues: Naming Strategies: Absolute Names, Mount Points (logical connection.
Presented by Qifan Pu With many slides from Ali’s NSDI talk Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion Stoica.
Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center NSDI 11’ Benjamin Hindman, Andy Konwinski, Matei Zaharia, Ali Ghodsi, Anthony D.
Spark on Entropy : A Reliable & Efficient Scheduler for Low-latency Parallel Jobs in Heterogeneous Cloud Huankai Chen PhD Student at University of Kent.
Deadlock CS Introduction to Operating Systems.
Tarcil: Reconciling Scheduling Speed and Quality in Large Shared Clusters Christina Delimitrou, Daniel Sanchez and Christos Kozyrakis Presented By Shiv.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 7: Deadlocks.
Chapter 7: Deadlocks.
Transaction Management
Tao Zhu1,2, Chengchun Shu1, Haiyan Yu1
Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center
MESOS.
CS 425 / ECE 428 Distributed Systems Fall 2016 Nov 10, 2016
Operating System: DEADLOCKS
Omega: flexible, scalable schedulers for large compute clusters
Chapter 7: Deadlocks.
CPU SCHEDULING.
Banker`s Algorithm Developed by Dijkstra in 1965
Outline Deadlocks, dead lock prevention, avoidance.
Deadlock Prevention Restrain the ways request can be made.
Cloud Computing Large-scale Resource Management
ITEC 202 Operating Systems
Chapter 7: Deadlocks.
Presentation transcript:

The "Almost Perfect" Paper -Christopher Francis Hyma Chilukiri

General observations from the paper : Scenario:1 " A framework can reject resources that do not satisfy its constraints in order to wait for ones that do. " section 3.2 Problem :- Starvation, Consider a scenario where a framework waits for a particular set of resources Also consider that mesos has a resource offer that has 1 less than those needed. According to the above statement the framework will reject the offer. Mesos does not offer a solution for a scenario where a cycle of offer and rejection occurs more than once "

Scenario : 2 " Mesos takes advantage of the fact that most tasks are short, and only reallocates resources when tasks finish for eg : if a framework’s share is 10% of the cluster, it needs to wait approximately 10% of the mean task length to receive its share. " section 3.3 Inference : - Tasks are short and we infer from the above statement that the amount of time a framework has to wait for its share is directly proportional to the number of resources utilized.Problem occurs if the task is of a longer duration.

Scenario 3 :- Killing a task if it exceeds guaranteed list "Killing a task has a low impact but it is harmful for frameworks with interdependent tasks" section 3.3 Inference :- We infer that if a framework with interdependent tasks exceeds the guaranteed allocation it would be killed and this would trigger a cascade reaction of several inconsistencies violating the ACID principle.

Scenario 4:- " Mesos performs well when frameworks can scale up and down elastically, tasks durations are homogeneous, and frameworks prefer all nodes equally but when different frameworks prefer different nodes Mesos emulates centralised scheduler." section 4 The paper does not account for the performance of mesos when 1.Frameworks such as MPI which are rigid and does not support elasticity 2. Task durations are heterogeneous which is a more practical scenario to consider.

Scenario 5: "We assume the amount of mandatory resources requested by a framework never exceeds its guaranteed share. This ensures that frameworks will not deadlock waiting for the mandatory resources to become free" section 4.1 This assumption is not practical

Evaluation benchmarks : * Every evaluation is compared with Hadoop static. for eg: All the tests Mesos + torque, Mesos + Spark are compared only with Hadoop static * Mesos emulates centralized scheduler when the tasks are heterogeneous but they do not compare the test results with centralized schedulers. * Organisation and maintenance of filters