Embed Size (px)
Citation preview
COMPUTER SCIENCE AND ENGINEERING
COURSE DIARY (ACADEMIC YEAR 2011-12)
VIII SEMESTER
Name : _____________________________________________
USN : _____________________________________________
Semester & Section : _____________________________________________
The Mission
“The mission of our institution is to provide
world class education in our chosen fields and
prepare people of character, caliber and vision to
build the future world.”
ADVANCED COMPUTER ARCHITECTURE
SYLLABUS
Sub Code : 06CS81 IA Marks : 25
Hrs/Week : 04 Exam Hours : 03
Total Hrs : 52 Exam Marks : 100
UNIT - 1
FUNDAMENTALS OF COMPUTER DESIGN: Introduction; Classes of computers;
Defining computer architecture; Trends in Technology, power in Integrated Circuits and cost;
Dependability; Measuring, reporting and summarizing Performance; Quantitative Principles of
computer design.
6 hours
UNIT - 2
PIPELINING: Introduction; Pipeline hazards; Implementation of pipeline; What makes
pipelining hard to implement?
6 Hours
UNIT - 3
INSTRUCTION –LEVEL PARALLELISM – 1: ILP: Concepts and challenges; Basic
Compiler Techniques for exposing ILP; Reducing Branch costs with prediction; Overcoming
Data hazards with Dynamic scheduling; Hardware-based speculation.
7 Hours
UNIT - 4
INSTRUCTION –LEVEL PARALLELISM – 2: Exploiting ILP using multiple issue and
static scheduling; Exploiting ILP using dynamic scheduling, multiple issue and speculation;
Advanced Techniques for instruction delivery and Speculation; The Intel Pentium 4 as example.
PART - B
UNIT - 5
MULTIPROCESSORS AND THREAD –LEVEL PARALLELISM: Introduction;
Symmetric shared-memory architectures; Performance of symmetric shared–memory
multiprocessors; Distributed shared memory and directory-based coherence; Basics of
synchronization; Models of Memory Consistency.
7 Hours
UNIT - 6
REVIEW OF MEMORY HIERARCHY: Introduction; Cache performance; Cache
Optimizations, Virtual memory.
6 Hours
UNIT - 7
MEMORY HIERARCHY DESIGN: Introduction; Advanced optimizations of Cache
performance; Memory technology and optimizations; Protection: Virtual memory and virtual
machines.
6 Hours
UNIT - 8
HARDWARE AND SOFTWARE FOR VLIW AND EPIC: Introduction: Exploiting
Instruction-Level Parallelism Statically; Detecting and Enhancing Loop-Level Parallelism;
Scheduling and Structuring Code for Parallelism; Hardware Support for Exposing Parallelism:
Predicated Instructions; Hardware Support for Compiler Speculation; The Intel IA-64
Architecture and Itanium Processor; Conclusions.
7 Hours
TEXT BOOK:
1. Computer Architecture, A Quantitative Approach – John L. Hennessey and David A.
Patterson:, 4th Edition, Elsevier, 2007.
REFERENCE BOOKS:
1. Advanced Computer Architecture Parallelism, Scalability – Kai Hwang:,
Programability, Tata Mc Grawhill, 2003.
2. Parallel Computer Architecture, A Hardware / Software Approach – David E. Culler,
Jaswinder Pal Singh, Anoop Gupta:, Morgan Kaufman, 1999
ADVANCED COMPUTER ARCHITECTURE
LESSON PLAN
Sub Code : 06CS81 IA Marks : 25
Hrs/Week : 04 Exam Hours : 03
Total Hrs : 52 Exam Marks: 100
SI.No Chapter Hour
No
Topics to be Covered
1.
Fundamentals of
computer design
1. Introduction, Classes of computers
2. Defining computer architecture
3. Trends in technology, Integrated cost
4. Dependability
5. Measuring and reporting performance
6. Quantitative principles of computer design
2.
Pipelining
7. Introduction
8. Pipeline hazards
9. Pipeline hazards
10. Implementation of pipeline
11. Implementation of pipeline
12. Why pipelining hard to implement
3.
Instruction level
parallelism-1
13. ILP concepts
14. Compiler techniques for exposing ILP
15. Reducing branch costs
16. Prediction
17. Over coming data hazards with dynamic
scheduling
18. Hardware based speculation
19. Branch prediction
4.
Instruction level
parallelism-2
20. Exploiting ILP using multiple issues
21. Static scheduling
22. Exploiting ILP using dynamic scheduling
23. Multiple issue and speculation
24. Advance techniques for inspection delivery
25. Speculation
26. TI-pentium 4
5.
Multiprocessors and
thread level parallelism
27. Introduction
28. Symmetric shared memory architectures
29. Performance
30. Distributed shared memory and directory based
coherence
31. Synchronization
32. Models of memory consistency
Review of memory
33. Introduction
34. Cache performance
35. Cache optimization
6.
hierarchy
.
36. Virtual memory
37. Summary
7.
Memory hierarchy
design
38. Introduction
39. Advanced optimizations of cache performance
40. Memory technology and optimization
41. Protection
42. Virtual memory
43. Virtual machines
44. Hierarchy design
8.
Hardware and software
for VLIW and EPIC
45. Introduction
46. Detecting and enhancing loop level parallelism
47. Scheduling and structuring code for parallelism
48. Predicated instructions
49. Hardware support for compiler speculation
50. Intel IA-64 architecture and itanium processor
51. Conclusion
52. Revision
QUESTION BANK- Advanced Computer Architecture
1. With neat diagram, explain the Flynn’s classification of computer architecture.
2. Explain about shared memory multiprocessor and its types.
3. Explain about resource dependency and its types 4. Define the term “Grain size”.
5. What is pipelining?
6. Define “Latency”. 7. Define the term “Through put”.
8. Explain and compare
i) Control flow Computers
ii) Data flow Computers
iii) Reduction Computers
9. Define Multiprogramming.
10. Define Multiprocessing.
11. What is meant by VLIW Architecture?
12. Differentiate Risc and Cisc. 13. What is interleaving?
14. Define fault tolerance. 15. What are the Mechanisms for Instruction Pipelining?
16. Explain about branch handling techniques. 17. What is branch Prediction?
18. Explain in detail about linear pipeline processor and its categories. 19. Explain the following terms
i) Flow dependence
ii) Anti dependence
iii) Output dependence
20. With a neat block diagram, explain super scalar processor
21. Explain about crossbar switch. 22. What is Cache Coherence problem?
23. Write the Pseudo code for the data parallel equation solver Kernel and explain?
24. Highlight the need of BARRIER & LOCK primitive in solver Kernel.
25. What is meant by scalable system?
26. Explain any one message passing protocol.
27. List the advantages and disadvantages of message passing protocol.
28. What is Hardware parallelism?
29. What is Software parallelism?
30. Write short notes on message routing scheme
31. What is meant by CSA & CPA adders and differentiate?
32. Describe how a sequential program can be converted into parallel program.
33. Explain the elements of a computer system?
34. Differentiate multiprocessors and multicomputers
35. Define node degree. 36. What is pipeline cycle?
37. What is meant by co-processor
38. Define node diameter.
39. Define bisection width. 40. Define Network throughput. 41. Differentiate processor and co-processor. 42. What is meant by the super scalar processor
43. Differentiate super scalar and victor processors. 44. Define the arbiter 45. Explain broad call and broadcast in addressing and timing control.
46. Define bus timer.
47. What is bus addressing?
48. Explain daisy chained bus arbitration. 49. What is an interrupt?
50. Explain about memory allocation schemes.
SYSTEM MODELING AND SIMULATION-SYLLABUS
Sub Code : 06CS82 IA Marks : 25
Hrs/Week : 04 Exam Hours : 03
Total Hrs : 52 Exam Marks : 100
PART – A
1. INTRODUCTION 8 Hrs
When simulation is the appropriate tool and when it is not appropriate; Advantages and
disadvantages of Simulation; Areas of application; Systems and system environment;
Components of a system; Discrete and continuous systems; Model of a system; Types
of Models; Discrete-Event System Simulation; Steps in a Simulation Study.
Simulation examples: Simulation of queuing systems; Simulation of inventory systems;
Other examples of simulation.
2. GENERAL PRINCIPLES, SIMULATION SOFTWARE 6 Hrs
Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance
Algorithm, World Views, Manual simulation Using Event Scheduling; List processing.
Simulation in Java; Simulation in GPSS.
3. STATISTICAL MODELS IN SIMULATION 6 Hrs
Review of terminology and concepts; Useful statistical models; Discrete distributions;
Continuous distributions; Poisson process; Empirical distributions.
4. QUEUING MODELS 6 Hrs
Characteristics of queuing systems; Queuing notation; Long-run measures of
performance of queuing systems; Steady-state behavior of M/G/1 queue; Networks of
queues.
PART – B
5. RANDOM-NUMBER GENERATION, RANDOM-VARIATE GENERATION
8 Hrs
Properties of random numbers; Generation of pseudo-random numbers; Techniques for
generating random numbers; Tests for Random Numbers.
Random-Variate Generation: Inverse transform technique; Acceptance-Rejection
technique; Special properties.
6. INPUT MODELING 6 Hrs
Data Collection; Identifying the distribution with data; Parameter estimation; Goodness
of Fit Tests; Fitting a non-stationary Poisson process; Selecting input models without
data; Multivariate and Time-Series input models.
7. OUTPUT ANALYSIS FOR A SINGLE MODEL 6 Hrs
Types of simulations with respect to output analysis; Stochastic nature of output data;
Measures of performance and their estimation; Output analysis for terminating
simulations; Output analysis for steady-state simulations.
8. VERIFICATION AND VALIDATION OF SIMULATION MODELS,
OPTIMIZATION 6 Hrs
Model building, verification and validation; Verification of simulation models;
Calibration and validation of models. Optimization via Simulation.
Text Books:
1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event
System Simulation, 4th Edition, Pearson Education, 2007.
(Chapters1, 2, 3, 4.4, 4.5, 5, 6.1 to 6.3, 6.4.1, 6.6, 7, 8, 9, 10, 11, 12.4)
Reference Books:
1. Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course,
Pearson / Prentice-Hall, 2006.
2. Averill M. Law: Simulation Modeling and Analysis,4th Edition, Tata McGraw-Hill,
2007.
M.V.J COLLEGE OF ENGINEERING
Department Of Computer Science & Engineering
LESSON PLAN— SYSTEM MODELING AND SIMULATION
SUBJECT CODE: 06CS82 ARKS: 25
HOURS/WEEK: 04 HOURS: 03
TOTAL HOURS: 52 EXAM MARKS: 100
SL
NO CHAPTER HOUR
NO
TOPICS TO BE COVERED
1
INTRODUCTION
1
When simulation is the appropriate tool and
when it is not appropriate; Advantages and
disadvantages of Simulation
2 Areas of application; Systems and system
environment
3 Components of a system; Discrete and
continuous systems
4 Model of a system; Types of Models
5 Discrete-Event System Simulation; Steps in a
Simulation Study
6 Simulation examples: Simulation of queuing
systems
7 Simulation of inventory systems; Other examples
of simulation
8 Revision
2
GENERAL
PRINCIPLES,
SIMULATION
SOFTWARE
9 Concepts in Discrete-Event Simulation: The
Event-Scheduling / Time-Advance Algorithm
10 World Views
11 Manual simulation Using Event Scheduling
12 List processing
13 Simulation in Java; Simulation in GPSS
14 Revision
3 STATISTICAL
MODELS IN
SIMULATION
15 Review of terminology and concepts
16 Useful statistical models
17 Discrete distributions; Continuous distributions
18 Poisson process
19 Empirical distributions
20 Revision
4
QUEUING MODELS
21 Characteristics of queuing systems
22 Queuing notation
23 Long-run measures of performance of queuing
systems
24 Steady-state behavior of M/G/1 queue
25 Networks of queues
26 Revision
5
RANDOM-NUMBER
GENERATION,
RANDOM-
VARIATE
GENERATION
27 Properties of random numbers
28 Generation of pseudo-random numbers
29 Techniques for generating random numbers
30 Tests for Random Numbers.
31 Random-Variate Generation: Inverse transform
technique
32 Acceptance-Rejection
technique
33 Special properties
34 Revision
6 INPUT MODELING
35 Data Collection; Identifying the distribution with
data
36 Parameter estimation; Goodness of Fit Tests
37 Fitting a non-stationary Poisson process
38 Selecting input models without
Data
39 Multivariate and Time-Series input models.
40 Revision
7
OUTPUT
ANALYSIS FOR A
SINGLE MODEL
41 Types of simulations with respect to output
analysis
42 Stochastic nature of output data
43 Measures of performance and their estimation
44 Output analysis for terminating
simulations
45 Output analysis for steady-state simulations
46 Revision
8
VERIFICATION
AND VALIDATION
OF SIMULATION
MODELS,
OPTIMIZATION
47 Model building
48 Verification and validation
49 Verification of simulation models
50 Calibration and validation of models
51 Optimization via Simulation
52 Revision
QUESTION BANK
UNIT 1
1. State any 2 situations where simulation can be used and not with justification.
2. What is simulation? State any 4 merits and demerits of simulation.
3. Differentiate the following with examples:
• Static and dynamic model
• Discrete and continuous system
• Deterministic and stochastic model
4. With an example define a model of system. Give the classification of different types of
models of a system.
5. Discuss the types of models of a system.
6. Explain the various steps in simulation study. Write the flow chart for simulation study.
7. Briefly explain the simulation of Inventory system and the various means used to
evaluate the system.
8. A newspaper seller classifies his days into “good” and “bad” ones with probability 0.4 and 0.6 respectively. The amounts of newspaper sold are given by the distributions
below:
Good Copies sold Probability Bad Copies sold Probability
150 0.05 150 0.10
200 0.10 200 0.30
250 0.20 250 0.40
300 0.35 300 0.15
350 0.30 350 0.05
He can buy a copy of the newspaper himself by 1 Euro and he sells it with the
price of 1.8 Euros. Unsold copies must be thrown away. Based on 5 days of
simulation calculate the profit of the newspaper seller. Instead of 250
newspapers per day if 300 newspapers are purchased will it be more profitable.
Random digits for type of day 03 00 04 07 08
Random digits for number of copies sold 70 37 93 07 45
UNIT 2
1. A small grocery store has 1 checkout counter. Customers arrive at this counter at random
from 1-10 mins apart. Each possible value of inter-arrival time has the same probability
of occurrence equal to 0.0. The service time varies from 1-6mins apart with probabilities
shown below:
Service Time 1 2 3 4 5 6
Probability 0.10 0.20 0.30 025 0.10 0.05
Develop simulation table for 10 customers and find the following:
• The average time between arrivals
• The probability that a customer has to wait in the queue. • The average service time.
Random digits for arrivals: 91,72,15,94,30,92,75,23,30.
Random digits for service time: 84, 10,74,53,17,79,91,67,89,38.
2. Define any 4 concepts in discrete event simulation with suitable examples.
3. With respect to discrete event simulation, differentiate between the terms activity and
delay.
4. Explain the various steps used in Time-advance algorithm.
5. Six trucks are used to haul coal from the entrance of a small mine to the railroad. Each
truck is loaded by one of two loaders. After loading, a truck immediately moves to the
scale, to be weighed. Both the loaders and the scale have FCFS waiting line for trucks.
After being weighed, a truck begins to travel time and then afterward returns to the
loader queue. It is assumed that 5 of the trucks are at the loaders and one is at the scale at
time 0. The activity times are given in the following table:
Loading time (min) 10 05 15 05 10
Weighing time (min) 12 16 12 12 12
Travel time (min) 40 60 80 60 40
Simulate the system for 25mins, estimate the loader and scale utilization.
6. Explain event scheduling. 7. Explain the concept of manual simulation using event scheduling.
8. Explain how Java simulation differs from GPSS simulation.
UNIT 3
1. Explain the following terms: • Discrete Random variables • Continuous random variables
• Cumulative distribution function • Expectation
• The mode 2. Explain the various useful statistical models? 3. Write the difference between:
• Bernoulli and Binomial distribution • Uniform and Exponential distribution
4. Explain the properties of a Poisson Process
5. Generate 3 Poisson variates with mean α=0.2. 6. Explain Empirical distributions.
UNIT 4
1. Describe the queuing system with respect to arrival and service mechanisms, system
capacity, queue discipline, flow diagrams of arrival and service events.
2. Prepare a simulation table for a single channel queuing system using even
scheduling/time advance algorithm, until the clock reaches time 21, using the inter
arrival timer and the service timer given below in the order shown. The stopping event
will be at time 30. Inter arrival time (mins) 8 6 1 8 3 8
Service time 4 1 4 3 2 4
Compute the cumulative statistics for the following:
• Busy time of server
• Maximum queue length
• Total number of customers who spend four or more minutes at counter
• Total number of departures up to the current simulation time
3. Explain the queuing notation. 4. Explain the steady state behavior in Markovian Models.
UNIT 5
1. Define a random number. Explain statistical properties of random numbers with
example.
2. Explain the secondary properties of random numbers.
3. What are psuedo random numbers? List the errors, which occur during the generation of
psuedo random numbers.
4. Use Linear congruential method to generate a sequence of 3 random numbers for X0=27,
a=8 and m=100.
5. Use the multiplicative congruential method to generate a sequence of four 3-digit
random numbers for X0 =117, a=43 and m=1000.
6. The sequence of numbers 0.54,0.73,0.98,0.11 and 0.68 has been generated. Use the
Kolmogorav- Smirnov test with α= 0.05 to determine if the hypothesis that its numbers
are uniformly distributed on the interval (0,1) can be rejected. Compare F(x) and Sn(x)
on a graph, D0.05, 5=0.565.
7. The number of vehicles arriving at an intersection in a 5 min period between 7:00 AM
and 7:05 AM was monitored for 5 working days over a 20-week period. The table given
below gives the data: Arrivals per period Xi 0 1 2 3 4 5 6 7 8 9 10 11
Frequency in number of days 12 10 19 17 10 08 07 05 05 03 03 01
• Construct frequency table and find mean.
• Assume Poisson distribution and estimate the parameter ‘α’.
• Check for Goodness of Fit using Chi2- test for significance level of 5%.
8. When to use random variates generation?
9. What is the difference between random number generation and random variates
generation? Explain with example.
10. Explain the Inverse transformation technique of producing random variates for
exponential distribution. Generate exponential variates Xi with mean 1. Give random
numbers Ri=0.1306,0,0422,06597,0.7965,0.7696.
11. Lead times are exponentially distributed with the mean, 3.7 days. Generate 5 random
lead-time variates for this distribution using Inverse Transform technique. Take R1=0.01,
R2=0.13, R3=0.35, R4=0.65 and R5=0.53.
12. Consider the 60 2-digit nos, in the sequence given below: 0.30 0.48 0.36 0.01 0.54 0.34 0.96 0.06 0.61 0.85
0.48 0.86 0.14 0.86 0.89 0.37 0.49 0.60 0.04 0.83
0.42 0.83 0.37 0.21 0.90 0.89 0.91 0.79 0.57 0.99
0.95 0.27 0.41 0.81 0.96 0.31 0.09 0.06 0.23 0.77
0.73 0.47 0.13 0.55 0.11 0.75 0.36 0.25 0.23 0.72
0.60 0.84 0.70 0.30 0.26 0.38 0.05 0.19 0.73 0.44
Test whether the 2nd, 9th, 16th, … numbers in the sequence are auto
correlated where α=0.05.
13. Consider Discrete distribution with the DMF given by P(x)= 2x/K(K+1), x= 1,2, … K.
Find an expression for finding the values of random variates ‘x’ corresponding to
random number ‘R’.
14. Write short notes on Acceptance-Rejection test.
UNIT 6
1. Write short notes on Data collection in input modeling.
2. What is the need for Input model? Explain the steps involved in the development of a
useful model for a given set of input data.
3. The time required for 50 different employees to compute and record the number of hours
during the week was measured with the following results in mins. Use Chi2- test to test
the hypothesis that these service times are exponentially distributed. Take the number of
class intervals as K=6, α=0.05.
Employee Time Employee Time Employee Time Employee Time Employee Time
1 1.88 11 3.53 21 1.42 31 0.39 41 0.80
2 1.54 12 0.53 22 1.28 32 0.34 42 5.50
3 1.90 13 1.80 23 0.82 33 0.01 43 4.91
4 0.15 14 0.79 24 2.16 34 0.10 44 0.35
5 0.02 15 0.21 25 0.05 35 1.10 45 0.36
6 2.81 16 0.80 26 0.04 36 0.24 46 0.90
7 1.50 17 0.26 27 1.49 37 0.26 47 1.03
8 0.53 18 0.63 28 0.66 38 0.45 48 1.73
9 2.62 19 0.36 29 2.03 39 0.17 49 0.38
10 2.67 20 2.03 30 1.00 40 4.29 50 0.48
Use X20.05=9.49.
4. Explain how the method of histograms can be used to identify the shape of a distribution.
5. Explain the parameter estimation and input models without data.
6. Explain the different estimations available in input modeling.
7. Explain Identifying the distribution with data and Time-series input model.
UNIT 7
1. What is output analysis? State its purpose. Explain Interval estimation.
2. Explain the types of simulation WRT Output analysis. Give an example.
3. Explain initialization bias in output analysis of steady state simulation.
4. Write a short note on Point estimation.
5. Explain the stochastic nature of output data.
UNIT 8
1. Explain in detail about the model building, verifying and validation process through a
diagram.
2. Explain 3-step approach for validation process as formulated by Nayler and Finger.
3. What does optimization via simulation mean?
4. Explain the random search algorithm.
5. Explain verification of simulation model based on calibration of models.
STORAGE AREA NETWORKS
Subject Code : 06CS833 IA Marks : 25
Total No. of Lecture Hrs. : 52 Exam Marks : 100
PART- A
UNIT - 1
INTRODUCTION: Server Centric IT Architecture and its Limitations; Storage – Centric IT
Architecture and its advantages; Case study: Replacing a server with Storage Networks; The
Data Storage and Data Access problem; The Battle for size and access. 6 Hours
UNIT - 2
INTELLIGENT DISK SUBSYSTEMS - 1: Architecture of Intelligent Disk Subsystems; Hard
disks and Internal I/O Channels, JBOD, Storage virtualization using RAID and different RAID
levels; 6 Hours
UNIT - 3
INTELLIGENT DISK SUBSYSTEMS – 1, I/O TECHNIQUES - 1: Caching: Acceleration
of Hard Disk Access; Intelligent disk subsystems; Availability of disk subsystems. The Physical
I/O path from the CPU to the Storage System; SCSI. 7 Hours
UNIT - 4
I/O TECHNIQUES – 2, NETWORK ATTACHED STORAGE: Fibre Channel Protocol
Stack; Fibre Channel SAN; IP Storage. The NAS Architecture, The NAS hardware Architecture,
The NAS Software Architecture, Network connectivity, NAS as a storage system. 7 Hours
PART- B
UNIT - 5
FILE SYSTEM AND NAS: Local File Systems; Network file Systems and file servers; Shared
Disk file systems; Comparison of fibre Channel and NAS. 6 Hours
UNIT - 6
STORAGE VIRTUALIZATION: Definition of Storage virtualization; Implementation
considerations; Storage virtualization on Block or file level; Storage virtualization on various
levels of the storage Network; Symmetric and Asymmetric storage virtualization in the Network
6 Hours
UNIT - 7
SAN ARCHITECTURE AND HARDWARE DEVICES: Overview, creating a Network for
storage; SAN Hardware devices, The fibre channel switch, Host Bus adaptors; Putting the
storage in SAN; Fabric operation from a Hardware perspective. 7 Hours
UNIT - 8
SOFTWARE COMPONENTS OF SAN: The switch’s Operating system, Device
Drivers, The Supporting the switch’s components, Configuration options for SANs. Panning for
business continuity. 7 Hours
TEXT BOOKS:
1. Storage Networks Explained – Ulf Troppens, Rainer Erkens and Wolfgang Muller, John
Wiley & Sons, 2003.
2. Storage Networks: The Complete Reference – Robert Spalding, Tata McGraw Hill, 2003.
REFERENCE BOOKS:
1. Storage Area Network Essentials: A Complete Guide to understanding and
Implementing SANs – Richard Barker and Paul Massiglia, John Wiley India, 2002.
2. Storage Networking Fundamentals Marc Farley, Cisco Press, 2005.
M.V.J COLLEGE OF ENGINEERING
DEPT OF COMPUTER SCIENCE & ENGINEERING LESSON PLAN— STORAGE AREA NETWORKS
SUBJECT CODE: 06CS833 IA MARKS: 25
HOURS/WEEK: 4 EXAM HOURS: 3
TOTAL HOURS: 52 EXAM MARKS: 100
SL
NO Chapter
HOUR
NO TOPICS TO BE COVERED
1
PART A:
UNIT 1:
INTRODUCTION
1 Introduction
2 Server Centric IT Architecture and its
Limitations
3 Storage – Centric IT Architecture and its
advantages
4 Case study: Replacing a server with Storage
Networks
5 The Data Storage and Data Access problem;
6 The Battle for size and access
2
UNIT: 2
INTELLIGENT
DISK SUBSYSTEMS
7 Architecture of Intelligent Disk Subsystems;
8 Architecture of Intelligent Disk Subsystems;
9 Hard disks and Internal I/O Channels
10 JBOD
11 Storage virtualization using RAID
12 Different RAID levels
3 UNIT - 3
INTELLIGENT
DISK SUBSYSTEMS
– 1, I/O
TECHNIQUES - 1
13 Caching
14 Acceleration of Hard Disk Access
15 Intelligent disk subsystems
16 Availability of disk subsystems
17 The Physical I/O path from the CPU to the
Storage System
18 The Physical I/O path from the CPU to the
Storage System
19 SCSI
4
UNIT - 4
I/O TECHNIQUES –
2, NETWORK
ATTACHED
STORAGE:
20 Fibre Channel Protocol Stack
21 Fibre Channel SAN
22 IP Storage. The NAS Architecture
23 The NAS hardware Architecture
24 The NAS Software Architecture
25 Network connectivity
26 NAS as a storage system
5
PART B :
UNIT – 5 FILE
SYSTEM AND NAS:
27
Local File Systems
28 Network file Systems
29 Network file Systems
30 File servers
31 Shared Disk file systems
32 Comparison of fibre Channel and NAS
6 UNIT - 6
STORAGE
VIRTUALIZATION:
33 Definition of Storage virtualization
34 Implementation considerations
35 Storage virtualization on Block or file level
36 Storage virtualization on various levels of the
storage Network
37 Symmetric storage virtualization in the Network
38 Asymmetric storage virtualization in the Network
7 UNIT - 7
SAN
ARCHITECTURE
AND HARDWARE
DEVICES:
39 Overview
40 Creating a Network for storage
41 SAN Hardware devices
42 The fibre channel switch
43 Host Bus adaptors
44 Putting the storage in SAN
45 Fabric operation from a Hardware perspective
8 UNIT - 8
SOFTWARE
COMPONENTS OF
SAN:
46 The switch’s Operating system
47 The switch’s Operating system
48 Device Drivers
49 The Supporting the switch’s components
50 Configuration options for SANs
51 Panning for business continuity
52 Panning for business continuity
QUESTION BANK - STORAGE AREA NETWORKS
UNIT -I
1. Explain the structure of server centric IT and storage centric IT Architecture 2. What are the limitations of server centric IT Architecture?
3. What are the advantages of storage Centric IT architecture?
4. Define The Data Storage and Data Access problem.
5. What are the problems to design a large network in terms of size and access?
6. What are the three different attributes for designing large business applications storage?
7. What are the attributes for support applications?
8. What are the different categories of storage management applications.
9. Explain the application development life cycle.
UNIT -II
1. Explain the architecture of Intelligent Disk subsystems.
2. Briefly explain the different IO channels designed with built in redundancy in order to increase the fault tolerance of disk subsystems.
3. Define JBOD. 4. Define Storage virtualization. 5. How virtualization is done by using RAID controller. 6. What is Hot space Disk?
7. What are the different levels of RAID?
8. What is striping?
9. What is mirroring?
10. What are mirrored Stripes and striped mirrors?
11. What is parity instead of mirroring?
12. Define RAID 2 & 3.
13. Compare the theoretical basic forms of various RAID levels.
UNIT-III
1. Define Caching. 2. What are the types of caching and explain.
3. What are instant copies?
4. What is remote mirroring?
5. What is meant by Availability with remote mirroring?
6. Differentiate the types of remote mirroring with proper diagrams.
7. What are LUN Masking and LUN zoning?
8. Define CHAOS. 9. Define availability of Disk subsystems.
10. Explain the physical IO paths from the CPU to the storage system consist of system bus,
host IO Bus and IO bus.
11. Define SCSI. 12. List out the maximum cable length and transmission speeds for SCSI.
13. How SCSI buses differentiate by means of target IDs
14. What is twin tailed SCSI cabling?
15. How SCSI sans can be built up using multi port storage systems.
UNIT-IV
1. What are the design goals for fiber channel SAN?
2. What are the three different topologies designed for fibre channel?
3. Define Link, Port in fibre channel. 4. Define different types of ports in fibre channel. 5. Explain the fibre channel protocol stack. 6. Define FC0, FC1, FC2, and FC3. 7. Explain cables, plugs and signal encoding in FC0. 8. What are the advantages of fibre optic cables?
9. Define 8B/10B encoding and what are the advantages of 8B/10B? 10. What is meant by k 28.5 symbol?
11. Define ordered sets in link control protocol. 12. Define the frame format for fibre channel.
13. What are the different service classes for fibre channel?
14. Explain the login and addressing in link services. 15. Explain the different topologies for fibre channel SAN. 16. Explain the different standards for IP storage. 17. Explain NAS hardware and software Architectures. 18. Define Network connectivity in NAS. 19. Justify NAS as a storage system.
20. Define private Loop and quick loop.
UNIT-V
1. Define and differentiate Local and network File systems..
2. Define NAS. 3. What are the performance bottlenecks in file servers?
4. What is meant by Acceleration of Network file servers?
5. Briefly explain the concepts behind DAFS and GPFS 6. Compare NFS, uDAFS and fDAFS.
7. What are the different roles can be played by GPFS?
8. Compare and contrast the features of NAS, fibre channel SAN and ISCSI SAN.
9. compare the different IO paths of SCSI, iSCSI, NAS and fibre channel
10. What is meant by shared Disk file system?
11. define Journaling and snapshots
UNIT-VI
1. Define the storage virtualization in IO path. 2. What are the objectives of Virtualization?
3. Define Architecture related and implementation related limitations of storage
virtualization.
4. What are the important requirements for storage virtualization?
5. Briefly discuss the general considerations and requirements for implementation of
virtualization.
6. Explain the storage virtualization on block or file level. 7. Define in-band and out-band virtualization. 8. Discuss the various levels of storage virtualization to form a storage network.
9. What are the different types of storage virtualization in network? Explain.
10. Explain Symmetric Storage virtualization in a network.
11. What are the advantages and disadvantages of symmetric Storage virtualization?
12. Explain aSymmetric Storage virtualization in a network.
13. What are the advantages and disadvantages of asymmetric Storage virtualization?
.
UNIT-VII
1. What are the SAN devices?
2. Draw the structure of typical fabric OS micro-kernel and explain its components.
3. Define fabric API. 4. Define the fabric OS services. 5. What are HBS Drivers?
6. Explain the simple SAN and advanced SAN configuration.
7. How servers are connected with SAN by using Host bus adapters. 8. Briefly explain the different configuration levels of SAN. 9. What is Fibre channel switch?
10. Define the types of ports in fibre channel standard and explain its configurations. 11. What are the basic functions of FC host bus adapters?.
12. Explain the HBA’s critical role in interoperability. 13. Explain the different configurations used to put the storage in SAN. 14. Explain the anatomy of FC frame format.
15. Explain the flow control in class2 FC.
UNIT-VIII
1. Define Switch’s OS. 2. Define Device driver. 3. Explain the HBA driver functions. 4. Define data sharing and device sharing. 5. What is meant by SAN Management?
6. Define ISL functions. 7. Define Aggregation, Archiving and zoning 8. Explain the storage device segregation through port zoning. 9. Explain the in-band and out-band management functions.
10. Explain the integrated management functions.
11. How ISL functions are supporting a simple cascading switch configuration.
12. How to implement multi-switch configuration.
13. How OLTP supports for edge/core configurations. 14. Explain the heterogeneous OS SAN supported environment.
15. Define data replication and how it is overcome in SAN.
16. What is meant by integrating Tape solutions?
17. How advanced clustering is applied for shared storage SAN. 18. What are the important guidelines to follow for connecting the SAN to data center?
ADHOC NETWORKS
Sub Code : 06CS841 IA Marks : 25
Hrs/Week : 04 Exam Hours : 03
Total Hrs : 52 Exam Marks : 100
PART - A
UNIT - 1
INTRODUCTION: Ad hoc Networks: Introduction, Issues in Ad hoc wireless networks, Ad
hoc wireless internet.
6 Hours
UNIT - 2
MAC – 1: MAC Protocols for Ad hoc wireless Networks: Introduction, Issues in designing a
MAC protocol for Ad hoc wireless Networks, Design goals of a MAC protocol for Ad hoc
wireless Networks, Classification of MAC protocols, Contention based protocols with
reservation mechanisms.
7 Hours
UNIT - 3
MAC – 2: Contention-based MAC protocols with scheduling mechanism, MAC protocols that
use directional antennas, Other MAC protocols.
6 Hours
UNIT - 4
ROUTING – 1: Routing protocols for Ad hoc wireless Networks: Introduction, Issues in
designing a routing protocol for Ad hoc wireless Networks, Classification of routing protocols,
Table drive routing protocol, On-demand routing protocol.
7 Hours
PART-B
UNIT - 5
ROUTING – 2: Hybrid routing protocol, Routing protocols with effective flooding
mechanisms, Hierarchical routing protocols, Power aware routing protocols.
6 Hours
UNIT - 6
TRANSPORT LAYER: Transport layer protocols for Ad hoc wireless Networks: Introduction,
Issues in designing a transport layer protocol for Ad hoc wireless Networks, Design goals of a
transport layer protocol for Ad hoc wireless Networks, Classification of transport layer
solutions, TCP over Ad hoc wireless Networks, Other transport layer protocols for Ad hoc
wireless Networks.
7 Hours
UNIT - 7
SECURITY: Security: Security in wireless Ad hoc wireless Networks, Network security
requirements, Issues & challenges in security provisioning, Network security attacks, Key
management, Secure routing in Ad hoc wireless Networks.
6 Hours
UNIT - 8
QoS: Quality of service in Ad hoc wireless Networks: Introduction, Issues and challenges in
providing QoS in Ad hoc wireless Networks, Classification of QoS solutions, MAC layer
solutions, network layer solutions.
7 Hours
TEXT BOOK: 1. Ad hoc Wireless Networks – C. Siva Ram Murthy & B. S. Manoj, 2
nd Edition,
Pearson Education, 2005.
REFERENCE BOOKS: 1. Ad hoc Wireless Networks – Ozan K. Tonguz and Gianguigi Ferrari, John Wiley, 2006.
2. Ad hoc Wireless Networking – Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du, Kluwer
Academic Publishers, 2004.
3. Adhoc Mobile Wireless Networks - C.K. Toh, Protocols and Systems, Prentice-Hall
PTR, 2002.
LESSON PLAN— ADHOC NETWORKS
SL
NO Chapter
HOUR
NO TOPICS TO BE COVERED
1
PART A:
UNIT 1:
INTRODUCTION
1 Ad hoc Networks: Introduction
2 Ad hoc Networks: Introduction
3 Issues in Ad hoc wireless networks
4 Ad hoc wireless networks continued…
5 Ad hoc wireless internet.
6 Ad hoc wireless internet continued…
2
UNIT: 2
MAC – 1
7 MAC Protocols for Ad hoc wireless Networks:
Introduction
8 Issues in designing a MAC protocol for Ad hoc
wireless Networks
9 Design goals of a MAC protocol for Ad hoc
wireless Networks
10 Design goals continued …
11 Classification of MAC protocols
12 Contention based protocols with reservation
mechanisms
13 Contention based protocols continued…
3 UNIT - 3
MAC – 2
14 Contention-based MAC protocols with
scheduling mechanism
15 MAC protocols that use directional antennas
16 Other MAC protocols
17 Contention-based MAC protocols with
scheduling mechanism
18 MAC protocols that use directional antennas
19 Other MAC protocols
4
UNIT – 4
ROUTING – 1:
20 Routing protocols for Ad hoc wireless Networks
21 Issues in designing a routing protocol for Ad hoc
wireless Networks
22 Issues in designing a routing protocol for Ad hoc
wireless Networks continued ….
23 Issues in designing a routing protocol for Ad hoc
wireless Networks continued….
24 Classification of routing protocols
25 Table drive routing protocol
26 On-demand routing protocol.
5
PART : B
UNIT –5
ROUTING – 2:
27 Hybrid routing protocol
28 Routing protocols with effective flooding
mechanisms
29 Hierarchical routing protocols
30 Hierarchical routing protocols continued ….
31 Power aware routing protocols
32 Advantages Power aware routing protocols
6 UNIT - 6:
TRANSPORT
LAYER:
33 Transport layer protocols for Ad hoc wireless
Networks
34 Introduction, Issues in designing a transport layer
protocol for Ad hoc wireless Networks
35 Design goals of a transport layer protocol for Ad
hoc wireless Networks
36 Classification of transport layer solutions
37 Classification of transport layer solutions
continued..
38 TCP over Ad hoc wireless Networks
39 Other transport layer protocols for Ad hoc
wireless Networks.
7 UNIT – 7 :
SECURITY
40 Security: Security in wireless Ad hoc wireless
Networks
41 Network security requirements,
42 Issues & challenges in security provisioning
43 Network security attacks
44 Key management
45 Secure routing in Ad hoc wireless Networks
8 UNIT - 8
QoS:
46 Quality of service in Ad hoc wireless Networks
47 Introduction, Issues and challenges in providing
QoS in Ad hoc wireless Network
48 Networks, Classification of QoS solutions
49 MAC layer solutions
50 MAC layer solutions continued….
51 network layer solutions
52 network layer solutions continued..
QUESTION BANK- Adhoc Networks
51. Give any five differences between cellular wireless networks and ADHOC wireless
network.
52. Explain any six issues of ADHOC wireless networks.
53. Write a note on ADHOC wireless internet
54. Describe in detail, MACAW and MACA-BY- invitation protocols.
55. Explain any two contention based with preservation mechanism MAC protocols
56. Explain distributed priority scheduling MAC protocols
57. Explain distributed wireless ordering MAC protocols
58. Describe the working contention based protocols with reservation mechanisms
59. Describe the contention based MAC protocols with scheduling mechanism
60. Explain routing protocols for ad hoc wireless networks
61. What are issues in designing a routing protocols for ad hoc wireless networks
62. Describe the classification of routing protocols
63. What are the different types of routing protocols
64. Write note table drive routing protocols
65. Write on On-demand routing protocols.
66. Explain hybrid routing protocols
67. Describe the routing protocols with effective flooding mechanisms
68. Explain the Hierarchical routing protocols
69. Difference between hierarchical protocols and power aware routing protocols
70. What are the advantage power aware routing protocols
71. Explain the transport layer protocols for ad hoc wireless networks
72. Issues in designing a transport layer protocols for ad hoc wireless networks
73. List the design goals of transport layer protocols for ad hoc wire less networks
74. Explain the classification of transport layer
75. What is the solution for transport layer classifications?
