PDA

View Full Version : Distributed Computing (3485) assignment spring 2012 idea solution



Xpert
07-28-2012, 06:40 PM
Course: Distributed Computing (3485) Semester: Spring, 2012
Level: Bachelor Total Marks: 100





ASSIGNMENT No. 1

Note: All questions carry equal marks.

Q. 1 Describe the importance of computation in computer technology Also explain the characteristics of distributed computing.

Q. 2 What is RPC? Discuss the techniques used for RPC in client server model.

Q. 3 Describe various types of events? Also explain the techniques used for resource allocation to various events in distributed environments.

Q. 4 What are the payoffs of various types of failures in distributed system? Also explain the techniques to convalesce from these.

Q. 5 Explain the importance of dynamic membership. Also describe why it is so useful in distributed environment.



ASSIGNMENT No. 2


Total Marks: 100
Note: All questions carry equal marks.

Q. 1 Define synchronization. How virtual synchrony works? Explain the algorithmic working of the virtual synchrony.

Q. 2 Write down the characteristics of wrappers. Why wrappers are so important in distributed computation?

Q. 3 How the reliability of distributed shared memory will be encountered. Elaborate.
Q. 4 Discuss the importance of masking the overhead of protocol layer in view of software architecture for group communication.

Q. 5 Study various problems in realm of security in distributed computing. Create a intellectual report of your research study.



3485 Distributed Computing Credit Hours: 4 (4+0)

Recommended Book:
Parallel & Distributed Computing Handbook by Albart Y.Zomaya

Course Outlines:
Unit–1: Parallel and Distributed Computing: The Scene, The Pro.
a) A Prospective
b) Parallel Processing Paradigm
c) Modeling and Characterizing Parallel Algorithms
d) Cost vs. Performance Evaluation
e) Software and General Purpose

Unit–2: Semantics of Concurrent Programming & Formal Methods
a) Models of Concurrent Programming
b) Axiomatic, Denotation, Operational: Semantics Definitions
c) Process Algebras
d) PETRI Nets
e) High Level Net Models

Unit–3: Complexity issues in Parallel and Distributed Computing
a) Turing Machine as the Basis and Consequences
b) Complexity Measures for Parallelism
c) Parallel Complexity Model and Resulting Classes
d) VLSI Computational Complexity
e) Complexity Measures for Distributed Systems
f) Neural Networks and Complexity Issues

Unit–4: Distributed Computing Theory
a) The Computational Model
b) Leaders Election
c) Spares Network Covers and their Applications
d) Ordering Events & Resource Allocation
e) Tolerating Processor Failure in synchronous and Asynchronous Systems

Unit–5: Check Pointing in Parallel and Distributed Systems
a) Check pointing Using Task Duplication
b) Techniques for consistent check pointing
c) Conclusion and Future Directions

Unit–6: Architecture for Open Distributed Software Systems
a) Computational Model
b) ODP Application

Unit–7: Superscalar, VLIW and SIMD-Processing
a) Superscalar Processor
b) VLIW Processor
c) SIMD Machine Component
d) Associative Processing

Unit–8: MMID Architecture: Share and Distributed Memory Design
a) Proliferation of MIMD Design
b) Share Memory Architecture
c) Distributed Memory Architecture
d) Hybrid Share/Distributed Architecture

Unit–9: ATM Base Parallel and Distributed Computing
a) Broadband Integrated Services Data Network
b) ATM Protocol & Switches
c) Host to Network Interfaces
d) Parallel and Distributed Computing Environment Over ATM