.png){kind=icon}
返回
Genetic scheduling for parallel processor systems: comparative studies and performance issues
.png){kind=icon}
PRE
AI
DOI：10.1109/71.790598.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Task scheduling is essential for the proper functioning of parallel processor systems. Scheduling of tasks onto networks of parallel processors is an interesting problem that is well-defined and documented in the literature. However, most of the available techniques are based on heuristics that solve certain instances of the scheduling problem very efficiently and in reasonable amounts of time. This paper investigates an alternative paradigm, based on genetic algorithms, to efficiently solve the scheduling problem without the need to apply any restricted assumptions that are problem-specific, such is the case when using heuristics. Genetic algorithms are powerful search techniques based on the principles of evolution and natural selection. The performance of the genetic approach will be compared to the well-known list scheduling heuristics. The conditions under which a genetic algorithm performs best will also be highlighted. This will be accompanied by a number of examples and case studies.
Keyword:
genetic algorithms
heuristics
parallel processing
scheduling
randomization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Modification of cellulose model surfaces by cationic polymer latexes prepared by RAFT-mediated surfactant-free emulsion polymerization.png)
Polym. Chem.
OAAI
Polym. Chem.IF0
OAAI分享收藏分享收藏The effects of imaginary voluntary muscle contraction and relaxation on cerebellar brain inhibition
PREAI
分享收藏分享收藏Investigation of the optical properties of the Cr doped CuxO thin film deposited by thermionic vacuum arc plasmaOptik
OptikIF0
PREAI
分享收藏
查看更多内容