Home Browse by Subject Bestsellers New Titles Editor's Choice New Reviews Textbooks
Search Book Series Study Guides Rights Inspection Copy Contact Us Join Our Mailing List
For Authors How to Order E-Catalogues

Browse all Subjects
Search Bookshop
New Titles
Editor's Choice
Bestsellers
Book Series
Textbooks
Journals
Join Our Mailing List
 
AUTOMATIC PARALLELIZATION FOR A CLASS OF REGULAR COMPUTATIONS

by G M Megson (University of Reading) & X Chen (University of Kent)

The automatic generation of parallel code from high level sequential description is of key importance to the wide spread use of high performance machine architectures. This text considers (in detail) the theory and practical realization of automatic mapping of algorithms generated from systems of uniform recurrence equations (do-lccps) onto fixed size architectures with defined communication primitives. Experimental results of the mapping scheme and its implementation are given.


Contents:

  • Survey and Analysis of Partitioning and Mapping
  • Improvements to Some Existing Partitioning and Mapping Methods
  • A Methodology of Partitioning and Mapping for Given (N-1)-D Regular Arrays
  • Optimal Mapping onto Lower-Dimensional Regular Arrays
  • The Structure of Parallel Programs
  • Parallel Code Generation
  • Experimental Results and Discussions
  • Conclusion
  • Bibliography


Readership: Postgraduate students and researchers in academics & industry, compiler writers, computer scientists and electrical engineers.

272pp Pub. date: Jan 1997
ISBN 978-981-02-2806-4
981-02-2806-6
US$55 / £34
US$22 / £14

* Special price applies only to individuals purchasing online and cannot be used in conjunction with any other offers.


Copyright © 2008 World Scientific Publishing Co. All rights reserved.
Updated on 7 August 2008