Designing and Building Parallel Programs (I. Foster)
Advertisement
Designing and Building Parallel Programs (I. Foster)
Designing and Building Parallel Programs (I. Foster)
This book provides a practitioner's guide for students, programmers,
engineers, and scientists who wish to design and build efficient and
cost-effective programs for parallel and distributed computer systems. It covers
the following topics: Parallel Computers and Computation, Designing Parallel
Algorithms, Quantitative Basis for Design, Putting Components Together, Tools,
Fortran M, High Performance Fortran, Message Passing Interface and Performance
Tools.
Coding theory includes the study of compression codes which enable us
to send messages cheaply and error correcting codes which ensure that messages
remain legible even in the presence of errors. Topics covered includes: Codes
and alphabets, Huffman’s algorithm, Shannon’s noiseless coding theorem , Hamming’s breakthrough, Shannon’s noisy coding theorem , Linear codes,
Polynomials and fields , Cyclic codes, Stream ciphers, Asymmetric systems,
Commutative public key systems, Trapdoors and signatures.
This book has been written as
lecture notes for students who need a grasp of the basic principles of linear
codes. Topics covered includes: Shannon theory and coding, Coding theory,
Decoding of linear codes and MacWilliams identity, Coding theory - Constructing
New Codes, Coding theory - Bounds on Codes, Reed-Muller codes, Fast decoding of
RM codes and higher order RM codes.
This note explains
the following topics: Object-oriented programming, Data encapsulation with
classes, Subclasses and inheritance, Abstract classes, Exception handling,
Reflection, Concurrent programming, Functional programming, Logic programming,
Scripting languages.
Covered topics
are: Text Compression, Error Detection and Correction, Cryptography, Finite
State Machines, Recursion and Induction, Relational Database, String
Matching and Parallel Recursion.
This note introduces the theory of
error-correcting codes to computer scientists. This theory, dating back to the
works of Shannon and Hamming from the late 40's, overflows with theorems,
techniques, and notions of interest to theoretical computer scientists. The
course will focus on results of asymptotic or algorithmic significance.
Principal topics include: Construction and existence results for
error-correcting codes, Limitations on the combinatorial performance of
error-correcting codes, Decoding algorithms, Applications in computer science.
This note covers the following topics: Basic Theories, Basic Data
Structures, Function Theory, Program Theory, Programming Language, Recursive
Definition, Theory Design and Implementation, Concurrency and Interaction.
This book covers the following topics: Computer Architecture,
Functions, Files, Reading and Writing Simple Records, Developing Robust
Programs, Sharing Functions with Code Libraries, Intermediate Memory Topics,
High-Level Languages and Optimization.
This book provides a practitioner's guide for students, programmers,
engineers, and scientists who wish to design and build efficient and
cost-effective programs for parallel and distributed computer systems. It covers
the following topics: Parallel Computers and Computation, Designing Parallel
Algorithms, Quantitative Basis for Design, Putting Components Together, Tools,
Fortran M, High Performance Fortran, Message Passing Interface and Performance
Tools.