A buffer-inventory-based dynamic scheduling algorithm for multimedia-on-demand servers

1998 ◽  
Vol 6 (2) ◽  
pp. 125-136 ◽  
Author(s):  
Huanxu Pan ◽  
Lek Heng Ngoh ◽  
Aurel A. Lazar
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
On Demand

A dynamic scheduling algorithm for video-on-demand servers

2004 ◽  
Vol 50 (4) ◽  
pp. 1113-1118 ◽  
Author(s):  
Kyung Oh Lee ◽  
Jeong Bae Lee ◽  
Kee Wook Rim
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Video On Demand ◽  
On Demand

Dual priority dynamic scheduling algorithm based on multi-FPGA

2013 ◽  
Vol 33 (3) ◽  
pp. 862-865
Author(s):  
Shuangzhi DU ◽  
Yong WANG ◽  
Xiaoling TAO
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm

scholarly journals Dynamic Scheduling Algorithm based on NOMA Access and Priority Assignment for V2X communications

2020 ◽  
Vol 53 (2) ◽  
pp. 15041-15046
Author(s):  
Ala Din Trabelsi ◽  
Hend Marouane ◽  
Emna Bouhamed ◽  
Faouzi Zarai
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Priority Assignment

scholarly journals Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing

2021 ◽  
Vol 21 (3) ◽  
pp. 1-33
Author(s):  
Qianmu Li ◽  
Shunmei Meng ◽  
Xiaonan Sang ◽  
Hanrui Zhang ◽  
Shoujin Wang ◽  
...  
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Dynamic Change ◽  
High Energy ◽  
Transformation Rule ◽  
Volunteer Computing ◽  
Attack Behavior ◽  
Time Threshold ◽  
Security And Reliability ◽  
Multi Level

Volunteer computing uses computers volunteered by the general public to do distributed scientific computing. Volunteer computing is being used in high-energy physics, molecular biology, medicine, astrophysics, climate study, and other areas. These projects have attained unprecedented computing power. However, with the development of information technology, the traditional defense system cannot deal with the unknown security problems of volunteer computing . At the same time, Cyber Mimic Defense (CMD) can defend the unknown attack behavior through its three characteristics: dynamic, heterogeneous, and redundant. As an important part of the CMD, the dynamic scheduling algorithm realizes the dynamic change of the service centralized executor, which can enusre the security and reliability of CMD of volunteer computing . Aiming at the problems of passive scheduling and large scheduling granularity existing in the existing scheduling algorithms, this article first proposes a scheduling algorithm based on time threshold and task threshold and realizes the dynamic randomness of mimic defense from two different dimensions; finally, combining time threshold and random threshold, a dynamic scheduling algorithm based on multi-level queue is proposed. The experiment shows that the dynamic scheduling algorithm based on multi-level queue can take both security and reliability into account, has better dynamic heterogeneous redundancy characteristics, and can effectively prevent the transformation rule of heterogeneous executors from being mastered by attackers.

Linear Rail Space Dynamic Scheduling Technology for Multi-Tasking Hybrid Assembly Sections

2012 ◽  
Vol 271-272 ◽  
pp. 650-656
Author(s):  
Zhi Bing Lu ◽  
Ai Min Wang ◽  
Cheng Tong Tang ◽  
Jing Sheng Li
Keyword(s):  
Production Scheduling ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Real Data ◽  
Utilization Rate ◽  
Filter Method ◽  
Scheduling Problem ◽  
Rule Based ◽  
Comprehensive Utilization ◽  
Space Production

For the rapid response to production scheduling problem driven by high-density production tasks, a dynamic scheduling technology for the large precision strip products assembly with a mixture of task time nodes and line-rail space is proposed. A scheduling constrained model containing coverage, proximity, timeliness and resource is established. A linear rail space production scheduling technology using heuristic automatic scheduling and event-driven method is put forward. The time rule based on delivery and single completion assembly is formed, at the same time the space rule based on the adjacent rail and comprehensive utilization is researched. Supposing the privilege of single product assembling as the core, the scheduling parts filter method based on multiple constraints and former rules. For the space layout problem, a clingy forward and backward algorithms is proposed to judge the assemble position regarding the space comprehensive utilization rate. The classification of the various disturbances in the actual production is summarized. Three basic algorithms are proposed, including insertion, moving and re-scheduling algorithm, in order to solve the assembly dynamic scheduling problem driven by production disturbance events. Finally, take rocket as the example， the rocket assembly space production scheduling system is developed, combining with the proposed algorithm. The practicability of the system is validated using real data.

Sign in / Sign up

Export Citation Format

Share Document