Back
Scheduling tasks with uncertain times of duration
Authors:
- Dariusz Dorota
Abstract
This paper describes methods of scheduling depend tasks. Algorithm based on effective previous research of author work that consider scheduling of task with divisibility attribute with higher level of dependability. As a specification was used as a acyclic task graph which specifies the tasks and their dependencies. In this work duration of task is specified using probabilistic method, especially normal distribution of probability. The research focuses on scheduling tasks under selected uncertainty conditions.
- Record ID
- CUTc420ca0e8729406d954bd69ba0b24173
- Publication categories
- ; ;
- Author
- Pages
- 197-209
- Other elements of collation
- Bibliografia (liczba pozycji) - 31; Oznaczenie streszczenia - Abstr.
- Substantive notes
- Punktacja MNiSW/MEiN (rozdział) - 20
- Book
- Zamojski Wojciech, Wojciech Zamojski Mazurkiewicz Jacek, Jacek Mazurkiewicz Sugier Jarosław Jarosław Sugier [et al.] (eds.): Theory and Applications of Dependable Computer Systems: proceedings of the Fifteenth International Conference on Dependability of Computer Systems DepCoS-RELCOMEX, June 29 – July 3, 2020, Brunów, Poland, Advances in Intelligent Systems and Computing, no. 1173, 2020, Cham, Springer, Springer, ISBN 978-3-030-48256-5 (online)
- Keywords in English
- scheduling task, multiprocessor-processor task, divisibility of the task, uncertain times of duration
- DOI
- DOI:10.1007/978-3-030-48256-5_20 Opening in a new tab
- URL
- https://link.springer.com/chapter/10.1007/978-3-030-48256-5_20 Opening in a new tab
- Language
- eng (en) English
- Score (nominal)
- 40
- Additional fields
- Indeksowana w: Scopus, CORE
- Uniform Resource Identifier
- https://cris.pk.edu.pl/info/article/CUTc420ca0e8729406d954bd69ba0b24173/
- URN
urn:pkr-prod:CUTc420ca0e8729406d954bd69ba0b24173
* presented citation count is obtained through Internet information analysis, and it is close to the number calculated by the Publish or PerishOpening in a new tab system.