Assigning real-time tasks to heterogeneous processors by applying ant colony optimization

The problem of determining whether a set of periodic tasks can be assigned to a set of heterogeneous processors without deadline violations has been shown, in general, to be NP-hard. This paper presents a new algorithm based on ant colony optimization (ACO) metaheuristic for solving this problem. A...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of parallel and distributed computing Ročník 71; číslo 1; s. 132 - 142
Hlavní autoři:	Chen, Hua, Cheng, Albert Mo Kim, Kuo, Ying-Wei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier Inc 2011 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Ant colony optimization Applied sciences Colonies Computer science; control theory; systems Computer systems and distributed systems. User interface Energy of solution Energy use Exact sciences and technology Heterogeneous processors Language processing and microprogramming Mathematical models Multiprocessors Optimization Periodic tasks Power-aware computing Processors Prototypes Real-time systems Scheduling Searching Software Theoretical computing Heterogeneous processors Ant colony optimization Multiprocessors Power-aware computing Periodic tasks Scheduling Real-time systems Energy consumption Insecta Formicoidea Multiprocessor Space complexity Swarm intelligence Metamodel Aculeata Local search Deadline Periodicity Social insect Real time Computational complexity Processor scheduling Arthropoda Heuristic method NP hard problem Problem solving Hymenoptera Invertebrata Time complexity
ISSN:	0743-7315, 1096-0848
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!