Job control in heterogeneous computing systems

Назарова

et al. 2014

Self Cite

The CORSAR model software complex designed to analyze scheduling rules for resource intensive heterogeneous problems of search type that can be parallelized with respect to data is described. In the course of searching for solutions, the original arrays are decomposed into separate informative fragments so that one can use sliding scheduling methods and optimize parallelizing pro cesses when processing requests. Tasks are executed on a high performance heterogeneous specialized computing system. The developed multiparametric model control scheme is invariant to types of com putational resources, ensures their operation efficiency and scalability when the system is updated and evolving.

Section: Discussionmentioning

confidence: 99%

Control of resource-intensive computations under uncertainty. II. Scheduling complex

Kupalov-Yaropolk

Назарова

et al. 2014

Self Cite

“…Modern heterogeneous computing systems are multifunctional and diverse [15,16]. Each of them has its own specifics that cannot always be described by the model considered in this work.…”

Section: Discussionmentioning

confidence: 99%

Control of resource-intensive computations under uncertainty. III. Dynamic concurrent resource allocation

Назарова

2015

Self Cite

Control problems for a heterogeneous system executing heterogeneous search tasks are considered. Data parallelization of tasks under objective uncertainty-for the unknown and rapidly changing flow of incoming requests-is studied. Critical modes of operation under big system work loads are analyzed. The modified sliding scheduling method allows correcting the processing proce dure in real time. A way of dynamic construction of a sequence of non discriminating concurrent allo cations of limited different type resources between users with equal rights is proposed. A concept of normative maximal performance of the system processing one type of tasks in the single user mode is introduced. Parametric guaranteed estimates are used to decompose tasks with respect to their type. Scheduling procedures according to which tasks that de facto require less computational costs receive the processing priority and are completed first of all are developed.

“…The processing time of each individual job is not known in advance, and it can be very large; moreover, a job can be unrealizable (i.e., the corresponding problem can have no solutions) (see [6]). In this paper, we continue the study started in [7].…”

Section: Introductionmentioning

confidence: 92%

Analysis of computer job control under uncertainty

Golosov

Kozlov

et al. 2012

Self Cite

Various policies for controlling jobs in a problem oriented computer system are consid ered. The proposed algorithms belong to the class of search algorithms; they require a large (and, typ ically, unknown) amount of computations. The problem is to select a dynamic policy for redistributing resources between jobs under uncertainty. The analysis of resource reallocation rules uses probability theory and computer simulation.