检索结果-内蒙古大学图书馆

Power and bit scheduling of Markov jump systems with convergence rate as an optimization index

Automatica 2025年 175卷

作者： Yan, Jingjing Xia, Yuanqing Wang, Xinjing Ma, Li College of Electrical Engineering Henan University of Technology Zhengzhou450001 China School of Automation Beijing Institute of Technology Beijing100081 China College of Surveying and Geo-Informatics North China University of Water Resource Electric Power Zhengzhou450001 China

Existing power and bit scheduling algorithms mostly focus on open-loop system performance, i.e., improving estimation accuracy. This paper focuses on the scheduling methods for the closed-loop Markov jump systems in the unreliable transmission environments to improve the system stability and save energy. First, a control unit including feedback controller and predictive controller is proposed which improves the system performance while reducing the complexity of predictive controller design. Second, we design a novel optimization indicator based on time-varying convergence rate and sensor energy consumption. Third, by analyzing the relationship between Lyapunov function and the system state, an explicit expression of the time-varying convergence rate is gained. Next, a constant χ is introduced to obtain the effective power set, in which the convergence rate is always less than 1, thereby ensuring the system stability. Based on this, the optimal power and bit scheduling algorithm is obtained, which improves the system convergence speed while reducing energy consumption. Last, a two-tanks system is used to verify the effectiveness and superiority of the main algorithms. © 2025 Elsevier Ltd

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization of indeterminate pressure leakage regulation and control in drainage networks based on attenuated hydroacoustic signal recognition algorithm 4

Optimization of indeterminate pressure leakage regulation an...

引用

4th International Conference on Testing Technology and Automation Engineering, TTAE 2024

作者： Sheng, Haoxu Chongqing Chijiu Zhuoyue Engineering Management Co. Ltd. Chongqing400000 China

ISBN: (数字)9781510686656

ISBN: (纸本)9781510686649

The current water supply and drainage pipe network coverage monitoring node deployment is generally single point coverage, and the monitoring area is small, resulting in an increase in the drop value of the detection pressure. For this reason, the optimization of regulation and control of water supply and drainage pipe network leakage under variable pressure based on the identification algorithm of attenuated underwater acoustic signal is proposed. Based on the current measurement, the multi-level method is adopted to expand the monitoring area, and the multi-level deployment of water supply and drainage pipe network covers the monitoring nodes to capture the leakage abnormal signal and regulate the fuzzy delimitation of coverage. Based on this, an optimization model for the regulation and control of water supply and drainage pipe network leakage under variable pressure is constructed by identifying and calculating the attenuated underwater acoustic signal, and the adaptive balance adjustment method is adopted to realize the optimization of scheduling. The test results show that compared with the sensitive design pipeline pressure regulation optimization detection Fluent water pipeline optimization scheduling method, the attenuation underwater acoustic signal identification algorithm of this design, the pipe network uncertain pressure leakage control optimization method, the final detection pressure drop value is relatively high, which shows that the design of the scheduling optimization method has high coverage and stability, the scheduling results are significantly optimized, and further reliable practical verification. © 2024 SPIE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Slot Utilization in IEEE 802.15.4e TSCH Networks using Reinforcement Learning 35

Optimal Slot Utilization in IEEE 802.15.4e TSCH Networks usi...

引用

35th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2024

作者： Ara, Tarana Liscano, Ramiro Ontario Tech University Dept. of Electrical Computer and Software Engineering Oshawa Canada

ISBN: (纸本)9798350362244

This paper presents an innovative MAC scheduling algorithm to achieve energy savings in IEEE 802.15.4e TSCH sensor networks leveraging reinforcement learning to determine an optimal number of slots to keep active in order to maintain a specific packet delivery ratio for the network. The goal is to turn off slots in the 802.15.4e TSCH frame that are not highly utilized. Each node determines the slots that should be deactivated based on a threshold Q value. This scheduling strategy allows the nodes to conserve energy effectively by finding the optimal active timeslots for both transmission and reception. This algorithm we name it as RAST Reinforcement-based Slot utilization Technique) algorithm. Through extensive simulations and evaluations across various network configurations, the RAST algorithm reveals a significant packet delivery ratio improvement as compared to Orchestra utilizing less active slots. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimized operation of microgrid based on improved honey badger algorithm 3

Optimized operation of microgrid based on improved honey bad...

引用

3rd International Conference on Energy, Power and Electrical Technology, ICEPET 2024

作者： Song, Kaiwen Feng, Jinghong Ying, Zhiqiang Dalian Maritime University School of Turbine Engineering Dalian116026 China

ISBN: (纸本)9798350352658

In order to improve the instability of microgrid operation and increase the utilization rate of clean energy, a microgrid optimization scheduling method based on improved honey badger algorithm is proposed. Firstly, the daily scheduling model of microgrid in grid-connected mode is established with the lowest comprehensive cost as the objective function. Secondly, an improved Honey Badger algorithm (IHBA) combining cluster variation, tent mapping and reverse learning strategy is proposed to solve the problem of poor convergence accuracy of Honey Badger algorithm (HBA). The feasibility and high precision of the improved Honey Badger algorithm are preliminarily verified by using three multi-modal benchmark test functions to test IHBA and HBA. Finally, IHBA is applied to the optimized microgrid scheduling model. Simulation results show that compared with HBA, slime mold algorithm (SMA) and Manta ray algorithm (MRFO), the proposed IHBA algorithm has better convergence speed and optimization accuracy, and can obtain lower comprehensive cost of microgrid. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2022年第11期41卷 3673-3684页

作者： Dai, Gaoyang Mohaqeqi, Morteza Voudouris, Petros Yi, Wang Uppsala Univ Dept Informat Technol S-75237 Uppsala Sweden

Guaranteeing timing constraints for parallel real-time applications deployed on multicore platforms is challenging, especially for applications containing non-preemptive execution blocks, that suffer from priority inversions. In this article, we propose to model such applications using a sporadic directed acyclic graph (DAG) model where preemption may take place only between the nodes of a DAG task. We present a new method for response-time analysis of such tasks scheduled with the global fixed-priority scheduling policy. We show that our method outperforms the state-of-the-art techniques significantly in terms of resource utilization in experimental evaluations using both benchmark and randomly generated task sets. We also present a method to deal with global EDF scheduling, which is a new technique proposed for response time analysis of sporadic DAG tasks with non-preemptive nodes.

关键词： Task analysis scheduling algorithms Time factors Timing Dynamic scheduling Computational modeling Upper bound Directed acyclic graph (DAG) EDF scheduling fixed-priority scheduling limited preemption response-time analysis

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation and Task Off-Loading for 6G Enabled Smart Edge Environments

引用

IEEE ACCESS 2022年 10卷 93542-93563页

作者： Jamil, Syed Usman Khan, M. Arif Rehman, Sabih Ur Charles Sturt Univ Sch Comp Math & Engn Wagga Wagga NSW 2650 Australia Charles Sturt Univ Sch Comp Math & Engn Port Macquarie NSW 2444 Australia

There has been an enormous increase in information flow and communication data due to the rapid rise in the number of Internet of Everything (IoE) devices and the development of cutting-edge technologies such as the rollout of the Sixth Generation (6G) network. The rising and inevitable off-loading requirements of IoE devices have resulted in an unprecedented increase in the reliance on edge and cloud paradigms. However, such a reliance on far-end technologies to access already scarce resources can often result in increased latency and unstable connection issues due to limited bandwidth. In this paper, we investigate the solution for such a stringent network design by presenting a conceptual cloud architecture based on key components such as resource allocation, scheduling and task off-loading for IoE devices. The IoE devices utilise a scheduler to access resources from nearby higher resourced IoE devices for their task computation, where the scheduler allocates incoming requests according to the availability of resources within a cluster of devices or to other devices in nearby clusters. Motivated by these design characteristics, we propose a design of a novel Main Task Off-loading scheduling Algorithm (MTOSA) for efficient task allocation and dissemination. We present a theoretical analysis of five different scheduling policies namely Round Robin (RR), Strongest Channel (SC), Max Rate (MR), Proportional Fair (PF) and Priority Base (PB) scheduling to find an optimal technique for task off-loading in futuristic networks. Furthermore, we compare the performance of these five scheduling policies with the two existing scheduling policies from the literature. It is shown through various experiments that the proposed MTOSA algorithm performs better when compared with the existing schemes for different performance parameters.

关键词： Task analysis Resource management 6G mobile communication scheduling Cloud computing scheduling algorithms Load modeling Edge computing Edge-based cloud 6G IoE smart devices AI QoS task off-loading machine learning (ML) scheduling resource allocation

来源：评论

学校读者我要写书评

暂无评论

Research on the Development of Programable Packet scheduling 3

Research on the Development of Programable Packet Scheduling

引用

3rd International Conference on Computer Vision, Image and Deep Learning and International Conference on Computer Engineering and Applications, CVIDL and ICCEA 2022

作者： Lin, Yinjie National University of Defense Technology College of Computer Changsha China

ISBN: (纸本)9781665459112

The packet scheduling problem is a classical multidimensional decision problem that requires rational decisions on the inbound as well as the outbound timing of a huge number of packets. With the advent of programmable scheduling, the deployment of packet scheduling algorithms on switches is easier, and multiple scheduling algorithms can be implemented without changing the hardware architecture. The advent of programmable scheduling simplifies the testing and deployment of new scheduling algorithms and can make the application of packet scheduling algorithms much easier to implement. © 2022 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on multi-processor real-time scheduling policies 6

Research on multi-processor real-time scheduling policies

引用

6th International Conference on Electronic Information Technology and Computer Engineering, EITCE 2022

作者： Hui, Zengqiang Liu, Lulu Research and Development Dapartment Chinese Flight Test Establishment Xi'an China Information and Archives Center Chinese Flight Test Establishment Xi'an China

ISBN: (纸本)9781450397148

Multiprocessor real-time scheduling algorithm plays an important role in the system. Paper in combination with the RMS and EDF scheduling algorithm is proposed on the basis of a kind of real-time multiprocessor task scheduling model containing threshold, the task can be on the threshold value range within each processor to migrate, avoided some processors being idle, part of the processor is too busy lead to task suspended phenomenon, ensure the relative balance of each processor utilization. © 2022 Association for Computing Machinery.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An MA-PPO based Task scheduling Method for Computing First Networks 5

An MA-PPO based Task Scheduling Method for Computing First N...

引用

5th International Conference on Telecommunications and Communication Engineering, ICTCE 2022

作者： Zhao, Jialu Xie, Kun Sun, Huiyue Li, Chengcheng Zhang, Yasheng Beijing University of Posts and Telecommunications Beijing China 54th Research Institute of CETC Hebei Shijiazhuang China

ISBN: (纸本)9781450397797

Aiming at converging computing and network resources, computing first networking (CFN) provides the computing task scheduling solution along with routing policy based on real-time computing and network information, to achieve the optimal utilization of overall resources and improve user experience. Most of the existing schemes consider computing and network resources separately to obtain their optimal results, lacking a load balancing mechanism that comprehensively considers both. In view of the above, this paper proposes an MA-PPO-based service scheduling algorithm for CFN. Based on the current computing and network resource status, scheduling strategies combined with computing task allocation and routing planning are flexibly generated for each computing task to achieve the overall optimization of computing and network resources utilization. The experimental results show that the algorithm can effectively improve the utilization of computing and network resources, shorten task processing time, and improve user experience. © 2022 Association for Computing Machinery.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Time Deterministic Dynamic Segmentation scheduling Algorithm 9

A Time Deterministic Dynamic Segmentation Scheduling Algorit...

引用

9th IEEE International Conference on Cyber Security and Cloud Computing and 8th IEEE International Conference on Edge Computing and Scalable Cloud, CSCloud-EdgeCom 2022

作者： Gu, Haonan Wu, Jing Guo, Yi Wuhan University of Science and Technology College of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China

ISBN: (数字)9781665480666

ISBN: (纸本)9781665480666

This paper proposed a soft real-time scheduling algorithm 'time-deterministic dynamic partitioning scheduling' for multimedia tasks in embedded devices. We established a new model based on the characteristics of embedded devices. We developed a pre-scheduling mechanism to select a suitable scheduling strategy based on the actual situation of the task set in the offline cache and to rearrange the task order so as to guarantee the reliability and real-time performance of the system while having higher flexibility and stability. The mechanism also completes the tasks assigned by the system in a stable manner with high utilization. © 2022 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：