BY GARCIA REYES CITLALI LPEZ GONZLEZ BEATRIZ RENDN DAZ HECTOR ARTURO

DEFINITION:
Distributed operating systems perform the same functions as a normal operating system, but with the difference of working in a distributed environment. Its primary mission is to facilitate access to and management of distributed resources in the network.
In a distributed operating system users can access remote resources in the same way they do for local resources. Allow distribute jobs, tasks or processes, from a set of processors. Perhaps this processor set is on a computer or on different, which is transparent to the user.

 Distributed systems must be highly reliable and stable because if a system component decomposes other component must be able to replace it immediately and do not affect system processes.

Among the different existing distributed operating systems include the following: Sprite, Solaris-MC, Mach, Chorus, Spring, Amoeba, Taos, etc.

FEATURES
Global Mechanism for communication between processes overall protection scheme Management of common processes Global File System Each kernel must have control of the local resources Managing your own memory Process Management -> Planning

HISTORICAL INFORMATION
In the beginning of the computer age computers were large and expensive. Due to their scarcity and cost, they operated independently each other. Since the 70s, the first minicomputers arise that would compete with the big computers both benefits and its price, which spread its use. Large centralized systems were slowly giving way to more decentralized systems, and composed of several computers or multiprocessors. Soon there were new requirements for interconnection of equipment, and developed local area networks (LAN), such as Ethernet or Token Ring. Today, Internet is the largest network and the most used, and maintained an impressive growth rate. Moreover, the Internet is the basis for many new projects distributed systems.

 Although current grid systems solve the current needs of communication between computers, have important limitations, and are not applicable to a lot of problems. Thus arises the need for building distributed systems that replace current network systems or multiprocessor systems.

BASIC FEATURES:
Distributed operating systems are based on the basic ideas: Transparency Efficiency Flexibility Scalability

DISTRIBUTED OPERATING SYSTEM VS DISTRIBUTED SYSTEM

There is a vital difference between distributed operating systems and distributed systems. We could call a Distributed System capacity of distributed operating system, ie: A distributed system is the relationship between a standalone computer and a file server or shared devices. Each computer running its programs in its memory by using its own microprocessor and memory only, this does not share memory or assign tasks to other processors in the network. However, a distributed operating system has access to all shared network devices including processors and RAM.

BIRTH OF DISTRIBUTED SYSTEMS

CAUSES: Microprocessor technology: power / cost. Communication Technologies: - Communication protocols. - Local Area Networks (LAN): Costs and benefits. - Internet Business factors: - Electronic commerce: e-commerce. - Distributed Information (WWW). - Cost reduction

HETEROGENEITY OF A SYSTEM DISTRIBUTING

A distributed system can be comprised of many elements connected by LAN or WAN: - Terminals X and Java Stations (Network Computer). - PCs and workstations. - Portable Systems (mobile networks: GSM, WAP and ...) - Minicomputers. - Supercomputers.

HETEROGENEITY OF A SYSTEM DISTRIBUTING

- Shared memory multiprocessors or not. - Specialty Servers (storage, printing, ...). - Embedded Systems. Encouraged by the following factors: - Extensibility distributed systems. - Specialization of servers

PROBLEMATIC:
Each node has its own copy of the operating system: What tasks are made locally and which are global? How to achieve mutual exclusion without shared memory? How to deal with deadlocks without a global state? Planning Process: Each copy of the operating system has its tailed planning (process migration). How to create a single file tree? Implications single clock failure, the presence of failures or heterogeneity.

EVOLUTION OF D.O.S.
First Network OS: - Include network services in conventional SO - Example: UNIX 4BSD ( 1980) Gradual addition of more functionality: - Sun ONC ( 1985): includes NFS, RPC, NIS First SOD: - New OS but based on conventional architectures (monolithic) - Example: Sprite University of Berkeley ( 1988)

Evolution of D.o.s.(II)

DOS based on m-kernel. Examples: - CMU Mach ( 1986) - Amoeba designed by Tanenbaum ( 1984) - Chorus of INRIA in France ( 1988)

KEY FEATURES OF A DISTRIBUTED SYSTEM

THE KEY FEATURES OF A DISTRIBUTED SYSTEM:

They are loosely coupled Nodes are autonomous worstation resources are managed locally Network connections using system software Remote access requires explicit message passing beteen nodes. Messages are CPU to CPU Protocols for realibility, flow control , failure detection, etc., implemented in software The only way two nodes can communicate is by sending and receiving network messages.

ADVANTAGES AND DISADVANTAGES OF A DISTRIBUTED SYSTEM

ADVANTAGES OF DISTRIBUTED SYSTEMS OVER CENTRALISED SYSTEMS

Better price/performance than mainframes More computing power Some applications are inherently distributed Improved reliability because system can survive crash of one processor Incremental growth can be achieved by adding one processor at a time Shared ownership facilitated.

ADVANTAGES OF DISTRIBUTED SYSTEMS OVER ISOLATED PCs

Shared utilization of resources. Communication. Better performance and flexibility than isolated personal computers. Simpler maintenance if compared with individual PCs.

DISADVANTAGES OF DISTRIBUTED SYSTEMS

Although there are several advantages of distributed systems, there are certain disadvantages also which are listed below:

 Network performance parameters.

Latency: Delay that occurs after a send operation is executed before data starts to arrive at the destination computer. Data Transfer Rate: Speed at which data can be transferred between two computers once transmission has begun. Total network bandwidth: Total volume of traffic that can be transfered across the network in a give time. Dependency on reliability of the underlying network. Higher security risk due to more possible access points for intruders and possible communication with insecure systems. Software complexity.

DESIGN GOALS OF DISTRIBUTED SYSTEMS

In order to design a good distributed system. There are six key design goals. They are: 1. 2. 3. 4. 5. 6. Concurrency Scalability Openness Fault Tolerance Privacy and Authentication Transparency.

CONCURRENCY
About conneting users and resources.
Share resources (hw components, data) Groupware Security aspects

Concurrency is important because any distributed service taht isnt concurrent would would become a bottleneck taht would serialise the actions of its clients and this reduce the natural concurrency of the system.

SCALABILITY
The goal is to be able to use the same software for different size systems. Adistributed software system is scalable if it can handle increased demand on any part of the system without a chenge to the software.

OPENNESS
Two types of openness:
non-proprietary Public protocols are important because they make it possible for many software manufacturers to build clients and servers that will be able to talk to each other. Proprietary protocols limit the players to those from a single company and thus limit the success of the protocol. extensibility. A system is extensible if it permits customizations needed to meet unanticipated requirements. Extensibility is important because its scalability and allows a system to survive over time as the demands on it and the ways it is used change.

FAULT-TOLERANCE
o A fault tolerant system is the one that can continue functioning, perhaps in a degraded form, even if something goes wrong. o One of the advantages of Distributed Operating Systems is that there are enough resources to achieve fault tolerance. o Two radically different approaches:
Redundancy Techniques Atomic Transactions

TRANSPARENCY

Transparent ~ present itself to users and applications as if it were only a single computer system .

LOGICAL OPERATION OF THE SYSTEM

DISTRIBUTED FILE SYSTEM

A distributed file system, stores files on one or more computers called servers and makes them accessible to other computers called clients, which are handled as if they were local.

The file system is maintained on the network using its files not depend on any location within the same network system.

ADVANTAGES
The files are more accessible from multiple computers if you can access the servers. Share files in a single location is easier to distribute copies of the files to all clients. Backups and security are easier to handle when you just have to take account of the servers.

NAME SERVICE
A name service stores a collection of one more nomination contexts, set of links between textual names and attributes of objects such as users, computers, services and remote objects

The main task that provides a naming service is the resolution of a name, that is, the search for a certain name given attributes. These services identify and locate resources in the distributed environment.

TYPES OF SERVICES
A) White Pages: Names B) Yellow Pages :Directory.

TYPES OF NAMES
Listed below are some types of names:

And port identifiers processes. Textual Names Service. Resource identifiers. Filenames. Physical addresses and logical network.

LINK OR CONNECTION

Is partnership between a name and an object is called. Each object in a system has certain attributes. For example, services and computers have physical addresses, users have email addresses, telephone numbers and addresses of their personal computers, adding access keys, working directories, etc..

There are three basic concepts in this area: NAME OF AN OBJECT: specify what you are looking for a process (server) ADDRESS : specifies where the object is located. ROUTE: specifies how to get there.

SYNCHRONIZATION SERVICES
Synchronization services are those that allow us to maintain the individual computer clocks in approximately and appropriate.

Synchronization can be physical clocks, which synchronize the clocks of hardware and logical clocks, which order the input, execution and output events.

In a distributed operating system, memory becomes physically but logically shared private.

That is, a computer runs the programs in their own memory, but if you need more memory available resources used another computer that trained and prepared within the network to share their memories.

Distributed shared memory that helps form the famous bottlenecks because seeking the necessary resources to accomplish all assigned tasks to fulfill.

Based shared memory pages

This model proposes a memory address space virtual memory that integrates all system computers, and their use is by paging. The vast majority of modern computer architecture based on memory paging or some variant. In such systems, the hardware provides a number of facilities related to memory pages, normally utilized only by the operating system.

Object-based shared memory

Although the memory control becomes more complex, the result is both modular and flexible, and the synchronization and access can be integrated cleanly Another restriction of this model is that all accesses to shared objects must be made by calling the methods of the objects, which are not supported and non-modular programs are incompatible. seeks access to data by encapsulating the data and spread through the network

Object-based shared memory

Although the memory control becomes more complex, the result is both modular and flexible, and the synchronization and access can be integrated cleanly Another restriction of this model is that all accesses to shared objects must be made by calling the methods of the objects, which are not supported and non-modular programs are incompatible. seeks access to data by encapsulating the data and spread through the network

ADVANTAGES & DISADVANTAGES OF DISTRIBUTED MEMORY

ADVANTAGES: Illusion of a shared physical memory without bottlenecks. Scalability (we can extend the system without much trouble). Low cost. DISADVANTAGES: Network topology is very important. Network administration.

SECURITY SERVICES

The security services are linked to a DOS access permissions to shared data as a resource. Memory resources eg permits are assigned to the amount of shared memory according to the physical needs of each computer.

APPLICATIONS

WAN networks

Due to the tremendous growth of this type of network (Internet) has become very important exchange of information through the network.
And for this we have the following examples: E-mail news service File Transfer World Wide Web

Multimedia applications

Are the latest additions to distributed systems. These applications impose certain hardware needs to have a speed and regularity of transferring a large amount of data. Examples of these systems are:
Videoconferencing. Telemonitoring. Multiuser games. Computer assisted instruction.

Areas of applied computing to distributed system

At this point takes into account the full range of applications of distributed systems, as their design involves many areas, for example: Communications. distributed operating systems. distributed database. distributed file servers. distributed programming languages. fault tolerant systems.