Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment by Pradeep Kumar Yadav, M. P. Singh, Harendra Kumar

Get full text

Servitization of Job Shop Scheduling Algorithms by LIU Sheng-hui, ZHANG Xing, ZHANG Shu-li, MA Chao

“…The scheduling algorithm resources are not yet fully shared betwwen manufacturing execution system, and it is difficult to efficiently select the appropriate scheduling algorithm for scheduling problem from the candidate scheduling resources. …”
Get full text

Advance Bandwidth Scheduling Algorithms in Dedicated Networks by Yunyue Lin, Qishi Wu, Nageswara S. V. Rao, Mengxia Zhu

Get full text

Cloud scheduling algorithm based on fuzzy clustering by Wen-juan LI, Qi-fei ZHANG, Ling-di PING, Xue-zeng PAN

“…In order to better serve cloud’s objective of providing low-cost and on-demand services,a two-level and fuzzy clustering based cloud scheduling algorithm named FCTLBS(fuzzy clustering and two level based task scheduling algorithm) was proposed.Scheduling was divided into two levels:user scheduling and task cheduling.It used fuzzy clustering method to cluster resources according to their capabilities and computed tasks’resource bias coefficient according to their parameters.Thus tasks with different resource preference were able to choose different capability resources in the corresponding clusters.The new algorithm reduces the scale of resource choice,better reflects cloud tasks’ service requirements.Simulation results show that the proposed algorithm has some advantages compared to other kindred algorithms.…”
Get full text

A Synthesized Heuristic Task Scheduling Algorithm by Yanyan Dai, Xiangli Zhang

“…Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. …”
Get full text

Dynamic scheduling algorithm for streaming media based on CDN by YANG Ge1, FAN Xiu-mei3

Subjects: Get full text

Power services scheduling algorithm based on quantum communication by Zhuozhi YU, Yefeng ZHANG, Bingyang HAN, Wenwei CHEN, Dong WANG

“…Quantum communication could effectively improve the transmission’s reliability and security of power system services.However,limited by the generating rate of quantum key,it was difficult to meet the encryption requirements of important services.Therefore,a queue scheduling algorithm was required to legitimately schedule the power system services which need to be encrypted in quantum communication.An improved weighted fair queuing (weighted fair queuing,WFQ) algorithm LD-WFQ was proposed.By estimating the expected delay of the data packets to be encrypted,sending the packets that would soon be timeout,the proposed algorithm effectively reduced the timeout ratio of the packets and improved the effective utilization of quantum keys,while maintaining the timeout ratio of the packets in high priority queue at a low level.Compared with the WFQ algorithm,the simulation result proves the superiority of LD-WFQ algorithm.…”
Get full text

Slow task scheduling algorithm based on node identification by Yun-fei CUI, Xin-ming LI, Yi LI, Dong LIU

“…In order to reduce the influence of the slow task, produced in big data processing, a scheduling algorithm (TQST) combining recognition, speculation and seduction of slow task was proposed. …”
Get full text

Heterogeneous redundancies scheduling algorithm for mimic security defense by Qinrang LIU, Senjie LIN, Zeyu GU

“…The scheduling of heterogeneous redundancies is one of the key lines of mimic security defense,but the existing scheduling strategies are lack of consideration about the similarity among redundancies and the scheduling algorithms are incomprehensive.A new scheduling algorithm called random seed ＆amp; minimum similarity (RSMS) algorithm was proposed,which combined dynamics and reliability by determining a scheduling scheme with minimum global-similarity after choosing a seed-redundancy randomly.Theoretical analysis and simulation results show that RSMS algorithm possessed a far longer scheduling cycle than maximum dissimilarity algorithm,as well as a far lower failure rate than random scheduling algorithm,which represents an effective balance between dynamics and reliability.…”
Get full text

Emergency task scheduling algorithm for space-based networks by LI Zheyuan, HE Lijun, JIA Ziye, LI Bokang, WANG Yanting, MIN Minghui

Get full text

Negative feedback scheduling algorithm based on historical information in SDN by Yingying LYU, Yunfei GUO, Zhenpeng WANG, Guozhen CHENG, Yawen WANG

“…In the current SDN architecture,the controllers suffer from lots of potential attacks.For example,malicious flow rule attacks may introduce fake flow rules to confuse the host.A negative feedback scheduling algorithm based on historical information was proposed,in which hypothesis testing was used to judge the behavior of the attacker and the result will be used as a basis for scheduling.Simulation results and analysis show that,compared with the traditional scheduling methods,the proposed algorithm can increase the attacker’s time cost to a certain extent,so as to effectively defend the attacker’s probe attack.In addition,the more types of controllers,the more difficult it is to break the system.…”
Get full text

A TSN traffic scheduling algorithm combined with enqueue shaping by Wenxuan HAN, Hailong ZHU, Xinxin HE, Yanjue LI, Changchuan YIN

“…Most of the existing studies on the scheduling of mixed traffic in time-sensitive network (TSN) focus on how to ensure low-latency of stream reservation (SR) traffic.However, SR traffic blocks best-effort (BE) traffic for a long time will lead to excessive delay in BE traffic, which is not conducive to the state maintenance of network and the management of system.In order to reduce the maximum end-to-end delay of BE messages, a traffic scheduling algorithm which combines with enqueue shaping was proposed.It reduced the blocking of BE traffic by reducing the reserved bandwidth of SR traffic.The algorithm first added enqueue buffers in front of SR queues.Then, the reserved bandwidth ratio among the same priority traffic was adjusted by setting the number of frames in each enqueue buffer entering the SR queue during enqueue shaping.Finally, it jointed egress shaping to reserve bandwidth resources for each SR flow to match its latency requirement.Simulation results showed that combining enqueue shaping can reduce the maximum end-to-end delay of BE messages by 9.66%～75.76%.…”
Get full text

Exploring Virtual Machine Scheduling Algorithms: A Meta-Analysis by Salman Mahmood, Nor Adnan Yahaya

Get full text

Executive dynamic scheduling algorithm based on high-order heterogeneity by Hongyong JIA, Yunfei PAN, Wenhe LIU, Junjie ZENG, Jianhui ZHANG

“…At present, most isomer scheduling models in DHR systems only considered second-order isomerism and lack dynamics.In order to solve these problems, a dynamic scheduling algorithm was proposed, which combined heterogeneity and dynamics by determining a scheduling scheme with maximum scheduling value.The value was obtained by combining high-order heterogeneity and historical information.The experimental results show that the proposed algorithm has better defense capabilities than other scheduling algorithms, and its strategy can achieve a balance of dynamics and security.…”
Get full text

Correlation-Based Task Scheduling Algorithm in Wireless Sensor Network by Fangfang Yan, Yue Shi, Wei Wei

“…There are some shortages of static scheduling algorithm（SCP）while scheduling tasks in wireless sensor network.A scheduling clustered tree was proposed，and a new clustering algorithm（ICS）based on task duplication was put forward. …”
Get full text

Correlation-Based Task Scheduling Algorithm in Wireless Sensor Network by Fangfang Yan, Yue Shi, Wei Wei

“…There are some shortages of static scheduling algorithm（SCP）while scheduling tasks in wireless sensor network.A scheduling clustered tree was proposed，and a new clustering algorithm（ICS）based on task duplication was put forward. …”
Get full text

Executive dynamic scheduling algorithm based on high-order heterogeneity by Hongyong JIA, Yunfei PAN, Wenhe LIU, Junjie ZENG, Jianhui ZHANG

“…At present, most isomer scheduling models in DHR systems only considered second-order isomerism and lack dynamics.In order to solve these problems, a dynamic scheduling algorithm was proposed, which combined heterogeneity and dynamics by determining a scheduling scheme with maximum scheduling value.The value was obtained by combining high-order heterogeneity and historical information.The experimental results show that the proposed algorithm has better defense capabilities than other scheduling algorithms, and its strategy can achieve a balance of dynamics and security.…”
Get full text

A Stochastic -Coverage Scheduling Algorithm in Wireless Sensor Networks by Jiguo Yu, Shaohua Ren, Shengli Wan, Dongxiao Yu, Guanghui Wang

“…Each sensor node runs a stochastic k -coverage-preserving scheduling algorithm to determine its work modes, and redundant nodes can enter into sleep mode, while active nodes ensure the coverage of the network. …”
Get full text

A Source Aware Scheduling Algorithm for Time-Optimal Convergecast by Jing Zhao, Yajuan Qin, Dong Yang, Ying Rao

“…In order to achieve the lower bound derived by theoretical analysis, we proposed a source aware scheduling algorithm for general network. For IWSNs with a fixed number of available channels, we present a source aware scheduling algorithm with constrained channel. …”
Get full text

Trust-aware dynamic level scheduling algorithm in cloud environment by Jie CAO, Guo-sun ZENG, Huo-wen JIANG, Hai-ying MA

“…Based on interpersonal trust model in sociology，a trust evaluation model is proposed based on users’ past experience with service provider，friends’ recommendations and third party’s feedback.By combining users’ trust requirement for service resource together with trust degree of service resource and dynamic level scheduling(DLS) algorithm，a novel scheduling algorithm was proposed that was called trust-aware dynamic level scheduling algorithm in cloud environment(CTDLS).The algorithm takes the cloud service resources’ trust degree into account when calculates the scheduling-level of task-resource pairs.The simulation experimental results show that such algorithms can effectively satisfy the tasks’ trust requirement and improve the success rate of parallel tasks scheduling in practice.…”
Get full text