Adaptation for Mobile Data Access (DM1 & PL1) Yerang Hur Mar. 24, 1998.

Slides:



Advertisements
Similar presentations
R2: An application-level kernel for record and replay Z. Guo, X. Wang, J. Tang, X. Liu, Z. Xu, M. Wu, M. F. Kaashoek, Z. Zhang, (MSR Asia, Tsinghua, MIT),
Advertisements

Mobile Computing Models Mobile Computing - CNT Dr. Sumi Helal Professor Computer & Information Science & Engineering Department University of.
File System for Mobile Computing Quick overview of AFS identify the issues for file system design in wireless and mobile environments Design Options for.
CS-550: Distributed File Systems [SiS]1 Resource Management in Distributed Systems: Distributed File Systems.
CODA/AFS (Constant Data Availability)
Overview of Mobile Computing (3): File System. File System for Mobile Computing Issues for file system design in wireless and mobile environments Design.
G Robert Grimm New York University Disconnected Operation in the Coda File System.
Disconnected Operation in the Coda File System James J. Kistler and M. Satyanarayanan Carnegie Mellon University Presented by Deepak Mehtani.
Disconnected Operation in the Coda File System James J. Kistler and M. Satyanarayanan Carnegie Mellon University Presented by Cong.
Distributed Systems 2006 Styles of Client/Server Computing.
Coda file system: Disconnected operation By Wallis Chau May 7, 2003.
The Google File System. Why? Google has lots of data –Cannot fit in traditional file system –Spans hundreds (thousands) of servers connected to (tens.
Other File Systems: AFS, Napster. 2 Recap NFS: –Server exposes one or more directories Client accesses them by mounting the directories –Stateless server.
Computer Science Lecture 21, page 1 CS677: Distributed OS Today: Coda, xFS Case Study: Coda File System Brief overview of other recent file systems –xFS.
HA LVS Coda - Devjani Sinha. High Availability-HA n critical commercial applications move on the Internet n An elegant highly available system may have.
Disconnected Operation In The Coda File System James J Kistler & M Satyanarayanan Carnegie Mellon University Presented By Prashanth L Anmol N M Yulong.
Concurrency Control & Caching Consistency Issues and Survey Dingshan He November 18, 2002.
Jeff Chheng Jun Du.  Distributed file system  Designed for scalability, security, and high availability  Descendant of version 2 of Andrew File System.
PRASHANTHI NARAYAN NETTEM.
NFS. The Sun Network File System (NFS) An implementation and a specification of a software system for accessing remote files across LANs. The implementation.
Mobility Presented by: Mohamed Elhawary. Mobility Distributed file systems increase availability Remote failures may cause serious troubles Server replication.
Client-Server Computing in Mobile Environments
Northwestern University 2007 Winter – EECS 443 Advanced Operating Systems The Google File System S. Ghemawat, H. Gobioff and S-T. Leung, The Google File.
Agile Application-Aware Adaptation for Mobility Khaled Hadi ICS243F Odyssey.
Team CMD Distributed Systems Team Report 2 1/17/07 C:\>members Corey Andalora Mike Adams Darren Stanley.
Ch 1. Mobile Adaptive Computing Myungchul Kim
Framework of an Application-Aware Adaptation Scheme for Disconnected Operations Umar Kalim, Hassan Jameel, Ali Sajjad, Sang Man Han, Sungyoung Lee, and.
Distributed Systems Principles and Paradigms Chapter 10 Distributed File Systems 01 Introduction 02 Communication 03 Processes 04 Naming 05 Synchronization.
M i SMob i S Mob i Store - Mobile i nternet File Storage Platform Chetna Kaur.
Distributed File Systems
Replication for Mobile Computing Prasun Dewan Department of Computer Science University of North Carolina
Distributed File Systems Case Studies: Sprite Coda.
Slingshot: Deploying Stateful Services in Wireless Hotspots Ya-Yunn Su Jason Flinn University of Michigan Presenter: Youngki, Lee.
Research Overview TalkOdyssey - 1 Odyssey Agile, Application-Aware Adaptation for Mobility Kip Walker some slides “borrowed” from Satya.
Chapter 20 Distributed File Systems Copyright © 2008.
Introduction to DFS. Distributed File Systems A file system whose clients, servers and storage devices are dispersed among the machines of a distributed.
Presenters: Rezan Amiri Sahar Delroshan
DISCONNECTED OPERATION IN THE CODA FILE SYSTEM J. J. Kistler M. Sataynarayanan Carnegie-Mellon University.
CS 525M – Mobile and Ubiquitous Computing Seminar Bradley Momberger.
CODA: A HIGHLY AVAILABLE FILE SYSTEM FOR A DISTRIBUTED WORKSTATION ENVIRONMENT M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel,
Mobile File System Byung Chul Tak. AFS  Andrew File System Distributed computing environment developed at CMU provides transparent access to remote shared.
Jinyong Yoon,  Andrew File System  The Prototype  Changes for Performance  Effect of Changes for Performance  Comparison with A Remote-Open.
CS425 / CSE424 / ECE428 — Distributed Systems — Fall 2011 Some material derived from slides by Prashant Shenoy (Umass) & courses.washington.edu/css434/students/Coda.ppt.
Information/File Access and Sharing Coda: A Case Study J. Kistler, M. Satyanarayanan. Disconnected operation in the Coda File System. ACM Transaction on.
Network Computing Laboratory Odyssey: Agile Application- Aware Adaptation for Mobility SOSP ’97 Brian D. Noble 외, CMU Presenter: Youngki Lee.
A Design of User-Level Distributed Shared Memory Zhi Zhai Feng Shen Computer Science and Engineering University of Notre Dame Oct. 27, 2009 Progress Report.
Information Management NTU Distributed File Systems.
GLOBAL EDGE SOFTWERE LTD1 R EMOTE F ILE S HARING - Ardhanareesh Aradhyamath.
Overview of Mobile File Systems Presented by Steve Todd For WSU CS 898T Mobile and Wireless Networks Class 5/3/04.
Energy Efficient Prefetching and Caching Athanasios E. Papathanasiou and Michael L. Scott. University of Rochester Proceedings of 2004 USENIX Annual Technical.
EE324 INTRO TO DISTRIBUTED SYSTEMS L-20 More DFS.
Highly Available Services and Transactions with Replicated Data Jason Lenthe.
KAIS T System Support for Mobile, Adaptive Applications Brian Noble, University of Michigan Presented by Hyeeun Choi.
THE EVOLUTION OF CODA M. Satyanarayanan Carnegie-Mellon University.
Feb 22, 2001CSCI {4,6}900: Ubiquitous Computing1 Announcements Send today with people in your project group. People seem to be dropping off and I.
Mobility Victoria Krafft CS /25/05. General Idea People and their machines move around Machines want to share data Networks and machines fail Network.
Mobile File Systems.
Coda / AFS Thomas Brown Albert Ng.
Nomadic File Systems Uri Moszkowicz 05/02/02.
Disconnected Operation in the Coda File System
Presented By Abhishek Khaitan Adhip Joshi
Today: Coda, xFS Case Study: Coda File System
Agile Application-Aware Adaptation for Mobility
Distributed File Systems
Distributed File Systems
Distributed File Systems
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Distributed File Systems
Distributed File Systems
System-Level Support CIS 640.
Presentation transcript:

Adaptation for Mobile Data Access (DM1 & PL1) Yerang Hur Mar. 24, 1998

2 Outline Motivation Models of Adaptation Application-transparent Adaptation –Design and implementation –Evaluation Application-aware Adaptation –Design and implementation –Evaluation Conclusion and Future Work

3 Motivation Constraints of mobility –Lack of local resources and the physical security reliance on server –Variable network connectivity in bandwidth, latency, reliability, and cost reliance on client Mobility needs adaptive system to meet the intrinsic constraints.

4 Models of Adaptation Who is responsible for adaptation ? –Individual applications (laissez-faire adaptation) –The system (application-transparent adaptation) system provides resource arbitration. existing applications continue to work even when mobile. –Both (application-aware adaptation) application specific information is used while the system controls resources.

5 Application-aware (ex. Odyssey) Laissez-faire (ex. Eudora) Application-transparent (ex. Coda)

6 Application-transparent Adaptation (Coda) System Call Interface Vnode Interface Coda Mini Cache Application Venus To Coda Servers (Cache Manager)

7 Illustration by Gaich Muramatsu

8 Design and Implementation Goal: high availability –Disconnected operation while disconnected, Venus serves file system requests. when disconnection ends, Venus propagates modifications. –Server replication allows volumes to have replicas at more than one server.

9 Design rationale Scalability –callback-based cache coherence servers notifies clients when their cached copies are no longer valid. –whole-file caching when Venus fetches a file, it fetches the entire file from the servers. cache misses can occur only when files are open.

10 Design rationale Advent of portable workstation –disconnection Optimistic replica control –when a client is disconnected, the system permits reads and writes everywhere. –treats conflicts after their occurrence. –provides higher availability.

11 Ex. cat /coda/usr/jjk/foo open call is forwarded by the Vnode interface. When it is realized that the request is for a file in the /coda file system, it is handed to the Coda MiniCache in the kernel. When the MiniCache does not have usr/jjk/foo, the request is passed to Venus and Venus checks the client disk cache for usr/jjk/foo and in case of a cache miss, it contacts the servers to ask usr/jjk/foo. Venus enters a disconnected mode, when there is no network connection to any server.

12 Venus states and transitions Hoarding Emulation Reintegration disconnection physical reconnection local reconnection

13 Hoarding Why? –Venus cannot serve a cache miss during a disconnection. important files should be kept in the cache up to date. Prioritized cache management –Users may give information on priority of files (HDB). –Recent reference history and HDB are used for hoarding. Hoard walking –updates the hoarded files.

14 Hoarding Hoard profiles # Personal files a /coda/usr/jjk d+ a /coda/usr/jjk/papers 100:d+ a /coda/usr/jjk/papers/sosp 1000:d+ # System files a /usr/bin 100:d+ a /usr/etc 100:d+ a /usr/lib 100:d+

15 Hoard walking Goal: to meet equilibrium. –Cache is in equilibrium when no uncached file has a higher priority than a cached file. –Every 10 minutes or by users request. Phase 1 –Name bindings of HDB entries are re-evaluated. Phase 2 –Priorities in the cache and HDB are re-evaluated.

16 Emulation Venus takes the role of pseudo-server. Logging –records information for reintegration in a replay log. logs a store record rather than logging the every open, close, and intervening write operation. Discards a previous store record when a new one for the same file is appended to the log. Persistence –cached directory, replay logs, and the HDB is stored in nonvolatile storage.

17 Reintegration Venus propagates changes made during emulation and updates its cache. All activity is suspended till completion of reintegration. Replay algorithm –Clients Venus obtains permanent file ids for new files. Venus transfers the replay log to the servers. –Servers parses the log and all files referenced in the log are locked. Transaction begins. validates each object in the log and executes it. transfers data. commits the transaction and releases all locks.

18 Reintegration Conflict handling –During phase two of replay, a server compares the unique storid associated with that in a log entry. –If there is a conflict the entire reintegration is aborted. Ex: – conflict in the case of a store of file – creating a new directory: conflicts occur if the name collides with an exiting name. –modification of attributes –Venus stores all replay information in its local disk when reintegration fails, and users can selectively replay it manually.

19 Evaluation Duration of reintegration –time to allocate permanent fids + time for the replay at the servers + time for server replication Cache size Likelihood of conflicts

20 Time for reintegration

21 Cache size

22 Likelihood of conflicts

23 Summary Coda can support disconnect operation. –Ex: 100MB local disk, 50MB cache, one or two day disconnection about 1 minute reintegration

24 Application-aware Adaptation (Odyssey) Application Viceroy Warden1Warden2Wardon3 Odyssey API extension

25 Design and implementation Goal: Collaborative partnership between the operating system and applications –Adaptation is the key to mobility. unpredictable variation in network quality disparity in the availability of remote services limitations on local resources –Odyssey monitors resources, interacts with each application, and applications decide the best adaptation when notified.

26 Design rationale Fidelity –Degree to which data presented at a client matches the reference copy at the server. video data: frame rate and image quality telemetry data: sampling rate and timeliness Concurrency –Ability to execute multiple independent applications concurrently on a mobile client. Agility –Speed and accuracy with which it detects and responds to changes in resource availability The larger change is, the more important the agility is.

27 Viceroy and wardens Viceroy –Centralized resource management monitoring the availability of resources notifying applications of changes Wardens –Type-specific operations to change the fidelity –Responsible for communicating servers and caching data

28 Expressing resource expectation Generic resources in Odyssey –network bandwidth, network latency, disk cache space, CPU, battery power Resource negotiation operations –request (in path, in resource-descriptor, out request-id) –cancel (in request-id) –resource descriptor resource-id, lower bound, upper bound, name of upcall handler Upcall handler –handler (in request-id, in resource-id, in resource-level) TSO (Type-Specific Operations) –tsop (in path, in opcode, in insize, in inbuf, inout outsize, out outbuf)

29 Notifying applications Viceroy generates an upcall to the corresponding application Application adjusts its fidelity according to its policy with the resource-level.

30 Example applications Video player Web browser Speech recognizer

31 Video player Xanim Video Server Client RPC OdysseyAPI Viceroy Video Warden Three fidelity levels: color frames at quality 99 and 50, and b/w frames

32 Evaluation 30 sec 2 sec Reference waveforms for agility experiments 90 MHz Pentium client and 200MHz Pentium Pro servers Customized NetBSD 1.2

33 Results Agility (supply estimation agility) (s) (KB/s) (s) (KB/s)

34 Results Agility (supply estimation agility) (s) (KB/s) (s) (KB/s)

35 Results Agility (demand estimation agility) (s) (KB/s) (s) (KB/s) % utilization/stream45% utilization/stream

36 Results (s) (KB/s) % utilization/stream

37 Results Effect of adaptation ( performance and fidelity)

38 Results Effect of centralized resource management

39 Conclusion and Future Work Need for adaptation in mobile information access is widely accepted application-aware adaptation They should apply resource management to other resources Multiple fidelity levels for other applications should be supported (ex. Speech recognizer). Systematic principles for adaptive mobile systems would be valuable.

40 References J. J. Kistler and M. Satyanarayanan. Disconnected Operation in the Coda File System. ACM Transactions on Computer Systems, Vol. 10, No. 1, Feb. 1992, pp M. Satyanarayanan et al. Coda: a Highly Available File System for a Distributed Workstation Environment. IEEE Transactions on Computers. Vol. 39, No. 4, April 1990, pp B. D. Noble et al. Agile Application-Aware Adaptation for Mobility. In Proceedings of the 16th ACM Symposium on Operating System Principles. Oct B. D. Noble, M. Price, and M. Satyanarayanan. A Programming Interface for Application-aware Adaptation in Mobile Computing. In Proceedings of the 1995 USENIX Symposium on Mobile and Location-Independent Computing. April 1995.