SCHOOL OF ARTS AND SCIENCE ACADEMIC YEAR 2010/2011 JANUARY EXAMINATION COMPUTER SCIENCE AACSS164(A) Distributed Computer Systems MONDAY, 17 JANUARY 2011 ‘TIME: 2.00 PM - 4.00 PM (2 HOURS) VANCED DIPLOMA IN SCIENCE. IEERING AND MICROELECTRONICS WITH Ct (INFORMATION SY! COMMUNICATIONS) Instructions to Candidates: ‘Answer ALLL questions. All questions carry equal marks. the Sub mpemert RPC eM MASSHAL: Paing « + Doser pageum salle do comer “a ob! ae qh te feeabcles ott He a: - sare ee on fo he hak 2M Mt ad. the ‘war tac @ AL whieh Alby Ae no: pammeels (he ot Nitta) Phigfry ply ttre shack, Inf, fhm (tle A Wfvacd Peomtrs, bill, "0 Ie a prowritire nlf wed oly the ime! of 5 in ae server, 19. pre 9 kt, gf th fon 0 chithbey. of. 6 anthig + Why go anething ehins, 7 rehin to he smrver od eheg packs Me ot ‘Tat mg g moe ad he 0 fo he owe on pee Hb Wyrks te mosey med belle 2 Aah Fmt 00 refrar 0 Hy ee. ne ~ We ver peatan dale te recip, A Tb sad : +The shh, we nota grid! fo fy pte) ee coplr (Ag Leica ta) “ty dan bprty the HUT do he intra corr ; ‘ abehe tons COL of the promtirs A ein 1s Hitig ee thir yop bipes. ufet. This question paper consists of 4 questions on 3 printed pag.mip» ndpadef — Prow > PRCESS0L cy mmunicofe iby con ye! Procesiag une : nang 7 rescues ; : hin! Omnia pro oie AACSS164 (A) D COMPUTER SYSTEMS Ql. (a), “A distributed operating system looks to its users like an ordinary centralized @ operating system, but in fact runs on multiple independent CPUs. In other words, the user views the system as a virtual processor, not as a collection of distinct machines.” hg JAR key concept te inpments above ref rovrn YEE ther view the ae. ihe) inpeeszor Be SoA of key congept that you have identified in (ii) Analyse ‘which FOUR (4) typ le System(NFS). (16 marks) ceaess —_QN-(@) (i) are used in Network PARR srk ch Howey (by) "Your project manager needs to implement a distributed scheduling task in his new project. You are asked to choose and illustrate a scheduling algorithm into that distributed scheduling task where your chosen algorithm must achieve load sharing goal, suboptimal heuristic solution and state scheduler requirement. (6 marks) (©) What is the difference between global scheduling and local scheduling? (2 marks) {[Total: 25 marks) Q2. (a) distributed lock manager approach is viable for distributed real-time applications as it will not create a single critical element and a single point of failure. There are two solutions used in this approach, (i) Compare the TWO (2) solutions that are mentioned above. (6 marks) (ii) Examine the two solutions with the three-point test for the proof of the mutual exclusion | (5 marks) i (6) A deadlock is a situation in which two computer programs which use the same resoutce are preventing each other from accessing the same resource and resulting, in both programs cease to function. 2d, Sduson — “aes = Sketch the FOUR (4) allocation conditions that may create deadlock. Zibn-Wremptve = = (8 marks) Td and 204 = eas 7c vor, G Bropose any THREE (sins to prevent easel S Gai | Page Aye owe tly [Totat: 25 marks} |© ,ACSS5164 (A) DISTRIBUTED COMPUTER SYSTEMS @3. (a) _ Differentiate between symmetric and asymmetric key cryptography. (8 marks) (b) Compare and contrast the stateful and stateless servers in terms of the following: (i) Support failure transparency (ii) Support location transparency Gi) Support replication transparency (12 marks) fly explain any FIVE (6) process management ‘bilities. (5 marks) | EAD EES a os [Tota 25 marks Hered green (0 oy the ROR gie wRESS® Sev TE ho! pe | 19, seer abevk eo : wmortcy. “it is the synchronization of the system clocks in all the computers networked in a distributed environment at a moment in time.” (Do you agree with the above statement? Justify your answer, (4 marks) (ii) Briefly explain any TWO @) common difficulties that will be encountered while attempting to synchronize physical clocks in a distributed operating system. (marks) (b) The purpose of Two-phase commit protocol is to ensure that all transactions appear to occur atomically throughout the distributed system. (Identify the TWO (2) phases comprised in a Two-phase commit protocol. (2 marks) (ii) Assess the major disadvantage of a Two-phase commit protocol. (2 mark Gii) Propose a solution to overcome the problem you have stated in Q4.(b)Gi) G marks) (©) Distinguish the Simple Usage Point from the Economic Usage Point scheduling, algorithm approach. (6 marks) (Assess the pros and cons of sockets and pipes in term of inter-process communication (é marks) (Total: 25 marks} This question paper consists of 4 questions on 3 printed pages.