Multiprocessor task scheduling method based on harmony search and simulated annealing

A technology of task scheduling and simulated annealing, which is used in electrical digital data processing, special data processing applications, multi-programming devices, etc. to achieve the effect of enhancing search speed and improving search speed.

Inactive Publication Date: 2013-02-06
李英明
View PDF2 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

They proposed it based on the phenomenon that musicians rely on their own memory to repeatedly adjust the pitch of each instrument in the band to achieve a state of beautiful harmony. Although HS was proposed later, it is simple, robust, and The advantages of fast convergence speed have been applied and developed in many fields. The harmony search algorithm belongs to the heuristic group intelligence optimization algorithm. It has a continuous nature and has been widely used in many continuous optimization problems. The simulated annealing algorithm is the earliest It is proposed for combinatorial optimization. Its characteristic is that it can jump out of the local minimum during the search process and eventually tend to the global optimum. Therefore, it has the advantages of high quality, strong initial value robustness, and easy implementation in general. For example, Yu Liang et al. used the harmony search algorithm to solve the water distribution optimization system design, and achieved better results, but it has not been widely used in the field of multiprocessor scheduling

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multiprocessor task scheduling method based on harmony search and simulated annealing
  • Multiprocessor task scheduling method based on harmony search and simulated annealing
  • Multiprocessor task scheduling method based on harmony search and simulated annealing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] see figure 1 , the present invention is a kind of method based on harmony search and the multiprocessor task scheduling of simulated annealing, comprises the following steps:

[0034] (1) Initialize HS related parameters, initial temperature T, cooling coefficient t

[0035] In order to find the optimal solution, the SA algorithm usually needs to set a higher initial temperature, but experiments have shown that the higher the initial temperature, the longer the time it takes. Therefore, in order to make the search quality and efficiency reach a relatively balanced state, the initial temperature is selected as 500.

[0036] (2) Initialize the harmony library (HM), use the fine-tuning probability to make the HS algorithm generate a new solution Xnew to update the HM library, and find the optimal solution Xopt;

[0037] Initialization parameters =0, the upper and lower bounds of the harmonic solution variables , , choose the probability parameter , fine-tuning...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a multiprocessor task scheduling algorithm based on harmony search and simulated annealing. The algorithm lies in fusion of harmony search and simulated annealing and includes: firstly, initializing harmony algorithm related parameters and a harmony base; secondly, directly performing annealing process to a task sequence corresponding to an optimal harmony solution in the harmony base so as to enhance search speed of the algorithm. The optimal solution is stored, probabilistic leap of SA (simulated annealing) algorithm is given to full play, a local minimum point is got rid of, and accordingly algorithmic performance is improved effectively. In addition, the modified algorithm is successfully applied to task scheduling of a multiprocessor. Verification shows that the algorithm has a scheduling strategy better than the traditional algorithm in operating efficiency.

Description

technical field [0001] The invention relates to a method for improving the processing speed of a computer, in particular to a multiprocessor task scheduling method based on harmony search and simulated annealing. Background technique [0002] The problem of multiprocessor scheduling arises with the development of computers. With the rapid enhancement of the performance of microprocessors, new fast networks appear constantly, resulting in high-performance computer systems, namely distributed systems. The efficiency of distributed system processing tasks largely depends on the task scheduling of processors. Therefore, the emergence of distributed systems promotes researchers to study the scheduling of multiprocessors more deeply. [0003] Multiprocessor Task Scheduling Problem (MTS) is a kind of combinatorial optimization problem, it is NP-hard problem, and it is also an integral part of parallel and distributed computing. The multiprocessor scheduling problem is primarily a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30G06F9/46
Inventor 李英明姜华刘彦秀
Owner 李英明
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap