advanced computer architecture m.tech vlsi

Upload: pronadeep-bora

Post on 21-Feb-2018

216 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    1/8

    VL201 ADVANCED COMPUTER ARCHITECTURE

    L T P C

    3 0 0 3

    OVERVIEW 5

    Introduction and Review of basic computer architecture - Instruction and Instruction

    Sequencing Addressing Modes - Quantitative techniques in computer design -measuring and reporting performance - Flnn!s "lassification of "omputers #SIS$%

    MIS$% MIM$& RIS" "IS"

    INSTRUCTION LEVEL PARALLELISM 10

    'asic concepts of (ipelining static pipeline dnamic pipeline - instruction pipeline

    - data ha)ards -control ha)ards - structural ha)ards - techniques for handling ha)ards -

    (ipeline optimi)ation techniques*

    DATA LEVEL PARALLELISM 9

    'rief introduction of Arra processor - detailed stud of Interconnection +etwor, -

    'oolean cube% Mesh% omega% shuffle networ, - various concepts illustrated b

    studing detailed SIM$ algorithms% vi)*% Matri multiplication*

    THREAD LEVEL PARALLELISM 12

    Multi-threading Multiprocessors - "entrali)ed and $istributed Shared Memor

    Architectures "ache "oherence Issues - (erformance Issues Snchroni)ation

    Issues Models of Memor "onsistenc - Interconnection +etwor,s 'uses%

    "rossbar and Multi-Stage Switches Multi-"ore (rocessor Architectures - .arge

    Scale Multiprocessors - /arehouse-Scale "omputers*

    MEMORY HIERARCHY DESIGN 9

    'asic "oncepts - Issues in the $esign of Memor 0ierarchies - Fallacies and (itfalls

    in the $esign of Memor 0ierarchies - 1ptimi)ations of "ache (erformance -

    Memor 2echnolog and 1ptimi)ations*

    TOTAL : 45 PERIODS

    REFERENCES:

    3* 4ohn .* 0ennesse and $avid A* (etterson5 6"omputer Architecture - AQuantitative Approach7% Morgan 8aufmann 9 :lsevier% Fifth edition% ;

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    2/8

    ;* 8ai 0wang 6Advanced "omputer Architecture - (arallelism% Scalabilit%

    (rogrammabilit7% 2ata Mc=raw 0ill% ;

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    3/8

    (rocessing $istributed 2ransactions (rocessing "oncurrenc "ontrol Recover

    "ommit (rotocols*

    OBJECT ORIENTED DATABASES 9

    Introduction to 1bBect 1riented $ata 'ases - Approaches - Modeling and $esign -

    (ersistence Quer .anguages - 2ransaction - "oncurrenc Multi Cersion .oc,s

    Recover (1S2=R:S 4ASMI+: =:MS21+: - 1$M= Model*

    ADVANCED DATA MODELS 9

    Mobile $atabases5 .ocation and 0andoff Management - :ffect of Mobilit on $ata

    Management - .ocation $ependent $ata $istribution - Mobile 2ransaction Models

    -"oncurrenc "ontrol - 2ransaction "ommit (rotocols- Multimedia $atabases-

    Information Retrieval- $ata /arehousing- $ata Mining- 2et Mining*

    EMERGING TECHNOLOGIES 9

    DM. $atabases5 DM.-Related 2echnologies-DM. Schema- DM. Quer .anguages-

    Storing DM. in $atabases-DM. and SQ.- +ative DM. $atabases- /eb $atabases-

    =eographic Information Sstems- 'iological $ata Management- "loud 'ased

    $atabases5 $ata Storage Sstems on the "loud- "loud Storage Architectures-"loud

    $ata Models- Quer .anguages- Introduction to 'ig $ata-Storage-Analsis*

    TOTAL: 45 PERIODS

    REFERENCES:

    3* R* :lmasri% S*'* +avathe% 6Fundamentals of $atabase Sstems7% Fifth

    :dition%(earson :ducation% ;

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    4/8

    E* CiBa 8umar% 6Mobile $atabase Sstems7% 4ohn /ile ? Sons% ;

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    5/8

    Subprograms $esign Issues .ocal Referencing (arameter (assing 1verloaded

    Methods =eneric Methods $esign Issues for Functions Semantics of "all and

    Return Implementing Simple Subprograms Stac, and $namic .ocal Cariables

    +ested Subprograms 'loc,s $namic Scoping

    OBJECT"ORIENTATION! CONCURRENCY AND EVENT HANDLING 9

    1bBect-orientation design issues for 11( languages implementation of obBect-

    oriented constructs concurrenc semaphores monitors message passing

    threads statement level concurrenc eception handling even handling

    FUNCTIONAL AND LOGIC PROGRAMMING LANGUAGES 9

    Introduction to .ambda "alculus Fundamentals of Functional (rogramming

    .anguages (rogramming with Scheme (rogramming with M. Introduction to

    .ogic and .ogic (rogramming (rogramming with (rolog Multi-(aradigm

    .anguages

    TOTAL : 45 PERIODS

    REFERENCES:

    3* Robert /* Sebesta% 6"oncepts of (rogramming .anguages7% 2enth :dition%Addison /esle% ;

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    6/8

    CS9#2GRAPH THEORY AND ALGORITHMS

    L T P C

    3 0 0 3

    INTRODUCTION 9

    =raphs - Isomorphism Subgraphs $egree 1perations on =raphs $egree

    Sequences - /al,s 2rails - (aths "onnected =raphs - "ircuits 2rees - (roperties

    of 2rees "otrees and Fundamental "ircuits - "ut Sets - Fundamental "ut Sets and

    "ut Certices $irected and /eighted =raphs - (lanar and $ual =raphs - Metric

    Representation of =raphs

    TREES AND SPECIAL GRAPHS 9

    2ree "haracteri)ations - +umber of 2rees - Minimum Spanning 2rees 'ipartite

    =raphs - .ine =raphs - "hordal =raphs - :ulerian =raphs - "haracteri)ation -

    Fleur!s Algorithm - "hinese-(ostman-(roblem - 0amilton graphs

    MATCHINGS AND COLORINGS 9

    'asic :quations - Matchings in 'ipartite =raphs - (erfect Matchings - =reed and

    Approimation Algorithms - Certe "olorings - "hromatic +umber and "liques -

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    7/8

    =reed "oloring Algorithm - "oloring of "hordal =raphs - 'roo,!s 2heorem - :dge

    "olorings - =upta-Ci)ing 2heorem% "lass-3 =raphs and "lass-; =raphs - :quitable

    :dge-"oloring

    PLANAR AND DIRECTED GRAPHS 9

    'asic "oncepts - :ulers Formula - (olhedrons and (lanar =raphs - "haractri)ations

    (lanarit 2esting - -"olor-2heorem - $irected graphs - 1ut-$egree% In-$egree

    "onnectivit 1rientation - :ulerian $irected =raphs - 0amilton $irected =raphs -

    Applications of graphs

    GRAPH ALGORITHMS 9

    =raph Searching - Minimum Spanning 2rees 8rus,al!s Algorithm - (rim!s

    Algorithm - Shortest (ath Algorithms - $iB,straKs Algorithm - 'ellman-Ford

    Algorithm Single-Source Shortest (aths - All- (airs Shortest (aths Flod-/arshall

    Algorithm - 4ohnsonKs Algorithm for Sparse =raphs - =eneral Framewor, for Solving(ath (roblems in $irected =raphs - Maimum Flow - Flow networ,s - Ford-

    Ful,erson Method - Maimum 'ipartite Matching - (reflow-(ush Algorithms - .ift-

    to-Front Algorithm - Multithreaded Algorithms

    TOTAL: 45 PERIODS

    REFERENCES:

    3* 2homas 0* "ormen% "harles :* .eiserson% Ronald .* Rivest and "lifford Stein%

    6Introduction to Algorithms7% >rd :dition% (rentice 0all of India% ;

  • 7/24/2019 Advanced Computer Architecture M.tech VLSI

    8/8

    @* R* $iestel% 6Advanced =raph 2heor7% Springer Cerlag 0eidelberg% +ew or,%;