Languages and Compilers for Parallel Computing
Editat de Siddharta Chatterjee, Jan F. Prins, Larry Carter, Jeanne Ferrante, Zhiyuan L. Li, David Sehr, Pen-Chung Yewen Limba Engleză Paperback – 20 aug 1999
Preț: 327.48 lei
Preț vechi: 409.36 lei
-20%
Puncte Express: 491
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540664260
ISBN-10: 3540664262
Pagini: 404
Ilustrații: XIII, 391 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540664262
Pagini: 404
Ilustrații: XIII, 391 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Java.- From Flop to MegaFlops: Java for Technical Computing.- Considerations in HPJava Language Design and Implementation.- Locality.- A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality.- An Integrated Framework for Compiler-Directed Cache Coherence and Data Prefetching.- I/O Granularity Transformations.- Network Computing.- Stampede A Programming System for Emerging Scalable Interactive Multimedia Applications.- Network-Aware Parallel Computing with Remos.- Object-Oriented Implementation of Data-Parallelism on Global Networks.- Fortran.- Optimized Execution of Fortran 90 Array Language on Symmetric Shared-Memory Multiprocessors.- Fortran RED — A Retargetable Environment for Automatic Data Layout.- Automatic Parallelization of C by Means of Language Transcription.- Irregular Applications.- Improving Compiler and Run-Time Support for Irregular Reductions Using Local Writes.- Beyond Arrays — A Container-Centric Approach for Parallelization of Real-World Symbolic Applications.- SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations.- HPF-2 Support for Dynamic Sparse Computations.- Instruction Scheduling.- Integrated Instruction Scheduling and Register Allocation Techniques.- A Spill Code Placement Framework for Code Scheduling.- Copy Elimination for Parallelizing Compilers.- Potpourri.- Compiling for SIMD Within a Register.- Automatic Analysis of Loops to Exploit Operator Parallelism on Reconfigurable Systems.- Principles of Speculative Run—Time Parallelization.- Dependence Analysis.- The Advantages of Instance-Wise Reaching Definition Analyses in Array (S)SA.- Dependency Analysis of Recursive Data Structures Using Automatic Groups.- The I+ Test.