Abstract—Consideration is given to the dispatching problem in an almost nonobservable distributed processing system with M, M ≥ 2, single-server queues operating in parallel, each under the processor-sharing discipline. Jobs having the same job size distribution arrive one-by-one to the dispatcher, which immediately routes it to one of the queues. When making a routing decision, the dispatcher has no online information about the system (like current queues sizes, size of arriving job, etc.). The only information available to the dispatcher is job-size distribution, job-interarrival-time distribution, server speeds, time instants of previously arrived jobs, and previous routing decisions. Under these conditions, one is interested in the routing policies that minimize the job long-run mean response time. A new class of dispatching policies is proposed that, according to the numerical experiments, may significantly outperform all classical dispatching policies available for such system: (optimal) probabilistic policy and the round-robin policy.

摘要—考虑了一个几乎不可观察的M，M的分布式处理系统中的调度问题≥2，单服务器队列并行运行，每个队列均在处理器共享原则下进行。具有相同作业大小分布的作业将一一到达分配器，该分配器立即将其路由到队列之一。在做出路由决策时，调度员没有关于系统的在线信息（例如当前队列的大小，到达的工作的大小等）。调度员可用的唯一信息是作业大小分布，作业间隔时间分布，服务器速度，先前到达的作业的即时时刻以及先前的路由决策。在这种情况下，人们对使工作长期平均响应时间最小化的路由策略很感兴趣。提出了一类新的调度策略，根据数值实验，