Theme Inference Throught Detection and Extraction of Domain Specific Events

Only available on StudyMode
  • Topic: Parallel computing, Parallel algorithm, Data parallelism
  • Pages : 5 (885 words )
  • Download(s) : 92
  • Published : May 5, 2013
Open Document
Text Preview
HS T81 ENGINEERING ECONOMICS AND MANAGEMENT
UNIT I
Introduction – Micro Economics – Macro Economics – Economic decisions and Technical Decisions – Demand and Supply Concepts – Elasticity of Demand – Cost of Products – Price of products – Break-Even Analysis – Nature of Functioning of Money – Notional Income – GNP and Savings – Inflation an Deflation Concepts. UNIT II

Introduction – Elementary Economic Analysis – Interest Formulas and their Applications - Comparisons – Present Worth Method – Future Worth Method – Annual Equivalent Method – Rate of Return Method UNIT III

Replacement and Maintenance Analysis – Depreciation – Evaluation of Public ternatives – Inflation Adjusted Decisions
UNIT IV
Nature and Importance of Management - Development of Management Thought - Ethical and Environmental Foundations - Decision Making - Organizing and Staffing - Planning and Strategic Management – Leadership - Communicating and Controlling Managing Information UNIT V

Operations Management - Marketing Management - Financial Management – Multinational Management - Entrepreneurship and Small Business - Management of Public Organizations

CS T82 HIGH PERFORMANCE COMPUTING
UNIT I
Introduction: Need of high speed computing – increase the speed of computers – history of parallel computers and recent parallel computers; solving problems in parallel – temporal parallelism – data parallelism – comparison of temporal and data parallel processing – data parallelprocessing with specialized processors – inter-task dependency. The need for parallel computers - models of computation - analyzing algorithms -expressing algorithms.

UNIT II
Parallel Programming Platforms: Trends in microprocessor architectures - limitations of memory system performance – parallel computing platforms – communication costs in parallel machines – routing mechanisms for interconnection networks. Principles of Parallel Algorithm Design: Preliminaries – decomposition techniques – characteristics of tasks and interactions – mapping techniques for load balancing – methods for containing interaction overheads – parallel algorithm models. Basic Communication Operations: One-to-all broadcast and all-to-one reduction – all-to-all broadcast reduction – all-reduce and prefix-sum operations – scatter and gather – all-to-all personalized communication – circular shift – improving the speed of some communication operations.

UNIT III
Analytical Modeling of Parallel Programs: Sources of overhead in parallel programs – performance metrics for parallel systems – scalability of parallel systems – minimum execution time and minimum cost-optimal execution time. Programming using the Message-Passing Paradigm: principles of message-passing programming – the building blocks – MPI – topologies and embedding – overlapping communication with computation – collective communication and computation operations – groups and communicators.

Programming Shared Address Space Platforms: Thread basics – synchronization primitives in Pthreads – controlling thread and synchronization attributes – composite synchronization constructs – tips for designing asynchronous programs – OpenMP. UNIT IV

Dense Matrix Algorithms: Matrix-vector multiplication – matrix-matrix multiplication – solving a system of linear equations – FFT. Sorting: Issues in sorting on parallel computers – sorting networks – bubble sort and its variants – Quicksort – bucket and sample sort – other sorting algorithms. Graph Algorithms: Definitions and representation – minimum spanning tree – single-source shortest paths – all-pairs shortest paths.

UNIT V
Search Algorithms for Discrete for Discrete Optimization Problems: Definitions and examples, sequential search algorithms, search overhead factor, parallel depth-first search, parallel best-first search, speedup anomalies in parallel search algorithms. Dynamic Programming: Overview.

CS T83 INFORMATION SECURITY
UNIT I
Introduction: Security problem in computing – Elementary...
tracking img