Standard

Cyclic Scheduling for Parallel Processors with Precedence Constrains. / Grigoreva, N. .

в: Journal of Physics: Conference Series, Том 1658, № 1, 012019, 17.10.2020, стр. 012019.

Результаты исследований: Научные публикации в периодических изданиях › статья в журнале по материалам конференции › Рецензирование

Harvard

Grigoreva, N 2020, 'Cyclic Scheduling for Parallel Processors with Precedence Constrains', Journal of Physics: Conference Series, Том. 1658, № 1, 012019, стр. 012019. https://doi.org/10.1088/1742-6596/1658/1/012019

APA

Grigoreva, N. (2020). Cyclic Scheduling for Parallel Processors with Precedence Constrains. Journal of Physics: Conference Series, 1658(1), 012019. [012019]. https://doi.org/10.1088/1742-6596/1658/1/012019

Vancouver

Grigoreva N. Cyclic Scheduling for Parallel Processors with Precedence Constrains. Journal of Physics: Conference Series. 2020 Окт. 17;1658(1):012019. 012019. https://doi.org/10.1088/1742-6596/1658/1/012019

Author

Grigoreva, N. . / Cyclic Scheduling for Parallel Processors with Precedence Constrains. в: Journal of Physics: Conference Series. 2020 ; Том 1658, № 1. стр. 012019.

BibTeX

@article{feab8057c7394ee4aaa0a3fa64397c5f,
title = "Cyclic Scheduling for Parallel Processors with Precedence Constrains",
abstract = "The goal of this paper is to prepare algorithms of the cyclic scheduling problem, in which some set of jobs V is to be repeated an infinite number of times. We consider the multiprocessors problem when a set of jobs is done on identical parallel processors. Cyclic scheduling problems arise (for example) in manufacturing, timesharing of processors in embedded systems. The goal is to find a periodic schedule that minimizes the cycle time under precedence constraints. Although the problem is NP-hard, we show that the special case, where the precedence graph G is a tree or there are only two processors and all jobs have a unit processing time, can be solved in polynomial time.",
author = "N. Grigoreva",
year = "2020",
month = oct,
day = "17",
doi = "10.1088/1742-6596/1658/1/012019",
language = "English",
volume = "1658",
pages = "012019",
journal = "Journal of Physics: Conference Series",
issn = "1742-6588",
publisher = "IOP Publishing Ltd.",
number = "1",
note = "The II International Scientific and Practical Conference on Mathematical Modeling, Programming and Applied Mathematics, 2nd ISPCMMPAM ; Conference date: 05-11-2020 Through 06-11-2020",

}

RIS

TY - JOUR

T1 - Cyclic Scheduling for Parallel Processors with Precedence Constrains

AU - Grigoreva, N.

PY - 2020/10/17

Y1 - 2020/10/17

N2 - The goal of this paper is to prepare algorithms of the cyclic scheduling problem, in which some set of jobs V is to be repeated an infinite number of times. We consider the multiprocessors problem when a set of jobs is done on identical parallel processors. Cyclic scheduling problems arise (for example) in manufacturing, timesharing of processors in embedded systems. The goal is to find a periodic schedule that minimizes the cycle time under precedence constraints. Although the problem is NP-hard, we show that the special case, where the precedence graph G is a tree or there are only two processors and all jobs have a unit processing time, can be solved in polynomial time.

AB - The goal of this paper is to prepare algorithms of the cyclic scheduling problem, in which some set of jobs V is to be repeated an infinite number of times. We consider the multiprocessors problem when a set of jobs is done on identical parallel processors. Cyclic scheduling problems arise (for example) in manufacturing, timesharing of processors in embedded systems. The goal is to find a periodic schedule that minimizes the cycle time under precedence constraints. Although the problem is NP-hard, we show that the special case, where the precedence graph G is a tree or there are only two processors and all jobs have a unit processing time, can be solved in polynomial time.

UR - https://iopscience.iop.org/article/10.1088/1742-6596/1658/1/012019/pdf

UR - http://www.scopus.com/inward/record.url?scp=85096363619&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/84fee41f-c9db-31ad-95fd-ac6c195bfe88/

U2 - 10.1088/1742-6596/1658/1/012019

DO - 10.1088/1742-6596/1658/1/012019

M3 - Conference article

VL - 1658

SP - 012019

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

SN - 1742-6588

IS - 1

M1 - 012019

T2 - The II International Scientific and Practical Conference on Mathematical Modeling, Programming and Applied Mathematics

Y2 - 5 November 2020 through 6 November 2020

ER -

ID: 70945024