- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
[IEEE 2018 IEEE Symposium on Computers and Communications (ISCC) - Natal (2018.6.25-2018.6.28)] 2018 IEEE Symposium on Computers and Communications (ISCC) - QoS Guaranteed Batch Scheduling for Optical Switches Based on Unequal Weight Sequence
摘要： Due to the reconfiguration overhead of optical fabrics, batch scheduling method is generally used to schedule an optical packet switch, with a necessary speedup inside the switch to ensure 100% throughput with a bounded packet delay. Existing algorithms take each traffic matrix as a batch, and adopt traffic matrix decomposition techniques to decompose it into the sum of a set of weighted permutation matrices (which are then used as switch configurations). Nevertheless, existing algorithms adopt an equal weight for all switch configurations, meaning that each configuration should be held for the same time duration to transmit packets. We observe that this rigid strategy may limit the flexibility of the scheduling and result in a large speedup requirement due to inefficient time slot utilization. Motivated by this observation, we propose a UWS (Unequal Weight Sequence) algorithm to decompose the traffic matrix. UWS uses a different weight for each switch configuration. It first takes an arithmetic progression as the starting weight sequence, and then adjusts the weights for configurations to ensure 100% throughput with a bounded packet delay (such that QoS can be guaranteed). We theoretically prove that the worst case speedup of UWS will never be larger than that of the best existing ADAPT algorithm. Simulation results indeed demonstrate a speedup improvement of around 15%.
关键词： speedup,Optical switch fabric,scheduling,reconfiguration overhead
更新于2025-09-23 15:22:29
-
Computational Speedups Using Small Quantum Devices
摘要： Suppose we have a small quantum computer with only M qubits. Can such a device genuinely speed up certain algorithms, even when the problem size is much larger than M? Here we answer this question to the affirmative. We present a hybrid quantum-classical algorithm to solve 3-satisfiability problems involving n ? M variables that significantly speeds up its fully classical counterpart. This question may be relevant in view of the current quest to build small quantum computers.
关键词： quantum computing,hybrid algorithm,computational speedup,3-satisfiability
更新于2025-09-04 15:30:14