DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN. Chapter 3 Processes

Transcription

1 DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN Chapter 3 Processes

2 Context Switching Processor context: The minimal collection of values stored in the registers of a processor used for the execution of a series of instructions (e.g., stack pointer, addressing registers, program counter). Thread context: The minimal collection of values stored in registers and memory, used for the execution of a series of instructions (i.e., processor context, state). Process context: The minimal collection of values stored in registers and memory, used for the execution of a thread (i.e., thread context, but now also at least MMU register values).

3 Observations on Context Switching 1. Threads share the same address space. Thread context switching can be done entirely independent of the operating system. 2. Process switching is generally (somewhat) more expensive as it involves getting the OS in the loop, i.e., trapping to the kernel. 3. Creating and destroying threads is much cheaper than doing so for processes.

4 Why use threads 1. Avoid needless blocking: a single-threaded process will block when doing I/O; in a multi-threaded process, the operating system can switch the CPU to another thread in that process. 2. Exploit parallelism: the threads in a multi-threaded process can be scheduled to run in parallel on a multiprocessor or multicore processor. 3. Avoid process switching: structure large applications not as a collection of processes, but through multiple threads.

5 Thread Usage in Nondistributed Systems Figure 3-1. Context switching as the result of IPC.

6 Thread Implementation User-level thread Cheap to Create and Destroy threads. Switching context can be done in few instructions. Invocation of blocking system call will immediately block the entire process. Kernel-level thread: High price to pay. Every thread operation carried out by kernel requiring a system call. Switching contexts may now become as expensive as switching process context. Hybrid form of user-level and kernel-level threads. Lightweight Processes (LWP)

7 Thread Implementation Figure 3-2. Combining kernel-level lightweight processes and user-level threads.

8 Multi-threaded Clients

9 Multithreaded Servers (1)

10 Multithreaded Servers (2) Figure 3-4. Three ways to construct a server.

11 The Role of Virtualization in Distributed Systems Figure 3-5. (a) General organization between a program, interface, and system. (b) General organization of virtualizing system A on top of system B.

12 Mimicking Interfaces Four types of interfaces at three different levels 1.Instruction set architecture: the set of machine instructions, with two subsets: I. Privileged instructions: allowed to be executed only by the operating system. II. General instructions: can be executed by any program. 2.System calls as offered by an operating system. 3.Library calls, known as an application programming interface (API)

13 Architectures of Virtual Machines

14 Runtime (process) VM

15 Native VM monitor

16 Hosted VM Monitor

17 VMs and cloud computing Three types of cloud services Infrastructure-as-a-Service covering the basic infrastructure Platform-as-a-Service covering system-level services Software-as-a-Service containing actual applications IaaS Instead of renting out a physical machine, a cloud provider will rent out a VM (or VMM) may possibly be sharing a physical machine with other customers almost complete isolation between customers (although performance isolation may not be reached).

18 Networked User Interfaces (1) A networked application with its own protocol.

19 Networked User Interfaces (2) Figure 3-8. (b) A general solution to allow access to remote applications.

20 Example: The XWindow System Figure 3-9. The basic organization of thexwindow System.

21 Improving X There is often no clear separation between application logic and user-interface commands Applications tend to operate in a tightly synchronous manner with an X Kernel Alternative approaches Let applications control the display completely, up to the pixel level (e.g., VNC) Provide only a few high-level display operations (dependent on local video drivers), allowing more efficient display operations.

22 Client-Side Software for Distribution Transparency Figure Transparent replication of a server using a client-side solution.

23 General Design Issues (1) Figure (a) Client-to-server binding using a daemon.

24 General Design Issues (2) Figure (b) Client-to-server binding using a superserver.

25 Server Interrupt 1) Close the screen 2) Out-of-band data: 1) On out of band channel: FTP control channel 2) On the same channel: urgent data

26 Server state 1. Stateless server: like HTTP server 2. Soft state: it keeps information for limited time only, like user updates 3. State full state: it keeps the user information indefinitely. Like Google drive.

27 Server Clusters (1) Figure The general organization of a three-tiered server cluster.

28 Request Handling Figure The principle of TCP handoff.

29 Distributed Servers Figure Route optimization in a distributed server.

30 Managing Server Clusters Example: PlanetLab Essence of PlanetLab: Different organizations contribute machines, which they subsequently share for various experiments. We need to ensure that different distributed applications do not get into each other s way virtualization

31 PlanetLab (1) PlanetLab management issues: Nodes belong to different organizations. Each organization should be allowed to specify who is allowed to run applications on their nodes, And restrict resource usage appropriately. Monitoring tools available assume a very specific combination of hardware and software. All tailored to be used within a single organization. Programs from different slices but running on the same node should not interfere with each other.

32 Reasons for Migrating Code Figure The principle of dynamically configuring a client to communicate to a server. The client first fetches the necessary software, and then invokes the server.

33 Models for Code Migration Figure Alternatives for code migration.

34 Migration and Local Resources Figure Actions to be taken with respect to the references to local resources when migrating code to another machine.

35 Migration in Heterogeneous Systems Three ways to handle migration (which can be combined) Pushing memory pages to the new machine and resending the ones that are later modified during the migration process. Stopping the current virtual machine; migrate memory, and start the new virtual machine. Letting the new virtual machine pull in new pages as needed, that is, let processes start on the new virtual machine immediately and copy memory pages on demand.

36 PlanetLab (2) Figure The management relationships between various PlanetLab entities.

37 PlanetLab (3) Relationships between PlanetLab entities: A node owner puts its node under the regime of a management authority, possibly restricting usage where appropriate. A management authority provides the necessary software to add a node to PlanetLab. A service provider registers itself with a management authority, trusting it to provide wellbehaving nodes.

38 PlanetLab (4) Relationships between PlanetLab entities: A service provider contacts a slice authority to create a slice on a collection of nodes. The slice authority needs to authenticate the service provider. A node owner provides a slice creation service for a slice authority to create slices. It essentially delegates resource management to the slice authority. A management authority delegates the creation of slices to a slice authority.