scholarly journals Generic Algorithms for Scheduling Applications on Hybrid Multi-core Machines

2017 ◽  
pp. 220-231 ◽  
Author(s):  
Marcos Amaris ◽  
Giorgio Lucarelli ◽  
Clément Mommessin ◽  
Denis Trystram
Keyword(s):  
Generic Algorithms

The Novel Approach

2017 ◽  
pp. 1-12
Keyword(s):  
Risk Management ◽  
Project Management ◽  
Quality Management ◽  
Portfolio Management ◽  
Six Sigma ◽  
The Novel ◽  
Mathematical Concepts ◽  
Process Flow ◽  
Novel Approach ◽  
Generic Algorithms

This chapter presents the novel Six Sigma DMAIC generic approach to Risk Management. The method is introduced first. In The Generic Approach and Algorithms section, generic mathematical concepts are elaborated. Also, four generic classes of applications of the proposed method are identified including: 1) Portfolio Management; 2) Quality Management; 3) Project Management; and 4) Income Management. Furthermore, four generic algorithms are elaborated for the respective four classes of application of the method. The generic algorithms include description and process flow of the applications. Finally, the modelling tools used in the book's elaborations are detailed, as well as references for how to use these tools and run Simulation and Stochastic Optimisation step-by-step.

A Generic Guide for Using Membrane Computing in Robot Control

2017 ◽  
pp. 86-96
Keyword(s):  
Operating Systems ◽  
Membrane Computing ◽  
Task Complexity ◽  
Future Research ◽  
Research Directions ◽  
Robot Controller ◽  
Swarm Algorithms ◽  
Future Research Directions ◽  
High Level ◽  
Generic Algorithms

As various theoretical and practical details of using membrane computing models have been presented throughout the book, certain details might be hard to find at a later time. For this reason, this chapter provides the reader with a set of checkmark topics that a developer should address in order to implement a robot controller using a membrane computing model. The topics discussed address areas such as: (1) robot complexity, (2) number of robots, (3) task complexity, (4) simulation versus real world execution, (5) sequential versus parallel implementations. This chapter concludes with an overview of future research directions. These directions offer possible solutions for several important concerns: the development of complex generic algorithms that use a high level of abstraction, the design of swarm algorithms using a top-down (swarm-level) approach and ensuring the predictability of a controller by using concepts such as those used in real-time operating systems.

Coupled Aero-Thermodynamics Optimization for the Cooling System of a Turbine Vane

2013 ◽  
Author(s):  
Zhongran Chi ◽  
Jing Ren ◽  
Hongde Jiang
Keyword(s):  
Temperature Distribution ◽  
System Design ◽  
Optimization Design ◽  
Cooling System ◽  
Critical Issue ◽  
Operating Conditions ◽  
Critical Parameters ◽  
Pin Fin ◽  
Optimization Search ◽  
Generic Algorithms

Cooling system design for the air-cooled turbine is a critical issue in modern gas turbine engineering. Advances in CFD technology and optimization methodology is providing new prospects for turbine cooling system design, that the optimum cooling system of the vanes and blades could be designed automatically by the optimization search coupled with the Conjugate Heat Transfer (CHT) analysis. An optimization platform consists of the Generic Algorithms (GA), a mesh generation tool (Coolmesh), and the CHT solver (ANSYS CFX) is presented in this paper. The optimization study was aimed at finding the optimum cooling structure for the 2nd stage vane of the E3 engine, with acceptable metal temperature distribution and limited coolant amount simultaneously. The vane was installed with impingement and pin-fin cooling structure. The optimization search involved the design of critical parameters of the cooling system, including the size of impingement tube, diameter and distribution of impingement holes, and the size and distribution of pin-fin near trailing edge. The optimization design was carried under two engine operating conditions to explore the affect of different boundary conditions. A constant pressure drop was assumed within the cooling system during each optimization. To make the problem computationally faster, the simulations were approached for the interior only (solid and coolant). A weighed function of temperature distribution and coolant mass flow was used as the objective of the Single Objective Generic Algorithms (SOGA). The result showed that the optimal cooling system configuration with considerable cooling performance could be designed through SOGA optimization without human interference.

scholarly journals GRCircuit - Functional Macro Blocks Circuit Recovering Tool

2021 ◽  
Author(s):  
Leandro Maia Maia Silva ◽  
Fabricio Vivas Andrade ◽  
Luiz Filipe Menezes Vieira
Keyword(s):  
Design Automation ◽  
Logic Gates ◽  
Conjunctive Normal Form ◽  
Maximum Amount ◽  
Boolean Satisfiability ◽  
Levels Of Abstraction ◽  
Complex Structural ◽  
Problem Solvers ◽  
Structural Blocks ◽  
Generic Algorithms

Abstract Considering that the more information you can gather about a particular circuit, you can address problems more accurately in the Eletronic Design Automation (EDA) eld, therefore, many tools focus on obtaining the maximum amount of information about the input to which it is provided in order to determine which are the best algorithms to each instance. Some of these tools are the Boolean Satisfiability (SAT) problem solvers; which, for the most part, receive formulas described in Conjunctive Normal Form (CNF) as input. The circuits encoding process to the CNF format, unfortunately, destroy much of the information that could have been used to optimize SAT solvers, as part of this informations must be recovered to avoid applying generic algorithms in the solution of SAT problems. One of the difficult aspects of retrieving this information corresponds to the matching of clauses to its respective logic gates, as well as which sets of logic gates correlate to a functional block. The present work makes use of subgraph isomorphism algorithms to recover circuits encoded in CNF-DIMACS maximimizing the number of clauses handled, both at the level of logic gates as well as more complex structural blocks, which allow their identification at higher levels of abstraction. Our tool was able to successfully recover all circuits

Sign in / Sign up

Export Citation Format

Share Document