Introduction to parallel programming. Author: Steven Brawer, Encore Computer Corp., Marlborough, MA View colleagues of Steven Brawer. Contents: Preface; Introduction; Tiny Fortran; Hardware and Operating System Models; This is the first practical guide to parallel programming written for the. Introduction to Parallel Programming focuses on the techniques, processes, methodologies, and approaches involved in parallel programming.
|Published (Last):||20 September 2016|
|PDF File Size:||12.1 Mb|
|ePub File Size:||12.92 Mb|
|Price:||Free* [*Free Regsitration Required]|
Selected pages Page Chapter 2 Tiny Fortran.
Introduction to Parallel Programming – Steven Brawer – Google Books
In the introductory chapter, the author ex- plains his pedagogical approach by stating that the text stresses simplicity and focuses on fundamentals. In Chapter 2, a subset of Fortran77, which includes only those features necessary for developing parallel pro- grams and common to all algorithmic languages, i s pre- sented as the so-called Tiny Fortran.
Chapter 14 presents more complex synchronization techniques, including semaphores. The semaphore does not limit mutual exclusion in a protected region to a single process at a time, but i t allows the creation of a protected region for several processes.
Chapter 14 Semaphores and Events.
Introduction to Parallel Programming. The book is divided into fifteen chapters and three appendices. Parallel programming of a discrete event, discrete time simulator is described in Chapter 12 with an eye on the topics of introdyction dependency and contention for data struc- tures when more than one process try to access a data structure simultaneously.
Chapter 11 explains how various sources of overhead time to fork processes, for initial- ization, for any sequential portions in the program, for synchronization calls, and for joins can reduce the ideal speedup. Chapter 3 Hardware and Operating System Models.
In Chapter 6, the concept of racing condition i s introduced and the barrier mecha- nism is described for synchronizing the processes. Almost every concept or technique is described by a short program. Chapters are intended to familiarize readers with the fundamentals of parallel programming.
The book first offers information on Fortran, hardware and operating system models, and processes, shared memory, and simple parallel programs. Home Documents Introduction introducrion Parallel Programming: Appendix C explains how parallel programming can be done on a uniprocessor machine.
There was a problem providing the content you requested
The text then elaborates on basic parallel programming techniques, barriers and race conditions, and nested loops.
Contents Chapter 1 Introduction. Chapter 11 Performance Tuning. But the organization of the book could be clarified.
Various chapters overlap in presentation. Chapter 4 presents the functions for creating parallel programs in- cluding forking for creating processes a process i s a generalization of the concept of a program; it is a pro- gram along with its environment or support structuresjoining for destroying processes, and sharing memory.
This is an enhanced ver- sion of Fortran77 that includes explicitly incorporated parallel programming language structures. Chapter 7 Introduction to SchedulingNested Loops.
Academic PressMay 10, – Computers – pages.
This chapter also covers the effective use of the cache memory. Post on Oct views. Topics include parallel programming and the structure of programs, effect of the number of processes on overhead, loop splitting, indirect scheduling, block scheduling and forward dependency, and induction variable. The last chapter contains a 2-page list of programming projects.
Account Options Sign in. The manuscript takes a look at overcoming data dependencies, scheduling summary, linear recurrence relations, and performance tuning. Chapter 5 describes two elementary techniques for ap- portioning loops among various processors: Chapter 7 is an introduction to scheduling how to balance the workload among processors. Chapter 8 dis- cusses the subject of loops with data dependencies. Parallel Programming on a Uniprocessor Under Unix.
Nevertheless, this is a useful introductory book for parallel programming on shared memory machines.
Chapter 9 Scheduling Summary. Chapter 13 Some Applications. Chapter 8 Overcoming Data Dependencies. Chapter 15 Programming Projects. It is intended for the application programmers with no previous knowledge of parallel programming but who have ex- perience in an algorithmic language such as Basic, For- tran, Pascal, C, or Ada. Chapter 13 describes parallel implementation of several problems including exploring a maze, the traveling salesman problem, and the Gauss elimination method for the solution of simultaneous lin- ear algebraic equations.
Chapter 6 Barriers and Race Conditions. A number of common stdven dependencies are described and prigramming of circumventing them are given. My library Help Advanced Book Search.
Introduction to Parallel Programming focuses on the techniques, processes, methodologies, and approaches involved in parallel programming. The book btawer s full of examples. Order Form for Parallel Programs on Diskette. Equivalent C and Fortran Constructs. The publication is a valuable reference for researchers interested in parallel programming.