A boundle of on-line algorithms for scheduling computational tasks
We deal with the problem of scheduling the set of computational tasks on parallel identical processors. Each task needs a predefined number of processors to perform. The problem is known in scheduling theory and has been considered up to now by a few authors. Starting from the formal original descri...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2025-06-01
|
| Series: | International Journal of Electronics and Telecommunications |
| Subjects: | |
| Online Access: | https://journals.pan.pl/Content/135250/8_5023_L_Dorota_sk.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850233191011450880 |
|---|---|
| author | Dariusz Dorota Czeslaw Smutnicki |
| author_facet | Dariusz Dorota Czeslaw Smutnicki |
| author_sort | Dariusz Dorota |
| collection | DOAJ |
| description | We deal with the problem of scheduling the set of computational tasks on parallel identical processors. Each task needs a predefined number of processors to perform. The problem is known in scheduling theory and has been considered up to now by a few authors. Starting from the formal original description of the problem, we provide a mathematical model and then propose, at first, the solution method in the deterministic case. In fact, the paper focuses chiefly on the nondeterministic variant of the problem. We have proposed several online algorithms for this case. These algorithms are evaluated through competitive analysis and experiments. The practical application of the problem can be found in embedded systems with increased dependability obtained through hardware and software redundancy. |
| format | Article |
| id | doaj-art-434aa69ecd484ddc8080c797d0ccd72c |
| institution | OA Journals |
| issn | 2081-8491 2300-1933 |
| language | English |
| publishDate | 2025-06-01 |
| publisher | Polish Academy of Sciences |
| record_format | Article |
| series | International Journal of Electronics and Telecommunications |
| spelling | doaj-art-434aa69ecd484ddc8080c797d0ccd72c2025-08-20T02:02:58ZengPolish Academy of SciencesInternational Journal of Electronics and Telecommunications2081-84912300-19332025-06-01vol. 71No 2397402https://doi.org/10.24425/ijet.2025.153585A boundle of on-line algorithms for scheduling computational tasksDariusz Dorota0Czeslaw Smutnicki1Cracow University of Technology, Crakow, PolandWrocław University of Science and Technology, Wrocław, PolandWe deal with the problem of scheduling the set of computational tasks on parallel identical processors. Each task needs a predefined number of processors to perform. The problem is known in scheduling theory and has been considered up to now by a few authors. Starting from the formal original description of the problem, we provide a mathematical model and then propose, at first, the solution method in the deterministic case. In fact, the paper focuses chiefly on the nondeterministic variant of the problem. We have proposed several online algorithms for this case. These algorithms are evaluated through competitive analysis and experiments. The practical application of the problem can be found in embedded systems with increased dependability obtained through hardware and software redundancy.https://journals.pan.pl/Content/135250/8_5023_L_Dorota_sk.pdfmultiprocessor taskson-line scheduling |
| spellingShingle | Dariusz Dorota Czeslaw Smutnicki A boundle of on-line algorithms for scheduling computational tasks International Journal of Electronics and Telecommunications multiprocessor tasks on-line scheduling |
| title | A boundle of on-line algorithms for scheduling computational tasks |
| title_full | A boundle of on-line algorithms for scheduling computational tasks |
| title_fullStr | A boundle of on-line algorithms for scheduling computational tasks |
| title_full_unstemmed | A boundle of on-line algorithms for scheduling computational tasks |
| title_short | A boundle of on-line algorithms for scheduling computational tasks |
| title_sort | boundle of on line algorithms for scheduling computational tasks |
| topic | multiprocessor tasks on-line scheduling |
| url | https://journals.pan.pl/Content/135250/8_5023_L_Dorota_sk.pdf |
| work_keys_str_mv | AT dariuszdorota aboundleofonlinealgorithmsforschedulingcomputationaltasks AT czeslawsmutnicki aboundleofonlinealgorithmsforschedulingcomputationaltasks AT dariuszdorota boundleofonlinealgorithmsforschedulingcomputationaltasks AT czeslawsmutnicki boundleofonlinealgorithmsforschedulingcomputationaltasks |