关于Fork-Join网络的控制
On the Control of Fork-Join Networks
摘要：
作业的处理顺序地和并行地发生的网络在许多应用领域中是普遍的，例如计算机系统、医疗保健、制造和项目管理。作业的并行处理引起的同步约束，可以是一个主要的原因作业延迟。与只具有顺序作业处理的前馈排队网络相比，具有同步约束的网络的逼近和控制较少被理解。一个著名的建模框架是fork-join处理网络，在这个框架中，同步约束非常重要。我们的目标是找到调度规则fork-join处理网络与多个作业类型，其中有第一个fork操作，然后可以并行执行的活动，然后加入操作。困难在于，一些可以并行执行的活动需要共享资源。我们解决的调度问题，共享服务器（即，哪种类型的工作优先级每次服务器变得可用）时，该服务器是在高负荷服务，并证明了一个渐近最优的结果。
英文摘要：
Networks in which the processing of jobs occurs both sequentially and in parallel are prevalent in many application domains, such as computer systems, healthcare, manufacturing, and project management. The parallel processing of jobs gives rise to synchronization constraints that can be a main reason for job delay. In comparison with feedforward queueing networks that have only sequential processing of jobs, the approximation and control of networks that have synchronization constraints is less understood. One well-known modeling framework in which synchronization constraints are prominent is the fork-join processing network. Our objective is to find scheduling rules for fork-join processing networks with multiple job types in which there is first a fork operation, then activities that can be performed in parallel, and then a join operation. The difficulty is that some of the activities that can be performed in parallel require a shared resource. We solve the scheduling problem for that shared server (that is, which type of job to prioritize each time the server becomes available) when that server is in heavy traffic and prove an asymptotic optimality result.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
