Muutke küpsiste eelistusi

E-raamat: Annual Review of Scalable Computing [World Scientific e-raamat]

(Nus, S'pore)
  • Formaat: 244 pages
  • Sari: Series On Scalable Computing 2
  • Ilmumisaeg: 15-Nov-2000
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • ISBN-13: 9789812792228
Teised raamatud teemal:
  • World Scientific e-raamat
  • Hind: 97,94 €*
  • * hind, mis tagab piiramatu üheaegsete kasutajate arvuga ligipääsu piiramatuks ajaks
Annual Review of Scalable ComputingSuurem pilt
  • Formaat: 244 pages
  • Sari: Series On Scalable Computing 2
  • Ilmumisaeg: 15-Nov-2000
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • ISBN-13: 9789812792228
Teised raamatud teemal:
World Scientific e-raamatudRohkem infot World Scientific e-raamatute kohta
Raamatu kodulehekülg: http://www.worldscientific.com/worldscibooks/10.1142/4517#t=toc
Continuing the Series on Scalable Computing launched in 1999, this volume presents five articles reviewing significant current developments in the field. The topics include the collaborative activities support system, parallel languages, Internet Java, the multithreaded dataflow machine, and task allocation algorithms.
Coordination In Collaborative Activities
1(27)
Introduction
1(2)
The MLMV Methodology
3(6)
Activity Levels and ViewPoints
3(6)
Coordination Graphs: Graph Grammar Based Technique For Coordination Description
9(9)
The CG-based Coordination Description Formalism
9(1)
The Hierarchical Coordination Model For Concurrency Management
10(4)
The Linear Coordination Model For Information Sharing Management
14(4)
MLMV Software Support For Implementing Distributed Cooperative Applications
18(7)
A CORBA-based Software Environment For MLMV Models Enactment
18(3)
Application to Distributed Editing Using the Web
21(4)
Conclusion
25(1)
Acknowledgements
25(1)
Bibliography
25(3)
Advances In Programming Languages For Parallel Computing
28(31)
Introduction
28(2)
Shared Memory Languages
30(4)
Orca
31(1)
Linda
32(1)
OpenMP
33(1)
Java
33(1)
Distributed Memory Languages
34(5)
PVM
35(1)
MPI
36(1)
HPF
37(1)
CILK
37(1)
C*
38(1)
ZPL
38(1)
Object-oriented Parallel Languages
39(4)
MPL
40(1)
Concurrent Aggregates
41(1)
HPC++
42(1)
Distributed Java
42(1)
Parallel Declarative Languages
43(3)
Parallel Logic Languages
43(2)
Parallel Functional Languages
45(1)
Composition Based Languages
46(3)
SkieCL
47(1)
BSPlib
47(1)
PCN
48(1)
CC++
49(1)
Discussion and Future Trends
49(4)
Conclusions
53(1)
Bibliography
54(5)
JAVM: Internet-based Parallel Computing Using Java
59(16)
Introduction
59(1)
Why Java?
60(2)
Concerns
62(1)
Parallel Computing Using Java
62(2)
Java Applets Implementations
62(1)
Critique
62(1)
Standalone Java Applications
63(1)
Critique
63(1)
Project JAVM
64(9)
Goals
64(2)
Transfer Policy
66(1)
Information Policy
67(2)
Placement Policy
69(1)
Security in JAVM
70(1)
JCA/JCE and the DSTC Security Provider
70(1)
Cryptography in JAVM
71(1)
Preliminary Results
71(1)
Ongoing Work
72(1)
Summary
73(1)
Bibliography
73(2)
Datarol: A Parallel Machine Architecture For Fine-Grain Multithreading
75(32)
Introduction
76(2)
Datarol Architecture
78(4)
Concept of Datarol
79(2)
Optimization of Datarol Architecture
81(1)
Datarol-II Program
82(1)
Instruction Set
82(1)
Sample Program
83(1)
Datarol-II Processor
83(5)
Overview of Datarol-II Processor
83(2)
Memory Unit
85(1)
Function Unit
85(1)
Structure Memory Unit
86(1)
Function Call Mechanism
87(1)
Evaluation of Datarol-II Architecture
88(4)
Threading Effect
88(1)
Effect of Implicit Register Loading
89(1)
Swapping Cost
90(2)
Cost-Effective Implementation of Datarol-II Processor
92(10)
FMD: Fine-grain Message Driven mechanism
92(2)
FMP: Fine-grain Message Processor
94(1)
Co-processing between CPU and FMP
95(1)
Synchronization
96(1)
Thread Queue Management
96(1)
Frame Management
97(1)
Preliminary Evaluation
98(1)
An Implementation of FMD: KUMP/D
98(1)
Performance Analysis
99(2)
Performance of Message Handling
101(1)
Related Work
102(2)
Conclusions
104(1)
Bibliography
105(2)
Static Task Scheduling And Allocation Algorithms
107(106)
Introduction
108(5)
Scheduling Models
109(2)
Performance Considerations
111(2)
Contributions
113(1)
The DAG Scheduling Problem
113(4)
The DAG Model
114(1)
Generation of a DAG
114(1)
Variations in the DAG Model
115(2)
The Multiprocessor Model
117(1)
NP-Completeness of the DAG Scheduling Problem
117(1)
A Taxonomy of DAG Scheduling Algorithms
118(2)
Basic Techniques in DAG Scheduling
120(4)
Characteristics of Scheduling Algorithms
124(1)
Description of the Algorithms
125(54)
Scheduling DAGs with Restricted Structures
125(1)
Hu's Algorithm for Tree-Structured DAGs
125(2)
Coffman and Graham's Algorithm for Two-Processor Scheduling
127(2)
Scheduling Interval-Ordered DAGs
129(1)
Scheduling Arbitrary DAGs without Communication
129(1)
Level-based Heuristics
129(1)
A Branch-and-Bound Approach
130(1)
Analytical Performance Bounds for Scheduling without Communication
131(1)
UNC Scheduling
132(1)
Scheduling of Primitive Graph Structures
133(1)
The EZ Algorithm
134(1)
The LC Algorithm
134(2)
The DSC Algorithm
136(3)
The MD Algorithm
139(2)
The DCP Algorithm
141(1)
Other UNC Approaches
141(2)
Theoretical Analysis for UNC Scheduling
143(1)
BNP Scheduling
143(1)
The HLFET Algorithm
143(2)
The ISH Algorithm
145(1)
The MCP Algorithm
145(2)
The ETF Algorithm
147(3)
The DLS Algorithm
150(2)
The LAST Algorithm
152(1)
Other BNP Approaches
152(3)
Analytical Performance Bounds of BNP Scheduling
155(1)
TDB Scheduling
155(1)
The PY Algorithm
156(2)
The LWB Algorithm
158(1)
The DSH Algorithm
158(2)
The BTDH Algorithm
160(1)
The LCTD Algorithm
160(2)
The CPFD Algorithm
162(3)
Other TDB Approaches
165(2)
APN Scheduling
167(1)
The Message Routing Issue
167(1)
The MH Algorithm
168(1)
The DLS Algorithm
169(2)
The BU Algorithm
171(1)
The BSA Algorithm
171(3)
Other APN Approaches
174(1)
Scheduling in Heterogeneous Environments
174(3)
Mapping Clusters to Processors
177(2)
Some Scheduling Tools
179(2)
Hypertool
179(1)
PYRROS
179(1)
Parallax
180(1)
OREGAMI
180(1)
PARSA
180(1)
CASCH
181(1)
Commercial Tools
181(1)
Benchmarking the Scheduling Algorithms
181(2)
Peer Set Graphs
181(1)
Random Graphs with Optimal Solutions
182(1)
Random Graphs with Pre-Determined Optimal Schedules
182(1)
Random Graphs without Optimal Schedules
183(1)
Traced Graphs
183(1)
Performance Results and Comparison
183(19)
Results for the Peer Set Graphs
184(1)
Results for RGBOS benchmarks
185(2)
Results for the RGPOS Benchmarks
187(1)
Results for the RGNOS Benchmarks
188(1)
Comparing Schedule Lengths
188(2)
Pair-Wise Comparison
190(2)
Best Solutions and Degradations from the Best
192(6)
Number of Processors Used
198(1)
Algorithm Running Times
199(1)
Results for Traced Graphs
199(1)
Scheduling Scalability (SS)
200(2)
New Ideas and Research Trends
202(8)
Scheduling using Genetic Algorithms
205(2)
Randomization Techniques
207(1)
Parallelizing a Scheduling Algorithm
208(1)
Future Research Directions
209(1)
Summary and Concluding Remarks
210(3)
Acknowledgments
213(1)
Bibliography
213


Püsilink: https://www.kriso.ee/db/9789812792228_pe.html