+612 9045 4394
 
CHECKOUT
Algorithms for Parallel Processing : The IMA Volumes in Mathematics and its Applications - Michael T. Heath

Algorithms for Parallel Processing

The IMA Volumes in Mathematics and its Applications

By: Michael T. Heath (Editor), Abhiram Ranade (Editor), Robert S. Schreiber (Editor)

Hardcover Published: 14th December 1998
ISBN: 9780387986807
Number Of Pages: 373

Share This Book:

Hardcover

RRP $562.99
$389.50
31%
OFF
or 4 easy payments of $97.38 with Learn more
Ships in 7 to 10 business days

Other Available Editions (Hide)

  • Paperback View Product Published: 23rd October 2012
    $181.25

This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com­ puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett­ Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda­ tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work­ shop organizers were Abhiram Ranade of The Indian Institute of Tech­ nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another.

Foreword
Preface
A general-purpose shared-memory model for parallel computationp. 1
Supporting a coherent shared address space across SMP nodes: An application-driven investigationp. 19
Single-message vs. batch communicationp. 61
Some simple and practical strategies for parallelismp. 75
Locality in computing connected componentsp. 89
Routing in optical and wireless networksp. 101
Transparent parallel transactions on replicated autonomous databasesp. 117
Mathematical tools for loop transformations: From systems of uniform recurrence equations to the polytope modelp. 147
The scalability of mesh improvement algorithmsp. 185
Data parallel performance optimizations using array aliasingp. 213
Coarsening, sampling, and smoothing: Elements of the multilevel methodp. 247
Some methods of parallel pseudorandom number generationp. 277
Performance of parallel sparse triangular solutionp. 289
Determining an out-of-core FFT decomposition strategy for parallel disks by dynamic programmingp. 307
Enabling department-scale supercomputingp. 321
Providing uniform dynamic access to numerical softwarep. 345
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780387986807
ISBN-10: 0387986804
Series: The IMA Volumes in Mathematics and its Applications
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 373
Published: 14th December 1998
Publisher: Springer-Verlag New York Inc.
Country of Publication: US
Dimensions (cm): 23.5 x 15.5  x 2.2
Weight (kg): 1.59