Ds Flat Unix Syl

8/10/2019 Ds Flat Unix Syl

1/5

(9A05604) DISTRIBUTED SYSTEMS

UNIT ICharacterization of Distributed Systems: Introduction, Examples of Distributed systems, Resourcesharing and web, challenges, System models: Introduction, Architectural and Fundamental models,Networking and Internetworking, Interprocess Communication.

UNIT II

Distributed objects and Remote Invocation: Introduction, Communication between distributed objects,RPC, Events and notifications, Case study-Java RMI. Operating System Support: Introduction, OS layerProtection, Processes and Threads, Communication and Invocation, Operating system architecture,Distributed File Systems-Introduction, File Service architecture, case study- SUN network file systems.

UNIT IIIName Services: Introduction, Name Services and the Domain Name System, Case study of the GlobalName Service, Case study of the X.500 Directory Service. Peer to Peer Systems: Introduction, Napster anits legacy, Peer to Peer middleware, Routing overlays, Overlay case studies-Pastry, Tapestry, Applicatiocase studies-Squirrel, OceanStore.

UNIT IVTime and Global States: Introduction, Clocks, events and Process states, Synchronizing physical clocks,logical time and logical clocks, global states, distributed debugging. Coordination and Agreement:Introduction, Distributed mutual exclusion, Elections, Multicast communication, consensus and relatedproblems.

UNIT VTransactions and Concurrency control: Introduction, Transactions, Nested Transactions, Locks,Optimistic concurrency control, Timestamp ordering, Comparison of methods for concurrency control.

UNIT VIDistributed Transactions: Introduction, Flat and Nested Distributed Transactions, Atomic commitprotocols, Concurrency control in distributed transactions, Distributed deadlocks, Transaction recoveryReplication-Introduction, System model and group communication, Fault tolerant services, Transactionwith replicated data.

UNIT VIISecurity: Introduction, Overview of Security techniques, Cryptographic algorithms, Digital signatures,Case studies-Kerberos, TLS, 802.11 WiFi.

UNIT VIIIDistributed shared memory, Design and Implementation issues, Sequential consistency and Ivy casestudy, Release consistency and Munin case study, Other consistency models, CORBA case study:Introduction, CORBA RMI,CORBA Services.

TEXT BOOKS:1. Distributed Systems Concepts and Design, G Coulouris, JDollimore and T Kindberg, Fourth Edition,Pearson Education.2. Distributed Systems, S.Ghosh, Chapman and Hall/CRC, Taylor & Francis Group, 2010.


2/5


3/5

(9A05606) UNIX INTERNALS LAB

1. Program on process creation and Executiona. To display Environment variables.b. To implement Different types of exec functions.

2. Write a programa. To Opening a stream

b. To Read and Write a streamc. To Position a Stream

3. Write a program toa. Create a fileb. Add record to filec. Modify recordsd. Delete recordse. Find status and mode value of a file

4. Write a Program that takes certain file names along the command line arguments and remove if thereexists any duplicates.

5. Write a Program to find whether a file is having read, write, execute permissions and also checkwhether a given name is file or directory.

6. Write a program to create a chain of Processes.

7. Write a program toa. Create the semaphoresb. Set values to semaphores

c. Get the values from the semaphoresd. Remove semaphores

8. Write a program to implement various operations on Message Queues.

9. Write a program to demonstratea. Signal handlingb. Terminal I/O

10. Perform Socket Programming Using

a. UDP socketb. TCP socket

11. Write a program toa. Create a shared memoryb. Write to shared memoryc. Read from shared memory


4/5

12. Write a program to create two pipes.

13. Write a program which takes a source file name and directory name as command line argument andprint a message YES, if the file is found in the given directory.

14. Design a directory structure that improves the efficiency of searching for pathnames by avoiding thelinear search

15. Implement free disk block list with a bitmap instead of linked list.

16. Design a scheme that reduces the number of directory searches for file names by caching frequentlyused names.

17. Redesign getblk and brelse where the kernel follows a FIFO scheme instead of LRU.

18. Design algorithm for allocating and freeing memory page and page tables Many process can sleep oan address but the kernel may want to wakeup selected processes that receive a signal assumingthat the signal mechanism can identify the particular processes, remodify the wakeup algorithm so thatonly one process is woken up on a sleep address instead of all the processes.

19. Implement a new system call newpgrp(PID, ngrp), that resets the process group of another processidentified by the process ID PID to ngrp.

20. Implement a new system call no wait(PID) where PID identifies a child of the process issuing the calwhen issuing the call the process informs the kernel that it will never wait for the child process to exit, sthat the kernel can immediately cleanup the child process slot when the child dies.


5/5

(13A05404) FORMAL LANGUAGES AND AUTOMATA THEORY

UNIT IIntroduction: Basics of set theory, Relations on sets, Deductive proofs, Reduction to definitions, Oththeorem forms, Proving equivalences about sets, The Contrapositive, Proof by contradiction, Counexamples, Inductive proofs, Alphabets, Strings, Languages, Problems, Grammar formalism, ChomsHierarchy

Finite Automata: An Informal picture of Finite Automata, Deterministic Finite Automata (DFA), NDeterministic Finite Automata (NFA), Applying FA for Text search, Finite Automata with Epsiltransitions (-NFA or NFA- ), Finite Automata with output, Conversion of one machine to anothMinimization of Finite Automata, Myhill-Nerode Theorem.

UNIT IIRegular Languages: Regular Expressions (RE), Finite Automata and Regular Expressions, ApplicationsRegular Expressions, Algebraic laws for Regular Expressions, The Ardens Theorem, Using Ardetheorem to construct RE from FA, Pumping Lemma for RLs, Applications of Pumping LemmEquivalence of Two FAs, Equivalence of Two REs, Construction of Regular Grammar from R

Constructing FA from Regular Grammar, Closure properties of RLs, Decision problems of RLApplications of REs and FAs

UNIT IIIContext Free Grammars and Languages: Definition of Context Free Grammars (CFG), Derivations aParse trees, Ambiguity in CFGs, Removing ambiguity, Left recursion and Left factoring, SimplificationCFGs, Normal Forms, Linear grammars, Closure properties for CFLs, Pumping Lemma for CFDecision problems for CFLs, CFG and Regular Language .

UNIT IVPush Down Automata (PDA): Informal introduction, The Formal Definition, Graphical notati

Instantaneous description, The Languages of a PDA, Equivalence of PDAs and CFGs, Deterministic PuDown Automata, Two Stack PDA.

UNIT VTuring Machines and Undecidability: Basics of Turing Machine (TM), Transitional RepresentationTMs, Instantaneous description, Non Deterministic TM, Conversion of Regular Expression to TM, Twstack PDA and TM, Variations of the TM, TM as an integer function, Universal TM, Linear BoundAutomata, TM Languages, Unrestricted grammar , Properties of Recursive and Recursively enumerablanguages, Undecidability, Reducibility, Undeciadable problems about TMs, Posts CorrespondenProblem(PCP), Modified PCP.

Text Books:1. Introduction to Automata Theory, Formal Languages and Computation, Shyamalendu kandPearson.2. Introduction to Automata Theory, Languages, and Computation, Third Edition, John E.HopcroRajeev Motwani, Jeffery D. Ullman, Pearson.

Documents

Ds Flat Unix Syl