System Models Advanced Operating Systems Nael Abu-halaweh.

Slides:



Advertisements
Similar presentations
Multiple Processor Systems
Advertisements

Distributed Processing, Client/Server and Clusters
Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.
Database Architectures and the Web
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Distributed System Architectures.
Replication. Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Company name KUAS HPDS Using Remote Memory Paging for Handheld Devices in a Pervasive Computing Environment Arjuna Sathiaseelan.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
Classification of Distributed Systems Properties of Distributed Systems n motivation: advantages of distributed systems n classification l architecture.
Study of Hurricane and Tornado Operating Systems By Shubhanan Bakre.
Distributed Shared Memory
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
Using DSVM to Implement a Distributed File System Ramon Lawrence Dept. of Computer Science
Ameoba Designed by: Prof Andrew S. Tanenbaum at Vrija University since 1981.
Distributed Processing, Client/Server, and Clusters
Chapter 16 Client/Server Computing Patricia Roy Manatee Community College, Venice, FL ©2008, Prentice Hall Operating Systems: Internals and Design Principles,
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
CS 550 Amoeba-A Distributed Operation System by Saie M Mulay.
Yousuf Surmust Instructor: Marius Soneru Course: CS550 Fall 2001
A. Frank - P. Weisberg Operating Systems Introduction to Tasks/Threads.
16: Distributed Systems1 DISTRIBUTED SYSTEM STRUCTURES NETWORK OPERATING SYSTEMS The users are aware of the physical structure of the network. Each site.
©Silberschatz, Korth and Sudarshan18.1Database System Concepts Centralized Systems Run on a single computer system and do not interact with other computer.
Definition of terms Definition of terms Explain business conditions driving distributed databases Explain business conditions driving distributed databases.
PRASHANTHI NARAYAN NETTEM.
DISTRIBUTED COMPUTING
File Systems (2). Readings r Silbershatz et al: 11.8.
RAID-x: A New Distributed Disk Array for I/O-Centric Cluster Computing Kai Hwang, Hai Jin, and Roy Ho.
Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung Google∗
Distributed File Systems Concepts & Overview. Goals and Criteria Goal: present to a user a coherent, efficient, and manageable system for long-term data.
Hands-On Microsoft Windows Server 2008 Chapter 1 Introduction to Windows Server 2008.
Shilpa Seth.  Centralized System Centralized System  Client Server System Client Server System  Parallel System Parallel System.
1 The Google File System Reporter: You-Wei Zhang.
Computer System Architectures Computer System Software
1 Lecture 20: Parallel and Distributed Systems n Classification of parallel/distributed architectures n SMPs n Distributed systems n Clusters.
Windows 2000 Advanced Server and Clustering Prepared by: Tetsu Nagayama Russ Smith Dale Pena.
Local Area Networks (LAN) are small networks, with a short distance for the cables to run, typically a room, a floor, or a building. - LANs are limited.
Distributed File Systems
CLIENT SERVER VS PEER TO PEER Networks. Lesson objectives Candidates should understand the advantages and disadvantages of: client server networks peer.
Unit – I CLIENT / SERVER ARCHITECTURE. Unit Structure  Evolution of Client/Server Architecture  Client/Server Model  Characteristics of Client/Server.
Transparent Process Migration: Design Alternatives and the Sprite Implementation Fred Douglis and John Ousterhout.
A Comparison of Two Distributed Systems: Amoeba and Sprite
Distributed File Systems Overview  A file system is an abstract data type – an abstraction of a storage device.  A distributed file system is available.
Distributed File System By Manshu Zhang. Outline Basic Concepts Current project Hadoop Distributed File System Future work Reference.
Introduction to DFS. Distributed File Systems A file system whose clients, servers and storage devices are dispersed among the machines of a distributed.
Multiprossesors Systems.. What are Distributed Databases ? “ A Logically interrelated collection of shared data ( and a description of this data) physically.
Ch 10 Shared memory via message passing Problems –Explicit user action needed –Address spaces are distinct –Small Granularity of Transfer Distributed Shared.
CENTRALISED AND CLIENT / SERVER DBMS. Topics To Be Discussed………………………. (A) Centralized DBMS (i) IntroductionIntroduction (ii) AdvantagesAdvantages (ii)
Computing Resource Paradigms CS3353. Computing Resource Paradigms Centralized Computing Distributed Computing.
PARALLEL PROCESSOR- TAXONOMY. CH18 Parallel Processing {Multi-processor, Multi-computer} Multiple Processor Organizations Symmetric Multiprocessors Cache.
GLOBAL EDGE SOFTWERE LTD1 R EMOTE F ILE S HARING - Ardhanareesh Aradhyamath.
Chap 7: Consistency and Replication
Cloud Computing Computer Science Innovations, LLC.
Distributed Systems Unit – 1 Concepts of DS By :- Maulik V. Dhamecha Maulik V. Dhamecha (M.Tech.)
Distributed File System. Outline Basic Concepts Current project Hadoop Distributed File System Future work Reference.
Intro to Distributed Systems Hank Levy. 23/20/2016 Distributed Systems Nearly all systems today are distributed in some way, e.g.: –they use –they.
Chapter Five Distributed file systems. 2 Contents Distributed file system design Distributed file system implementation Trends in distributed file systems.
Chapter 16 Client/Server Computing Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals and Design Principles, 6/E William.
Lecture 13 Parallel Processing. 2 What is Parallel Computing? Traditionally software has been written for serial computation. Parallel computing is the.
Distributed Processing, Client/Server and Clusters
Distributed Operating Systems Spring 2004
Distributed Operating Systems
Diskless network security
Advanced Operating Systems
Chapter 17: Database System Architectures
Outline Midterm results summary Distributed file systems – continued
Outline Announcements Lab2 Distributed File Systems 1/17/2019 COP5611.
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Introduction To Distributed Systems
Database System Architectures
Presentation transcript:

System Models Advanced Operating Systems Nael Abu-halaweh

Contents Introduction. Workstation Model. Processor Pool Model. Hybrid Model. Clustering.

Introduction Traditional Systems have only one processor. Processors in Distributed Systems can be organized in several ways.

The Workstation Model This System consists of workstation connected by a high-speed LAN. In some system workstations have local disks (diskful or disky workstation. In others, workstation do not have disks (diskless). When using diskless workstations, the file system is implemented on one or more file servers.

Advantages of Diskless Workstations Cheaper. Ease of Maintenance. Easier to backup. Symmetry & flexibility.

Disky Workstations Workstation have private disks. Local Disks can be used in the following ways: 1- Paging and Temporary Files. 2- Paging, Temporary Files & System Binaries. 3- Paging, Temporary Files, System Binaries & File Caching. 4- Complete Local File System.

Advantages of the Workstation Model The model is easy to Understand. Users have guaranteed Response Time. Sophisticated Graphics Programs can run very Fast. Users have large degree of autonomy.

Disadvantages of the Workstation Model Occupy more space. Inefficient Resource Allocation (Some Station may be idle while others demand more resources).

Using Idle Workstations At peak period 30% of the workstations are idle. A variety of schemes have been proposed for using idle or underutilized workstation. First attempt: the use of rsh program that comes with Berkeley Unix. Major Flaws in rsh: 1- The user has to identify the Remote Workstation. 2- Programs execute in the Remote Machine environment. 3- User logging to the machine should accept lower performance.

Using Idle Machine Key Issues How is an Idle Ws. found? How can a remote process be run transparently? What happens if the machine owners comes back?

Finding an Idle Machine If no user-initiated processes are running on the machine it is considered idle. There are substantial differences in load between idle machines. Two categories of algorithms are used to locate idle workstations: Server Driven & Client Driven.

Server Driven Idle Station announces its availability. To do this it registers its name, network address & properties in a registry or a database. When a remote command is executed it looks into the registry to find a suitable Ws. For reliability it is better to have more than one copy of the database.

Server Driven (Alternative Approach) Each Ws. has its own copy of the registry file. Newly available Ws. broadcasts its availability on the network. Upon receiving the idle Ws. broadcast; each client updates its registry. Advantages: Less overhead in finding an idle Ws. & fault tolerance. Disadvantages: All machines have to maintain their copies.

Client Driven The client looking for an idle Ws. broadcasts the request which includes the program & the resources it needs. All available workstations reply back to the requesting client. The requesting client picks one.

Running a Remote Process Transparently Finding an idle Ws is only the first step. The remote environment should be set up such that it looks like the environment on the home computer. A process needs the same file system view, working directory & environment variables. Some system calls must be forwarded back to the home machine. (example: Keyboard) System calls that query the state of the machine must be done on the machine on which the process is running.

Processor Pool Model A rack full of CPUs. CPUs are allocated to users on demand. Users are given high performance graphic terminals. Advantages: Reducing Cost/performance, Allows easy incremental growth. Based on the queuing theory: a Processor pool with n processors will reduce the average response time by n-fold compared to that of n personal workstations.

Why have distributed Systems? The queuing theory analysis showed that the mean response time centralized system is n times better than an n distributed single processor systems. Advantages of Distributed systems: 1- Price/ performance. 2- Reliability. 3- Fault tolerance. 4- Uniform Response.

Workstation Vs. Processor Pool Model Processor pool is a better way of getting extra computing power. Workstation model is suitable for users with light applications, while Processor Pool can handle large applications.

Hybrid Model A hybrid system consists of workstations & processor pool/s. Combines the advantages of both models. Advantages: Fast Interactive Response, Efficient Use of Resources & Simple Design.

Clustering A cluster is a group of computers working together to provide a common set of applications. A cluster appears to the clients as a unified system. Advantages: Load Balancing, Fail-Over & Scalability.

References A. Tanenbaum, “Distributed Operating Systems”, Prentice Hall, “What’s New in Clustering Technologies” obtained from: aluation/overview/technologies/clustering.mspx aluation/overview/technologies/clustering.mspx Filip Hanik, “Clustering Technologies in Memory Session Replication in Tomcat 4” obtained from: =Tomcat. =Tomcat