Fault-Tolerant Storage Servers for the Databases of Redundant Web Servers in a Computing Grid

Similar documents
Tacked Link List - An Improved Linked List for Advance Resource Reservation

Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment

The New Territory of Lightweight Security in a Cloud Computing Environment

A Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme

BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm

Application of RMAN Backup Technology in the Agricultural Products Wholesale Market System

Threshold Based Auto Scaling of Virtual Machines in Cloud Environment

Change Detection System for the Maintenance of Automated Testing

An FCA Framework for Knowledge Discovery in SPARQL Query Answers

Multimedia CTI Services for Telecommunication Systems

A Practical Evaluation Method of Network Traffic Load for Capacity Planning

UsiXML Extension for Awareness Support

Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints

Setup of epiphytic assistance systems with SEPIA

Blind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better

On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment

Relabeling nodes according to the structure of the graph

Every 3-connected, essentially 11-connected line graph is hamiltonian

How to simulate a volume-controlled flooding with mathematical morphology operators?

Assisted Policy Management for SPARQL Endpoints Access Control

Linked data from your pocket: The Android RDFContentProvider

Real-Time and Resilient Intrusion Detection: A Flow-Based Approach

LaHC at CLEF 2015 SBS Lab

Zigbee Wireless Sensor Network Nodes Deployment Strategy for Digital Agricultural Data Acquisition

A Voronoi-Based Hybrid Meshing Method

Linux: Understanding Process-Level Power Consumption

Representation of Finite Games as Network Congestion Games

Malware models for network and service management

Detecting Anomalies in Netflow Record Time Series by Using a Kernel Function

DANCer: Dynamic Attributed Network with Community Structure Generator

Real-Time Collision Detection for Dynamic Virtual Environments

Mokka, main guidelines and future

Cloud My Task - A Peer-to-Peer Distributed Python Script Execution Service

QAKiS: an Open Domain QA System based on Relational Patterns

A New Method for Mining High Average Utility Itemsets

Study on Feebly Open Set with Respect to an Ideal Topological Spaces

HySCaS: Hybrid Stereoscopic Calibration Software

MUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor

Service Reconfiguration in the DANAH Assistive System

Application of Artificial Neural Network to Predict Static Loads on an Aircraft Rib

Open Digital Forms. Hiep Le, Thomas Rebele, Fabian Suchanek. HAL Id: hal

Taking Benefit from the User Density in Large Cities for Delivering SMS

SIM-Mee - Mobilizing your social network

Very Tight Coupling between LTE and WiFi: a Practical Analysis

Multi-atlas labeling with population-specific template and non-local patch-based label fusion

Teaching Encapsulation and Modularity in Object-Oriented Languages with Access Graphs

Hardware Acceleration for Measurements in 100 Gb/s Networks

Technical Overview of F-Interop

BugMaps-Granger: A Tool for Causality Analysis between Source Code Metrics and Bugs

YANG-Based Configuration Modeling - The SecSIP IPS Case Study

Implementing Forensic Readiness Using Performance Monitoring Tools

ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler

Comparison of spatial indexes

Managing Risks at Runtime in VoIP Networks and Services

Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows

Traffic Grooming in Bidirectional WDM Ring Networks

Natural Language Based User Interface for On-Demand Service Composition

The Connectivity Order of Links

Comparator: A Tool for Quantifying Behavioural Compatibility

An Implementation of a Paper Based Authentication Using HC2D Barcode and Digital Signature

From Object-Oriented Programming to Service-Oriented Computing: How to Improve Interoperability by Preserving Subtyping

Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material

YAM++ : A multi-strategy based approach for Ontology matching task

Structuring the First Steps of Requirements Elicitation

Monitoring Air Quality in Korea s Metropolises on Ultra-High Resolution Wall-Sized Displays

Catalogue of architectural patterns characterized by constraint components, Version 1.0

Computing and maximizing the exact reliability of wireless backhaul networks

X-Kaapi C programming interface

An Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions

NP versus PSPACE. Frank Vega. To cite this version: HAL Id: hal

Recommendation-Based Trust Model in P2P Network Environment

KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard

Decentralised and Privacy-Aware Learning of Traversal Time Models

Robust IP and UDP-lite header recovery for packetized multimedia transmission

Full Text Search Engine as Scalable k-nearest Neighbor Recommendation System

IntroClassJava: A Benchmark of 297 Small and Buggy Java Programs

Implementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context

Real-time FEM based control of soft surgical robots

From Microsoft Word 2003 to Microsoft Word 2007: Design Heuristics, Design Flaws and Lessons Learnt

Kernel perfect and critical kernel imperfect digraphs structure

Search-Based Testing for Embedded Telecom Software with Complex Input Structures

FStream: a decentralized and social music streamer

Scan chain encryption in Test Standards

A 64-Kbytes ITTAGE indirect branch predictor

Simulations of VANET Scenarios with OPNET and SUMO

QuickRanking: Fast Algorithm For Sorting And Ranking Data

Moveability and Collision Analysis for Fully-Parallel Manipulators

Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression

Experimental Evaluation of an IEC Station Bus Communication Reliability

FIT IoT-LAB: The Largest IoT Open Experimental Testbed

Deformetrica: a software for statistical analysis of anatomical shapes

Comparison of radiosity and ray-tracing methods for coupled rooms

Open Source Software Developer and Project Networks

The Animation Loop Station: Near Real-Time Animation Production

SDLS: a Matlab package for solving conic least-squares problems

Reverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces

Kernel-Based Laplacian Smoothing Method for 3D Mesh Denoising

An Experimental Assessment of the 2D Visibility Complex

Light field video dataset captured by a R8 Raytrix camera (with disparity maps)

A Short SPAN+AVISPA Tutorial

Transcription:

Fault-Tolerant s for the Databases of Redundant Web Servers in a Computing Grid Minhwan Ok To cite this version: Minhwan Ok. Fault-Tolerant s for the Databases of Redundant Web Servers in a Computing Grid. Ching-Hsien Hsu; Xuanhua Shi; Valentina Salapura. 11th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2014, Ilan, Taiwan. Springer, Lecture Notes in Computer Science, LNCS-8707, pp.591-594, 2014, Network and Parallel Computing. <10.1007/978-3-662-44917-2_60>. <hal-01403156> HAL Id: hal-01403156 https://hal.inria.fr/hal-01403156 Submitted on 25 Nov 2016 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Distributed under a Creative Commons ttributionttribution 4.0 International License

Fault-Tolerant s for the Databases of Redundant Web Servers in a Computing Grid MinHwan Ok Korea Railroad Research Institute, Woulam, Uiwang, Gyeonggi, Korea mhok@krri.re.kr Abstract. Computing Grid in this paper is a Grid computing environment that supplies applications which run in a local computing site only, without any modification or adaptation for running globally in the Grid computing environment. Each stage of a running application is transcribed at all the management databases coupled with respective Web servers. The consistency is maintained by double-checking of every acknowledgement against a write to all the management databases and a circulated read response from either database. The storage spaces could be integrated into a single one by storage managers within a computing site. The modification of a file is broadcast to the storage managers sharing the storage space and their allocation tables are updated immediately. The system architecture is in a distributed control type, potentially the best match for Cloud computing. Keywords: Scalable Web service, computing Grid, Fault-tolerant, Storage virtualization. 1 Constructing the Computing Grid In the system model, the applications are provided to the users by Web service. A client computer connects to the Web server of the coordinator. is composed of user interfaces to log-on the computing Grid and to input parameters with user input/output data transfer. is the manager of information including parameters input, software title selected, and details concerned with user ID. It also selects appropriate computing site for the user. Connector is a client of and read/write information/report from/to the management database. Applications are launched, controlled and landed through Application Manager, which would be a kind of RFB. In Fig. 1, Application Manager delivers the commands included in the order, which is received via Connector, to the Application. When transferring the output data, should be re-authenticated for the security of user data. On writing information to the management of the originator coordinator, the originator writes the same information to the management s of the other coordinator, if one or more coordinator does not respond to the writing, the coordinator is presumed crashed-down. This is broadcast to the remained coordinators. On reading adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011

information from the management of the originator coordinator, the originator initiates reading from the management of the next coordinator, after reading the information from the its own management. The reading is relayed returning to the originator, thus it is named Circulated Read. If one or more coordinator does not respond to this reading, the coordinator is presumed crashed-down and this is also broadcast to the remained coordinators. Web Server Application Client Application Manager Connector Web Browser Client Server Storage Manager Application Client Fig. 1. System architecture of the computing Grid Fig. 2 illustrates the circulated read request/response, the broadcast write is illustrated in Fig. 3. In both information writing and information circulated reading, the originator creates Replay Roll if it detects any crashed-down coordinator. Replay roll is the list of transactions from the point the crash-down is detected to the point the crashed-down coordinator broadcasts its restart. Then the coordinator updates its management following the replay roll the originator has sent. Keeping up the recorded information identical is the major issue in this follow-up scenario. 1 2 3 Read Originator 1 2 3 Read-Relay 2 Read-Relay 1 Fig. 2. reading from either management is relayed, which will be circulated to the originator and the originator responds with the information last.

1 2 3 Write Originator Fig. 3. writing to the management of the other coordinators are acknowledged later and the coordination service continues without these acknowledgements. 2 Multiple s Ancillary to the selected one among local computing sites the software installed, one of storage servers is designated for sizable storage space to process large quantities of data with the storage farm. The storage space for application running is confined within the application server in the previous work[1]. It is also confined in the application server in this work, except that the whole data is partitioned and the partitions are replaced to be processed in the application server in the manner similar to the virtual memory. The application has restarted in the case of the storage server failure in the previous work, however the application rolls back to the previous phase of the current partition in this work. For active/standby failover, the allocation table is mirrored to the other storage server. A couple of storage servers are assigned to backups of each other, and the storage manager has dual modes between active/standby in normal status and active/active in abnormal status, of the other server. Coupling two storage servers is static and conducted by the administrator. Gateway Gateway Storage Farm Storage Farm Loading ion 2 ion 1 ion 2 ion 3 ion 4 ion 5 Fig. 4. Computing Grid Organization and storage management on partitioned data Since multiple storage servers govern the storage farm, the write to a storage device is allowed while the storage manager has the token of the device that the token is traversing storage servers otherwise. Once the storage manager wrote to a storage device, it broadcasts allocation information of the written file to other storage managers so

that storage managers sharing the storage space would update their allocation tables. The storage devices could constitute one single storage space spanned from one device to another, for availability losing an advantage of parallelized access of striping. When one storage device fails, it is broadcast among the storage managers by a storage manager detected the fault. The storage space of the device is marked 'missing' at all the storage managers, analogous to bad blocks, and access to files located at the space is restricted from then. A storage manager should have the token of a device when it has to write to the device and it waits for the token. The investigation protocol is described in Fig. 5 for the case the token of a device is not returned before the failure of a storage manager. The storage manager waited for a predefined duration broadcasts the request for the last use time of that token. If all the other managers responds the storage manager wait for another predefined duration. After the duration the storage manager queries the manager of the latest use whether the writing is done. On reply of In-Use the storage manager waits for another predefined duration, and Repeat the querying/waiting. Otherwise, the storage manager creates other token and sends Alternative Token to the manager it queried. If the manager it queried does not reply with Token Destroy, the storage server broadcasts the failure of the respective storage server. Fig. 5. Investigation into the storage manager which is queried whether its writing is done. References 1. Ok, M.-H., Lee, K.-s.: A Consolidation Model of Web s toward a Simplified Computing Grid. International Conference on Multimedia and Ubiquitous Engineering, Seoul Korea, 757-761 (2007)