Scheduling Jobs in Multi-Grid Environment

Slides:



Advertisements
Similar presentations
Scheduling in Distributed Systems Gurmeet Singh CS 599 Lecture.
Advertisements

Achieving Elasticity for Cloud MapReduce Jobs Khaled Salah IEEE CloudNet 2013 – San Francisco November 13, 2013.
1 of 14 1 /23 Flexibility Driven Scheduling and Mapping for Distributed Real-Time Systems Paul Pop, Petru Eles, Zebo Peng Department of Computer and Information.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
An Agent-Based Approach to Inference Prevention in Distributed Database System Xue Ying Chen Department of Computer Science.
Banker’s Algorithm Implementation in CPN Tools Michal Žarnay Department of Transportation Networks University of Žilina, Slovakia.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
1 of 14 1 / 18 An Approach to Incremental Design of Distributed Embedded Systems Paul Pop, Petru Eles, Traian Pop, Zebo Peng Department of Computer and.
Decidability of Minimal Supports of S-invariants and the Computation of their Supported S- invariants of Petri Nets Faming Lu Shandong university of Science.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
Using Trust in Distributed Consensus with Adversaries in Sensor and Other Networks Xiangyang Liu, and John S. Baras Institute for Systems Research and.
Resource Provisioning based on Lease Preemption in InterGrid Mohsen Amini Salehi, Bahman Javadi, Rajkumar Buyya Cloud Computing and Distributed Systems.
Trace Generation to Simulate Large Scale Distributed Application Olivier Dalle, Emiio P. ManciniMar. 8th, 2012.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 March 01, 2005 Session 14.
In each iteration macro model creates several micro modules, sends data to them and waits for the results. Using Akka Actors for Managing Iterations in.
GRID’2012 Dubna July 19, 2012 Dependable Job-flow Dispatching and Scheduling in Virtual Organizations of Distributed Computing Environments Victor Toporkov.
1 A Framework for Data-Intensive Computing with Cloud Bursting Tekin Bicer David ChiuGagan Agrawal Department of Compute Science and Engineering The Ohio.
CDL-Flex Empirical Research
Summer Report Xi He Golisano College of Computing and Information Sciences Rochester Institute of Technology Rochester, NY
Power Management of Flash Memory for Portable Devices ELG 4135, Fall 2006 Faculty of Engineering, University of Ottawa November 1, 2006 Thayalan Selvam.
BOF: Megajobs Gracie: Grid Resource Virtualization and Customization Infrastructure How to execute hundreds of thousands tasks concurrently on distributed.
Resource Brokering in the PROGRESS Project Juliusz Pukacki Grid Resource Management Workshop, October 2003.
Autonomic scheduling of tasks from data parallel patterns to CPU/GPU core mixes Published in: High Performance Computing and Simulation (HPCS), 2013 International.
Copyright © 2011, Performance Evaluation of a Green Scheduling Algorithm for Energy Savings in Cloud Computing Truong Vinh Truong Duy; Sato,
Static Process Scheduling Section 5.2 CSc 8320 Alex De Ruiter
Service-oriented Resource Broker for QoS-Guaranteed in Grid Computing System Yichao Yang, Jin Wu, Lei Lang, Yanbo Zhou and Zhili Sun Centre for communication.
Task Graph Scheduling for RTR Paper Review By Gregor Scott.
School Cloud Professor Kam-Fai Wong Managing Director, School Net Cum Associate Dean (External Affairs), Faculty of Engineering, CUHK.
An Energy-efficient Task Scheduler for Multi-core Platforms with per-core DVFS Based on Task Characteristics Ching-Chi Lin Institute of Information Science,
Control Strategies for Microgrids Ali Mehrizi-Sani Assistant Professor School of Electrical Engineering and Computer Science Washington State University.
Uppsala, April 12-16th 2010EGEE 5th User Forum1 A Business-Driven Cloudburst Scheduler for Bag-of-Task Applications Francisco Brasileiro, Ricardo Araújo,
Basics and Principles of Scientific Research By Ass. Prof. Dr. Majid S. Naghmash Diglah University College Department of Computer Engineering Techniques.
HAMA: An Efficient Matrix Computation with the MapReduce Framework Sangwon Seo, Edward J. Woon, Jaehong Kim, Seongwook Jin, Jin-soo Kim, Seungryoul Maeng.
Scheduling MPI Workflow Applications on Computing Grids Juemin Zhang, Waleed Meleis, and David Kaeli Electrical and Computer Engineering Department, Northeastern.
Xi He Golisano College of Computing and Information Sciences Rochester Institute of Technology Rochester, NY THERMAL-AWARE RESOURCE.
A Two-phase Execution Engine of Reduce Tasks In Hadoop MapReduce XiaohongZhang*GuoweiWang* ZijingYang*YangDing School of Computer Science and Technology.
An Energy Efficient Sleep Scheduling Considering QoS Diversity for IEEE e Wireless Networks Speaker: Wun-Cheng Li IEEE ICC 2010 Jen-Jee Chen, Jia-Ming.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
University of Texas at Arlington Scheduling and Load Balancing on the NASA Information Power Grid Sajal K. Das, Shailendra Kumar, Manish Arora Department.
Zeta: Scheduling Interactive Services with Partial Execution Yuxiong He, Sameh Elnikety, James Larus, Chenyu Yan Microsoft Research and Microsoft Bing.
Euro-Par, HASTE: An Adaptive Middleware for Supporting Time-Critical Event Handling in Distributed Environments ICAC 2008 Conference June 2 nd,
1 Performance Impact of Resource Provisioning on Workflows Gurmeet Singh, Carl Kesselman and Ewa Deelman Information Science Institute University of Southern.
Resource Provision for Batch and Interactive Workloads in Data Centers Ting-Wei Chang, Pangfeng Liu Department of Computer Science and Information Engineering,
Introduction | Model | Solution | Evaluation
Ching-Chi Lin Institute of Information Science, Academia Sinica
A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids e-Science IEEE 2007 Report: Wei-Cheng Lee
Efficient Load Balancing Algorithm for Cloud
Implementation and Experimentation of Producer- Consumer Synchronization Problem 呂鴻洋 Introduction Producer-consumer problem is one classical.
James D. Z. Ma Department of Electrical and Computer Engineering
Immediate-request vs. scheduled calls Short-duration vs
Introduction to Agents
Ontology Partition for Browsing
Rui Wu, Jose Painumkal, Sergiu M. Dascalu, Frederick C. Harris, Jr
Computation of Minimal Siphons for a Class of Generalized Petri Nets
Control Architecture for Flexible Production Systems
Topological Ordering Algorithm: Example
Ho-Ramammorthy 2 phase snapshot algorithm PRESENTATION
Topological Ordering Algorithm: Example
Presented By: Darlene Banta
Adaptive Data Refinement for Parallel Dynamic Programming Applications
Topological Ordering Algorithm: Example
Resource Allocation for Distributed Streaming Applications
Chapter 2. Problem Solving and Software Engineering
Ho-Ramamoorthy 2-Phase Deadlock Detection Algorithm
Reliable Web Services: Methodology, Experiment and Modeling International Conference on Web Services (ICWS 2007) Pat. P. W. Chan, Michael R. Lyu Department.
Workflow Mining: Concepts and Algorithm
Topological Ordering Algorithm: Example
GGF10 Workflow Workshop Summary
Presentation transcript:

Scheduling Jobs in Multi-Grid Environment Albana Roçi and Reggie Davidrajuh Department of Electronic Engineering and Computer Science

Outline Background Proposed Algorithm Results Conclusion

Multi Grid A grid job is organized as a flow of different activities [1, 2] The grid should be interconnected with some other grids to enable the executions of the tasks [1] Figure 1. Grid System [2]

Activity – Oriented Petri Nets (GPenSim) Model Simplicity Resource management Figure 2. Classical Petri Net Model Figure 3. AOPN Model

Example The first module has 16 tasks and 4 heterogeneous resources. The second module has 17 tasks and 4 heterogeneous resources. Figure 4. First Module Figure 5. Second Module

Proposed Algorithm When an external request comes to the broker, it checks for the availability of the local resource: If the task has been completed The task is in execution mode but the recourse does not contribute in the execution. If the resource is available, but the task has not started the execution because it is waiting for another task under execution to be completed. It checks the time gap between them.

Example Lets suppose that the process is in the 3rd TU. The fifth task from the second module requires first resource from the first module. Figure 6. Graph model of the First Module

Example Figure 7. Depth First Search algorithm Figure 8. Topological sort algorithm

Results Naïve Solution Proposed Algorithm

Conclusion A understandable and efficient algorithm is implemented using GPenSim The time of the execution is minimized The resources are well organized There is no any deadlock during the processing

Thank You!

References [1] M. Silberstein, D. Geiger, A. Schuster, & M. Livny, Scheduling mixed workloads in multi-grids: the grid execution hierarchy. In High Performance Distributed Computing, 2006 15th IEEE International Symposium on (pp. 291-302). IEEE. June 2006. [2] R. Davidrajuh, A New Two-Phase Approach for Petri Net Based Modeling of Scheduling Problems. In Industrial Engineering, Management Science and Applications 2015 (pp. 125-134). Springer, Berlin, Heidelberg. 2015. [3] General Purpose Petri Net Simulator (GPenSIM): http://davidrajuh.net/gpensim/