Parallel Programming and Compilers: The Springer International Series in Engineering and Computer Science, cartea 59
Autor Constantine D. Polychronopoulosen Limba Engleză Paperback – 23 sep 2011
Din seria The Springer International Series in Engineering and Computer Science
- 24% Preț: 1041.97 lei
- 20% Preț: 643.50 lei
- 18% Preț: 1225.62 lei
- 18% Preț: 965.02 lei
- 20% Preț: 646.12 lei
- 18% Preț: 948.79 lei
- 20% Preț: 646.62 lei
- 15% Preț: 637.46 lei
- 20% Preț: 643.83 lei
- 18% Preț: 949.23 lei
- 20% Preț: 644.48 lei
- 20% Preț: 994.92 lei
- 20% Preț: 645.97 lei
- 18% Preț: 946.87 lei
- 20% Preț: 995.57 lei
- 18% Preț: 956.99 lei
- 20% Preț: 644.98 lei
- 15% Preț: 649.54 lei
- 18% Preț: 950.21 lei
- 18% Preț: 1221.38 lei
- 18% Preț: 957.62 lei
- 15% Preț: 643.99 lei
- 18% Preț: 948.47 lei
- 18% Preț: 947.35 lei
- 20% Preț: 1284.65 lei
- 20% Preț: 1633.95 lei
- 20% Preț: 1285.78 lei
Preț: 330.10 lei
Preț vechi: 412.62 lei
-20% Nou
Puncte Express: 495
Preț estimativ în valută:
63.18€ • 65.71$ • 52.95£
63.18€ • 65.71$ • 52.95£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461284161
ISBN-10: 1461284163
Pagini: 260
Ilustrații: 258 p.
Dimensiuni: 152 x 229 x 14 mm
Greutate: 0.35 kg
Ediția:Softcover reprint of the original 1st ed. 1988
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 1461284163
Pagini: 260
Ilustrații: 258 p.
Dimensiuni: 152 x 229 x 14 mm
Greutate: 0.35 kg
Ediția:Softcover reprint of the original 1st ed. 1988
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1 Parallel Architectures and Compilers.- 1.1 Introduction.- 1.2 Book Overview.- 1.3 Vector and Parallel Machines.- 1.4 Parallelism in Programs.- 1.5 Basic Concepts and Definitions.- 2 Program restructuring for parallel execution.- 2.1 Data Dependences.- 2.2 Common Optimizations.- 2.3 Transformations for Vector/Parallel Loops.- 2.4 Cycle Shrinking.- 2.5 Loop Spreading.- 2.6 Loop Coalescing.- 2.7 Run-Time Dependence Testing.- 2.8 Subscript Blocking.- 2.9 Future Directions.- 3 A Comprehensive Environment for Automatic Packaging and Scheduling of Parallelism.- 3.1 Introduction.- 3.2 A Comprehensive Approach to Scheduling.- 3.3 Auto-Scheduling Compilers.- 4 Static and Dynamic Loop Scheduling.- 4.1 Introduction.- 4.2 The Guided Self-Scheduling (GSS(k)) Algorithm.- 4.3 Simulation Results.- 4.4 Static Loop Scheduling.- 5 Run-Time Overhead.- 5.1 Introduction.- 5.2 Bounds for Dynamic Loop Scheduling.- 5.3 Overhead of Parallel Tasks.- 5.4 Two Run-Time Overhead Models.- 5.5 Deciding the Minimum Unit of Allocation.- 6 Static Program Partitioning.- 6.1 Introduction.- 6.2 Methods for Program Partitioning.- 6.3 Optimal Task Composition for Chains.- 6.4 Details of Interprocessor Communication.- 7 Static Task Scheduling.- 7.1 Introduction.- 7.2 Optimal Allocations for High Level Spreading.- 7.3 Scheduling Independent Serial Tasks.- 7.4 High Level Spreading for Complete Task Graphs.- 7.5 Bounds for Static Scheduling.- 8 Speedup Bounds for Parallel Programs.- 8.1 Introduction.- 8.2 General Bounds on Speedup.- 8.3 Speedup Measures for Task Graphs.- 8.4 Speedup Measures for Doacr Loops.- 8.5 Multiprocessors vs. Vector/Array Machines.- References.