Страница публикации

Planning of parallel abstract programs as Boolean satisfiability

Авторы: Oparin G.A., Novopashin A.P.

Журнал: Lecture Notes in Computer Science

Том: 3606


Год: 2005

Отчётный год: 2005


Местоположение издательства:


Аннотация: In this paper 1, a new formulation is proposed for the problem of constructing parallel abstract programs of a required length in parallel computing systems. The conditions of a planning problem are represented as a system of Boolean equations (constraints); whose solutions determine the possible plans for activating the program modules. Specifications of modules are stored in the knowledgebase of the planner. Constraint on number of processors and time delays at execution of modules are taken into account.

Индексируется WOS: 1

Индексируется Scopus: 0

Индексируется РИНЦ: 0

Публикация в печати: 0

Добавил в систему: