Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Genetic algorithms for task scheduling problem

From MaRDI portal
Publication:666007
Jump to:navigation, search

DOI10.1016/j.jpdc.2009.09.009zbMath1233.68077OpenAlexW4361867942MaRDI QIDQ666007

Mona M. Arafa, Fatma A. Omara

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.09.009


zbMATH Keywords

schedulinggenetic algorithmsparallel processinggraph algorithmsevolutionary computingtask partitioning


Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14)


Related Items (3)

Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems ⋮ Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments


Uses Software

  • Hypertool


Cites Work

  • Unnamed Item
  • Benchmarking and comparison of the task graph scheduling algorithms
  • ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS


This page was built for publication: Genetic algorithms for task scheduling problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:666007&oldid=12564333"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 08:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki