CP7103 MULTICORE ARCHITECTURES

CP7103 MULTICORE ARCHITECTURES 

UNIT I FUNDAMENTALS OF QUANTITATIVE DESIGN AND ANALYSIS 9

Classes of Computers – Trends in Technology, Power, Energy and Cost – Dependability – Measuring, Reporting and Summarizing Performance – Quantitative Principles of Computer Design – Classes of Parallelism - ILP, DLP, TLP and RLP - Multithreading - SMT and CMP Architectures – Limitations of Single Core Processors - The Multicore era – Case Studies of Multicore Architectures.

UNIT II DLP IN VECTOR, SIMD AND GPU ARCHITECTURES 9

Vector Architecture - SIMD Instruction Set Extensions for Multimedia – Graphics Processing Units - Detecting and Enhancing Loop Level Parallelism - Case Studies. 

UNIT III TLP AND MULTIPROCESSORS 9

Symmetric and Distributed Shared Memory Architectures – Cache Coherence Issues - Performance Issues – Synchronization Issues – Models of Memory Consistency - Interconnection Networks – Buses, Crossbar and Multi-stage Interconnection Networks.

UNIT IV RLP AND DLP IN WAREHOUSE-SCALE ARCHITECTURES 9

Programming Models and Workloads for Warehouse-Scale Computers – Architectures for Warehouse-Scale Computing – Physical Infrastructure and Costs – Cloud Computing – Case Studies.

UNIT V ARCHITECTURES FOR EMBEDDED SYSTEMS 9 Features and Requirements of Embedded Systems – Signal Processing and Embedded Applications – The Digital Signal Processor – Embedded Multiprocessors - Case Studies.

REFERENCES: 

1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A Quantitative

Approach”, Morgan Kaufmann / Elsevier, 5th edition, 2012.

2. Kai Hwang, “Advanced Computer Architecture”, Tata McGraw-Hill Education, 2003

3. Richard Y. Kain, “Advanced Computer Architecture a Systems Design Approach”,

Prentice Hall, 2011.

4. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A Hardware/

Software Approach” , Morgan Kaufmann / Elsevier, 1997.

CP7102 ADVANCED DATA STRUCTURES AND ALGORITHMS

CP7102 ADVANCED DATA STRUCTURES AND ALGORITHMS L T P C

UNIT I ITERATIVE AND RECURSIVE ALGORITHMS 9 Iterative Algorithms: Measures of Progress and Loop Invariants-Paradigm Shift: Sequence of Actions versus Sequence of Assertions- Steps to Develop an Iterative Algorithm-Different Types of Iterative Algorithms--Typical Errors-Recursion-Forward versus Backward- Towers of Hanoi-Checklist for Recursive Algorithms-The Stack Frame-Proving Correctness with Strong Induction- Examples of Recursive Algorithms-Sorting and Selecting Algorithms- Operations on Integers- Ackermann’s Function- Recursion on Trees-Tree Traversals- Examples- Generalizing the Problem - Heap Sort and Priority Queues-Representing Expressions.

UNIT II OPTIMISATION ALGORITHMS 9

Optimization Problems-Graph Search Algorithms-Generic Search-Breadth-First Search- Dijkstra’s Shortest-Weighted-Path -Depth-First Search-Recursive Depth-First Search-Linear Ordering of a Partial Order- Network Flows and Linear Programming-Hill Climbing-Primal Dual Hill Climbing- Steepest Ascent Hill Climbing-Linear Programming-Recursive Backtracking-Developing Recursive Backtracking Algorithm- Pruning Branches-Satisfiability 

UNIT III DYNAMIC PROGRAMMING ALGORITHMS 9

Developing a Dynamic Programming Algorithm-Subtle Points- Question for the Little Bird- Subinstances and Subsolutions-Set of Substances-Decreasing Time and Space-Number of Solutions-Code. Reductions and NP-Completeness-Satisfiability-Proving NP-Completeness- 3-Coloring- Bipartite Matching. Randomized Algorithms-Randomness to Hide Worst Cases- Optimization Problems with a Random Structure.

UNIT IV SHARED OBJECTS AND CONCURRENT OBJECTS 9

Shared Objects and Synchronization -Properties of Mutual Exclusion-The Mora l- The Producer–Consumer Problem -The Readers–Writers Problem-Realities of Parallelization- Parallel Programming- Principles- Mutual Exclusion-Time- Critical Sections--Thread Solutions-The Filter Lock-Fairness-Lamport’s Bakery Algorithm-Bounded Timestamps-Lower Bounds on the Number of Locations-Concurrent Objects- Concurrency and Correctness- Sequential Objects-Quiescent Consistency- Sequential Consistency-Linearizability- Formal Definitions- Progress Conditions- The Java Memory Model

UNIT V CONCURRENT DATA STRUCTURES 9

Practice-Linked Lists-The Role of Locking-List-Based Sets-Concurrent Reasoning- Coarse- Grained Synchronization-Fine-Grained Synchronization-Optimistic Synchronization- Lazy Synchronization-Non-Blocking Synchronization-Concurrent Queues and the ABA Problem- Queues-A Bounded Partial Queue-An Unbounded Total Queue-An Unbounded Lock-Free Queue-Memory Reclamation and the ABA Problem- Dual Data Structures- Concurrent Stacks and Elimination- An Unbounded Lock-Free Stack- Elimination-The Elimination Backoff Stack

TOTAL : 45 PERIODS

REFERENCES:

1. Jeff Edmonds, “How to Think about Algorithms”, Cambridge University Press, 2008.

2. M. Herlihy and N. Shavit, “The Art of Multiprocessor Programming”, Morgan Kaufmann,

2008.

3. Steven S. Skiena, “The Algorithm Design Manual”, Springer, 2008.

4. Peter Brass, “Advanced Data Structures”, Cambridge University Press, 2008.

5. S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, “Algorithms” , McGrawHill, 2008.

6. J. Kleinberg and E. Tardos, "Algorithm Design“, Pearson Education, 2006.

7. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms“,

PHI Learning Private Limited, 2012.

8. Rajeev Motwani and Prabhakar Raghavan, “Randomized Algorithms”, Cambridge

University Press, 1995.

CP7101 DESIGN AND MANAGEMENT OF COMPUTER NETWORKS

CP7101 DESIGN AND MANAGEMENT OF COMPUTER NETWORKS


UNIT I INTRODUCTION TO NETWORK MANAGEMENT 9
Overview of Analysis, Architecture and Design Process-System Methodology, Service
methodology, Service Description - Service characteristics - Performance Characteristics -
Network supportability - Requirement analysis – User Requirements – Application
Requirements – Device Requirements – Network Requirements – Other Requirements -
Requirement specification and map.

UNIT II REQUIREMENTS ANALYSIS 9
Requirement Analysis Process – Gathering and Listing Requirements- Developing service
metrics – Characterizing behavior – Developing RMA requirements – Developing delay
Requirements - Developing capacity Requirements - Developing supplemental performance
Requirements –Requirements mapping – Developing the requirements specification

UNIT III FLOW ANALYSIS 9

Individual and Composite Flows – Critical Flows - Identifying and developing flows – Data
sources and sinks – Flow models- Flow prioritization – Flow specification algorithms –
Example Applications of Flow Analysis

UNIT IV NETWORK ARCHITECTURE 9
Architecture and design – Component Architectures – Reference Architecture – Architecture
Models – System and Network Architecture – Addressing and Routing Architecture –
Addressing and Routing Fundamentals – Addressing Mechanisms – Addressing Strategies
– Routing Strategies – Network Management Architecture – Network Management
Mechanisms Performance Architecture – Performance Mechanisms – Security and Privacy
Architecture – Planning security and privacy Mechanisms

UNIT V NETWORK DESIGN 9
Design Concepts – Design Process - Network Layout – Design Traceability – Design Metrics
– Logical Network Design – Topology Design – Bridging, Switching and Routing Protocols-
Physical Network Design – Selecting Technologies and Devices for Campus and Enterprise
Networks – Optimizing Network Design

TOTAL : 45 PERIODS

REFERENCES:

1. Network Analysis, Architecture, and Design By James D. McCabe, Morgan Kaufmann,
Third Edition, 2007.ISBN-13: 978-0123704801
2. Computer Networks: A Systems Approach by Larry L. Peterson, Bruce S. Davie - 2007,
Elsevier Inc.
3. Top-down Network Design: [a Systems Analysis Approach to Enterprise Network
Design] By Priscilla Oppenheimer, Cisco Press , 3rd Edition, ISBN-13: 978-1-58720-
283-4 ISBN-10: 1-58720-283-2
4. Integrated Management of Networked Systems: Concepts, Architectures, and Their
Operational Application (The Morgan Kaufmann Series in Networking), Heinz-Gerd
Hegering, Sebastian Abeck, and Bernhard Neumair, 1999.
5. “Network Design and Management” – by Steven T.Karris, Orchard publications, Second
edition, Copyright 2009, ISBN 978-1-934404-15-7
6. “Network Design, Management and Technical Perspective”, Teresa C. Mann-Rubinson
and Kornel Terplan, CRC Press, 1999
7. “Ethernet Networks-Design, Implementation, Operation and Management by Gilbert
Held, John Wiley and sons, Fourth Edition
8. James Kurose and Keith Ross, “Computer Networking: A Top-Down Approach Featuring
the Internet”, 1999

MA7155 APPLIED PROBABILITY AND STATISTICS

MA7155 APPLIED PROBABILITY AND STATISTICS


UNIT I ONE DIMENSIONAL RANDOM VARIABLES 9+3

Random variables - Probability function – Moments – Moment generating functions and
their properties – Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal
distributions – Functions of a Random Variable.

UNIT II TWO DIMENSIONAL RANDOM VARIABLES 9+3

Joint distributions – Marginal and Conditional distributions – Functions of two dimensional
random variables – Regression Curve – Correlation.

UNIT III ESTIMATION THEORY 9+3

Unbiased Estimators – Method of Moments – Maximum Likelihood Estimation - Curve fitting
by Principle of least squares – Regression Lines.

UNIT IV TESTING OF HYPOTHESES 9+3

Sampling distributions - Type I and Type II errors - Tests based on Normal, t,2 and F
distributions for testing of mean, variance and proportions – Tests for Independence of
attributes and Goodness of fit.

UNIT V MULTIVARIATE ANALYSIS 9+3

Random Vectors and Matrices - Mean vectors and Covariance matrices - Multivariate
Normal density and its properties - Principal components Population principal
components - Principal components from standardized variables.

 TOTAL 45+15=60 PERIODS


REFERENCES:

1 Jay L. Devore, “Probability and Statistics For Engineering and the Sciences”,Thomson
and Duxbury, 2002.
2.Richard Johnson. ”Miller & Freund’s Probability and Statistics for Engineer”, Prentice –
Hall , Seventh Edition, 2007.
3.Richard A. Johnson and Dean W. Wichern, “Applied Multivariate Statistical Analysis”,
Pearson Education, Asia, Fifth Edition, 2002.
4.Gupta S.C. and Kapoor V.K.”Fundamentals of Mathematical Statistics”, Sultan an Sons,
2001.
5.Dallas E Johnson , “Applied Multivariate Methods for Data Analysis”, Thomson an Duxbury
press,1998.

Anna University PG time table for Nov / Dec 2013

Anna University PG time table for Nov / Dec 2013