Hardware Counters’ Space Reduction for Code Region Characterization

2019 ◽  
pp. 74-86
Author(s):  
Jordi Alcaraz ◽  
Anna Sikora ◽  
Eduardo César
Keyword(s):  
Code Region ◽  
Space Reduction ◽  
Hardware Counters

Design and implementation of Software Defined Hardware Counters for SDN

2016 ◽  
Vol 102 ◽  
pp. 129-144 ◽  
Author(s):  
Tao Zhao ◽  
Tao Li ◽  
Biao Han ◽  
Zhigang Sun ◽  
Jinfeng Huang
Keyword(s):  
Design And Implementation ◽  
Hardware Counters

Solution space reduction of disassembly sequences generated automatically via computer aids

2014 ◽  
Vol 229 (16) ◽  
pp. 2977-2986 ◽  
Author(s):  
Louisa Issaoui ◽  
Nizar Aifaoui ◽  
Abdelmajid Benamara
Keyword(s):  
Solution Space ◽  
Target Component ◽  
Cad Model ◽  
Simulation Tool ◽  
Sequence Generation ◽  
Space Solution ◽  
Space Reduction ◽  
Automatic Sequence ◽  
Selective Disassembly

To develop a simulation tool for automatic disassembly in computer aid design (CAD) environment two difficulties are found: the huge space of generated sequences and their feasibility especially in combinatory generation. This article deals with automatic sequence generation for selective disassembly of mechanical product. Starting from a CAD model a new appropriate connection tree of a target component is constructed. This tree aims at reducing space solution by eliminatory rules. The generation of sequence is based on reading of connection tree branches and eliminatory tests of feasibility. The feasibility is checked by updating the disassembly mobility of each sequence’s element. A case study is presented to prove the effectiveness of the proposed approach.

Infeasibility and Non-Optimality Tests for Solution Space Reduction in Discrete Optimal Design

1992 ◽  
Author(s):  
Leonard P. Pomrehn ◽  
Panos Y. Papalambros
Keyword(s):  
Mathematical Model ◽  
Solution Space ◽  
Global Optimum ◽  
Gear Train ◽  
Discrete Variables ◽  
Multistage Process ◽  
Model Formulation ◽  
Space Reduction ◽  
Nonlinear Design ◽  
The Mathematical Model

Abstract Techniques to be employed for nonlinear design optimization with discrete variables are studied in the context of a particular problem arising from the design of a gear train. The mathematical model formulation was presented in an earlier article. In this sequel, a solution derivation is described, patterned as a multistage process. After certain reformulation and relaxation, a variety of infeasibility and non-optimality tests are performed, greatly reducing the size of the space containing the global optimum. Methods used to investigate the remaining space do not guarantee a global optimum, but could be replaced by more costly methods that do provide such guarantees. A global infimum is generated, bounding any improvements on the best known solution.

Listening space reduction calculations

2021 ◽  
Vol 150 (4) ◽  
pp. A79-A79
Author(s):  
David E. Hannay
Keyword(s):  
Space Reduction
Sign in / Sign up

Export Citation Format

Share Document