Rocha et al., 2020 - Google Patents
A routing based genetic algorithm for task mapping on MPSoCRocha et al., 2020
- Document ID
- 5231520799189599995
- Author
- Rocha H
- Beck A
- Maia S
- Kreutz M
- Pereira M
- Publication year
- Publication venue
- 2020 X Brazilian Symposium on Computing Systems Engineering (SBESC)
External Links
Snippet
This work proposes an optimized task mapping solution called Routing Model-based Genetic Algorithm (RMGA) that combines task mapping and routing problems using an Integer Linear Programming (ILP) model as a fitness function. We compared our proposed …
- 230000002068 genetic 0 title abstract description 18
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5045—Circuit design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
- G06F2217/78—Power analysis and optimization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
- H04L41/145—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning involving simulating, designing, planning or modelling of a network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/06—Deflection routing, e.g. hot-potato routing
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11544441B2 (en) | Automated network-on-chip design | |
| Sepúlveda et al. | A multi-objective approach for multi-application NoC mapping | |
| Mesidis et al. | Genetic mapping of hard real-time applications onto NoC-based MPSoCs—A first approach | |
| Khan et al. | An efficient algorithm for mapping real time embedded applications on NoC architecture | |
| Harish Ram et al. | A novel framework for applying multiobjective GA and PSO based approaches for simultaneous area, delay, and power optimization in high level synthesis of datapaths | |
| Xu et al. | Unified multi‐objective mapping for network‐on‐chip using genetic‐based hyper‐heuristic algorithms | |
| Velasquez et al. | A rank-based mechanism for service placement in the fog | |
| Silva et al. | An investigation of latency prediction for NoC-based communication architectures using machine learning techniques: J. Silva et al. | |
| Rocha et al. | A routing based genetic algorithm for task mapping on MPSoC | |
| Tang et al. | Routing pressure: A channel-related and traffic-aware metric of routing algorithm | |
| Ascia et al. | Mapping cores on network-on-chip | |
| Shruthi et al. | Comprehensive survey on wireless network on chips | |
| Khan et al. | An optimized hybrid algorithm in term of energy and performance for mapping real time workloads on 2d based on-chip networks | |
| Sacanamboy | Heuristic algorithm for task mapping problem in a hierarchical wireless network-on-chip architecture | |
| Baharvand et al. | Optimizing service function chaining and scheduling with deep Q-learning for enhanced quality of experience in edge networks | |
| Reza et al. | Heuristics-enabled high-performance application mapping in network-on-chip based multicore systems | |
| Sepúlveda et al. | A multi-objective adaptive immune algorithm for multi-application NoC mapping | |
| Phanibhushana et al. | Network-on-chip design for heterogeneous multiprocessor system-on-chip | |
| Morgan et al. | Bio-inspired NoC architecture optimization | |
| Andújar et al. | Extending the VEF traces framework to model data center network workloads | |
| Tei et al. | Network Partitioning Domain Knowledge Multiobjective Application Mapping for Large‐Scale Network‐on‐Chip | |
| Gomes de Araujo Rocha et al. | Using evolutionary metaheuristics to solve the mapping and routing problem in networks on chip | |
| Vinícius et al. | Optimal IP assignment for efficient NoC-based system implementation using NSGA-II and MicroGA | |
| Mirka et al. | Gannoc: A framework for automatic generation of noc topologies using generative adversarial networks | |
| Walter et al. | The era of many-modules SoC: revisiting the NoC mapping problem |