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

13th International Conference on Cloud Computing, Data Science and Engineering, Confluence 2023

作者： Sarkar, Darothi Singal, Swati Institute of Engineering and Management Department of Computer Science and Engineering Kolkata India Amity University Uttar Pradesh Amity School of Engineering and Technology Department of Computer Science and Engineering Noida India

ISBN: (纸本)9781665462631

An efficient scheduling algorithm for a CPU has always been on the lookout by researchers and engineers since the invention of computers. Today most of the tasks are running online facilitated by servers. So, the requirement for fast, efficient, and reliable scheduling algorithms is the need of the hour. However, the traditional heuristic algorithms are having issues like complexity and uncertainty, so it is important to apply innovative technology to improve the task scheduling to ensure the efficient performance of these heavyduty systems. This study aims at developing a new scheduling model that integrates both optimized task scheduling and resource utilization using deep reinforcement learning algorithms. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Multi-path scheduling Algorithm for Adaptive Sensor Network Resources 9

Research on Multi-path Scheduling Algorithm for Adaptive Sen...

引用

9th Annual International Conference on Network and Information Systems for Computers, ICNISC 2023

作者： Shi, Baohui Zhang, Yu Beijing Information Technology College Electronic Information Industrial Research Institute Beijing China

ISBN: (纸本)9798350306682

The current conventional adaptive sensor network resource multi-path optimization scheduling algorithm is mainly constructed by calculating the scheduling parameters and the multi-objective scheduling function, which leads to poor balanced scheduling due to the lack of weight assignment to network nodes. In this regard, the adaptive sensor network resource multi-path scheduling algorithm is proposed. By combining the ant colony algorithm, the distribution of network resources inside the sensor network is analyzed. By setting the pheromone node factor, the effective nodes of network resources are extracted. And for the network resource nodes with different degrees of dispersion, the weight allocation strategy is constructed and the multi-path scheduling feature parameters are extracted to construct a scheduling model. In the experiments, the scheduling performance of the designed scheduling method is tested. The final results can prove that when the proposed method is used to schedule the network resources, the balanced load difference of the resources is low and has a more desirable balanced scheduling effect. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of Average Completion Time and Makespan for Various Task scheduling Techniques 4

Comparison of Average Completion Time and Makespan for Vario...

引用

4th International Conference on Computing and Communication Systems, I3CS 2023

作者： Vishnoi, Sushant Kumar Patel, Sanjeev National Institute of Technology Department of Computer Science and Engineering Odisha Rourkela769008 India

ISBN: (纸本)9798350323771

Cloud computing is becoming a trending and important technology that everyone is using globally on a large scale. It allows users to get access to resources (Storage and computational) online over the internet. With the increasing number of users, maintaining the Quality of service is challenging. The jobs are becoming more and more intensive and hence designing and implementing the correct task scheduling algorithm is very necessary to fulfill the increasing demand of users. An algorithm is needed to be designed to map the request of users to a particular Virtual Machine to utilize the resources of virtual machines efficiently. In this paper, we have observed from the results that better makespan and optimum or efficient resource usage are required for both customers and cloud service scheduling algorithms, which are considered suitable for large-scale systems. In this paper, the performance of 5 scheduling algorithms - FCFS, SJF scheduling, Round Robin scheduling, general priority algorithm, and Particle Swarm Optimization (PSO) is analyzed and compared. The performance of the various task scheduling algorithms has been carried out on the Cloudsim simulator. It has been observed from results that PSO outperforms the other compared task scheduling techniques and gives 48.3% less makespan as compared to FCFS. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Area-based User scheduling Algorithm in Hybrid Duplex Networks

An Area-based User Scheduling Algorithm in Hybrid Duplex Net...

引用

2023 IEEE/CIC International Conference on Communications in China, ICCC Workshops 2023

作者： Lu, Rui Xu, Jin Tao, Xiaofeng Beijing University of Posts and Telecommunications National Engineering Research Center of Mobile Network Technologies Beijing100876 China Pengcheng Laboratory Shenzhen518000 China

ISBN: (纸本)9798350345407

In order to better meet the requirements of heavy uplink and low latency in 5G advanced systems, Subband Full Duplex (SBFD) has been put forward and considered as one of the hot issues in 3GPP Release 18. Compared with traditional Time Division Duplexing (TDD) mode, SBFD introduces frequency domain duplex and supports both uplink (UL) and downlink (DL) transmission in one timeslot. In this paper, a flexible area-based user scheduling (AB-US) algorithm is proposed to reduce the crosslink interference (CLI) in hybrid duplex networks with SBFD and legacy TDD. Based on detailed analysis of interference model, different user groups are defined with measurement results of signal strength, followed by a distinctly prioritized user scheduling strategy. Simulation results reveal that the proposed algorithm could increase the users' average DL SINR significantly. Although there is a slight SINR loss for central users, it achieves large SINR gain for edge users, which inevitably leads to a performance improvement from the whole system point of view. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Experimental Survey of FPGA-Based Monolithic Switches and a Novel Queue Balancer

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2023年第5期34卷 1621-1634页

作者： Papaphilippou, Philippos Sano, Kentaro Adhi, Boma Anantasatya Luk, Wayne Imperial Coll London Dept Comp London SW7 2BX England Huawei Technol R&D UK Ltd Cambridge CB4 0WG England RIKEN Ctr Computat Sci Kobe Hyogo 6500047 Japan

This article studies small to medium-sized monolithic switches for FPGA implementation and presents a novel switch design that achieves high algorithmic performance and FPGA implementation efficiency. Crossbar switches based on virtual output queues (VOQs) and variations have been rather popular for implementing switches on FPGAs, with applications in network switches, memory interconnects, network-on-chip (NoC) routers etc. The implementation efficiency of crossbar-based switches is well-documented on ASICs, though we show that their disadvantages can outweigh their advantages on FPGAs. One of the most important challenges in such input-queued switches is the requirement for iterative scheduling algorithms. In contrast to ASICs, this is more harmful on FPGAs, as the reduced operating frequency and narrower packets cannot "hide" multiple iterations of scheduling that are required to achieve a modest scheduling performance. Our proposed design uses an output-queued switch internally for simplifying scheduling, and a queue balancing technique to avoid queue fragmentation and reduce the need for memory-sharing VOQs. Its implementation approaches the scheduling performance of a state-of-the-art FPGA-based switch, while requiring considerably fewer resources.

关键词： Field programmable gate arrays scheduling Complexity theory scheduling algorithms Integrated circuit interconnections Switches Hardware Crossbar FPGA Index Terms NoCs output-queued queue balancing scheduling algorithms switch virtual output queues

来源：评论

学校读者我要写书评

暂无评论

Study on Time-sensitive Network scheduling for Substation Based on Gating Shaping 6

Study on Time-sensitive Network Scheduling for Substation Ba...

引用

6th IEEE International Electrical and Energy Conference, CIEEC 2023

作者： Hong, Yue Wang, Jin Liu, Chang Wei, Min Gao, Sihang Xu, Jiangpei Yu, Xiao Wang, Jie Zhou, Liang State Grid Hubei Electric Power Co. Ltd Wuhan China State Grid Hubei Electric Power Research Institute Hubei China Automation College Chongqing University of Posts and Telecommunications China-Korea Belt and Road Joint Laboratory on Industrial Internet of Things Chongqing China

ISBN: (纸本)9798350346671

Real-time and certainty are important performance indicators of substation network data transmission. There are many time-sensitive data in the substation site, and the transmission of these data has very high real-time and deterministic requirements. Due to the fusion communication of high-bandwidth data in the IT network, the transmission delay and jitter of some time-sensitive data are increased. In order to reduce the transmission delay and jitter of time-sensitive data flow in the substation, this paper designs and implements a time-sensitive network synchronization scheduling algorithm based on gating shaping. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Deadline and Cost Optimization based Task scheduling (DCOTS) in Cloud Computing Environment 4

Deadline and Cost Optimization based Task Scheduling (DCOTS)...

引用

4th International Conference on Intelligent Engineering and Management, ICIEM 2023

作者： Grewal, Sanjiv Kumar Mangla, Neeraj Department of CSE Mullana Ambala India

ISBN: (纸本)9798350341126

Deadline and cost optimization are the important issues in cloud computing environment. Lack of these two factors discourages the cloud users from using the services of clouds. The proposed task scheduling considers fulfilling user's requirements with in time and budget constraints. Cloud users always try to maximize their profit and finish the task or job within a predetermined time. Thus, proposed Deadline and Cost Optimization based Task scheduling (DCOTS) guarantees to satisfy user's need and try to maximize the profit of cloud providers. Proposed approach measures the QoS parameters i.e make span, load balancing, response time, throughput etc of cloud resources and these parameters are also associated with deadline and cost. The effectiveness of proposed scheduling algorithm is compared with existing cost and time based scheduling algorithm. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Sensor scheduling for Federated Learning over 6G in-X Subnetworks 2

Adaptive Sensor Scheduling for Federated Learning over 6G in...

引用

2nd International Conference on Smart Technologies and Systems for Next Generation Computing, ICSTSN 2023

作者： Wu, Qiaoli Gao, Bo Xiong, Ke Beijing Jiaotong University Engineering Research Center of Network Management Technology for High-Speed Railway Ministry of Education School of Computer and Information Technology Beijing China

ISBN: (纸本)9798350348002

In the upcoming 6G era, various end devices with data and computing resources can collaborate through federated learning (FL) to achieve the goal of ubiquitous intelligence. Inside any of those 'X' (i.e. everything) devices, however, a6G in-X subnetwork that wirelessly uploads training data from onboard sensors to an embedded access point (AP) may become a communication bottleneck during the process of FL. To support communication-efficient FL over in-X subnetworks, this paper proposes an adaptive sensor scheduling algorithm that jointly solves a queue stability problem and an age of information (AoI) optimization problem, based on Lyapunov optimization and MaxRatio scheduling methods. Simulations show that the proposed algorithm achieves higher FL accuracy, while guaranteeing queue stability at APs and better data freshness (quality) for data uploading over in-X subnetworks. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning-Based Task scheduling Algorithm for On-Satellite Data Analysis

Reinforcement Learning-Based Task Scheduling Algorithm for ...

引用

International Conference on Big Data Intelligence and Computing, DataCom 2022

作者： Qiu, Junji Sun, Qibo State Key Laboratory of Net working and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9789819922321

To leverage the explosively growing computing capacity of satellites, this paper envisions a novel computing paradigm – on-satellite data analysis. By directly dispatching data analysis logic to satellites and executing on them, this paradigm enables bandwidth-friendly and privacy-preserving ground-space computing, avoiding the need to download large amounts of (sensitive) data to ground stations. However, the intermittent connectivity between satellites and ground stations and hard-to-predict hardware status pose challenges to data analysis processes, especially the long tail phenomenon caused by struggling satellites. To facilitate this paradigm, we proposed a reinforcement learning-based scheduling algorithm that does not rely on real-time hardware status, and redundantly schedules tasks to more satellites based on real-time feedback. What’s more, the algorithm dynamically adjusts the time for redundant scheduling, rather than setting a specific landmark. Simulation results show that the proposed algorithm outperforms baselines in optimizing task execution time and satellite resource consumption under various task arriving intervals. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Cooperative Computing Resource scheduling Algorithm for Periodic Task Scenarios 15th

Multi-agent Cooperative Computing Resource Scheduling Algori...

引用

15th International Symposium on Advanced Parallel Processing Technologies, APPT 2023

作者： Chen, Zheng Wang, Ruijin Zhang, Zhiyang Chen, Ting Pei, Xikai Wu, Zhenya School of Information and Software Engineering University of Electronic Science and Technology of China Sichuan Chengdu611731 China The Second Research Institute of Civil Aviation Administration of China Sichuan Chengdu610041 China

ISBN: (纸本)9789819978717

The scheduling of large-scale service requests and jobs usually requires the service cluster to fully use node computing resources. However, due to the increasing number of server devices, the dependence between resource allocation and request, and the periodic external request received, the scheduling process of edge-oriented service requests is a complicated scientific problem. Existing studies do not take into account the periodic characteristics of service requests in different periods, leading to inaccurate scheduling decisions on external requests. This paper proposes a coordinated Multi-Agent recurrent Actor-Critic, based on a recursive network. CMARAC is used to solve the problem of computing resource allocation for periodic requests in edge computing scenarios. According to different resource information in the server cluster and the status of the task queue, the system state information and historical information are captured and maintained by integrating LSTM, and then the most appropriate service resources are selected by processing them in the Actor-Critic network. Tracking experiments using actual request data show that CMARAC can successfully learn the periodic state between external requests in the face of large-scale service requests. Compared with the baseline, the average throughput rate of the system implemented by CMARAC is improved by 2.1%, and the algorithm convergence rate is improved by 0.69 times. Finally, we optimized the parameters through experiments and determined the best parameter configuration of CMARAC. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：