CS Final Review

Size: px

Start display at page:

Download "CS Final Review"

Charlene Jones
5 years ago
Views:

1 CS Final Review Topics Clock Synchroniza>on Physical Clocks Clock Synchroniza>on Algorithms Network Time Protocol Berkeley Algorithm Clock Synchroniza>on in Wireless Networks Logical Clocks Lamport s Logical Clocks Vector Clocks 1

2 Clock Synchroniza>on In a centralized system, >me is unambiguous Processes obtain the >me, by issuing a system call to the kernel Process 1 issues R1 to obtain >me Kernel return T1 Process 2 issues R2 to obtain >me Kernel returns T2 It is guaranteed that T2 T1 In a distributed system, achieving agreement on >me is not trivial It is impossible to guarantee that physical clocks run at the same frequency Physical clocks Computer Clocks are acutually Timers, a precisely machined quartz crystal When kept under tension, crystals oscillate at a well- defined frequency Associated with the crystal are two registers, a counter and holding register At each oscilla>on, the counter decrements by 1 When counter reaches zero, an interrupt is generated Possible to program a >mer to generate an interrupt 60 >mes a second Each interrupt corresponds to a clock >ck Within a singly computer, a clock being slightly off is tolerable, with minimal impact In mul>- computers systems, clock skew is problema>c 2

3 Dealing with drix Set computer to true >me Not good idea to set clock back Illusion of >me moving backwards can confuse message ordering and soxware development environments Gradual clock correc>on If fast then make clock run slower un>l it synchronizes If slow then make clock run faster un>l it synchronizes Compensa>ng for a fast clock Computer s time, C dc/dt > 1 skew Clock Synchronized Linear Compensating Function Applied UTC time, t 3

4 NTP Basic Opera>on NTP is set up pairwise A probes B for its current >me and B also probes A Compute the offset, θ, and the delay es>ma>on, δ δ = [(T 2 T 1 )+(T 4 T 3 )]/2 Buffer 8 pairs of (θ, δ), and select the minimal value for δ as the best delay es>ma>on between the two servers The associated θ with the minimal delay δ is the most reliable es>ma>on of the offset The Berkeley Algorithm Request The >me daemon asks all the other machines for their clock values. Daemon computes the average of the received answers The >me daemon tells everyone how to adjust their clock. 4

5 Logical Clocks For many DS algorithms, associa>ng an event to an absolute real >me is not essen>al What s important is that the processes in the Distributed System agree on the ordering in which certain events occur rela>ve >me may not relate to the real >me. Such clocks are referred to as Logical Clocks Lamport's >mestamps Vector >mestamps Lamport s Logical Clocks To synchronize logical clocks, Lamport defines a rela>on called "happens- before" happens before rela>on is denoted as The rela>on can be observed directly in two situa>ons: If a and b are events in the same process, and a occurs before b, then a b is true. If a is the event of a message being sent by one process, and b is the event of the message being received by another process, then a b 5

6 Concurrent Events If two events happen without any message, then we can't say anything about their rela>ve occurrence in >me. We can say that a b c d f, but we can say lijle about e other than e f. P 1 a b m 1 c d P 2 P 3 e m 2 f Vector Clocks (2) Vector clocks are constructed by lekng each process P i maintain a vector VC i with the following two proper>es: 1. VC i [ i ] is the number of events that have occurred so far at P i. In other words, VC i [ i ] is the local logical clock at process P i. 2. If VC i [ j ] = k then P i knows that k events have occurred at P j. It is thus P i s knowledge of the local >me at P j. 6

7 Vector Clocks Messages Message Passing When P i sends a message to P j, the message has >mestamp t[]=vt i [] When P j receives the message, it sets VT j [k] to max (VT j [k],t[k]), for k = 1, 2,, N For example, P 2 receives a message with >mestamp (3,2,4) and P 2 s >mestamp is (3,4,3), then P 2 adjusts its >mestamp to (3,4,4) Vector Clocks Analysis Claim e e iff e.vt < e.vt P 1 P 2 P 3 a [1,0,0] e [0,0,1] b [2,0,0] m 1 c [2,1,0] g [0,0,2] d Real Time [2,2,0] m 2 f [2,2,3] 7

Process Synchroniza>on Mutual Exclusion Algorithms Permission Based Centralized DeCentralized Distributed Token Based Token Ring Elec>on Algorithms Bully Algorithm Ring Algorithm

8 Process Synchroniza>on Mutual Exclusion Algorithms Permission Based Centralized DeCentralized Distributed Token Based Token Ring Elec>on Algorithms Bully Algorithm Ring Algorithm Elec>on in Wireless Networks Elec>on in Large Scale Systems Mutual Exclusion Classifica>on Mutual Exclusion Permission-Based Token-Based Centralized Token Ring Decentralized Distributed 8

9 Centralized Algorithm Centralized Algorithm achieves DME by closely mimicking ME in single processor systems One process, C, is the Coordinator Coordinates access to resources Other processes issue requests to Request(R) access resource 1. Request Resource 2. Wait for Response 3. Receive Grant P C 4. Access Resource 5. Release Resource Free Resource Grant(R) Release(R) DME Decentralized Vo>ng Algorithm Unlike in the centralized scheme, if the resource cannot be granted, a decentralized DME coordinator informs the reques>ng process that the resource is unavailable To gain access to a resource, a process my secure a majority vote m >, where is the number of coordinators A failed coordinator resets at arbitrary moments, not having to remember any vote it gave before the crash Ignoring previously granted permissions, may lead a recovered coordinator to grant permission again to another process 9

A Distributed ME Algorithm Ricart and Agrawala Algorithm assumes there is a mechanism for totally ordering of all events in the system and a reliable message system Lamport s algorithm can be used

10 A Distributed ME Algorithm Ricart and Agrawala Algorithm assumes there is a mechanism for totally ordering of all events in the system and a reliable message system Lamport s algorithm can be used for total ordering A process wan>ng to enter it CS sends a message with (CS name, process id, current >me) to all processes, including itself When a process receives a CS request from another process, it reacts based on its current state with respect to the CS requested. Three possible cases must be considered RA Algorithm Example 8 P 0 P 0 P OK OK OK P 1 12 P 2 12 P 0 and P 2 request access to the same resource, nearly at the same >me Both send requests with >mestamps, 8 and 12, respec>vely P 1 OK P 2 P 0 has the lowest >mestamp, 8 P 0 wins access to the resource P 1 P 2 12 Upon comple>on of its CS, P 0 sends OK message to P 2 P 2 can enter its own CS 10

11 A Token Ring Algorithm P 2 P 1 P 3 P 0 P 2 P 4 P 6 P 0 P 4 P 1 P 3 P 5 P 7 P 7 P 6 P 5 An unordered group of processes on a network. A logical ring constructed in soxware Token circulates at high speed on the network A process must have a token to enter its CS Elec>on Algorithms Many distributed algorithms such as mutual exclusion and deadlock detec>on require a coordinator process. When the coordinator process fails, the distributed group of processes must execute an elecgon algorithm to determine a new coordinator process. Different criteria can be used to select the new coordinator 11

12 The Bully Algorithm When any process, P, no>ces that the coordinator is no longer responding it ini>ates an elec>on: 1. P sends an elec8on message to all processes with higher id numbers. 2. If no one responds, P wins the elec>on and becomes coordinator. 3. If a higher process responds, it takes over. Process P s job is done. Bully Algorithm Example Process 4 no>ces 7 down. Process 4 holds an elec>on. Process 5 and 6 respond, telling 4 to stop. Now 5 and 6 each hold an elec>on. 12

13 Ring Algorithm Basic Opera>on RA assumes that the processes are logically ordered in a ring {implies a successor pointer and an acgve process list} that is unidirec>onal. When any process, P, no>ces that the coordinator is no longer responding it ini>ates an elec>on: 1. P sends message containing P s process ID to the next available successor. Ring Algorithm Basic Opera>on 2. At each ac>ve process, the receiving process adds its process number to the list of processes in the message and forwards it to its successor. Eventually, the message gets back to the sender. 3. The ini>al sender sends out a second message lekng everyone know who the coordinator is {the process with the highest number} and indica>ng the current members of the ac>ve list of processes. 13

14 Consistency Models Background Replica>on Mo>va>on Data- Centric Consistency Models Con>nuous Consistency Consistent Ordering of Opera>ons Client- Centric Consistency Models Eventual Consistency Monotonic Reads Monotonic Writes Read Your Writes Writes Follow Reads Performance and Scalability Main issue To keep replicas consistent, we generally need to ensure that all conflic>ng opera>ons are done in the same order, across all servers ConflicGng OperaGons Concurrent Transac>ons Read Write Conflict: a read opera>on and a write opera>on act concurrently Write Write Conflict: two concurrent write opera>ons Guaranteeing global ordering on conflic>ng opera>ons may be a costly opera>on, with impact on scalability PotenGal SoluGon Weaken consistency requirements to avoid global synchroniza>on, when possible 14

15 What is a Consistency Model? A consistency model is a contract between a distributed data- store and its processes. If the processes agree to the rules, the data- store will perform correctly and as adver>sed. Data- Centric Consistency Models Strong and Weak Models Strong consistency models: Opera>ons on shared data are synchronized Do not require synchroniza>on opera>ons Strict consistency Related to absolute global >me SequenGal Consistency Also knows as serializability Linearizability To achieve atomicity Causal Consistency To maintain only causal rela>ons FIFO Consistency To maintain only individual ordering Weak consistency models: Synchroniza>on occurs only when shared data is locked and unlocked Rely on synchroniza>on opera>ons Weak Consistency Release Consistency Entry Consistency Note Weaker the consistency model are more scalable 15

16 Sequen>al Consistency Defini>on Sequen>al consistency The result of any execu>on is the same as if the read and write opera>ons by all processes were executed in some sequen8al order and the opera>ons of each individual process appear in this sequence in the order specified by its program Any valid interleaving of read and write opera>ons is OK, but all processes must see the same interleaving. The events observed by each process must globally occur in the same order, or it is not sequen>ally consistent. It doesn't actually majer if the events don't really agree with clock >me, as long as they are consistent. Linearizability In sequen>al consistency, absolute >me is somewhat irrelevant The order of events is most important. Linearizability Sequen>al + Opera>ons are ordered according to a global >me A data store is said to be linearizable when each opera>on is >mestamped and the following condi>on holds: The result of any execu>on is the same as if the opera>ons by all processes on the data store were executed in some sequen>al order and the opera>ons of each individual process appear in this sequence in the order specified by its program. In addi>on, if ts_op 1 (x) < ts_op 2 (y), thenop 1 (x) should precede Op 2 (y) in this sequence. 16

17 Causal Consistency Necessary condigon Writes that are poten>ally causally related must be seen by all processes in the same order. Concurrent writes may be seen in a different order on different machines. If event A is a direct or indirect result of another prior event B, then all processes should observe event A before observing event B. A = A + 1; // First two events are causally related, B = A * 5; // because B reads A ader A was wrieen. C = C * 3; // This is a concurrent statement. FIFO Consistency Necessary Condi>on Writes performed by a single process are seen by all other processes in the order in which they were issued, but writes from different processes may be seen in a different order by different processes. A valid sequence of events of FIFO consistency. P 2 s writes are seen in the correct order. FIFO consistency is easy to implement. 17

18 Weak Consistency - Seman>cs The weak consistency models enforce consistency on a group of opera6ons, as opposed to individual reads and writes as is the case for strict, sequen>al, causal and FIFO consistency models A synchronize(s) opera>on by P, causes all writes by P to be propagated to all other replicas and all external writes are propagated to P. Process P forces the just wrijen value out to all the other replicas Process P can be sure it s gekng the most recently wrijen value before it reads Summary of Consistency Models Consistency Strict Linearizability Sequential Causal FIFO Description Absolute time ordering of all shared accesses matters. All processes must see all shared accesses in the same order. Accesses are furthermore ordered according to a (nonunique) global timestamp All processes see all shared accesses in the same order. Accesses are not ordered in time All processes see causally-related shared accesses in the same order. All processes see writes from each other in the order they were used. Writes from different processes may not always be seen in that order (a) Consistency Weak Release Entry Description Shared data can be counted on to be consistent only after a synchronization is done Shared data are made consistent when a critical region is exited Shared data pertaining to a critical region are made consistent when a critical region is entered. (b) (a) Consistency models not using synchroniza>on opera>ons. (b) Models with synchroniza>on opera>ons. 18

19 Client- Centric Consistency Models Data- centric consistency models aim at providing the system- wide view on a data store. Client- centric consistency models are generally used for applica>ons that lack simultaneous updates Most opera>ons involve reading data. Weak, client- centric consistency models Eventual consistency Monotonic reads Monotonic writes Read your writes Writes follow reads Eventual Consistency Systems such as DNS and WWW can be viewed as applica>ons of large scale distributed and replicated databases that tolerate a rela>vely high degree of inconsistency Common AssumpGon if no updates take place for a long >me, all replicas will gradually and eventually become consistent This form of consistency is called eventual consistency Eventual consistency requires only that updates are guaranteed to propagate to all replicas Eventual consistent data stores work fine as long as clients always access the same replica what happens when different replicas are accessed? 19

20 Consistency for Mobile Users Inconsistencies Various inconsistencies may occur as a mobile user moves from loca>on A to loca>on B Updates at A may not have yet been propagated to B May be reading newer entries than the ones available at A Updates at B may eventually conflict with those at A The consistency model must ensure that the entries updated and/or read at by the mobile user at A, are in B the way you lex them in A. This requirement ensures that the database will appear to be consistent to you. Client- Centric Consistency Guarantees Guarantees are the responsibility of session manager, not servers Two sets are maintained Read- set set of writes that are relevant to session reads Write- set set of writes performed in session Update dependencies captured in read sets and write sets Four different client- central consistency models Monotonic reads Monotonic writes Read your writes Writes follow reads 20

21 Fundamentals of Functional Programming Languages The basic process of computation is fundamentally different in a FPL than in an imperative language In an imperative language, operations are done and the results are stored in variables for later use Management of variables is a constant concern and source of complexity for imperative programming FPL takes a mathematical approach to the concept of a variable Variables are bound to values, not memory locations A variable s value cannot change, which eliminates assignment as a possible operation FPL and IPL Example Summing the integers 1 to 10 in IPL The computation method is variable assignment total = 0; for (i = 1; i 10; ++i) total = total+i; Summing the integers 1 to 10 in FPL The. computation method sum [1..10] is function application 42 21

22 Lambda Calculus The lambda calculus is a formal mathematical system to investigate functions, function application and recursion. A lambda expression specifies the parameter(s) and the mapping of a function in the following form λ x. x * x * x for the function cube (x) = x * x * x Lambda expressions describe nameless functions Lambda expressions are applied to parameter(s) by placing the parameter(s) after the expression (λ x. x * x * x) 3 => 3*3*3 => 27 (λ x,y. (x-y)*(y-x)) (3,5) => (3-5)*(5-3) => -4 FPL Map and Fold map and fold FPL higher-order functions (map f list1 [list2 list3 ]) (map square ( )) à ( ) (fold f list [ ]) (fold + ( )) à 30 (fold + (map square (map list1 list2)))) 22

Roots in Functional Programming Map f f f f f Fold g g g g g MapReduce Programmers specify two functions: map (k, v) <k, v >* reduce (k, v ) <k, v >* All values with the same key are reduced together

23 Roots in Functional Programming Map f f f f f Fold g g g g g MapReduce Programmers specify two functions: map (k, v) <k, v >* reduce (k, v ) <k, v >* All values with the same key are reduced together The execution framework handles everything else! Not quite partition (k, number Usually, of partitions) programmers partition also specify: for k Often a simple hash of the key, e.g., hash(k ) mod N Divides up key space for parallel reduce operations combine (k, v ) <k, v >* Mini-reducers that run in memory after the map phase Used as an optimization to reduce network traffic 23

24 K 1 V 1 K 2 V 2 K 3 V 3 K 4 V 4 K 5 V 5 K 6 V 6 map map map map a 1 b 2 c 3 c 6 a 5 c 2 b 7 c 8 Shuffle and Sort: aggregate values by keys a 1 5 b 2 7 c Reduce Reduce Reduce r 1 s 1 r 2 s 2 r 3 s 3 Distributed Execution Overview User Program Fork Fork Fork Assign Map Master Assign Reduce Input data Split 0 Split 1 Split 2 Read Worker Worker Worker Local Write Remote Read, Sort Worker Worker Write Output File 0 Output File 1 24

25 MapReduce Data Flow A MapReduce job is a unit of work to be performed Job consists of the MapReduce Program, the Input data and the Configuration Information The MapReduce job is divided it into two types of tasks map tasks and reduce tasks It is not uncommon for MapReduce jobs to have thousands of individual tasks to be assigned to cluster nodes The Input data is divided into fixed-size pieces called splits One map task is created for each split The user-defined map function is run on each split Configuration information indicates where the input lies, and the output is stored Jobtracker Scheduling and Coordination In large jobs, the total number of tasks may exceed the number of tasks that can be run on the cluster concurrently, The Jobtracker must maintain a task queue and assign nodes to waiting tasks as the nodes become available. Another aspect of Jobtracker s responsibiliies involves coordination among tasks belonging to different jobs Jobs from different users, for example Designing a large-scale, shared resource to support several users simultaneously in a predictable, transparent and policy-driven fashion is challening! 25

26 MapReduce Stragglers The speed of a MapReduce job is sensitive to the stragglers performance tasks that take an usually long time to complete The map phase of a job is only as fast as the slowest map task. The running time of the slowest reduce task determines the completion time of a job Stragglers may result from unreliable hardware A machine recovering from frequent hardware errors may become significantly slower The barrier between the map and reduce tasks further compounds the problem MapReduce Combiners Combiner functions can be used to minimize the data transferred between map and reduce tasks Combiners are particularly useful when MapReduce jobs are limited by the bandwidth available on the cluster Combiners are user-specified functions Combiner functions run on the map output The combiner s is then fed to the reduce function Since it is an optimization function, there is no guarantee how many times combiners are called for a particular map output record, if at all Calling the combiner zero, one, or many times should produce the same output from the reducer. 26

27 Combiner Property The combiner function calls can be expressed as follows: Max(0, 20, 10, 25, 15) = Max(Max(0, 20, 10), Max(25, 15)) = Max(20, 25)=25 Max() is commonly referred to as distributive Not all function exhibit distributive property Mean(0, 20, 10, 25, 15) = ( )/5=14 Mean(Mean(0, 20, 10), Mean(25, 15)) = Mean (10, 20) = 15 Combiners do not replace producers Producers are still needed to process recorders with the same key from different maps 27

DISTRIBUTED COMPUTER SYSTEMS

DISTRIBUTED COMPUTER SYSTEMS CONSISTENCY AND REPLICATION CONSISTENCY MODELS Dr. Jack Lange Computer Science Department University of Pittsburgh Fall 2015 Consistency Models Background Replication Motivation