Modeling of Priorities Processing in Interleaved Memory with a Perfectly Informed Processor

A mathematical model of prioritiless processing of two queues is proposed. The queues contain requests of two types and are known perfectly. A polinomial algorithm to find the optimal processing strategy is proposed. The notion of a processing rate is introduced, its existence is proved and some estimations of the processing rate are given for the case when the requests are uniformly distributed.