A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
We present the scheduling analysis for the automatic parallelization of programs in the Z-polyhedral model, and obtain multidimensional schedules through an ILP formulation that minimizes latency. ... The polyhedral model is extensively used for analyses and transformations of regular loop programs, one of the most important being automatic parallelization. ... Loop programs with a non-unit stride fall outside the scope of the model. ...doi:10.1109/ipdps.2007.370229 dblp:conf/ipps/GuptaKR07 fatcat:rysz7qpumjb5hn24d5f22qwp3m
Thus, we introduce the use of a genetic algorithm with specialized operators that leverage the polyhedral representation of program dependences. ... However, because optimizing compilers (1) use simplistic performance models that abstract away many of the complexities of modern architectures, (2) rely on inaccurate dependence analysis, and (3) lack ... For example, compilers can typically not apply any transformation if data dependences are non-uniform (unimodular transformations, tiling), if the loop trip counts differ (fusion) or simply because profitability ...doi:10.1145/1375581.1375594 dblp:conf/pldi/PouchetBCC08 fatcat:p6z3qjhxl5cx7jwjvlu7cabgie
Thus, we introduce the use of a genetic algorithm with specialized operators that leverage the polyhedral representation of program dependences. ... However, because optimizing compilers (1) use simplistic performance models that abstract away many of the complexities of modern architectures, (2) rely on inaccurate dependence analysis, and (3) lack ... For example, compilers can typically not apply any transformation if data dependences are non-uniform (unimodular transformations, tiling), if the loop trip counts differ (fusion) or simply because profitability ...doi:10.1145/1379022.1375594 fatcat:2g6qs7a4qzbixmf7mz3mw5gke4
Lecture Notes in Computer Science
Algorithms, permitting us to build free schedules for perfectly and imperfectly nested affine loops with non-uniform dependences, are presented. ... The operations of each time schedule can be executed as soon as their operands are available. This allows us to extract maximum loop parallelism. The algorithms require exact dependence analysis. ... Most of those transformations permit us to extract parallelism from both uniform and non-uniform loops. ...doi:10.1007/978-3-540-45209-6_44 fatcat:g6f7gmn6prhg7crlnlmkkgcij4
Methods of structured uncertainty analysis (µ-analysis) are extended towards systems with dynamical and non-causal spatial coordinates. ... As an example, the paper applies the multidimensional structured uncertainty analysis to closed-loop control of a cross-directional paper machine process. ... One contribution of this paper is in identifying a large class of practically important multidimensional systems with non-causal coordinates for which closed-loop BIBO stability conditions derived for ...doi:10.1109/tac.2003.816980 fatcat:vtmiakgg3ffplm6ttgv3uzr4re
Doppler shift and non-thermal width of the synthesized line emission agree with those from a high-resolution reference simulation within an error of several km/s above the formation temperature of 10^5 ... We have tested the proposed method using a one-dimensional hydrodynamic model of a coronal loop in an active region. ... The non-uniform grid spacing is used with the grid size of 100 m near the transition region. ...arXiv:2106.00864v1 fatcat:ddgrzetsivgbhgvtri4aqcwf4y
The MD-retiming method improves the instruction-level parallelism of uniform loops. ... This paper presents an analysis of that technique and its constraints when applied to nested loops with known index bounds, such as those found in two and three dimensional image processing. ... This method improves the instruction level parallelism of uniform loops. ...doi:10.1117/12.438262 dblp:conf/spieVIP/PassosDBHS01 fatcat:aehielbrxfcyjbuedx6ehk5pnm
In the present article, we demonstrate that node-unaligned multidimensional networks, either with uniform or non-uniform multidimensional spaces, can also display exponentially larger algorithmic information ... information of the multidimensional space itself needs to be taken into account in multidimensional network complexity analysis. ... Conflicts of Interest: The authors declare no conflict of interest. ...doi:10.3390/e23070835 fatcat:v3thfvzvfbai7cztt3dp47z2ui
a uniform attrac: tor with respect to these controls. ... Authors’ summary: “We consider the use of Volterra functional series and of multidimensional discrete Laplace transforms in the analysis of nonlinear sampled-data systems with discontinuities in the amplitude ...
(RS-AOS-CN; Moscow) Synthesis of linear multidimensional time-dependent systems with discontinuous control actions. (Russian. ... Summary: “In this paper, we consider, for the first time, the com- bined problem of uniform disturbance rejection and decoupling of nonsquare linear time-dependent analytic systems via restricted Static ...
A technique for the enhancement of point targets in clutter is described. The local 3-D spectrum at each pixel is estimated recursively. ... flow-field for the textured background is then generated using the 3-D autocorrelation function and the local velocity estimates are used to apply high-pass velocity-selective spatiotemporal filters, with ... cloud or terrain), possibly exhibiting non-uniform motion. ...doi:10.1109/icassp.2015.7178137 dblp:conf/icassp/Kennedy15 fatcat:6nrovpcuyfe33coz3kwpcvnlnm
To address this fundamental challenge, we first present a convex characterization of all distinct, semantics-preserving, multidimensional affine transformations. ... However, determining appropriate compositions of loop transformations to achieve this remains a significantly challenging task; current compilers may achieve significantly lower performance than hand-optimized ... Acknowledgments We are grateful to Paul Feautrier for providing the foundations for multidimensional affine scheduling, and the simplification of Vasilache's original convex formulation of all semantics-preserving ...doi:10.1145/1926385.1926449 dblp:conf/popl/PouchetBBCRSV11 fatcat:h5y7lpv26fdhjcrmemweqffnxu
region analysis, and nonlinear dependence testing. ... This uniform approach provides a powerful unified framework of analysis methods for restructuring compilers. ... Analysis Algorithms This section presents our analysis algorithms based on the uniform representation of symbolic expressions with CR forms. ...doi:10.1145/1006209.1006226 dblp:conf/ics/EngelenBSWG04 fatcat:hkwj7as4dvcydfx76hqxp7cybi
Target tiles are represented with multiple time slices within each space tile. We explain the basic idea of space-time loop tiling and then illustrate it by means of an example. ... We present a new space-time loop tiling approach and demonstrate its application for the generation of parallel tiled code of enhanced locality for three dynamic programming algorithms. ... Unfortunately, PLuTo fails to tile all loops in a given loop nest in the case of DP programs exposing non-uniform dependences  . This reduces the locality of target tiled code. ...doi:10.3390/electronics10182233 fatcat:a2sfkllnkzedfi6my3oiydeq24
For multivariate distributions, we considered the case of independent marginals and the dependence structure between the marginal distributions described by Gaussian copula. ... In order to demonstrate the accuracy of the improvement, we calculated the corrected estimator for several families of random variables. ... UMO-2014/12/W/ST5/00592, as well as by the Biocentrum-Ochota project POIG02.03.00-00-003/09 and by the European Union from resources of the European Social Fund, Project POKL.04.01.01-00-051/10-00, "Information ...doi:10.3390/e18010013 fatcat:mrx4xuguonghrm52zwkmhl3fkm
« Previous Showing results 1 — 15 out of 15,669 results