Linkage – centroid, 216–218 – complete, 216, 290 – median, 216–218 – single, 216 – Ward, 216 Locking protocol, 361 Log-likelihood, 105, 113 Long Term Evolution (LTE), 423

Markov Random Fields (MRFs), 9, 11, 102, 112–114, 408, 416, 420, 421 Matrix factorization, 11 – binary, 234 – Boolean, 235 – nonnegative, 229 – objectives, 230 Max-Cut, 144 Maximum a posteriori, 105, 408, 409, 417, 420 Maximum likelihood, 93, 105, 408, 409, 413, 419 McQuitty's Weighted Pair-Group Method with Arithmetic mean (WPGMA), 216, 217, 222 Memory, 9, 10, 74–78, 82, 83, 136, 157, 184, 222, 307, 308, 313, 327, 344, 347 – allocation, 277, 284, 309–313 – architecture, 276, 277, 342 – bottleneck, 3, 277, 281, 284 – cache, 3, 281, 284, 340–345, 347 – capacity, 3 – footprint, 108, 110, 111, 137, 138, 140, 307, 309, 313, 314, 329

– hierarchy, 3, 276, 281, 284, 343 – layout, 27, 313, 341, 342, 345 – locality, 276, 277, 342 – Magnetoresistive Random Access Memory (MRAM), 4 – Non-Uniform Memory Access (NUMA), 276 – non-volatile, 10, 326 – physical, 308, 309 – scratchpad, 3, 381 – shared, 145, 152, 158, 310, 381 – Static Random-Access Memory (SRAM), 4, 67, 326, 328 – virtual, 308–311 Merge & Reduce, 87, 88 Message passing, 8, 10, 105, 125, 130–132, 143, 410, 412, 413 Model execution, 341 Monte Carlo, 287, 288, 294, 297 Multicore, 4, 8, 33, 249, 275, 285, 296, 304 Multilayer perceptrons, 8, 137, 250

Nearest-neighbor chain algorithm, 222 Nearest-neighbor search, 174 Neural Network – Binarized Neural Networks (BNN), 10, 326, 328–333 – Convolutional Neural Networks (CNN), 62, 130, 162, 163, 333 – Deep Neural Networks (DNN), 15, 61, 328, 434 – Graph Neural Networks (GNN), 8–10, 116, 117, 125–128,

130–135, 137–141, 161–163, 165 Neural network – Convolutional Neural Networks (CNN), 254

Offloading, 4, 369, 378 One-vs-Rest Classification, 274 Operating system kernel, 17–20, 22, 23, 27–30, 32, 33, 310 – data, 17, 22

Parallelism, 8, 249, 275, 287, 386 Partition function, 104 Peripheral Component Interconnect express (PCIe), 380 Permission, 32, 61, 310 Poisson dependency network, 92 Potential function, 105, 411 Power – consumption, 2, 3, 6, 7, 48, 55, 58, 64, 65, 256, 300, 301, 426, 429–433 – measurement, 42, 45, 47, 49, 50, 58, 59, 300, 301 Probability density function (pdf), 95, 104 Processor utilization, 288 Proximal Optimization, 233 Pruning, 340

Quantization, 10 Query compilation, 386

Radio, 49, 425, 433 – mobile radio networks, 429 – Software-Defined Radio (SDR), 433

Random forest, 45, 341, 434 Real-time system, 34, 360, 361, 370, 378 Regression, 5, 6, 10, 43, 85–87, 90, 102, 285–292, 298, 316, 341, 434, 435 – Bayesian, 89, 93, 94 – generalized linear regression models, 89, 90, 92 – hierarchical, 94 – LASSO, 95 – linear, 6, 10, 86, 89, 90, 92, 93 – logistic, 90–92, 316 – ordinary least squares, 92 – Poisson, 92 – probit, 90, 95 Regularization, 5, 11, 93, 103, 105, 110–114, 234, 236–238, 275, 331, 333 Representation – Term-frequency inversedocument-frequency (Tf-idf), 272 Representation learning, 129, 130, 167, 174, 176 Resource – awareness, 288, 289, 292 – efficiency, 227, 286 – efficient transmission, 425 – optimization, 429, 430 – synchronization, 361 – utilization, 16, 263, 268, 285, 287, 297, 298, 304, 430 Resource Block (RB), 432 Resource-constrained, 47, 61 Resource-constrained learning, 101, 102,

108, 110, 111, 113, 136 Rule of Three, 79, 80 Runtime – estimation, 289, 291 Sampling, 5, 6, 9, 10, 48, 64, 67, 85, 90–92, 130, 136, 139, 167, 168, 201, 203, 240, 287, 288, 294, 301 – importance, 86, 89, 91, 93, 136 – layer-wise, 136 – node-wise, 136 – reservoir, 76 – sub-sampling, 137, 139 – subgraph, 136 – uniform, 93 Scalability, 10, 87, 108, 130, 137, 140, 143, 223, 224, 293, 294, 304, 426 Scheduling, 8, 9, 26, 27, 39, 285, 286, 288–292, 294, 295, 297–300, 302, 304, 366, 411, 432 – Earliest Deadline First (EDF), 366 – federated, 367 – List-Earliest Deadline First (List-EDF), 366 – non-preemptive fixed-priority, 363 – Partitioned Earliest-Deadline-First (P-EDF), 367

– preemptive fixed-priority, 375 – Worst-Fit Partitioned Earliest-Deadline-First (WF-P-EDF), 368 Security, 31, 68 Sensor network, 6, 15, 34, 74, 101, 106 Shannon entropy, 104 Signal – digital processing, 430 – Received Signal Strength Indicator (RSSI), 45 Similarity measure, 117, 121, 162, 197, 198, 200, 204 – cosine, 162, 174, 175 – dynamic time warping, 199 – Fréchet distance, 198, 199 Single Instruction, Multiple Data (SIMD), 386 Sketches, 10, 85, 86, 88–91, 93, 284 Spatio-temporal state prediction, 100, 102, 103, 106, 111, 113, 114 Spectral efficiency, 425 Speedup, 184, 223, 279, 281, 282, 322 Star Schema Benchmark (SSB), 381 Submodular functions, 10, 74–77, 80, 84 Sufficient statistics, 103, 104, 409, 410

Support vector data description, 212 Support Vector Machine (SVM), 10, 45, 316, 332 Synchronization, 4, 140, 284

Task period, 368 Tensor Processing Unit (TPU), 2 Test bed, 34–38, 40, 45 Thread parallelism, 275 Tiling, 214 Time series data, 62, 65, 101, 197, 198 Transformer, 163, 165, 166, 176, 283 Transmission power, 44, 425, 430, 433

Ultra-low power device, 9 Ultra-low power state, 44, 52, 59, 67 Uplink power, 433 User Equipment (UE), 423, 425, 430, 431

Variance, 96, 139, 291 von Neumann architecture, 2, 3

Wasserstein distance, 94, 122, 123 Wireless Sensor Network (WSN), 35, 36 Worst Case Execution Time (WCET), 363, 370 Worst-Fit Heuristic, 367

## **List of Contributors**

#### **Editors**

#### **Contributors**

#### **Technical Editors**

## **Acknowledgment**

Part of the work on this book is the result of research of the Collaborative Research Center 876 "Providing Information by Resource-Constrained Analysis", which was funded from 2011–2022 by the Deutsche Forschungsgemeinschaft (DFG) under DFG project number 124020371, see: https://gepris. dfg.de/gepris/projekt/124020371?language=en.