Iterative scheduling algorithms based on the subdivision of the solution space into domains

Kalashnikov, A. V.; Костенко, В. А.

doi:10.3103/s0278641908030096

Search citation statements

Order By: Relevance

Paper Sections

Select...

Computational Complexity and Correctness Of The Algorithm1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2013

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computational complexity of one iteration of the algorithm is O ((N + E) 2 ), where N is the number of vertices of the graph of program G and E is the number of its edges.…”

Section: Computational Complexity and Correctness Of The Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Algorithm for synthesis of real-time systems under reliability constraints

Zorin

Костенко

2012

J. Comput. Syst. Sci. Int.

Self Cite

View full text Add to dashboard Cite

The problem of constructing a real time computing system that has a minimum number of processors is addressed. It is necessary that the system meets the deadlines of program execution and the system reliability requirements implying that the system must tolerate both hardware and software failures. The formal statement of this problem is presented, a method for its solution using an iterative scheduling algorithm based on the method of simulated annealing is proposed, and an experimental study of the proposed algorithm is conducted.

show abstract

“…The computational complexity of one iteration of the algorithm is O ((N + E) 2 ), where N is the number of vertices of the graph of program G and E is the number of its edges.…”

Section: Computational Complexity and Correctness Of The Algorithmmentioning

confidence: 99%

“…In [1,2], the authors proposed an approach to constructing algorithms based on simulated annealing for scheduling with a minimum execution time with a given number of processors. The algorithms using the scheme of simulated annealing consistently alter the schedule to reduce its execution time.…”

Section: Introductionmentioning

confidence: 99%