Synthesizing optimization algorithms for scheduling partially ordered set of problems
| Autor: | E. Yu. Nikulina, V. V. Men’shikh |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Rate-monotonic scheduling
Mathematical optimization Computational complexity theory Control and Systems Engineering Computer science Asymptotic computational complexity Probabilistic analysis of algorithms Dynamic priority scheduling Electrical and Electronic Engineering Partially ordered set Fair-share scheduling Scheduling (computing) |
| Zdroj: | Automation and Remote Control. 73:186-190 |
| ISSN: | 1608-3032 0005-1179 |
| Popis: | We consider the issues of optimal algorithms synthesis in the scheduling theory from a set of heuristic algorithms with low computational complexity. Optimal algorithm is derived which includes no more than seven tasks with identical duration of operations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|