2020
DOI: 10.2991/ijcis.d.200617.001
|View full text |Cite
|
Sign up to set email alerts
|

An Integer Cat Swarm Optimization Approach for Energy and Throughput Efficient MPSoC Design

Abstract: Modern multicore architectures have an ability to allocate optimum system resources for a specific application to have improved energy and throughput balance. The system resources can be optimized automatically by using optimization algorithms. Stateof-the-art using optimization algorithm in the field of such architectures has shown promising results in terms of minimized energy consumption through configuration of number of CPU cores, limited cache sizes and operating frequency. We propose, in this work, a Ca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 32 publications
(49 reference statements)
0
2
0
Order By: Relevance
“…Step 2: Classify each cat randomly into seeking and tracing mode according to the Mixing Ratio (MR) of 0.30 [13]. For example, if 10 cats are generated, 3 cats will go in tracing mode while the remaining 7 cats will go in seeking mode.…”
Section: Table 3 Pseudocode Of Seeking Mode In Csomentioning
confidence: 99%
“…Step 2: Classify each cat randomly into seeking and tracing mode according to the Mixing Ratio (MR) of 0.30 [13]. For example, if 10 cats are generated, 3 cats will go in tracing mode while the remaining 7 cats will go in seeking mode.…”
Section: Table 3 Pseudocode Of Seeking Mode In Csomentioning
confidence: 99%
“…Since the time complexity of ILP-based algorithms does not allow them to scale well to larger problem sizes, meta-heuristic algorithms, such as evolutionary and swarm algorithms, are more commonly used today [ 22 ]. They do not make assumptions on the objective functions, and because of that are more flexible, efficient and can find near-optimal solutions in a considerably shorter time [ 16 , 23 , 24 , 25 , 26 , 27 ]. Typically, these algorithms execute many unguided and independent searches from different starting points to increase the chance of reaching global optima.…”
Section: Related Workmentioning
confidence: 99%