On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,

Slides:



Advertisements
Similar presentations
DECISION MODELING WITH Multi-Objective Decision Making
Advertisements

Multi‑Criteria Decision Making
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Fast Algorithms For Hierarchical Range Histogram Constructions
IoP HEPP 2004 Birmingham, 7/4/04 David Cameron, University of Glasgow 1 Simulation of Replica Optimisation Strategies for Data.
1 1 Slide Chapter 10 Multicriteria Decision Making n A Scoring Model for Job Selection n Spreadsheet Solution of the Job Selection Scoring Model n The.
Introduction to Management Science
Copyright © 2006 Pearson Education Canada Inc Course Arrangement !!! Nov. 22,Tuesday Last Class Nov. 23,WednesdayQuiz 5 Nov. 25, FridayTutorial 5.
Applying Genetic Algorithms to Decision Making in Autonomic Computing Systems Authors: Andres J. Ramirez, David B. Knoester, Betty H.C. Cheng, Philip K.
1 Minggu 12, Pertemuan 23 Introduction to Distributed DBMS (Chapter , 22.6, 3rd ed.) Matakuliah: T0206-Sistem Basisdata Tahun: 2005 Versi: 1.0/0.0.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Overview Distributed vs. decentralized Why distributed databases
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Present by Chen, Ting-Wei Adaptive Task Checkpointing and Replication: Toward Efficient Fault-Tolerant Grids Maria Chtepen, Filip H.A. Claeys, Bart Dhoedt,
Introduction to Management Science
Grid Load Balancing Scheduling Algorithm Based on Statistics Thinking The 9th International Conference for Young Computer Scientists Bin Lu, Hongbin Zhang.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
A semantic learning for content- based image retrieval using analytical hierarchy process Speaker : Kun Hsiang.
1 Incentive-Based Scheduling for Market-Like Computational Grids Lijuan Xiao, Yanmin Zhu, Member, IEEE, Lionel M. Ni, Fellow, IEEE, and Zhiwei Xu, Senior.
1 A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids Riky Subrata, Member, IEEE, Albert Y. Zomaya, Fellow, IEEE, and Bjorn Landfeldt,
GRID COMPUTING: REPLICATION CONCEPTS Presented By: Payal Patel.
9-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Multicriteria Decision Making
9-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Presented by Johanna Lind and Anna Schurba Facility Location Planning using the Analytic Hierarchy Process Specialisation Seminar „Facility Location Planning“
Using Network Simulation Heung - Suk Hwang, Gyu-Sung Cho
1 Chapter 11 Implementation. 2 System implementation issues Acquisition techniques Site implementation tools Content management and updating System changeover.
Jason Chen, Ph.D. Professor of MIS School of Business
1 1 Slide © 2004 Thomson/South-Western Chapter 17 Multicriteria Decisions n Goal Programming n Goal Programming: Formulation and Graphical Solution and.
Network Aware Resource Allocation in Distributed Clouds.
The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Dataset Caitlin Minteer & Kelly Clynes.
Young Suk Moon Chair: Dr. Hans-Peter Bischof Reader: Dr. Gregor von Laszewski Observer: Dr. Minseok Kwon 1.
University of Westminster – Y. Zetuny, G. Terstyanszky, S. Winter, P. Kacsuk Centre for Parallel Computing Cavendish School of Informatics.
BFTCloud: A Byzantine Fault Tolerance Framework for Voluntary-Resource Cloud Computing Yilei Zhang, Zibin Zheng, and Michael R. Lyu
A Prediction-based Fair Replication Algorithm in Structured P2P Systems Xianshu Zhu, Dafang Zhang, Wenjia Li, Kun Huang Presented by: Xianshu Zhu College.
A Dynamic Data Grid Replication Strategy to Minimize the Data Missed Ming Lei, Susan Vrbsky, Xiaoyan Hong University of Alabama.
Software Requirements Engineering Negotiation Process Lecture-18.
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
GRID’2012 Dubna July 19, 2012 Dependable Job-flow Dispatching and Scheduling in Virtual Organizations of Distributed Computing Environments Victor Toporkov.
1 Optimal Resource Placement in Structured Peer-to-Peer Networks Authors: W. Rao, L. Chen, A.W.-C. Fu, G. Wang Source: IEEE Transactions on Parallel and.
Session-8 Data Management for Decision Support
© Mahindra Satyam 2009 Decision Analysis and Resolution QMS Training.
Your university or experiment logo here Caitriana Nicholson University of Glasgow Dynamic Data Replication in LCG 2008.
A Survey of Distributed Task Schedulers Kei Takahashi (M1)
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
MAINTENANCE STRATEGY SELECTION BASED ON HYBRID AHP-GP MODEL SUZANA SAVIĆ GORAN JANAĆKOVIĆ MIOMIR STANKOVIĆ University of Niš, Faculty of Occupational Safety.
Ajou University, South Korea GCC 2003 Presentation Dynamic Data Grid Replication Strategy based on Internet Hierarchy Sang Min Park , Jai-Hoon Kim, and.
Dynamic Load Balancing and Job Replication in a Global-Scale Grid Environment: A Comparison IEEE Transactions on Parallel and Distributed Systems, Vol.
Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.
PAPER PRESENTATION Real-Time Coordination of Plug-In Electric Vehicle Charging in Smart Grids to Minimize Power Losses and Improve Voltage Profile IEEE.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
Analytic Hierarchy Process. 2 The Analytic Hierarchy Process (AHP) Founded by Saaty in It is a popular and widely used method for multi-criteria.
Optimizing Live Migration of Virtual Machines across Wide Area Networks using Integrated Replication and Scheduling Sumit Kumar Bose, Unisys Scott Brock,
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
To accompany Quantitative Analysis for Management, 9e \by Render/Stair/Hanna M1-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Analytic Hierarchy.
BUSINESS PERFORMANCE MANAGEMENT
Caitriana Nicholson, CHEP 2006, Mumbai Caitriana Nicholson University of Glasgow Grid Data Management: Simulations of LCG 2008.
QoS Supported Clustered Query Processing in Large Collaboration of Heterogeneous Sensor Networks Debraj De and Lifeng Sang Ohio State University Workshop.
Scheduling MPI Workflow Applications on Computing Grids Juemin Zhang, Waleed Meleis, and David Kaeli Electrical and Computer Engineering Department, Northeastern.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
ESTIMATING WEIGHT Course: Special Topics in Remote Sensing & GIS Mirza Muhammad Waqar Contact: EXT:2257 RG712.
Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla,
Introduction to Load Balancing:
Reality of Highway Construction Equipment in Palestine
Supplement S7 Supplier Selection.
A Scoring Model for Job Selection
Agenda for This Week Monday, April 25 AHP Wednesday, April 27
Storing and Replication in Topic-Based Pub/Sub Networks
Multicriteria Decision Making
Presentation transcript:

On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 20, NO. 8, AUGUST 2009 Present by Chen, Ting-Wei

2 Table of Content Introduction Introduction System Requirements and Design System Requirements and Design Performance Metrics and Evaluation Performance Metrics and Evaluation Results and Discussion Results and Discussion Conclusions and Future Works Conclusions and Future Works

3 Introduction Problem Problem –How to select the best replica location from among many replica locations in minimum response time and high level of QoS? –How to establish fairness among the users in selecting the replica location, such that user gains an equity portion of QoS and response time in relation to other users?

4 Introduction (cont.) Replica selection Replica selection –One of major functions of data replication that decides which replica location is the best for the users based on some criteria Replicas for grid users Replicas for grid users –Minimum response time –High level of Quality of Service (QoS) –Be allocated among the users fairly

5 Introduction (cont.) Criteria in the selection decision Criteria in the selection decision –Response time –Security –Reliability  Conflict  Heterogeneous

6 Introduction (cont.) Achieves the following objectives Achieves the following objectives –Provides the Grid users with the required replica in minimum response time and maximum QoS –Establishes fairness among the users by providing a new method for resources allocation

7 Introduction (cont.) –Provides an elaborated method that generates the decision-maker preferences (weights) automatically, and is termed as the “ fairness method ” –Deploys the AHP model in replica selection engine

8 Introduction (cont.) Evaluated Evaluated –Own simulator which is an extension of the simulation OptorSim –Compare with the random algorithm  Because there is no previous work similar to them –Measure the fairness among users  Calculating the Standard Deviation (SD) FOR Grid users for each criterion value

9 System Requirements and Design Focus on Focus on –Replica selection decision –Establishing fairness among users –The most important resource

10 System Requirements and Design (cont.) Data file Copy 1 Grid site 1 Copy 5 Grid site 5 Copy 4 Grid site 4 Copy 3 Grid site 3 Copy 2 Grid site 2 Reliability Security Response Time Reliability Security Response Time Reliability Security Response Time Reliability Security Response Time Reliability Security Response Time

11 System Requirements and Design (cont.) Selection engine decides which is the best site Selection engine decides which is the best site –The highest secure site –The highest reliable site –The lower response time between the local site and the remote site  Best replica –The highest level of QoS

12 System Requirements and Design (cont.) Analytical Hierarchy Process Analytical Hierarchy Process –The weighted sum approach  Step 1: Underlying criteria. Thus, pair-wise comparisons are made and converted into quantity numbers. Criterion Scale of measurement Response Time From 30 minutes to 2000 minutes. Excellent=(30~100); Very Good=(101~500); Good=(501~1000); Indifferent=(1001~1500); Bad=(1501~2000) Reliability From 30 to 100. Excellent=(90~100); Very Good=(80~89); Good=(65~79); Indifferent=(50~64); Bad=(30~49) Security From 1 to 5. Excellent=5; Very Good=4; Good=3; Indifferent=2; Bad=1

13 System Requirements and Design (cont.)  Step 2 –The pair-wise comparisons are organized into a symmetric matrix –Multiply by itself becomes a judgment matrix –The total sum of each row in the judgment matrix is calculated to produce the AHP_Eigenvector value  Weight  Step 3 –For each criterion, the relative importance among the alternatives will be organized into a symmetric matrix, and steps 1, 2 are repeated

14 System Requirements and Design (cont.)  Step 4 –Local ratings –Multiply by the weights of the criteria of the judgment matrix (the first matrix) –Aggregate to get global ratings –Decision will be taken about the highest ranked alternative site  Disadvantage to AHP –Error prone –Hinder the dynamic nature of the autonomous Grid systems –Fairness Method is proposed to overcome this disadvantage

15 System Requirements and Design (cont.) Fairness Fairness –Contribute toward the replication management system in Grid –Contribute to other domains which have a similar optimization problem in selecting one possible solution

16 System Requirements and Design (cont.) System Detailed Design System Detailed Design –Data Grid architecture

17 System Requirements and Design (cont.) System consists of two main components System consists of two main components –Replica Manager (RM)  Manages the historical data file  Enquires the Replica Location Service for the related physical file name, and their sites locations  Enquires the NWS and GridFTP for site-related information and network status –Replica Selector (RS)  Located at each grid site (node) receives the requests from the user ’ s jobs

18 System Requirements and Design (cont.) –RS gets the related information from the RM in order to take the appropriate decision –RS computes the fairness values and comes up with the best replica location decision

19 System Requirements and Design (cont.) Implementation steps (Fairness method) Implementation steps (Fairness method) –Step 1:Calculate the User Criteria Average (UCA) from the historical data file for each criterion

20 System Requirements and Design (cont.) –Step 2: Calculate the System Criteria Average (SCA) for all users in the Grid system

21 System Requirements and Design (cont.) –Step 3: User Fairness (UF) is calculated for each criterion

22 System Requirements and Design (cont.) –Step 4: Calculate the correlated criteria weights  The equation is computed nine times by varying both i and j to fill the weights

23 System Requirements and Design (cont.) Implementation steps (AHP) Implementation steps (AHP) –Step 5: Produce the matrix  Fairness Matrix  Security Matrix  Reliability Matrix  Response Time Matrix

24 System Requirements and Design (cont.) –Step 6  Calculate the AHP_Eigenvector Security Matrix Row sum Eigenvector Total=10.34

25 System Requirements and Design (cont.) –Step 7  Aggregate the AHP_Eigenvector for reliability, security, and response time in one matrix  Multiply this matrix by the AHP_Eigenvector of the fairness matrix  One-dimensional array, rank array  The maximum value of the resulting ranked matrix is the best site

26 Performance Metrics and Evaluation Evaluate the system performance Evaluate the system performance –Measure –Analysis –Compare with other models Quality of Service (QoS) and Response Time Quality of Service (QoS) and Response Time –High level of security –The security value specified on each site in replica selection decision

27 Performance Metrics and Evaluation (cont.) Fairness Metric Fairness Metric –Measure the resources portion gained by a specified user –SD metrics are the appropriate metrics to measure the fairness level Evaluation Evaluation –OptorSim –Made some changes to suit the case –Compare with random algorithm

28 Results and Discussion Test case (1): Fairness Test case (1): Fairness –Before - After

29 Results and Discussion (cont.) –Before -After

30 Results and Discussion (cont.) Test case (2): Best Replica Selectin and Scalability Test case (2): Best Replica Selectin and Scalability

31 Results and Discussion (cont.)

32 Results and Discussion (cont.)

33 Results and Discussion (cont.)

34 Results and Discussion (cont.) –Overall of the fairness algorithm compared with the random algorithm

35 Conclusions and Future Works Conclusions Conclusions –Best replica selection –Establishing fairness among users –Advantage  The system allows Grid users to participate and share Grid resources fairly  The system achieves better satisfaction for Grid users –Reliability and security are maximized –Response time is minimized

36 Conclusions and Future Works (cont.) Future Works Future Works –Improve the replica selection process by involving the users in determining their preferences –Create another component to the system that provides searching and matching services for the users –The stock market shares will be adapted such that each user can sell or buy fairness values with other users

37 Conclusions and Future Works (cont.) –Expand the system –Propose a new replication strategy  Support replica management  Replica deletion  Replica placement  Reduce both job execution time and network traffic –The future replication strategy will be compared with the OptorSim

Thank You for Your Attention