Patent
Hardware-software partitioning method based on greedy simulated annealing algorithm
Li Rui,Zhibang Yang,Yi Wang,Cheng Xu,Yan Liu,Bing Huang,Wei Luo,Ting Zhang,Hui Wang +8 more
- 20 Jun 2012
5
TL;DR: In this article, the authors proposed a hardware-software partitioning method based on a greedy simulated annealing algorithm, which is mainly composed of two layer loops, namely an inner loop and an outer loop, wherein the inner loop can generate a new partition according to a disturbance model, and determine and accept the new partitions according to an acceptance criteria.
read more
Abstract: A hardware-software partitioning method based on a greedy simulated annealing algorithm comprises the following steps: (1) specifying the hardware-software partitioning problem as 0-1 knapsack problem, initially partitioning a task set by a greedy algorithm with low time complexity, and setting the partitioning result as the initial value of the simulated annealing algorithm; and (2) performing the simulated annealing algorithm, which is mainly composed of two layer loops, namely an inner loop and an outer loop, wherein the inner loop can generate a new partition according to a disturbance model, and determine and accept the new partition according to an acceptance criteria; and the outer loop is used for determining whether or not to exit the loop process according to a temperature threshold and the number of new partitions which are not accepted continuously. The method provided by the invention can reduce algorithm operation time, improve search quality and reduce calculation complexity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Shuffled frog-leaping based division method of software and hardware
Zhang Tao,Sun Shuting,Cai Xiao,Zhang Caixia +3 more
- 29 Apr 2015
TL;DR: In this article, a shuffled frog-leaping-based division method of software and hardware is presented, which comprises the steps of determining the maximum iterations of the algorithm at the initial; calculating the area and time cost of the hardware in the corresponding software and HMM division scheme corresponding to each frog; descending and sequencing the whole frog group according to the adaptive fitness of individual fog; updating the fog groups in each group at a plurality of times to enable the worst frog in the group to be prior to that of the previous frog as well as meeting the system limitation condition.
8
Patent
Efficient dynamic division method of software and hardware
Zhang Tao,Yu Yike,Zhao Xin,Li Kangkang +3 more
- 29 Apr 2015
TL;DR: In this paper, the authors proposed an efficient dynamic division method of software and hardware, and aimed at designing an embedded system, which comprises the steps of 1) building an accurate mathematic model for software and HMM division problem, 2) simplifying the accurate mathematical model into a low-dimensional simple model according to the relevance of coefficients of a coefficient matrix in a limitation condition, 3) solving the simplified model obtained in step 2) through the automatic division algorithm to obtain the optimal software and HW division scheme, recording the algorithm solving operation time, and observing the simplified mode solving efficiency of
3
Patent
Agreement inventory material order allocation method based on greedy algorithm
Jiang Yong,Chen Weixin,Xue Xiang,Bai Yuanqiang,Lu Suqing,Zhu Feng,Wang Beibei +6 more
- 09 Dec 2015
TL;DR: In this paper, an agreement inventory material order allocation method based on greedy algorithm, comprising a data import and export unit, an information query and display unit, a material allocation unit and an information maintaining unit, is presented.
3
Patent
Software and hardware partitioning method on basis of improved brainstorming algorithms
Tao Zhang,Ganjun Liu,Xin Zhao +2 more
- 14 Aug 2018
TL;DR: In this article, a software and hardware partitioning method based on improved brainstorming algorithms is proposed, which includes initializing parameters; initializing cluster centers; starting iteration updating and ranking individuals from small to large according to fitness values; sequentially starting to compute the distance from each individual toeach cluster center from the first ranked individuals; updating optimal individuals in each cluster; randomly selecting an individual from the clusters and generating a new individual; shifting the randomly selected individual towards global optimal individuals by random lengths randomly generating a newly selected individual meeting hardware area constraint conditions and replacing the selected individual with
1
Patent
Nested dynamic environment change detection method
Zhang Tao,Zhao Xin,Yu Yike,Gao Xinyi +3 more
- 09 Mar 2016
TL;DR: In this article, a nested dynamic environment change detection method is proposed, which consists of extracting characteristic parameters related to a current division task set; setting a sampling number as M; determining whether the current environment division scale is equal to the previous environment division scaling or not; evaluating the fitness of M sampling individuals in the environment, determining whether fitness is the same with that under the previous evaluation or not, so as to determine whether a fitness function of the current environments is equal with that in the previous environments or not.
References
Patent
Formal sequential lagrangian algorithm for large scale resource scheduling optimization
Xiaoming Feng,Yuan Liao,John Dennis Finney,Adolfo M. Fonseca +3 more
- 21 Oct 2004
TL;DR: In this paper, a Lagrangian relaxation based solution method was proposed for large scale resource scheduling problems, which is completely structure-based and does not use any problem domain specific knowledge in the solution process.
10
Patent
Multi-core adaptive & parallel simulated annealing genetic algorithm based on cloud controller
Lili Dong,Guanghong Gong,Ni Li +2 more
- 08 Sep 2010
TL;DR: In this article, a multi-core adaptive and parallel simulated annealing genetic algorithm based on a cloud controller (APSAGABC) is proposed, which mainly overcomes the defect that the traditional genetic algorithms are easily premature and get into local optimum.
8
Related Papers (5)
Qingqing Zhan,Wenxing Zhu,Xiuping He +2 more
- 23 Sep 2010
P. Roussel-Ragot,N. Kouicem,Gérard Dreyfus +2 more
- 01 Oct 1990