10 th December, 2013 Lab Meeting Papers Reviewed:.

Slides:



Advertisements
Similar presentations
2000 Making DADS distributed a Nordunet2 project Jochen Hollmann Chalmers University of Technology.
Advertisements

Time Demand Analysis.
Modeling and Simulation By Lecturer: Nada Ahmed. Introduction to simulation and Modeling.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Fault-Tolerant Scheduling Techniques.
Hadi Goudarzi and Massoud Pedram
Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Authored by: Seth Gilbert and Nancy Lynch Presented by:
Meta-Level Control in Multi-Agent Systems Anita Raja and Victor Lesser Department of Computer Science University of Massachusetts Amherst, MA
Intaver Institute Inc. 303, 6707, Elbow Drive S.W., Calgary AB Canada T2V 0E5 Quantitative Risk Analysis for Aerospace Industry.
Real-Time Scheduling CIS700 Insup Lee October 3, 2005 CIS 700.
1 Link Layer Multicasting with Smart Antennas: No Client Left Behind Souvik Sen, Jie Xiong, Rahul Ghosh, Romit Roy Choudhury Duke University.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
Lab Meeting Performance Analysis of Distributed Embedded Systems Lothar Thiele and Ernesto Wandeler Presented by Alex Cameron 17 th August, 2012.
Distributed Systems Fall 2010 Replication Fall 20105DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Towards Feasibility Region Calculus: An End-to-end Schedulability Analysis of Real- Time Multistage Execution William Hawkins and Tarek Abdelzaher Presented.
SIGMETRICS 2008: Introduction to Control Theory. Abdelzaher, Diao, Hellerstein, Lu, and Zhu. CPU Utilization Control in Distributed Real-Time Systems Chenyang.
1 Availability Study of Dynamic Voting Algorithms Kyle Ingols and Idit Keidar MIT Lab for Computer Science.
2/23/2009CS50901 Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial Fred B. Schneider Presenter: Aly Farahat.
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Present by Chen, Ting-Wei Adaptive Task Checkpointing and Replication: Toward Efficient Fault-Tolerant Grids Maria Chtepen, Filip H.A. Claeys, Bart Dhoedt,
Soft. Eng. II, Spr. 2002Dr Driss Kettani, from I. Sommerville1 CSC-3325: Chapter 9 Title : Reliability Reading: I. Sommerville, Chap. 16, 17 and 18.
7. Fault Tolerance Through Dynamic or Standby Redundancy 7.5 Forward Recovery Systems Upon the detection of a failure, the system discards the current.
Strategic Directions in Real- Time & Embedded Systems Aatash Patel 18 th September, 2001.
Modeling Capabilities and Workload in Intelligent Agents for Simulating Teamwork Thomas R. Ioerger, Linli He, Deborah Lord Dept. of Computer Science, Texas.
Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Influence of different system abstractions on the performance analysis.
1 Proportional differentiations provisioning Packet Scheduling & Buffer Management Yang Chen LANDER CSE Department SUNY at Buffalo.
Hardness-Aware Restart Policies Yongshao Ruan, Eric Horvitz, & Henry Kautz IJCAI 2003 Workshop on Stochastic Search.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.
MobSched: An Optimizable Scheduler for Mobile Cloud Computing S. SindiaS. GaoB. Black A.LimV. D. AgrawalP. Agrawal Auburn University, Auburn, AL 45 th.
Database Replication Policies for Dynamic Content Applications Gokul Soundararajan, Cristiana Amza, Ashvin Goel University of Toronto EuroSys 2006: Leuven,
SYSTEM DYNAMICS MODELING OF AGILE CONTINUOUS DELIVERY PROCESS 資工 4A 鄭鈞輿.
Fault-Tolerant Workflow Scheduling Using Spot Instances on Clouds Deepak Poola, Kotagiri Ramamohanarao, and Rajkumar Buyya Cloud Computing and Distributed.
2Object-Oriented Analysis and Design with the Unified Process The Requirements Discipline in More Detail  Focus shifts from defining to realizing objectives.
What are the main differences and commonalities between the IS and DA systems? How information is transferred between tasks: (i) IS it may be often achieved.
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
Probabilistic Preemption Control using Frequency Scaling for Sporadic Real-time Tasks Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat.
A Survey of Distributed Task Schedulers Kei Takahashi (M1)
Xiao Liu, Jinjun Chen, Ke Liu, Yun Yang CS3: Centre for Complex Software Systems and Services Swinburne University of Technology, Melbourne, Australia.
Predicting Queue Waiting Time in Batch Controlled Systems Rich Wolski, Dan Nurmi, John Brevik, Graziano Obertelli Computer Science Department University.
A Node and Load Allocation Algorithm for Resilient CPSs under Energy-Exhaustion Attack Tam Chantem and Ryan M. Gerdes Electrical and Computer Engineering.
Project Portfolio Management MaestroTec, Inc. Project Portfolio Management Providing the tools and resources necessary to effectively.
Real-Time Scheduling CS4730 Fall 2010 Dr. José M. Garrido Department of Computer Science and Information Systems Kennesaw State University.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
The System and Software Development Process Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Object-Oriented Design and Implementation of the OE-Scheduler in Real-time Environments Ilhyun Lee Cherry K. Owen Haesun K. Lee The University of Texas.
5 May CmpE 516 Fault Tolerant Scheduling in Multiprocessor Systems Betül Demiröz.
Quantitative Project Risk Analysis 1 Intaver Institute Inc. 303, 6707, Elbow Drive S.W., Calgary AB Canada T2V 0E5
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
Distributed Process Scheduling : A Summary
BSBPMG404A Apply Quality Management Techniques Apply Quality Management Techniques Project Quality Processes C ertificate IV in Project Management
1/22 Optimization of Google Cloud Task Processing with Checkpoint-Restart Mechanism Speaker: Sheng Di Coauthors: Yves Robert, Frédéric Vivien, Derrick.
Real-Time systems By Dr. Amin Danial Asham.
WERST – Methodology Group
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults Ching-Chih Han, Kang G. Shin, and Jian Wu.
Mok & friends. Resource partition for real- time systems (RTAS 2001)
1 Selection Strategies for Peer-to-Peer 3D Streaming Wei-Lun Sung, Shun-Yun Hu, Jehn-Ruey Jiang National Central University, Taiwan 2008/05/29.
An Algorithm for Automatically Obtaining Distributed and Fault Tolerant Static Schedules Alain Girault - Hamoudi Kalla - Yves Sorel - Mihaela Sighireanu.
Application-Aware Traffic Scheduling for Workload Offloading in Mobile Clouds Liang Tong, Wei Gao University of Tennessee – Knoxville IEEE INFOCOM
Test Lab Management and
Software Metrics and Reliability
Dynamic Graph Partitioning Algorithm
Quantitative Risk Analysis for Aerospace Industry
COMP60621 Designing for Parallelism
Limited-Preemption Scheduling of Sporadic Tasks Systems
MagnaData: Scheduling Complex Workflows with Non-Functional Requirements in Datacenters Laurens Versluis Massivizing Computer research.
Real-Time Process Scheduling Concepts, Design and Implementations
Real-Time Process Scheduling Concepts, Design and Implementations
Progress Report 2013/08/08.
Anand Bhat*, Soheil Samii†, Raj Rajkumar* *Carnegie Mellon University
Presentation transcript:

10 th December, 2013 Lab Meeting Papers Reviewed:

Fault tolerant workflow scheduling Primary Issue : – Scheduling workflows in a cloud environment, with deadlines, is a complex problem – Issues of shared resources, time to release, resource availability, access control during execution, failures, etc. – The main goal is to schedule workflows and execute these workflows within the deadline in-spite of many failures that occur in the environment. Solution: – Use of replication and resubmission of tasks based on priority of task. – Need to avoid resource wastages – Heuristic metric finds trade-off between replication and resubmission factors without the need for history data 1 1. Fault tolerant workflow scheduling based on replication and resubmission of tasks in Cloud Computing. Jayadivya et. al.

1 Results Ratio of success rate and resource usage Failure Probability

My Observations Difficult to understand the relevance of the deadline to the success or failure curves Failure probabilities for ‘with replication’ would be expected to be much better Surprising result is Performance Comparison are similar – this is probably due to heuristic metric – which is not discussed in detail. The mean number of replications necessary to achieve results is not specified 1 1. Fault tolerant workflow scheduling based on replication and resubmission of tasks in Cloud Computing. Jayadivya et. al.

Prediction of Remaining Service Execution Time Primary Benefits: – Dynamic Process Tracking requires predicted remaining duration – It also assists scheduling of resources – It provides feedback to the client Present State – Present methods update predictions on event arrival and subtract elapsed time New Approach: – Also consider expected events that have not occurred – Prediction approach based on PN formalism so that concurrency can be modelled 2 2. Prediction of remaining service execution time using stochastic PN with arbitrary firing delays. Andreas Rogge-Solti et. al.

Prediction of Remaining Service Execution Time

My Observations Empirical Models are not use Requires immediate notification of event Simulations assume a stable state In a real-time system this may not be feasible 1

QUESTIONS Thank you….