Article

Article title LOCAL SYMMETRIC OPTIMAL SCHEDULING
Authors A.E. Saak
Section SECTION IV. NEW INFORMATION TECHNOLOGIES
Month, Year 04, 2008 @en
Index UDC 681.3
DOI
Abstract Dynamic programming of planar schedule of given array of coordinate rectangular tetrodes in given area of the -plane - stands on local optimization of consecutive additive tetrode graphics - with the aim of minimization of horizontal strip inner emptiness of operational field of both kind computer power - processor and time - and following minimization of moving border position of the strip mentioned. The problem of acceleration of scheduling dynamic algorithm indicated, and the strip location generalization on the symmetric location of additive graphics inside the coordinate quadrant of the -plane - leads to necessity of the extreme analysis of so to speak localsymmetric sets of coordinate tetrode elements. The paper contains a solution of the local optimization task for the case of array of no more then three tetrode elements.

Download PDF

Keywords set of tetrodes elements, synthesis of tetrodes elements, comprehensive coordinate tetrode, local optimization of additive graphics, local optimal scheduling.
References 1. Бакенрот В.Ю., Чефранов А.Г. Эффективность приближенных алгоритмов распределения программ в однородной вычислительной системе // Изв. АН СССР. Техн. кибернетика, 1985, №4. – С. 135-148.
2. Саак А.Э. Тетродные отображения в моделировании МВС // Известия ТРТУ. – 2006. – № 8(63). – С. 221-226.

Comments are closed.