Languages and Compilers for Parallel Computing

7th International Workshop, Itaca, NY, USA, August 8-10, 1994, Proceedings

Lecture Notes in Computer Science Band 892

Keshav Pinagali, Utpal Banerjee, David Gelernter

Buch (Taschenbuch, Englisch)
Buch (Taschenbuch, Englisch)
Fr. 99.90
Fr. 99.90
inkl. gesetzl. MwSt.
inkl. gesetzl. MwSt.
Versandfertig innert 6 - 9 Werktagen Versandkostenfrei
Versandfertig innert 6 - 9 Werktagen
Versandkostenfrei

Weitere Formate

Taschenbuch

ab Fr. 82.90

Accordion öffnen
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 82.90

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 82.90

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 86.90

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 95.90

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 99.90

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 101.00

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 101.00

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 111.00

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 116.00

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 1 - 2 Werktagen

    Fr. 116.00

    Springer Berlin
  • Languages and Compilers for Parallel Computing

    Springer Berlin

    Versandfertig innert 6 - 9 Werktagen

    Fr. 127.00

    Springer Berlin

eBook

ab Fr. 106.90

Accordion öffnen
  • Languages and Compilers for Parallel Computing

    PDF (Springer)

    Sofort per Download lieferbar

    Fr. 106.90

    PDF (Springer)
  • Languages and Compilers for Parallel Computing

    PDF (Springer)

    Sofort per Download lieferbar

    Fr. 112.90

    PDF (Springer)
  • Languages and Compilers for Parallel Computing

    PDF (Springer)

    Sofort per Download lieferbar

    Fr. 127.90

    PDF (Springer)
  • Languages and Compilers for Parallel Computing

    PDF (Springer)

    Sofort per Download lieferbar

    Fr. 127.90

    PDF (Springer)

Beschreibung

This volume presents revised versions of the 32 papers accepted for the Seventh Annual Workshop on Languages and Compilers for Parallel Computing, held in Ithaca, NY in August 1994.

The 32 papers presented report on the leading research activities in languages and compilers for parallel computing and thus reflect the state of the art in the field. The volume is organized in sections on fine-grain parallelism, align- ment and distribution, postlinear loop transformation, parallel structures, program analysis, computer communication, automatic parallelization, languages for parallelism, scheduling and program optimization, and program evaluation.

Produktdetails

Einband Taschenbuch
Erscheinungsdatum 26.01.1995
Herausgeber Keshav Pingali, Utpal Banerjee, David Gelernter, Alex Nicolau, David Padua
Verlag Springer Berlin
Seitenzahl 503
Maße (L/B/H) 23.5/15.5/2.7 cm
Gewicht 666 g
Auflage 1995
Sprache Englisch
ISBN 978-3-540-58868-9

Weitere Bände von Lecture Notes in Computer Science

Das meinen unsere Kund*innen

0.0/5.0

0 Bewertungen

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kund*innen durch Ihre Meinung

Erste Bewertung verfassen

Unsere Kund*innen meinen

0.0/5.0

0 Bewertungen

0 Bewertungen filtern

  • artikelbild-0
  • Fine-grain scheduling under resource constraints.- Mutation scheduling: A unified approach to compiling for fine-grain parallelism.- Compiler techniques for fine-grain execution on workstation clusters using PAPERS.- Solving alignment using elementary linear algebra.- Detecting and using affinity in an automatic data distribution tool.- Array distribution in data-parallel programs.- Communication-free parallelization via affine transformations.- Finding legal reordering transformations using mappings.- A new algorithm for global optimization for parallelism and locality.- Polaris: Improving the effectiveness of parallelizing compilers.- A formal approach to the compilation of data-parallel languages.- The data partitioning graph: Extending data and control dependencies for data partitioning.- Detecting value-based scalar dependence.- Minimal data dependence abstractions for loop transformations.- Differences in algorithmic parallelism in control flow and call multigraphs.- Flow-insensitive interprocedural alias analysis in the presence of pointers.- Incremental generation of index sets for array statement execution on distributed-memory machines.- A unified data-flow framework for optimizing communication.- Interprocedural communication optimizations for distributed memory compilation.- Analysis of event synchronization in parallel programs.- Computing communication sets for control parallel programs.- Optimizing parallel SPMD programs.- An overview of the Opus language and runtime system.- SIMPLE performance results in ZPL.- Cid: A parallel, “shared-memory” C for distributed-memory machines.- EQ: Overview of a new language approach for prototyping scientific computation.- Reshaping access patterns for generating sparse codes.- Evaluating two loop transformations for reducing multiple-writer false sharing.- Parallelizing tree algorithms: Overhead vs. parallelism.- Autoscheduling in a distributed shared-memory environment.- Optimizing array distributions in data-parallel programs.- Automatic reduction tree generation for fine-grain parallel architectures when iteration count is unknown.