Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleAlgorithms for Parallel Processing [electronic resource] / edited by Michael T. Heath, Abhiram Ranade, Robert S. Schreiber
ImprintNew York, NY : Springer New York : Imprint: Springer, 1999
Connect tohttp://dx.doi.org/10.1007/978-1-4612-1516-5
Descript X, 373 p. online resource

SUMMARY

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


CONTENT

Models and Mechanisms in Parallel Computation -- A general-purpose shared-memory model for parallel computation -- Supporting a coherent shared address space across SMP nodes: An application-driven investigation -- Single-message vs. batch communication -- Some simple and practical strategies for parallelism -- Discrete and Combinatorial Algorithms -- Locality in computing connected components -- Routing in optical and wireless networks -- Transparent parallel transactions on replicated autonomous databases -- Mathematics of Parallelizing Compilers -- Mathematical tools for loop transformations: From systems of uniform recurrence equations to the polytope model -- Numerical Algorithms -- The scalability of mesh improvement algorithms -- Data parallel performance optimizations using array aliasing -- Coarsening, sampling, and smoothing: Elements of the multilevel method -- Some methods of parallel pseudorandom number generation -- Performance of parallel sparse triangular solution -- Determining an out-of-core FFT decomposition strategy for parallel disks by dynamic programming -- Parallel Computer Systems and Software -- Enabling department-scale supercomputing -- Providing uniform dynamic access to numerical software


Mathematics Algorithms Applied mathematics Engineering mathematics Numerical analysis Combinatorics Mathematics Numerical Analysis Applications of Mathematics Algorithm Analysis and Problem Complexity Combinatorics



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram