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

10th International Conference on Optimization and Applications, ICOA 2024

作者： Mesmar, Khadija Lebbar, Maria Aqil, Said Asebriy, Zahra Allali, Karam National School of Mines of Rabat Rosdm Research Team Lmaid Laboratory of Applied Mathematics and Business Intelligence Rabat Morocco Ensam Casablanca Hassan Ii University Laboratory Artificial Intelligence and Complex Systems Engineering Casablanca Morocco Est Essaouira Cadi Ayyad University Laboratory mathematics Computer sciences and modeling of complex systems Essaouira Morocco Fst Mohammadia Hassan Ii University Laboratory of Mathematics Computer Science and Applications Mohammadia Morocco

ISBN: (纸本)9798350387353

This paper is concerned with a set of independent jobs in a permutation flow shop that have setup times on a set of machines. The M-IAIS algorithm, which is based on immunoglobulins and has been modified, is designed to reduce the makespan. A unique procedure known as B cell repertoire updating, which comprises size C of jobs that are taken out of the sequence and reinserted into all possible positions of the remaining sequences of jobs, has an impact on the M-IAIS algorithm's performance. To increase the convergence velocity, three iterations of the algorithm are suggested. Thorough testing was done, and the three versions' performances on a set (benchmark) are compared. Problem instances are described in Sistemas de Optimizacion Aplicada (http://***/problem-instances) In the paper, percentage deviation is considered to evaluate the performance of the proposed algorithms. Furthermore, the ensuing outcomes demonstrate its suitability for addressing for the Permutation Flow Shop scheduling Problem with Sequence Dependent Setup Times. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of Microgrids Based on Improved Dung Beetle Optimization Algorithm 6

Optimal Scheduling of Microgrids Based on Improved Dung Beet...

引用

6th International Conference on Energy Systems and Electrical Power, ICESEP 2024

作者： Zhu, Wenfeng Liu, Tianyu School of Electrical Engineering Shanghai Dianji University Shanghai China

ISBN: (纸本)9798350353563

This study focuses on the optimal scheduling problem of microgrids and proposes a microgrid optimal scheduling model in grid-connected mode, which considers both microgrid system operation and environmental protection costs. To enhance the effectiveness of the model, an economic optimal scheduling scheme for microgrids based on the Improved Dung Beetle Optimization Algorithm (IDBO) is proposed. In this method, Cubic chaotic mapping is employed to enhance population diversity, preventing the initial population from converging prematurely to a local optimum. Furthermore, the rolling dung beetle formulation is enhanced by incorporating the global search capabilities of the Osprey optimization algorithm, thus bolstering both the global search capability and convergence speed of the IDBO algorithm. Simulation results, when compared with the whale algorithm (WOA), dung beetle algorithm (DBO), and mothball optimization algorithm (MFO), demonstrate that the IDBO algorithm enables microgrids to achieve superior overall benefits. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Flow-Graph Based Optimization of Containerized Resource scheduling: An Efficient scheduling Algorithm for Kubernetes Clusters

Flow-Graph Based Optimization of Containerized Resource Sche...

引用

2024 International Conference on Intelligent Computing and Robotics, ICICR 2024

作者： Zhang, Le Ji, Xin Peng, Fang Li, Junting Chen, Yiting Zhang, Kui Big Data Center State Grid Corporation of China Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China

ISBN: (纸本)9798350372274

With the widespread adoption of containerization technology and the evolution of cloud computing, efficient scheduling of containerized applications in cluster environments has become an increasingly important area of research. Kubernetes, as a mainstream container orchestration tool, faces several challenges with its default queue-based and greedy scheduling algorithm, especially in large-scale deployments, such as high latency and low scheduling robustness. This paper introduces a flow-graph-based optimization method for containerized resource scheduling, modeling the scheduling problem as a Minimum Cost Maximum Flow problem to achieve global optimization. Comparative experiments with traditional queue-based and random scheduling algorithms demonstrate the superiority of the proposed method in terms of balanced resource utilization, robustness of scheduling outcomes, and reduced algorithmic latency. This study provides a more efficient resource scheduling strategy for container orchestration tools like Kubernetes and offers a new perspective on resource management in large-scale containerized application environments. ©2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Study of Load Balancing Approaches in Real-Time Multi-Core Systems for Mixed Real-Time Tasks

引用

IEEE ACCESS 2024年 12卷 53373-53395页

作者： Jadon, Shruti Kannan, Pradyuman Kavedi Kalaria, Urmil Varsha, K. R. Gupta, Karthik Honnavalli, Prasad B. PES Univ Dept Comp Sci Engn Bengaluru 560085 India

Real-time systems are becoming pervasive with the growing global connectivity and rising consumer demands. The need for real-time processing has become a crucial part of many business applications worldwide. A key factor that determines the time taken for an application to give out the result hinges on its ability to prioritize, manage, and execute real-time workloads. However, there are several difficulties and constraints connected with implementing tasks in a real-time context. This research study primarily focuses on load balancing for mixed real-time tasks on a multi-core system, one of the major challenges for executing real-time workloads. The purpose of load balancing is to distribute the load evenly among the processor(s) and maximize their utility while minimizing overall execution time. The goal of this paper is to present a critical analysis of existing load balancing techniques for both periodic and aperiodic tasks. The paper explores several factors including throughput, performance, migration time, response time, overhead, resource utilization, scalability, fault tolerance, power efficiency, and other variables that play a crucial role in assessing the efficacy of load balancing in real-time systems. The proposed has contributed in four folds. Firstly, the state-of-the-art of various load balancing algorithms are discussed followed by the architecture involved in real-time multi-core systems. Later, different load balancing based scheduling algorithms were compared on the basis of different schemas and metrics for algorithm evaluation is also provided. Finally, the paper also identifies areas that warrant further exploration or investigation, suggesting potential avenues for future research, and highlighting emerging trends or developments that may shape the field.

关键词： Task analysis Real-time systems Heuristic algorithms scheduling Load management Partitioning algorithms scheduling algorithms real-time systems priority-driven algorithms EDF (earliest deadline first) RM (rate-monotonic) LBPSA (load balanced partitioning and scheduling algorithm) homogeneous multi-core heterogeneous multi-core static algorithms dynamic algorithms

来源：评论

学校读者我要写书评

暂无评论

Edge-Disjoint Tree Allocation for Multi-Tenant Cloud Security in Datacenter Topologies

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2024年第4期32卷 2858-2874页

作者： Rottenstreich, Ori Yallouz, Jose Mellanox Technol Nvidia Roskilde Denmark Technion IL-3200003 Haifa Israel

Resource sharing with its implied mutual interference has been considered a major concern for running applications of multiple tenants in shared cloud datacenters. Besides its security benefits, the isolation of traffic might ensure a quality of service (QoS) performance guarantee avoiding interference among tenants. Traffic isolation can be achieved by dedicating the usage of link resources in the network to a single tenant preventing its sharing among others. Accordingly, tenants should be connected through an edge-disjoint tree to enable isolated communication among its hosts. In this paper, we study the problem of establishing edge-disjoint trees in common datacenter topologies. We show that the availability of such trees is highly affected by the mapping of the tenants to hosts of the topology. Specifically, with the flexibility to map tenants in the datacenter topology, we describe a mapping algorithm and an optimal tree establishment for the optimization problem. Given the mapping of the tenants, we prove the problem turns out to be NP-Hard and provide comprehensive heuristics for the problem. Finally, we conduct experiments using real workloads to examine tree availability under various scenarios.

关键词： Datacenter distributed computing scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Stream-aware scheduling for QUIC-based Proxying Using Multiple Paths

Stream-aware Scheduling for QUIC-based Proxying Using Multip...

引用

2024 IEEE Conference on Standards for Communications and Networking, CSCN 2024

作者： Menne, Jan-Lukas Kuhlewind, Mirja Ericsson Research Germany Germany

ISBN: (纸本)9798331507428

In 3GPP networks Access Traffic Steering, Switching, Splitting (ATSSS) is specified to enable network-assisted use of multiple paths based on a multipath-enabled QUIC tunnel. scheduling of multiple end-to-end flows over different paths of one tunnel connection is challenging as path asymmetry, losses, and delays can lead to reordering. This might be misinterpreted as congestion leading to unnecessary throughput decreases. In this paper we propose a new stream-aware scheduling algorithm, called BLADE. It is developed to address challenges in scenarios that use multiple paths in QUIC proxies. By considering stream information in the scheduling decision, we minimize the use of different paths while maximizing throughput and path utilization. We show that BLADE avoids reordering and therefore improves throughput performance. Our work is a first step to enable better utilization of all available resources by using a stream-aware multipath proxy service that bundles use of multiple paths over different networks. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Robust scheduling method of AC / DC Distribution Network Based on Diamond-shaped Cutting Convex Hull Set 4

A Robust scheduling method of AC / DC Distribution Network B...

引用

4th International Conference on Intelligent Power and Systems, ICIPS 2024

作者： Yang, Jie Li, Yaxin Yang, Peiran Duan, Zhiqiang Yan, Jing State Grid Economic and Technology Research Institute Hubei Electric Power Co. LTD. Wuhan China University of Toronto TorontoON Canada State Grid Hubei Electric Power Co. LTD. Wuhan China

ISBN: (纸本)9798331532765

In an effort to enhance the description of the uncertainty inherent in renewable energy production, this paper proposes a robust scheduling method of AC/DC distribution network based on diamond-shaped cutting convex hull set. Initially, an ellipsoidal set accounting for uncertainty was developed using historical renewable energy data, alongside a data-driven convex hull polyhedron formed by interlinking vertices from a high-dimensional ellipse. Building upon this, addressing the substantial conservatism encountered when scaling the convex hull polyhedron, a convex hull set model of diamond-shaped cutting is established. Additionally, a robust scheduling model specifically for AC/DC distribution grids, utilizing the diamond-cut convex hull configuration, is formulated with the assistance of the C & CG algorithm for its resolution. Conclusively, validation through simulations on the enhanced IEEE-33 node system indicates that the proposed method can effectively reduces conservatism while enhancing the robustness of the outcomes. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Improved Way to Implement Round Robin scheduling Algorithm 3rd

An Improved Way to Implement Round Robin Scheduling Algorith...

引用

3rd International Conference on Computer Vision, High Performance Computing, Smart Devices, and Networks, CHSN 2022

作者： Vayadande, Kuldeep Bodhankar, Aditya Mahajan, Ajinkya Prasad, Diksha Dhakalkar, Riya Mahajan, Shivani Vishwakarma Institute of Technology Pune India

ISBN: (纸本)9789819966899

The scheduling algorithm is primarily responsible for the system’s effectiveness. The Round Robin (RR) algorithm is considerably more effective than the currently available ones. Every task in the Round Robin algorithm is given a set amount of time to complete the part of execution. The process needs to be taken out of ready queue if it is finished, otherwise it’s added to the end of ready queue, and waits for the process’s execution turn. In this chapter, we propose a technique related to the dynamic time quantum approach of Round Robin that works well. The dynamic time quantum (TQ) approach autonomously figures out the time quantum for each cycle based on a prescribed formula. In the proposed technique, TQ is calculated in each cycle and is compared to each process burst time for its execution. Further, the dynamic TQ reduced the Average Waiting Time, Average Turnaround Time, and Number of Context Switches. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

On Heavy-Traffic Optimal Scaling of c-Weighted MaxWeight scheduling in Input-Queued Switches

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2022年第8期67卷 4272-4277页

作者： Lu, Yingdong Maguluri, Siva Theja Squillante, Mark S. Suk, Tonghoon IBM Res Math Sci Yorktown Hts NY 10598 USA Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA

We consider the asymptotically optimal control of input-queued switches under a cost-weighted variant of MaxWeight scheduling, for which we establish theoretical properties that include showing the algorithm exhibits optimal heavy-traffic queue-length scaling. Our results are expected to be of theoretical interest more broadly than input-queued switches.

关键词： Schedules Costs Steady-state scheduling algorithms Linear programming Delays Queueing analysis Control systems communication systems communications technology computer networks Lyapunov methods optimal control optimal scheduling optimization queueing analysis systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

A static task allocation and scheduling algorithm for Kubernetes cluster 7

A static task allocation and scheduling algorithm for Kubern...

引用

7th IEEE International Conference on Information Systems and Computer Aided Education, ICISCAE 2024

作者： Yin, Jinyong Zhao, Yuechang Wang, Honghui Jiangsu Automation Research Institute Jiangsu Lianyungang China

ISBN: (纸本)9798350350760

In this paper, a static task allocation and scheduling algorithm for Kubernetes (also known as K8s) clusters is proposed, which includes two parts: static task allocation and dynamic task scheduling. The static allocation algorithm firstly submits the tasks to the K8s and obtains a feasible task allocation scheme to form a task allocation blueprint, and secondly stores the task allocation blueprint in the form of ConfigMap in the ETCD database of K8s. According to the task allocation scheme in the task allocation blueprint, the dynamic scheduling algorithm guides the K8s default scheduler to schedule tasks to the nodes specified in the task allocation blueprint by dynamically setting the nodeSelector field and tolerations fields of pods, as well as the labels and taints of nodes. When a node fails, the dynamic scheduling algorithm finds an untagged node and tags the same label and taint to the node, and the tasks running on the faulty node are scheduled to the node. Experimental results show that the proposed algorithm has significant progress compared with the existing task scheduling algorithms: 1) the proposed algorithm improves the certainty of K8s cluster task scheduling by statically recording the task allocation scheme in the task allocation blueprint;2) The algorithm represents the task allocation blueprint as the ConfigMap resource of the K8s cluster, and the node of task scheduling can be determined within O(n) time by querying the ConfigMap, which improves the real-time task scheduling of the K8s cluster. ©2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：