Bode A., Cin M.D. — Parallel Computer Architectures: Theory, Hardware, Software, Applications :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Bode A., Cin M.D. — Parallel Computer Architectures: Theory, Hardware, Software, Applications

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Parallel Computer Architectures: Theory, Hardware, Software, Applications

Авторы: Bode A., Cin M.D.

Аннотация:

Parallel computer architectures are now being used in applications ranging from image analysis to quantum mechanics. However, their use poses serious problems and requires the development of new techniques and tools. This book is a collection of the papers presented at a workshop on major research activity, held at the University of Erlangen-Nurnberg and the Technical University of Munich. The book is divided into five main parts: hardware aspects of multiprocessor systems; the performance of parallel systems; - architectures and tools for parallelization; - modelling techniques; and applications of parallel systems.

Язык:

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2007

Количество страниц: 309

Добавлена в каталог: 17.11.2013

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Ab initio      266
Actions      192
Adaptive partitioning      246 254
Address hashing      102 103
agents      196
Algorithm      305
Aliasing      173
AND-problems      50
Application concept      25
Approximate state space method      84
Approximation method      80
ASSIGNMENT      166
Automatic parallelization      118
Automatic test pattern generation      234
Bandwidth      1 56
Barrier synchronization      106 107 109 111 112 116
Basis functions      267
Beamsplitter      7
Benefit functions      53
Benefit rate      55
Block-structured grids      292 295
Block-structuring      295
Bounding methods      80
Broadcast      286
Bulk-synchronous parallelism (BSP)      106 116
Cache Coherence      103 133
candidates      92
Capsules      170
Causality      134
Central control management      239
Centralized components      89
Checker      33
Checkpointing      43
Chorus      90
class      181 186
Cluster      172
Coarse      215
Coarse grain parallelism      276
Collocation      183 184
Collocation association      170
Combination technique      276
Combinational circuits      235
Combinatorial optimization      219
Combining network      112 116
Communication channels      196
Communication memory      17
Communication memory interface      18
Communication system      191
Completion times      98
Components be located      94
concurrency control      133
Concurrent file system      258
Connectionist semantic networks      216
Constant factors      102 103 115
Control      211
Control algorithms      204 207
Control flow checking      35
Control loop      90
Control volume      293
Cooperation class      175
Cooperations      174
Coordination      22
correctness      200
Cost rate      55
Coupling unit      18 20
CPU      91
CPU-utilization      52
Creation of new processes      88
Crosstalk      12
Crystal orbital      266
Data skew      246 257
Data-flow analysis      120
Decision tree      237
Decision units      89
design specification      190
Diagonalization      273
Dislocation      183 187
Dislocation association      170
Distributed memory      87 133 279
Distributed memory multiprocessors      246
Distributed object model      181
Distributed self-management      238
Distributed shared memory (DSM)      15 102 116 133 159
Distributed snapshots      43
distributed systems      190
Distributed user programs      25
Distributed-memory machine      230
distribution      166
Distribution associations      170
distribution groups      172
Distribution language      166
Distribution model      169
Distribution system      167
Distribution transparency      168
Domain decomposition      298 302 303
Domain decomposition technique      295
Dynamic load balancing      241
Dynamic load managment      88
Effective scalability      250
Efficiency      62 102 103 105 106 108 109 110 111 112 113 115 270 298
Eigenvalue problem      266
Elliptic partial differential equations      276
Environment components      192
Error detection      33
Evalution unit      90
Event recorder      71
Event-driven monitoring      66
Excess parallelism      105 106 109 111 112 113 115
External sorting      246
farming      268
Fault dependency      240
Fault handling      31
Fault parallelism      234
Fault simulator      238
Fault tolerance      31
Fault tolerant interconnection network      38
Fault treatment      43
Fetch&op      116
Fiber concentrator      8
Final placement      219
Fine-grained parallelism      118
Finite state machine (FSM)      235
Finite volume      293
Fluid flow      292 305
Formal method      190
Frequency of synachronization      98
Functional program      191
Gang scheduling      26
Gate      173
Gauss — Seidel      292 293
Gaussian functions      267
Global communication      298 299 300 303 304
Global instruction scheduling      118
Global resource scheduling      88
global synchronization      95 96
Grand challenges      31
Granularity      99
Graph models      80
Graph search      211
Hard faults      44
Hardware monitoring      67
Hartree — Fock      266
Hashing      104 105 106 107
Heuristics      95 96 98
Holographic permutation elements      9
Horizontal parallelism      247
Horizontal parallelization      246
Hybrid monitoring      67
Hypercube      241
Idle-time      89 91 93 95 96 98 99

ILU method      292
ILU solver      293
ILU-decomposition      293
Image analysis and understanding      203
Imaging      6
Immutable objects      185
implementation      190
Implicit finite volume solution methods      305
Implicit methods      292
Indifference association      170
Inefficiencies      103 109 110 113 115
inheritance      187
Inner iteration      292 293 294 295 297 299 300 303 304 305
Instruction scheduling      119
Intel      270
Interconnection network      17 19
Interconnection topologies      4
INTERFACE      73
Interprocedural      120
Interrupt mechanism      26
iPSC/2      258
Island      173
Iteration matrix      297
Knowledge-based image understanding      203
Large data volumes      246
Latency hiding      103 106 113
latency reduction      103
Latency time      303 304 305
Leader task      26
Lengths of the ready queues      95
Liveness properties      193
load balancing      87 88 279 298 300
Load balancing effects      300
Load evalution unit      92 94
Load imbalance      87 92 95 98
Load Management      87
Load managements testbed      93
Load measure      92
Load parameters      87 89
load sharing      87 88
Local communication      298 299
Local components      89
Local global communication      298 299
Mach      90
Mapping      87 96 98
Massive parallelism      102 103 111 116
Massively parallel computers      31
Master      33
Master application      26
Master-checker mode      33
McCulloch Pitts neuron      92
Mean runtime      80
Measurement unit      90
Medium      215
Memory access analysis      121
Memory access latencies      102 103 105 115
Memory Management      150
Memory randomization      103 104
MEMSOS      24
MEMSY      15 75 274
Message-passing      27
Meta-abstraction      152
Meta-layer      152 160
Meta-object      152
Meta-recursion      153
method      305
Migration candidate      93 95
Migration of data      89
Migration of running processes      90
Migration unit      90 92
MMK      247
Mobility      169
Monitoring system      90
move_multicycle_op      126
Multigrid algorithm      305
Multigrid finite volume      305
Multigrid method      294 303
Multiple beam splitter      8
multiprocessor      87
Multiprogramming control      49
Multistage networks      9
Network of workstations      243 276
Neutral networks and linear optimization      211
Non-orthogonal      293
Non-series-parallel graphs      83
numerical      298
Numerical efficiencies      298 300 302 305
Numerical functions      81
Object      181
Object cache      158
Object management      150
Object space      156
Object store      155 160
Object-migration      159
Object-oriented operating system      150
OID      183
Open operating system      150 161
Optical backplane      4
Optical bus      7
Optimization      212
Optimization problem      204
Opto-ASIC      10
OR-problem      50
Outer iteration      292 293 294 297 299 300 302 303 304 305
page fault      93
parallel      298
Parallel checkpoint coordination      46
Parallel communication      285
Parallel efficiency      298 299 300 303 305
Parallel programs      80
Parallel random access machine (PRAM)      104
Parallel slackness      105
Parallel solution      276
Parallel sorting      246
Parallelism      3
Parallelization      215
Partial order semantics      139
Partitioning      219
PEPP      80
Percolation scheduling      120
Performance      103 106 108
Performance criteria      94
Performance evaluation      80 106
Persistency      41
Persistent object      150 154
Petri nets      139
Power of a parallel system      63
PRAM      105 109
PRAM emulation      104 106
Preprocessor      35
Process migration      87 93 99
Process switching      106 107 109 110 112 113 114 115 116
Processor nodes      17
Profit rate      55
Program analysis      118
Program graph      124
Programming model      22
Protection      42
Protocol development      191
Protocol hierarchy      195
Quantum mechanical methods      265
Randomized Shared Memory (RSM)      102 103 115 116
Ready queue length      91 96 98 99
Real-time computer vision      203
Redundancy      31
refinement      195
Reflection      153 162
Relative distribution      170
requirements specification      190
Response time      55 88

1 2

О проекте