海报：面向分布式人工智能任务的网络与计算资源灵活调度

Constrained Receiver Scheduling in Flexible Time and Wavelength Division Multiplexed Optical

An increasing bandwidth demand has mandated a shift to the time and wavelength division multiplexing (TWDM) techniques in optical access networks (OAN). Typical TWDM scheduling schemes consider scheduling of the optical line terminal receiver only. In this paper we have identified an additional collision domain that is present in TWDM schemes that offer security, in addition to bandwidth flexibility. Scheduling of the identified collision domain is termed as group scheduling. We illustrate that consideration of receiver scheduling only (as done in typical TWDM schemes) severely affects their t…

确定性通信中灵活双工的预测与空间感知调度

Predictive and Spatially Aware Scheduling in Flexible Duplexing for Deterministic Communications

提出利用流量预测和预测调度减少灵活双工中的上下行冲突，并利用空间分集减轻不可避免冲突的影响，相比参考方案成功传输数提升超40%。

Eiffel: Efficient and Flexible Software Packet Scheduling

Packet scheduling determines the ordering of packets in a queuing data structure with respect to some ranking function that is mandated by a scheduling policy. It is the core component in many recent innovations to optimize network performance and utilization. Our focus in this paper is on the design and deployment of packet scheduling in software. Software schedulers have several advantages over hardware including shorter development cycle and flexibility in functionality and deployment location. We substantially improve current software packet scheduling performance, while maintaining flexib…

Robust Scheduling for Flexible Processing Networks

Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e., policies that do not use system parameters such as arrival and/or service rates for making scheduling decisions. In this paper, we propose a general framework for the design of robust policies. The main techni…

优先级驱动控制网络的反馈调度

Feedback Scheduling of Priority-Driven Control Networks

传统的网络资源开环调度方法在网络带宽受限和工作负载变化的情况下，会导致网络控制系统的控制质量（Quality-of-Control，QoC）显著下降。这项工作的目标是通过动态分配可用的网络带宽，以最大限度地提高整体质量的NCS。基于控制和调度的协同设计，开发了一种集成反馈调度器，以实现动态环境中的灵活QoC管理。它包括一个级联的反馈调度模块的采样周期调整和一个直接反馈调度模块的优先级修改。优先级驱动的控制网络的固有特性，使其可行的建议反馈调度器在现实世界中的系统。大量的仿真结果表明，所提出的方法导致显着的QoC改善传统的开环调度方案在欠载和过载的网络条件下。

灵活数据率无线链路调度的近似算法

Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates

我们考虑灵活的数据率在无线网络中的调度问题。也就是说，取决于信号质量，每次可以发送更多或更少的数据，信号质量由信号与干扰加噪声比（SINR）确定。每个无线链路具有将SINR值映射到相应数据率的效用函数。我们必须决定哪些传输是同时进行的，以及（取决于问题变量）使用哪些传输功率。在容量最大化问题中，人们努力使总网络吞吐量最大化，即，所有链接的总效用。对于任意的效用函数（不一定是连续的），我们提出了一个O（log n）-近似时，有n个通信请求。该算法是建立在一个常数因子近似的特殊情况下的相应的问题，其中效用函数只包括一个单步的。换句话说，每个链接都有一个单独的阈值，我们的目标是最大化满足阈值的链接数量。在此过程中，这改进了[Kesselheim，SODA 2011]中的结果，不仅将其扩展到单个阈值，而且还显示了与基础度量空间或网络参数的假设无关的恒定近似因子。此外，我们考虑延迟最小化问题。这里，每个链接都有一个需求，例如，表示数据量。我们必须计算一个尽可能短的时间表，使得每个链路的需求都得到满足，也就是说，总的总效用（或传输的数据）至少与其需求一样大。基于容量最大化算法，我们证明了这个问题的O（log^2 n）-近似。