Search results for "Hard"
showing 10 items of 2294 documents
Unbiased Branches: An Open Problem
2007
The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but they do not consider the impact of unbiased branches, which are difficult-to-predict. In this paper, we evaluate the impact of unbiased branches in terms of prediction accuracy on a range of branch difference predictors using prediction by partial matching, multiple Markov prediction and neural-based prediction. Since our focus is on the impact that unbiased branches have on processor performance, timing issues and hardware costs are out of scope of this investigation. Our simulation results, with the SPEC2000 in…
Improving Computing Systems Automatic Multiobjective Optimization Through Meta-Optimization
2016
This paper presents the extension of framework for automatic design space exploration (FADSE) tool using a meta-optimization approach, which is used to improve the performance of design space exploration algorithms, by driving two different multiobjective meta-heuristics concurrently. More precisely, we selected two genetic multiobjective algorithms: 1) non-dominated sorting genetic algorithm-II and 2) strength Pareto evolutionary algorithm 2, that work together in order to improve both the solutions’ quality and the convergence speed. With the proposed improvements, we ran FADSE in order to optimize the hardware parameters’ values of the grid ALU processor (GAP) micro-architecture from a b…
Developing Domain-Knowledge Evolutionary Algorithms for Network-on-Chip Application Mapping
2013
This paper addresses the Network-on-Chip (NoC) application mapping problem. This is an NP-hard problem that deals with the optimal topological placement of Intellectual Property cores onto the NoC tiles. Network-on-Chip application mapping Evolutionary Algorithms are developed, evaluated and optimized for minimizing the NoC communication energy. Two crossover and one mutation operators are proposed. It is analyzed how each optimization algorithm performs with every genetic operator, in terms of solution quality and convergence speed. Our proposed operators are compared with state-of-the-art genetic operators for permutation problems. Finally, the problem is approached in a multi-objective w…
A genetic algorithm for discrete tomography reconstruction
2007
The aim of this paper is the description of an experiment carried out to verify the robustness of two different approaches for the reconstruction of convex polyominoes in discrete tomography. This is a new field of research, because it differs from classic computerized tomography, and several problems are still open. In particular, the stability problem is tackled by using both a modified version of a known algorithm and a new genetic approach. The effect of both, instrumental and quantization noises has been considered too. © 2007 Springer Science+Business Media, LLC.
ε-Regularized two-level optimization problems: Approximation and existence results
2006
The purpose of this work is to improve some results given in [12], relating to approximate solutions for two-level optimization problems. By considering an e-regularized problem, we get new properties, under convexity assumptions in the lower level problems. In particular, we prove existence results for the solutions to the e-regularized problem, whereas the initial two-level optimization problem may fail to have a solution. Finally, as an example, we consider an approximation method with interior penalty functions.
A Formal Passage From a System of Boltzmann Equations for Mixtures Towards a Vlasov-Euler System of Compressible Fluids
2019
A formal asymptotics leading from a system of Boltzmann equations for mixtures towards either Vlasov-Navier-Stokes or Vlasov-Stokes equations of incompressible fluids was established by the same authors and Etienne Bernard in: A Derivation of the Vlasov-Navier-Stokes Model for Aerosol Flows from Kinetic Theory Commun. Math. Sci., 15: 1703–1741 (2017) and A Derivation of the Vlasov-Stokes System for Aerosol Flows from the Kinetic Theory of Binary Gas Mixtures. KRM, 11: 43–69 (2018). With the same starting point but with a different scaling, we establish here a formal asymptotics leading to the Vlasov-Euler system of compressible fluids. Explicit formulas for the coupling terms are obtained i…
In between the inequalities of Sobolev and Hardy
2016
We establish both sufficient and necessary conditions for the validity of the so-called Hardy–Sobolev inequalities on open sets of the Euclidean space. These inequalities form a natural interpolating scale between the (weighted) Sobolev inequalities and the (weighted) Hardy inequalities. The Assouad dimension of the complement of the open set turns out to play an important role in both sufficient and necessary conditions. peerReviewed
Muckenhoupt $A_p$-properties of distance functions and applications to Hardy-Sobolev -type inequalities
2017
Let $X$ be a metric space equipped with a doubling measure. We consider weights $w(x)=\operatorname{dist}(x,E)^{-\alpha}$, where $E$ is a closed set in $X$ and $\alpha\in\mathbb R$. We establish sharp conditions, based on the Assouad (co)dimension of $E$, for the inclusion of $w$ in Muckenhoupt's $A_p$ classes of weights, $1\le p<\infty$. With the help of general $A_p$-weighted embedding results, we then prove (global) Hardy-Sobolev inequalities and also fractional versions of such inequalities in the setting of metric spaces.
Noncommutative Davis type decompositions and applications
2018
We prove the noncommutative Davis decomposition for the column Hardy space $\H_p^c$ for all $0<p\leq 1$. A new feature of our Davis decomposition is a simultaneous control of $\H_1^c$ and $\H_q^c$ norms for any noncommutative martingale in $\H_1^c \cap \H_q^c$ when $q\geq 2$. As applications, we show that the Burkholder/Rosenthal inequality holds for bounded martingales in a noncommutative symmetric space associated with a function space $E$ that is either an interpolation of the couple $(L_p, L_2)$ for some $1<p<2$ or is an interpolation of the couple $(L_2, L_q)$ for some $2<q<\infty$. We also obtain the corresponding $\Phi$-moment Burkholder/Rosenthal inequality for Orlicz functions that…
Fractional Hardy-Sobolev type inequalities for half spaces and John domains
2018
As our main result we prove a variant of the fractional Hardy-Sobolev-Maz'ya inequality for half spaces. This result contains a complete answer to a recent open question by Musina and Nazarov. In the proof we apply a new version of the fractional Hardy-Sobolev inequality that we establish also for more general unbounded John domains than half spaces.