CrazyEngineers
CrazyEngineers

  • Distributed System Question Bank

    Ankita Katdare

    Ankita Katdare

    @abrakadabra
    Updated: Oct 22, 2024
    Views: 1.3K
    Draw and explain architecture of distributed system.
    List and explain motivation behind development of distributed systems.
    List and explain in detail design issues in distributed systems.
    Draw and explain Remote Procedure Call concept.
    What are the drawbacks of absence of global clock and global time in distributed systems.
    Explain Lamport’s Logical clocks with example.
    Explain Vector clocks.
    Explain difference between logical clock and vector clock with the help of example.
    Define virtual time.
    What are the limitations of Lamport’s clock.
    What do you mean by causal ordering of messages.
    Explain Birman-Schipher-Stephenson protocol.
    Explain Schiper-Eggli-Sandoz protocol.
    Define the global state with the help of neat diagram.
    Define local state.
    0
    Replies
Howdy guest!
Dear guest, you must be logged-in to participate on CrazyEngineers. We would love to have you as a member of our community. Consider creating an account or login.
Replies

  • Ankita Katdare

    Administrator • Nov 17, 2010

    Explain the difference between global state and local state.
    Explain Chandy-Lamport’s Global State Recording algorithm.
    What is collected global state.
    Explain cuts of a distributed computation.
    What do you mean by termination detection.
    Explain Huang’s termination detection algorithm.
    What do you mean by mutual exclusion.
    Explain the requirements of mutual exclusion algorithm.
    Explain with example Lamport’s Non-token based algorithm for mutual exclusion.
    Explain with example Ricart-Agrawala Non-token based algorithm for mutual exclusion.
    Explain the difference between Token-based and Non-token based mutual exclusion algorithm.
    Explain the Suzuki-Kasami’s broadcast algorithm with proof of correctness.
    Explain Singhal’s Heuristics algorithm.
    Are you sure? This action cannot be undone.
    Cancel

  • Ankita Katdare

    Administrator • Nov 17, 2010

    Discuss the comparative performance analysis for distributed mutual exclusion algorithms.
    Show that in Lamport’s algorithm the critical section is accessed according to the increasing order of timestamps.
    In Lamport’s algorithm condition L1 can hold concurrently at several sites. Why then is L1 needed to guarantee mutual exclusion.
    Discuss the issues in deadlock detection and resolution.
    List and explain any one centralized deadlock detection algorithm.
    List the distributed deadlock detection algorithm.
    Explain Path-pushing distributed deadlock detection algorithm.
    Explain Edge-Chasing distributed deadlock detection algorithm.
    Explain Diffusion Computation based distributed deadlock detection algorithm.
    Explain Global State Detection Based distributed deadlock detection algorithm.
    Discuss the model of processor failures in Agreement protocols.
    List and discuss classification of agreement problems.
    Are you sure? This action cannot be undone.
    Cancel

  • Ankita Katdare

    Administrator • Nov 17, 2010

    List solutions to the Byzantine agreement problem and explain any one.
    Explain the interactive convergence algorithm for fault tolerant clock synchronization.
    Explain the interactive consistency algorithm for fault tolerant clock synchronization.
    What is atomic commit in DDBS.
    Show that Byzantine agreement cannot be always be reached among four processors if two processors are faulty.
    Draw and explain architecture of a distributed file system.
    List and explain in short various design issues related to distributed file system.
    Draw and explain architecture of a Sun Network File System (NFS).
    Draw and explain architecture of distributed shared memory.
    Define memory coherence.
    List and explain various forms of memory coherence.
    Explain Write-invalidate and write-update coherence protocols.
    Explain with neat diagram cache coherence in the PLUS system.
    What is Granularity.
    Explain page replacement.
    Are you sure? This action cannot be undone.
    Cancel

  • Ankita Katdare

    Administrator • Nov 17, 2010

    Discuss IVY (Integrated Shared Virtual Memory at Yale) as a distributed shared memory.
    Discuss Mirage as a distributed shared memory.
    Discuss Clouds as a distributed shared memory.
    Explain issues in Load Distributing for Distributed scheduling.
    List load distributing algorithms for distributed scheduling.
    Explain Sender-Initiated algorithms for load distribution.
    Explain Receiver-Initiated algorithms for load distribution.
    Explain Symmetrically Initiated algorithms for load distribution.
    Explain Adaptive algorithms for load distribution.
    Explain Load sharing policies for The V-System.
    Explain Load sharing policies for The Sprite System.
    Explain Load sharing policies for The Condor System.
    Explain The Stealth Distributed Scheduler.
    Explain task migration in distributed system. Also explain general steps involved in task migration.
    What are the various issues related to task migration.
    Are you sure? This action cannot be undone.
    Cancel

  • Ankita Katdare

    Administrator • Nov 17, 2010

    Explain structure of a migration mechanism.
    Discuss performance of a various task migration mechanisms.
    Explain the concept of recovery in distributed systems.
    What do you mean by backward and forward error recovery.
    Discuss the two phases of The Checkpoint Algorithm.
    Explain with example The Checkpoint Algorithm.
    Explain with example The Rollback Recovery Algorithm.
    Discuss scheme for Asynchronous Check pointing and Recovery.
    Discuss the algorithm for Asynchronous Check pointing and Recovery with example.
    Explain the characteristics of atomic actions.
    Explain the concept of Generals Paradox for commit protocols.
    Explain the Two-Phase commit protocol.
    What do you mean by static voting.
    Explain in detail The Voting Algorithm.
    Explain Data Encryption Standard (DES) with the help of neat diagram.
    What is Cipher Block Chaining.
    Write short note on public key cryptography.
    Explain in detail The Rivest-Shamir-Adleman (RSA) method for public key cryptography.
    Write short note on authentication in distributed systems.
    Define Authentication servers.
    Explain the protocol for private key systems.
    Explain the protocol for public key systems.
    What do you mean by digital signatures.
    Discuss digital signature in private key system.
    Discuss digital signature in public key system.
    Draw and explain Kerberos authentication protocol.
    Explain the three phases of Kerberos authentication protocol.
    Are you sure? This action cannot be undone.
    Cancel

  • Ankita Katdare

    Administrator • Jul 13, 2011

    Please add more questions to this question bank. We can compile a PDF of those and keep it for download.
    Are you sure? This action cannot be undone.
    Cancel

  • intoxicant

    Member • Jul 15, 2011

    have you got the answers to these?
    Are you sure? This action cannot be undone.
    Cancel

  • Ankita Katdare

    Administrator • Jul 15, 2011

    @intoxicant: Could you point to specific questions?
    Are you sure? This action cannot be undone.
    Cancel

  • Euphoria

    Member • Jun 9, 2015

    Need answer for "Show that Byzantine agreement cannot be always be reached among four processors if two processors are faulty."
    Are you sure? This action cannot be undone.
    Cancel

  • Ankita Katdare

    Administrator • Jun 9, 2015

    #-Link-Snipped-# Recommended reading:
    Advanced Concepts In Operating Systems By Singhal
    This excerpt: #-Link-Snipped-#
    Are you sure? This action cannot be undone.
    Cancel
Home Channels Search Login Register