Assignment Problems in Parallel and Distributed Computing: The Springer International Series in Engineering and Computer Science, cartea 32
Autor Shahid H. Bokharien Limba Engleză Hardback – 30 sep 1987
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 640.05 lei 6-8 săpt. | |
Springer Us – 24 feb 2012 | 640.05 lei 6-8 săpt. | |
Hardback (1) | 646.47 lei 6-8 săpt. | |
Springer Us – 30 sep 1987 | 646.47 lei 6-8 săpt. |
Din seria The Springer International Series in Engineering and Computer Science
- Preț: 119.98 lei
- 24% Preț: 1041.97 lei
- 20% Preț: 422.81 lei
- Preț: 206.36 lei
- 20% Preț: 313.26 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
Preț: 646.47 lei
Preț vechi: 808.09 lei
-20% Nou
Puncte Express: 970
Preț estimativ în valută:
123.71€ • 129.32$ • 104.54£
123.71€ • 129.32$ • 104.54£
Carte tipărită la comandă
Livrare economică 06-20 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780898382402
ISBN-10: 0898382408
Pagini: 156
Ilustrații: XXIV, 156 p.
Dimensiuni: 156 x 234 x 17 mm
Greutate: 0.45 kg
Ediția:1987
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: 0898382408
Pagini: 156
Ilustrații: XXIV, 156 p.
Dimensiuni: 156 x 234 x 17 mm
Greutate: 0.45 kg
Ediția:1987
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. Introduction.- 1.1. The Motivations for Distributed Processing.- 1.2. Environments for Distributed Processing.- 1.3. Distinction between Distributed and Parallel Processing.- 1.4. The Central Problem Addressed in this book.- 1.5. Graph-Theoretic Solution Techniques.- 1.6. Overview.- 2. Graph Theoretic Concepts.- 2.1. Directed Graphs.- 2.2. Undirected Graphs.- 2.3. Graphs in General.- 2.4. Weighted Graphs.- 2.5. Trees.- 2.6. Multigraphs.- 2.7. Further Reading.- 3. Network Flow Techniques.- 3.1. The Basic Dual-Processor Assignment Problem.- 3.2. Memory Constraints.- 3.3. Dynamic Assignments.- 3.4. Resource Partitioning with Replication.- 3.5. Summary.- 4. The Shortest Tree Algorithm.- 4.1. Introduction.- 4.2. Assigning Trees across Space.- 4.3. Assigning Series-Parallel Graphs.- 4.4. Optimal Assignments across Space and Time.- 4.5. Summary.- 5. Varying Load Conditions.- 5.1. Varying Load on one Processor.- 5.2. Varying Load on Two Processors.- 5.3. Varying Communication Costs.- 5.4. Summary.- 6. Sum-Bottleneck Algorithm.- 6.1. Motivations.- 6.2. Definitions.- 6.3. Partitioning Chains over Chains.- 6.4. Partitioning Multiple Chains in a Host-Satellite System.- 6.5. Global Assignments in Multiple-Satellite System.- 6.6. Partitioning Trees in a Host-Satellite System.- 6.7. Summary.- 7. Mapping for Parallel Processing.- 7.1. The Parallel Processing Environment.- 7.2. The Mapping Problem.- 7.3. Binary Dissections of Non-uniform domains.- 7.4. Related Research.- 7.5. Summary.- 8. Conclusions.- 8.1. Alternative Approaches.- 8.2. Open Problems.- 8.3. Sources of Information.