Login       My Wishlist
  My Cart
$0.00 / 0 items
 
EMS Linux
Utilizing the Best Tools With Linux
 
International Access
Global Shipping Options Available
Home About Us News Our Blog Our Catalog My Cart My Account Track Shippment Contact Us
  Our Catalog   Programming Languages   Compiler Design

Loop Parallelization


Huge Savings Item! Save 20% on the Loop Parallelization by Banerjee Utpal at EMS Linux. Hurry! Limited time offer. Offer valid only while supplies last. Automatic transformation of a sequential program into a parallel form is a subject that presents a great intellectual challenge and promises a great


Product Description

Automatic transformation of a sequential program into a parallel form is a subject that presents a great intellectual challenge and promises a great practical award. There is a tremendous investment in existing sequential programs, and scientists and engineers continue to write their application programs in sequential languages (primarily in Fortran). The demand for higher speedups increases. The job of a restructuring compiler is to discover the dependence structure and the characteristics of the given machine. Much attention has been focused on the Fortran do loop. This is where one expects to find major chunks of computation that need to be performed repeatedly for different values of the index variable. Many loop transformations have been designed over the years, and several of them can be found in any parallelizing compiler currently in use in industry or at a university research facility.
The book series on KappaLoop Transformations for Restructuring Compilerskappa provides a rigorous theory of loop transformations and dependence analysis. We want to develop the transformations in a consistent mathematical framework using objects like directed graphs, matrices, and linear equations. Then, the algorithms that implement the transformations can be precisely described in terms of certain abstract mathematical algorithms. The first volume, Loop Transformations for Restructuring Compilers: The Foundations, provided the general mathematical background needed for loop transformations (including those basic mathematical algorithms), discussed data dependence, and introduced the major transformations. The current volume, Loop Parallelization, builds a detailed theory of iteration-level loop transformations based on the material developed in the previous book.

Additional Information

Manufacturer:Springer
Brand:Banerjee Utpal
Publisher:Springer
Studio:Springer
EAN:9781441951410
Item Weight:0.67 pounds
Item Size:0.45 x 9.25 x 9.25 inches
Package Weight:0.68 pounds
Package Size:6.1 x 0.45 x 0.45 inches

Loop Parallelization by Banerjee Utpal

Buy Now:
Loop Parallelization

Brand: Banerjee Utpal
Condition: New
Lead Time: 1 - 2 Business Days
Availability: In Stock
$235.00
$188.74
You Save: 20%


Quantity:  

 


View More In Compiler Design.

 


Have questions about this item, or would like to inquire about a custom or bulk order?


If you have any questions about this product by Banerjee Utpal, contact us by completing and submitting the form below. If you are looking for a specif part number, please include it with your message.

First Name:
Last Last:
Email Address:
Your Message:

Related Best Sellers


By Brand: Springer
mpn: biography, ean: 9781461361541, isbn: 1461361540,

By Utpal Banerjee
mpn: biography, ean: 9781475770582, isbn: 1475770588,

By Mohammad R Haghighat
mpn: 12 black & white illustrations, biograph, ean: 9781475783179, isbn: 1475783175,

By Utpal Banerjee
mpn: biography, ean: 9781475783506, isbn: 1475783507,

By Springer
mpn: 9 black & white tables, biography, ean: 9781489984050, isbn: 1489984054,

By Springer
ean: 9783540127895, isbn: 3540127895,

By Andreas Krall
ean: 9783540201458, isbn: 3540201459,

By Kwangkeun Yi
ean: 9783540377566, isbn: 3540377565,

By Japan Ispa 200 2003 Aizu Laurence Tianruo Yang
mpn: Illustrations, ean: 9783540405238, isbn: 3540405232,

By Rina Dechter
ean: 9783540410539, isbn: 3540410538,



Privacy Policy / Terms of Service
© 2018 - emslinux.com. All Rights Reserved.