The Kangaroo Approach to Data Movement on the Grid Author: D. Thain, J. Basney, S.-C. Son, and M. Livny From: HPDC 2001 Presenter: NClab, KAIST, Hyonik.

Slides:



Advertisements
Similar presentations
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
Advertisements

Tam Vu Remote Procedure Call CISC 879 – Spring 03 Tam Vu March 06, 03.
04/14/2008CSCI 315 Operating Systems Design1 I/O Systems Notice: The slides for this lecture have been largely based on those accompanying the textbook.
File System Implementation
Group Communications Group communication: one source process sending a message to a group of processes: Destination is a group rather than a single process.
CS533 - Concepts of Operating Systems 1 Remote Procedure Calls - Alan West.
The Kangaroo Approach to Data Movement on the Grid Douglas Thain, Jim Basney, Se-Chang Son, and Miron Livny
I/O Hardware n Incredible variety of I/O devices n Common concepts: – Port – connection point to the computer – Bus (daisy chain or shared direct access)
The Kangaroo Approach to Data Movement on the Grid Jim Basney, Miron Livny, Se-Chang Son, and Douglas Thain Condor Project University of Wisconsin.
Reliable I/O on the Grid Douglas Thain and Miron Livny Condor Project University of Wisconsin.
The Kangaroo Approach to Data Movement on the Grid Douglas Thain, Jim Basney, Se-Chang Son, and Miron Livny Condor Project University of Wisconsin.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
Computer Science Lecture 2, page 1 CS677: Distributed OS Last Class: Introduction Distributed Systems – A collection of independent computers that appears.
PRASHANTHI NARAYAN NETTEM.
The Difficulties of Distributed Data Douglas Thain Condor Project University of Wisconsin
MULTICOMPUTER 1. MULTICOMPUTER, YANG DIPELAJARI Multiprocessors vs multicomputers Interconnection topologies Switching schemes Communication with messages.
REPLICATION IN THE HARP FILE SYSTEM B. Liskov, S. Ghemawat, R. Gruber, P. Johnson, L. Shrira, M. Williams MIT.
I/O Systems ◦ Operating Systems ◦ CS550. Note:  Based on Operating Systems Concepts by Silberschatz, Galvin, and Gagne  Strongly recommended to read.
1 Input/Output. 2 Principles of I/O Hardware Some typical device, network, and data base rates.
Determining an Internet Address at Startup
1 Transport Layer Computer Networks. 2 Where are we?
CIS 725 Wireless networks. Low bandwidth High error rates.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Application-Layer Anycasting By Samarat Bhattacharjee et al. Presented by Matt Miller September 30, 2002.
CH2 System models.
Distributed File Systems
Fundamentals of Computer Networks ECE 478/578 Lecture #19: Transport Layer Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Distributed File Systems Overview  A file system is an abstract data type – an abstraction of a storage device.  A distributed file system is available.
Properties of Layouts Single failure correcting: no two units of same stripe are mapped to same disk –Enables recovery from single disk crash Distributed.
MapReduce and GFS. Introduction r To understand Google’s file system let us look at the sort of processing that needs to be done r We will look at MapReduce.
1 The Kangaroo approach to Data movement on the Grid Rajesh Rajamani June 03, 2002.
Operating Systems Chapter 14 Distributed File Systems Hung Q. Ngo KyungHee University Spring 2009
Chapter 8-2 : Multicomputers Multiprocessors vs multicomputers Multiprocessors vs multicomputers Interconnection topologies Interconnection topologies.
IP1 The Underlying Technologies. What is inside the Internet? Or What are the key underlying technologies that make it work so successfully? –Packet Switching.
Eduardo Gutarra Velez. Outline Distributed Filesystems Motivation Google Filesystem Architecture The Metadata Consistency Model File Mutation.
GFS. Google r Servers are a mix of commodity machines and machines specifically designed for Google m Not necessarily the fastest m Purchases are based.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem.
Distributed File Systems
GLOBAL EDGE SOFTWERE LTD1 R EMOTE F ILE S HARING - Ardhanareesh Aradhyamath.
Distributed File Systems 11.2Process SaiRaj Bharath Yalamanchili.
Consistency David E. Culler CS162 – Operating Systems and Systems Programming Lecture 35 Nov 19, 2014 Read:
Presenter: Seikwon KAIST The Google File System 【 Ghemawat, Gobioff, Leung 】
NeST: Network Storage John Bent, Venkateshwaran V Miron Livny, Andrea Arpaci-Dusseau, Remzi Arpaci-Dusseau.
Silberschatz, Galvin, and Gagne  Applied Operating System Concepts Module 12: I/O Systems I/O hardwared Application I/O Interface Kernel I/O.
Chapter Five Distributed file systems. 2 Contents Distributed file system design Distributed file system implementation Trends in distributed file systems.
Taeho Kgil, Trevor Mudge Advanced Computer Architecture Laboratory The University of Michigan Ann Arbor, USA CASES’06.
DISTRIBUTED FILE SYSTEM- ENHANCEMENT AND FURTHER DEVELOPMENT BY:- PALLAWI(10BIT0033)
Communication in Distributed Systems. . The single most important difference between a distributed system and a uniprocessor system is the interprocess.
Last Class: Introduction
Module 12: I/O Systems I/O hardware Application I/O Interface
Operating System.
Application Layer Functionality and Protocols
CS703 - Advanced Operating Systems
Chapter 3: Windows7 Part 4.
Application Layer Functionality and Protocols
DUCKS – Distributed User-mode Chirp-Knowledgeable Server
Application Layer Functionality and Protocols
Operating System Concepts
13: I/O Systems I/O hardwared Application I/O Interface
CS703 - Advanced Operating Systems
Application Layer Functionality and Protocols
Application Layer Functionality and Protocols
Application Layer Functionality and Protocols
Chapter 13: I/O Systems I/O Hardware Application I/O Interface
Application Layer Functionality and Protocols
Application Layer Functionality and Protocols
Application Layer Functionality and Protocols
Exceptions and networking
Module 12: I/O Systems I/O hardwared Application I/O Interface
Presentation transcript:

The Kangaroo Approach to Data Movement on the Grid Author: D. Thain, J. Basney, S.-C. Son, and M. Livny From: HPDC 2001 Presenter: NClab, KAIST, Hyonik Lee

Motivation In many Grid applications, client usually gets data from data server, processes them and sends the results back to data server.

Problem While data are being transferred to destination server, error or latency can occur due to  Server crash  Performance variation of server  Exhausted resources -> not resilient The throughput of grid application is not good because the client should be blocked until the data are transferred in such a hostile environment.

Solution Approach Use intermediary memory or disk buffer.  Background processes move data and handling errors. Interface  Get  Put  Commit  push

Advantages One-hop Kangaroo  Insulates the client form many difficulties Network failure, destination machine crash Exhausted resources (e.g. BW)  Read operation can be satisfied from cached data. Multi-hop Kangaroo  Multiple hops help avoid the need to co-allocate network resources along all hops.  Multiple hops increase the available spooling space.

Architecture Kangaroo Transport Consistency Adaptation get, put, push, commit Application Kangaroo Transport Kangaroo Transport Consistency ack open, read, write, close, fsync File System TCP/IP get, put, commit, push get, put, push,commit Consistency

Adaptation Layer It is unreasonable to expect programmers to convert existing applications to work with Kangaroo. Adaptation Layer converts standard POSIX operations into Kangaroo operations. A number of operations are missing in the Kangaroo interface, but it is sufficient to admit many grid applications that simply must read and write data. read write fsync exit open without create open with create lseek close get put push commit FdKindHostPathoffset 0Unix/dev/null0 1KangCoral/tmp/out KangCoral/tmp/err Unix/etc/hosts785 4Kangdbhost/data/db59687 …………… Just update table POSIX Kangaroo

Consistency Layer Commit causes the caller to block until all outstanding changes have been written to some stable storage. Push causes the caller to block until all outstanding changes have been delivered to their respective destinations.

Kangaroo Transport Layer Performance  Uses all available resources (net, memory, disk) to maximize throughput Error management  Retry  Delay

Experiments

Blocking procedure call Non-blocking message