000			nam a22 7a 4500
999			_c29123 _d29123
008			180713b xxu||||| |||| 00| 0 eng d
020			_a9783319739083
082			_a005.275 _bTAN
100			_aTanase, Alexandru-Petru
245			_aSymbolic parallelization of ested loop programs
260			_bSpringer _c2018 _aSwitzerland
300			_axii, 176 p. _c23 cm.
365			_aEUR _b109.99/ Rs. 9096.17
520			_aThis book introduces new compilation techniques, using the polyhedron model for the resource-adaptive parallel execution of loop programs on massively parallel processor arrays. The authors show how to compute optimal symbolic assignments and parallel schedules of loop iterations at compile time, for cases where the number of available cores becomes known only at runtime. The compile/​runtime symbolic parallelization approach the authors describe reduces significantly the runtime overhead, compared to dynamic or just‐in-time compilation. The new, on‐demand fault‐tolerant loop processing approach described in this book protects loop nests for parallel execution against soft errors
650			_aCOMPUTERS /​ Programming /​ Parallel
650			_aComputer architecture
650			_aParallel programming (Computer science)
650			_aEngineering
650			_aCircuits and Systems
650			_aProcessor Architectures
650			_aElectronics and Microelectronics, Instrumentation
700			_aHannig, Frank
700			_aTeich, Jurgen
942			_2ddc _cBK