Research on run-time overhead of RM and improvement by LUO Ding-ding, ZHAO Hai, SUN Pei-gang, ZHANG Xi-yuan, YIN Zhen-yu

“…RM algorithm is a classic fixed priority real-time scheduling algorithm, but in most embedded real-time sys- tems, where the workload is composed of many tasks of high frequency and short execution time, the overheads from context-switches of real-time operating system will lead to a low resource utilization rate if RM algorithm is directly used. …”
Get full text

AoI-enabled multi-node cooperative sensing based on integration of sensing, communication, and computing in vehicular networks by Yiqing ZHOU, Haoyue ZHANG, Yanli QI, Qing CAI, Ling LIU, Jiangzhou WANG

“…For the requirements of real-time services in autonomous driving systems, such as high-definition (HD) maps, based on the integration of sensing, communication, and computing, a multi-node cooperative sensing mechanism was proposed with the age of information (AoI) as the real-time indicator.Considering the constraints on communication and computing resources and vehicle energy consumption, the information collection, transmission and processing of sensing nodes were optimally scheduled to minimize the AoI averaged over time.A Lyapunov-based online scheduling algorithm was proposed to transform the long-term stochastic optimization problem into an online optimization problem, which could be solved with low complexity.Compared with the existing mechanism considering integrated communication and computing, the proposed mechanism can improve real-time performance by 9%～50%.…”
Get full text

Modeling and performance analysis of train communication network based on switched ethernet by Yu-zhuo ZHANG, Yuan CAO, Ying-hong WEN

“…In order to meet the information transmission requirements of large capacity,high speed and hard real-time in the future,switched ethernet was introduced to the train communication network (TCN).Messages of different priorities was investigated,and established the TCN transmission process model with determined and stochastic Petri nets (DSPN) in accordance to its communication scheduling mechanism.The influences of different switch scheduling algorithms to the delay were compared,and the relationships between throughput and message number,throughout and generating cy-cle were respectively investigated.The experimental results show that the priority scheduling algorithm can reduce the delay of real-time data under the condition of sacrificing non real-time data's delay.It also verify the throughput of TCN based on switched ethernet is much higher than that of the existing TCN,which can provide theoretical basis for the de-sign and optimization in the future.…”
Get full text

A Sleep Scheduling Mechanism with PSO Collaborative Evolution for Wireless Sensor Networks by Luobing Dong, He Tao, William Doherty, Marten Young

“…This paper proposes a particle swarm optimization sleep scheduling mechanism for use in wireless sensor networks based on sleep scheduling algorithm. The mechanism adopts the approach of density control and finds the redundant nodes based on the computation results of the network coverage. …”
Get full text

A parallel multi-objective genetic algorithm for scheduling scientific workflows in cloud computing by Muhammad Sardaraz, Muhammad Tahir

“…This article presents a multi-objective scheduling algorithm for scheduling scientific workflows in cloud computing. …”
Get full text

Load prediction based elastic resource scheduling strategy in Flink by Ziyang LI, Jiong YU, Yuefei WANG, Chen BIAN, Yonglin PU, Yitian ZHANG, Yu LIU

“…In order to solve the problem that the load of big data stream computing platform fluctuates drastically while the cluster was suffering from the performance bottleneck due to the shortage of computing resources,the load prediction based elastic resource scheduling strategy in Flink (LPERS-Flink) was proposed.Firstly,the load prediction model was set up as the foundation to propose the load prediction algorithm and predict the variation tendency of the processing load.Secondly,the resource judgment model was set up to identify the performance bottleneck and resource redundancy of the cluster while the resource scheduling algorithm was proposed to draw up the resource rescheduling plan.Finally,the online load migration algorithm was proposed to execute the resource rescheduling plan and migrate processing load among nodes efficiently.The experimental results show that the strategy provides better performance promotion in the application with drastically fluctuating processing load.The scale and resource configuration of the cluster responded to the variation of processing load in time and the communication overhead of the load migration was reduced effectively.…”
Get full text

Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler by Supriya Raheja

“…At the second layer, Vague Logic Based Round Robin (VBRR) scheduling algorithm works to schedule the tasks. VBRR scheduler has the learning capability based on which scheduler adapts intelligently an optimum length for time quantum. …”
Get full text

Intelligent scheduling mechanism of time-sensitive network modal in polymorphic network by Sijin YANG, Lei ZHUANG, Yu SONG, Jiaxing WANG, Xinyu YANG

“…For the problems of uncertain forwarding scheduling and long solving time of time-sensitive network modal in polymorphic network, a joint routing and scheduling mechanism of time-sensitive network modal based on CSQF was proposed.Considering the requirement of bounded delay, network state and different routing mechanisms, a hybrid resource scheduling problem of joint cache queue and routing was formulated to optimize the resource usage of the entire network.Then, the traffic characteristics and cache queue utilization was used to predict the cache utilization of the next cycle, which was based on deep reinforcement learning.In addition, by using multi-queue CSQF forwarding scheduling mechanism and explicit routing algorithm based on cache utilization, an iterative scheduling algorithm was proposed to achieve deterministic forwarding and resource allocation.Simulation results show that the mechanism can effectively adjust the transmission scheduling of deterministic applications according to the resource usage of the network, and has better schedulability compared with other off-line scheduling mechanisms.…”
Get full text

Application-oriented resource matching model based on trust for internet-based virtual computing environment by Chun-ge ZHU, Xin-ran LIU, Yi-xian YANG, Hong ZHANG

“…In order to solve the problem of reasonable resource s ing in the virtual computing environment (iVCE),a resource matching model,based on trust “resource sliding window” model,was proposed.Firstly,the resources were classified in advance by their static properties.Then the resource nodes were evaluated by a trust model based on the time window and Bayesian algorithm,and the evaluated results as well as the resource load were fused to determine the levels of the dynamic real-time performance.Finally,the scheduling resources were allocated according to the comprehensive assessment of the static and dynamic properties of the resource nodes.The proposed model provides a basis of scheduling strategy for different resources with different tasks and attributes,thus achieving the goal of “proper resources’ serving proper tasks”.Simulation results show that,compared the previous scheduling algorithm,the proposed model has better performance in the success rate of task execution and the rate of resource utilization.…”
Get full text

A High Performance Load Balance Strategy for Real-Time Multicore Systems by Keng-Mao Cho, Chun-Wei Tsai, Yi-Shiuan Chiu, Chu-Sing Yang

“…In this paper, a novel scheduling algorithm is proposed for real-time multicore systems to balance the computation loads and save power. …”
Get full text

A Nonclairvoyant Real-Time Scheduler for Ambient Energy Harvesting Sensors by Hussein El Ghor, Maryline Chetto, Rafic Hage Chehade

“…We present a variant of EDF scheduling algorithm called EH-EDF (Energy Harvesting-Earliest Deadline First). …”
Get full text

Exploration on the Optimal Application of Mobile Cloud Computing in Enterprise Financial Management under 5G Network Architecture by Yanlin Guo, Huwei Li

“…In order to improve the effect of modern enterprise financial management, this paper improves the mobile cloud computing resource scheduling algorithm under the 5G network architecture. Moreover, this paper introduces mobile edge cloud computing, MEC server, into the financial 5G network system model. …”
Get full text

Research on deep reinforcement learning based intelligent shop scheduling method by Zihui LUO, Chengling JIANG, Liang LIU, Xiaolong ZHENG, Huadong MA

“…The unprecedented prosperity of the industrial internet of things (IIoT) has opened up a new path for the traditional industrial manufacturing model.Intelligent shop scheduling is one of the key technologies to achieve the overall control and flexible production of the whole production process.It requires an effective plan with a minimum makespan to allocate multiple processes and multiple machines for production scheduling.Firstly, the shop scheduling problem was defined as a Markov decision process (MDP), and a shop scheduling model based on the pointer network was established.Secondly, the job scheduling process was regarded as a mapping from one sequence to another, and a new shop scheduling algorithm based on deep reinforcement learning (DRL) was proposed.By analyzing the convergence of the model under different parameter settings, the optimal parameters were determined.Experimental results on different scales of public data sets and actual production data sets show that the proposed DRL algorithm can obtain better performances.…”
Get full text

Intelligent scheduling mechanism of time-sensitive network modal in polymorphic network by Sijin YANG, Lei ZHUANG, Yu SONG, Jiaxing WANG, Xinyu YANG

“…For the problems of uncertain forwarding scheduling and long solving time of time-sensitive network modal in polymorphic network, a joint routing and scheduling mechanism of time-sensitive network modal based on CSQF was proposed.Considering the requirement of bounded delay, network state and different routing mechanisms, a hybrid resource scheduling problem of joint cache queue and routing was formulated to optimize the resource usage of the entire network.Then, the traffic characteristics and cache queue utilization was used to predict the cache utilization of the next cycle, which was based on deep reinforcement learning.In addition, by using multi-queue CSQF forwarding scheduling mechanism and explicit routing algorithm based on cache utilization, an iterative scheduling algorithm was proposed to achieve deterministic forwarding and resource allocation.Simulation results show that the mechanism can effectively adjust the transmission scheduling of deterministic applications according to the resource usage of the network, and has better schedulability compared with other off-line scheduling mechanisms.…”
Get full text

Programmable composite pipeline structure supporting scheduling of integrated network and computing by HOU Saifeng, CUI Pengshuai, HU Yuxiang, DONG Yongji, LIU Yi

“…The network function pipeline deployment system supported the QoS isolation guarantee of different network functions and the allocation of heterogeneous resources in the programmable composite pipeline architecture. The scheduling algorithm was dynamically adjusted based on the hierarchical scheduling mechanism of programmable queuing to adapt to the characteristic service QoS guarantee requirements. …”
Get full text

An algorithm for joint optimization of dynamic routing and scheduling in time-sensitive networking by Yang ZHOU, Honglong CHEN, Lei ZHANG

“…Time-sensitive networking (TSN) is a set of protocols developed by the IEEE TSN task group, aiming at achieving deterministic communications over Ethernet.As the implementation method of TSN traffic scheduling is not specified in the protocols, the routing and scheduling algorithm for TSN remains an open issue.The joint optimization problem of routing and scheduling in TSN for industrial applications was modeled, and then an online heuristic algorithm was proposed to deliver the routing and scheduling solution for dynamic traffics.The routing path was determined by optimizing both the transmission delay and network load factors, and the scheduling time was quickly conducted by twice clipping operations.Finally, a simulated TSN testbed was developed with NeSTiNg framework based on OMNeT.The simulation results show that the execution time of the proposed algorithm outperforms the baseline algorithms even with large scale of network size and network traffics.It shows that the proposed algorithm guarantees the real-time performance even in dynamically changing networks.…”
Get full text

Proxy caching algorithm based on segment popularity for mobile streaming media by YANG Ge1, LIAO Jian-xin1, ZHU Xiao-min1, YANG Bo1, HUANG Hai1

“…A novel dynamic scheduling algorithm P2CAS2M2（proxy caching algorithm based on segment popularity for mobile streaming media）based on segment popularity for mobile streaming media was proposed.Proxy caching admis-sion and replacement algorithm based on the object segment popularity for mobile streaming media was implemented.The principle was obeyed that the data cached for each mobile streaming media object were in proportion to their popu-larity at the proxy server.The cache window size was updated periodically according to the average access time of the clients.Simulation results show that this algorithm is more adaptive than A2LS（adaptive and lazy segmentation algorithm） for the variety of the proxy server cache.It can gain more average number of cached mobile streaming media objects and less delayed requested ratio while byte-hit ratio of P2CAS2M2 is close to or exceeds A2LS under the circumstance of the same proxy cache space.…”
Get full text

Adaptive Scheduling and Routing Scheme for Delay Guarantee in Wireless Sensor Networks by Yan Sun, Cong Chen, Hong Luo

“…First of all, we utilize an optimal wake-up scheduling algorithm to achieve the initial wake-up schedules and routes and design an adaptive adjustment algorithm. …”
Get full text

Design of Real-time Processing Function of High-speed Maglev Train Signal System by FAN Liang, FANG Kai, YIN Yuan

“…In order to solve the problem that all events can be handled in real time under unfavorable conditions, this paper proposes a real-time processing modeling method, which analyzes the load capacity in a cycle through a rate monotone method, and adopts a clock driven task scheduling algorithm to avoid the impact of multi-event synchronous triggering on the system. …”
Get full text

Downlink hierarchical scheduling method for relay-enhanced cellular network based on TG-PF by Hua QU, Ya-lan SONG, Ji-hong ZHAO, Yi-wei LI

“…Hierarchical scheduling model for relay-enhanced cellular network was designed to divide the w e process of resource scheduling in relay-enhanced cell into two parts,which are high-level scheduling accomplished by eNode B and low-level scheduling accomplished by Relay Node.Based on this,a throughput guaranteed proportional fair (TG-PF) scheduling algorithm was also proposed.The algorithm fully takes the advantages of Max C/I algorithm and PF algorithm consideration,so that it can effectively improve cell lay-enhanced cellular network based on TG-PF,PF algorithm and TG-PF algorithm are separately used in high-level and low-level scheduling process to satisfy the system throughput and scheduling fairness requirements of relay-enhanced cell.Simulation results suggest that the proposed method can tremendously improve cell edge throughput with a small size sa-crifice in scheduling fairness.…”
Get full text