2012
DOI: 10.1134/s1064230712040090
|View full text |Cite
|
Sign up to set email alerts
|

Control model for heterogeneous computational tasks based on guaranteed estimates of execution times

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…The super concurrent allocation of allocated quotas among requests of one type is close in sense to the SWAP scheduling rule described in detail in [7,9]. According to SWAP, when solving problems, we de facto take into account the required yet unknown beforehand amount of computational costs and the duration each task stays in the SCS.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…The super concurrent allocation of allocated quotas among requests of one type is close in sense to the SWAP scheduling rule described in detail in [7,9]. According to SWAP, when solving problems, we de facto take into account the required yet unknown beforehand amount of computational costs and the duration each task stays in the SCS.…”
Section: Discussionmentioning
confidence: 99%
“…We consider a heterogeneous high performance system that executes resource intensive tasks of the special class given in [7] as citu tasks or citu problems (computationally intensive tasks (under) uncer tainty). Solving each such problem (executing a task) is reduced to searching the unique fragment in a large array of initial data.…”
Section: Statement Of the Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…CORSAR is used for model calculations during analysis of manage ment of a high performance heterogeneous specialized computing system (SCS). The SCS processes resource intensive heterogeneous tasks described in detail and specified in [9] as citu tasks (Computation ally Intensive Task (under) Uncertainty). The latter can be solved by various enumeration algorithmic procedures that successively look through the respective arrays of indivisible informative original data fragments.…”
Section: Introductionmentioning
confidence: 99%