Extended histories: improving regularity and performance in correlation prefetchers

Data Prefetchers identify and make use of any regularity present in the history/training stream to predict future references and prefetch them into the cache. The training information used is typically the primary misses seen at a particular cache level, which is a filtered version of the accesses seen by the cache. In this work we demonstrate that extending the training information to include secondary misses and hits along with primary misses helps improve the performance of prefetchers. In addition to empirical evaluation, we use the information theoretic metric entropy, to quantify the regularity present in extended histories. Entropy measurements indicate that extended histories are more regular than the default primary miss only training stream. Entropy measurements also help corroborate our empirical findings. With extended histories, further benefits can be achieved by triggering prefetches during secondary misses also. In this paper we explore the design space of extended prefetch histories and alternative prefetch trigger points for delta correlation prefetchers. We observe that different prefetch schemes benefit to a different extent with extended histories and alternative trigger points. Also the best performing design point varies on a per-benchmark basis. To meet these requirements, we propose a simple adaptive scheme that identifies the best performing design point for a benchmark-prefetcher combination at runtime. In SPEC2000 benchmarks, using all the L2 accesses as history for prefetcher improves the performance in terms of both IPC and misses reduced over techniques that use only primary misses as history. The adaptive scheme improves the performance of CZone prefetcher over Baseline by 4.6% on an average. These performance gains are accompanied by a moderate reduction in the memory traffic requirements.

Some regularity theorems for CR mappings

The purpose of this article is to study Lipschitz CR mappings from an h-extendible (or semi-regular) hypersurface in . Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A rigidity result for proper holomorphic mappings from strongly pseudoconvex domains is also proved.

Error analysis of discontinuous Galerkin methods for the Stokes problem under minimal regularity

In this article, we analyse several discontinuous Galerkin (DG) methods for the Stokes problem under minimal regularity on the solution. We assume that the velocity u belongs to H-0(1)(Omega)](d) and the pressure p is an element of L-0(2)(Omega). First, we analyse standard DG methods assuming that the right-hand side f belongs to H-1(Omega) boolean AND L-1(Omega)](d). A DG method that is well defined for f belonging to H-1(Omega)](d) is then investigated. The methods under study include stabilized DG methods using equal-order spaces and inf-sup stable ones where the pressure space is one polynomial degree less than the velocity space.

Regimes of nonlinear depletion and regularity in the 3D Navier-Stokes equations

The periodic 3D Navier-Stokes equations are analyzed in terms of dimensionless, scaled, L-2m-norms of vorticity D-m (1 <= m <= infinity). The first in this hierarchy, D-1, is the global enstrophy. Three regimes naturally occur in the D-1-D-m plane. Solutions in the first regime, which lie between two concave curves, are shown to be regular, owing to strong nonlinear depletion. Moreover, numerical experiments have suggested, so far, that all dynamics lie in this heavily depleted regime 1]; new numerical evidence for this is presented. Estimates for the dimension of a global attractor and a corresponding inertial range are given for this regime. However, two more regimes can theoretically exist. In the second, which lies between the upper concave curve and a line, the depletion is insufficient to regularize solutions, so no more than Leray's weak solutions exist. In the third, which lies above this line, solutions are regular, but correspond to extreme initial conditions. The paper ends with a discussion on the possibility of transition between these regimes.

Strain Regularity and Stiffness Tensor of Reinforcers in Dense Particle Reinforced Composites

针对高体积份数、随机分布、等轴状颗粒增强复合材料 ,研究了材料的应变分布规律 ,给出了基体和增强体应变平均值与材料微观结构参数之间的定量关系。结果表明 ,除应变平均值外 ,应变涨落是影响刚度张量的另一个重要因素 ,研究了应变涨落与材料微观结构参数之间的关系 ,并推导出了复合材料的刚度张量。与实验结果和以往的理论比较 ,预测结果与实验结果吻合良好

Regularity of strain distribution in short-fiber/whisker reinforced composites

Based on studies on the strain distribution in short-fiber/whisker reinforced metal matrix composites, a deformation characteristic parameter, lambda is defined as a ratio of root-mean-square strain of the reinforcers identically oriented to the macro-linear strain along the same direction. Quantitative relation between lambda and microstructure parameters of composites is obtained. By using lambda, the stiffness moduli of composites with arbitrary reinforcer orientation density function and under arbitrary loading condition are derived. The upper-bound and lower-bound of the present prediction are the same as those from the equal-strain theory and equal-stress theory, respectively. The present theory provides a physical explanation and theoretical base for the present commonly-used empirical formulae. Compared with the microscopic mechanical theories, the present theory is competent for stiffness modulus prediction of practical engineering composites in accuracy and simplicity.

Approximate Best Proximity Points of Cyclic Self-maps in Metric Spaces and Cyclic Asymptotic Regularity

3rd International Conference on Mathematical Modeling in Physical Sciences (IC-MSQUARE) Madrid, AUG 28-31, 2014 / editado por Vagenas, EC; Vlachos, DS; Bastos, C; Hofer, T; Kominis, Y; Kosmas, O; LeLay, G; DePadova, P; Rode, B; Suraud, E; Varga, K

Synthesizing Regularity Exposing Attributes in Large Protein Databases

This thesis describes a system that synthesizes regularity exposing attributes from large protein databases. After processing primary and secondary structure data, this system discovers an amino acid representation that captures what are thought to be the three most important amino acid characteristics (size, charge, and hydrophobicity) for tertiary structure prediction. A neural network trained using this 16 bit representation achieves a performance accuracy on the secondary structure prediction problem that is comparable to the one achieved by a neural network trained using the standard 24 bit amino acid representation. In addition, the thesis describes bounds on secondary structure prediction accuracy, derived using an optimal learning algorithm and the probably approximately correct (PAC) model.

Maximal L p -regularity for the Laplacian on Lipschitz domains

I.Wood: Maximal Lp-regularity for the Laplacian on Lipschitz domains, Math. Z., 255, 4 (2007), 855-875.

Intersubject Regularity in the Intrinsic Shape of Human V1

Previous studies have reported considerable intersubject variability in the three-dimensional geometry of the human primary visual cortex (V1). Here we demonstrate that much of this variability is due to extrinsic geometric features of the cortical folds, and that the intrinsic shape of V1 is similar across individuals. V1 was imaged in ten ex vivo human hemispheres using high-resolution (200 μm) structural magnetic resonance imaging at high field strength (7 T). Manual tracings of the stria of Gennari were used to construct a surface representation, which was computationally flattened into the plane with minimal metric distortion. The instrinsic shape of V1 was determined from the boundary of the planar representation of the stria. An ellipse provided a simple parametric shape model that was a good approximation to the boundary of flattened V1. The aspect ration of the best-fitting ellipse was found to be consistent across subject, with a mean of 1.85 and standard deviation of 0.12. Optimal rigid alignment of size-normalized V1 produced greater overlap than that achieved by previous studies using different registration methods. A shape analysis of published macaque data indicated that the intrinsic shape of macaque V1 is also stereotyped, and similar to the human V1 shape. Previoud measurements of the functional boundary of V1 in human and macaque are in close agreement with these results.

Regularity of invariant densities for 1D systems with random switching

© 2015 IOP Publishing Ltd & London Mathematical Society.This is a detailed analysis of invariant measures for one-dimensional dynamical systems with random switching. In particular, we prove the smoothness of the invariant densities away from critical points and describe the asymptotics of the invariant densities at critical points.

General Harris regularity criterion for non-linear Markov branching processes

We extend the Harris regularity condition for ordinary Markov branching process to a more general case of non-linear Markov branching process. A regularity criterion which is very easy to check is obtained. In particular, we prove that a super-linear Markov branching process is regular if and only if the per capita offspring mean is less than or equal to I while a sub-linear Markov branching process is regular if the per capita offspring mean is finite. The Harris regularity condition then becomes a special case of our criterion.