Subject Index
Oliver Sinnen · 2006
53 Application, 22, 24 area, 27 specification, 22 Architecture, see Parallel architecture Array, 32 dimension, 34 element, 32 Array processors, 55, 61, 67, 127 systolic, 62 wavefront, 61 ASAP (as-soon-as-possible), 98 Assignment spatial, 23, 75 temporal, 23, 75 Asymptotic notation, 44 Asynchronous, 60 Atomic instruction, 49 Attribution of start times, 118 Bandwidth, 12 β field, 159, 214, 249 BFS, see Breadth first search Bin packing, 139 BINPACKING, 89, 165 Bisection width, 13 Blocking wait, 243 Bottom level, 95, 107 computation, 96 Branching, 49 Breadth first search (BFS), 46 algorithm, 46 complexity, 46 Breeding, 170 Broadcast, 21 Bubble scheduling and allocation (BSA), 149, 158, 191, 200 Buffer size, 202 Bus, 11, 22, 193 C-SCHED, 211 Cache, 76 Cache effect, 76 CASCH, 183 CCR, see Communication to computation ratio CFG, see Control flow graph CG, see Computation graph Chess, 38 Child, 43 Chromosome, 171-177 direct representation, 173-174 encoding, 172 fittest, 181 indirect representation, 172-173 node list, 172, 176 pool, 171 processor allocation, 172, 176 representation type, 174-175 Clan, 138 Classic model, 76 Cluster, 120 assignment, 139-140 linear, definition, 124 merge, 121 Task Scheduling for Parallel Systems, by Oliver Sinnen