GENETIC SCHEDULING OF TASK GRAPHS
A genetic algorithm for scheduling computational task graphs is presented. The problem of assigning tasks to processing elements as a combinatorital optimization is formulated, and a heuristic based on a genetic algorithm is presented. The objective function to be minimized is the 'time on comp...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/423/1/Genetic_graphs.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513380299046912 |
|---|---|
| author | Benten, M. S. |
| author2 | Sait, Sadiq M. unknown |
| author2_role | author author |
| author_facet | Benten, M. S. Sait, Sadiq M. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Benten, M. S. Sait, Sadiq M. unknown |
| dc.date.*.fl_str_mv | 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/423/1/Genetic_graphs.pdf GENETIC SCHEDULING OF TASK GRAPHS. INTERNATIONAL JOURNAL OF ELECTRONICS 77 (4): 401-415 OCT 1994. |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/423/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | GENETIC SCHEDULING OF TASK GRAPHS |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | A genetic algorithm for scheduling computational task graphs is presented. The problem of assigning tasks to processing elements as a combinatorital optimization is formulated, and a heuristic based on a genetic algorithm is presented. The objective function to be minimized is the 'time on completion\ of all tasks. Results are compared with those published in the literature and with randomly generated task graphs whose optimal schedules are known a priori. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_2bc1b491e40602216b9c66d281159345 |
| identifier_str_mv | GENETIC SCHEDULING OF TASK GRAPHS. INTERNATIONAL JOURNAL OF ELECTRONICS 77 (4): 401-415 OCT 1994. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::423 |
| publishDate | 2020 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | GENETIC SCHEDULING OF TASK GRAPHSBenten, M. S.Sait, Sadiq M.unknownComputerA genetic algorithm for scheduling computational task graphs is presented. The problem of assigning tasks to processing elements as a combinatorital optimization is formulated, and a heuristic based on a genetic algorithm is presented. The objective function to be minimized is the 'time on completion\ of all tasks. Results are compared with those published in the literature and with randomly generated task graphs whose optimal schedules are known a priori.ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/423/1/Genetic_graphs.pdf GENETIC SCHEDULING OF TASK GRAPHS. INTERNATIONAL JOURNAL OF ELECTRONICS 77 (4): 401-415 OCT 1994. enhttps://eprints.kfupm.edu.sa/id/eprint/423/2020info:eu-repo/semantics/openAccessoai::4232019-11-01T13:23:54Z |
| spellingShingle | GENETIC SCHEDULING OF TASK GRAPHS Benten, M. S. Computer |
| status_str | publishedVersion |
| title | GENETIC SCHEDULING OF TASK GRAPHS |
| title_full | GENETIC SCHEDULING OF TASK GRAPHS |
| title_fullStr | GENETIC SCHEDULING OF TASK GRAPHS |
| title_full_unstemmed | GENETIC SCHEDULING OF TASK GRAPHS |
| title_short | GENETIC SCHEDULING OF TASK GRAPHS |
| title_sort | GENETIC SCHEDULING OF TASK GRAPHS |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/423/1/Genetic_graphs.pdf |