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

IEEE Control and System Graduate Research Colloquium (ICSGRC)

作者： Ahmed A Ali Alsabri Haitham Saleh Ben Abdelmula Amel Abdyssalam Alhaag Faculty of Information Technology University of Zawia Zawia Libya College of Computer Technology Zawia Ministry of Technical and Vocational Education Zawia Libya

ISBN: (数字)9798350386554

ISBN: (纸本)9798350386561

Carrier Aggregation (CA) is one of the main physical transmission features in Long Term Evolution-Advanced (LTE-A). CA offer successively higher peak data rates in excess of 1 Gbps in the downlink and 500 Mbps in the uplink by aggregating multiple Component Carriers (CCs) each of 20 MHz. Joint User scheduling (JUS) is prominent resource scheduling scheme, which has been adopted in 3GPP Rel.10. JUS is efficient but suffers high computational complexity. However, JUS scheduling scheme produce low throughput, high latency and unfairness to various user applications under heavy traffic loads. In this paper, an Improved Fairness-Throughput-Delay for JUS (IFTD-JUS) scheduling algorithm for LTE-A downlink has been proposed. This scheme is integrated with the proposed bandwidth estimation and bandwidth allocation techniques. As for the IFTD-JUS algorithm, the system fairness performance was enhanced by at least 14.89% compared with EXP/PF-JUS. Finally, the IFTD-JUS also outperformed the EXP/PF-JUS in terms of packet delay by 1.5 ms compared to IFTD-JUS.

关键词： scheduling algorithms Heuristic algorithms Estimation Quality of service Bandwidth Downlink Throughput Delays Resource management Uplink

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Intelligent Computing and Robotics (ICICR), International Conference on

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

ISBN: (数字)9798350372274

ISBN: (纸本)9798350372281

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.

关键词： scheduling algorithms Optimization methods Containers scheduling Robustness Resource management Low latency communication

来源：评论

学校读者我要写书评

暂无评论

Load Balancing based scheduling for Mixed Real Time Tasks on Multicore Systems

Load Balancing based Scheduling for Mixed Real Time Tasks on...

引用

International Conference on Parallel Distributed and Grid Computing (PDGC)

作者： Shruti Jadon Pradyuman K.K. Urmil Kalaria K.R. Varsha Karthik Gupta Dept of Computer Science PES University Bengaluru India

ISBN: (数字)9798331521349

ISBN: (纸本)9798331521356

Effective load balancing is essential for ensuring the efficient operation of multi-core systems, particularly in environments with diverse task priorities and deadlines. The primary objective is to intelligently distribute tasks among cores to optimize system responsiveness, prioritizing the timely completion of urgent tasks. Through rigorous computer simulations, this paper explores various load-balancing techniques tailored for multi-core systems operating in mixed real-time environments. Notably, the focus is on strategies applicable to such systems, excluding hardware-level optimizations and specific real-time scheduling algorithms. The paper introduces an algorithm aimed at enhancing both load balancing and response time. This involves leveraging the LBPSA (Load Balancing-based Partitioned scheduling Algorithm) for load balancing and implementing the TBS (Total Bandwidth Server) migration method to further improve response time. The insights and findings presented offer valuable guidance for researchers, system designers, and practitioners involved in load balancing within mixed real-time multi-core systems across a broad spectrum of applications. The LBPSA and TBS methods are presented as contributions of the paper, enhancing the existing body of knowledge in load-balancing techniques for multi-core systems.

关键词： scheduling algorithms Multicore processing Bandwidth Mean square error methods Load management Real-time systems Partitioning algorithms Time factors Servers Optimization

来源：评论

学校读者我要写书评

暂无评论

scheduling Multi-Server Jobs is Not Easy

arXiv

引用

arXiv 2024年

作者： Vaze, Rahul Tata Institute of Fundamental Research Mumbai India

The problem of online scheduling of multi-server jobs is considered, where there are a total of K servers, and each job requires concurrent service from multiple servers for it to be processed. Each job on its arrival reveals its processing time, the number of servers from which it needs concurrent service, and an online algorithm has to make scheduling decisions using only causal information with the goal of minimizing the response/flow time. The worst case input model is considered and the performance metric is the competitive ratio. For the case when all job processing time (sizes) are the same, we show that the competitive ratio of any deterministic/randomized algorithm is at least Ω(K) and propose an online algorithm whose competitive ratio is at most K + 1. With unequal job sizes, we propose an online algorithm whose competitive ratio is at most 2K log(Kwmax), where wmax is the maximum size of any job. With equal job sizes, we also consider the resource augmentation regime where an online algorithm has access to more servers than an optimal offline algorithm. With resource augmentation, we propose a simple online algorithm and show that it has a competitive ratio of 1 when provided with 2K servers with respect to an optimal offline algorithm with K servers. © 2024, CC BY-NC-ND.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Particle Swarm Algorithm Based scheduling Method for Flexible Production Line

Particle Swarm Algorithm Based Scheduling Method for Flexibl...

引用

Automation, Robotics and Computer Engineering (ICARCE), International Conference on

作者： Xi Zhao Huajian Tan Lin Ye Xuebin Lu AVIC Chengdu Aircraft Industry (Group) Co. Ltd Sichuan Aviation Intelligent Manufacturing Equipment Engineering Technology Research Center Chengdu China

ISBN: (数字)9798331529505

ISBN: (纸本)9798331529512

The State Council in “Made in China 2025” clearly put forward to vigorously promote the integration of information technology and industrialization, to achieve technological breakthroughs in key areas in aerospace equipment. In the next decade, China's demand for aircraft will continue to increase, which requires high manufacturing efficiency and fast response speed of aircraft parts. However, in actual production, the research and application of the production line scheduling algorithm is still relatively small, which leads to the actual production cannot play out the maximum efficiency of the production line. In view of the above problems, this paper takes the actual flexible production line as the research object, establishes the scheduling model in line with the actual production on the spot, and uses the optimized particle swarm algorithm to solve the model, to obtain the optimal solution to meet the requirements of the actual scheduling, so as to give full play to the maximum efficiency of the production.

关键词： Job shop scheduling scheduling algorithms Production Manufacturing Machine tools Aircraft manufacture Particle swarm optimization Aircraft Information technology Robots

来源：评论

学校读者我要写书评

暂无评论

A Robust Genetic Based Constraint scheduling Algorithm to Promote On-Demand Cloud Services

A Robust Genetic Based Constraint Scheduling Algorithm to Pr...

引用

International Conf on Electrical and Electronic Engineering (ICEEE)

作者： Ismail Hababeh Mohammad I. Daoud Medya Omar School of Electrical Engineering and Information Technology German Jordanian University Amman Jordan

ISBN: (数字)9798350362541

ISBN: (纸本)9798350362558

The scientific workflow scheduling provides an effective technique to improve cloud services performance and address the user constraints. However, many cloud services are limited in their execution time, storage, and cost, but few are anticipated to enhance workflow task scheduling based on certain quality of service constraints. This research presents a genetic algorithm for offline scheduling tasks with deadlines and budget constraints. The proposed approach utilizes the three-point crossover operation to generate better offspring. The proposed method is simulated in WorkflowSim and assessed using several state-of-the-art scientific workflows. The experimental results validate the competent performance of the proposed approach over well-known scheduling methods.

关键词： Costs scheduling algorithms Heuristic algorithms Quality of service Pricing Dynamic scheduling Genetics Biological cells Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Subgraph Extraction-Based Feedback-Guided Iterative scheduling for HLS

Subgraph Extraction-Based Feedback-Guided Iterative Scheduli...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Hanchen Ye David Z. Pan Chris Leary Deming Chen Xiaoqing Xu University of Illinois Urbana-Champaign The University of Texas at Austin X the moonshot factory Google

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

This paper proposes ISDC, a novel feedback-guided iterative system of difference constraints (SDC) scheduling algorithm for high-level synthesis (HLS). ISDC leverages subgraph extraction-based low-level feedback from downstream tools like logic synthesizers to iteratively refine HLS scheduling. Technical innovations include: (1) An enhanced SDC formulation that effectively integrates low-level feedback into the linear-programming (LP) problem; (2) A fanout and window-based subgraph extraction mechanism driving the feedback cycle; (3) A no-human-in-loop ISDC flow compatible with a wide range of downstream tools and process design kits (PDKs). Evaluation shows that ISDC reduces register usage by 28.5% against an industrial-strength open-source HLS tool.

关键词： Process design Technological innovation Job shop scheduling scheduling algorithms Synthesizers Buildings Linear programming

来源：评论

学校读者我要写书评

暂无评论

Efficient Multi-Processor scheduling in Increasingly Realistic Models (Brief Summary)

Efficient Multi-Processor Scheduling in Increasingly Realist...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Pál András Papp Georg Anegg Aikaterini Karanasiou Albert-Jan N. Yzelman Computing Systems Lab Huawei Zurich Research Center Zurich Switzerland

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

We study the problem of efficiently scheduling a computational DAG on multiple processors. While previous works have mostly studied this problem in rather simple models, we instead consider the well-established BSP model, and extend it with non-uniform memory access (NUMA) effects. This results in a notably more realistic model that captures communication costs, synchronization costs, and the hierarchical structure of modern computing architectures. We develop a range of algorithms to minimize the scheduling cost in this more complex setting: several initialization heuristics, a hill-climbing local search, and different approaches to solve the problem as an Integer Linear Program (ILP). We analyze our scheduling algorithms on a diverse set of real-world computational DAGs to show that they outperforms both academic and practical baselines: without NUMA effects, our scheduler finds solutions of 44%-51% smaller cost on average, and with NUMA effects, it achieves up to a factor 3× improvement. Finally, we develop a multilevel scheduling algorithm for the special case when the problem is dominated by very high communication costs.

关键词： Distributed processing Costs Program processors scheduling algorithms Computational modeling Heuristic algorithms Conferences

来源：评论

学校读者我要写书评

暂无评论

Perturbation Event Oriented Dynamic Task scheduling Algorithm for Parallel Testing of Control Systems

Perturbation Event Oriented Dynamic Task Scheduling Algorith...

引用

International Conference on Sensing, Diagnostics, Prognostics, and Control (SDPC)

作者： Jingyi Chen Shenhang Wang Xiaoxuan Tong Gang Xiang Yang Yu Ziyuan Zhan School of Electronic and Information Engineeer Harbin Institute of Technology Harbin China System Design Department Beijing Aerospace Automatic Control Institute Beijing China Beijing Aerospace Automatic Control Institute Beijing China Department of System Engineering Beijing Aerospace Automatic Control Institute Beijing China

ISBN: (数字)9798350388855

ISBN: (纸本)9798350388862

Task scheduling algorithms are key to research and practice in parallel testing techniques, especially in control system applications. The complexity of control system testing requires higher scheduling efficiency. However, perturbation events caused by test equipment problems, data transmission obstacles, or task changes are almost unavoidable and may reduce the scheduling effectiveness or even lead to system crashes. Therefore, in this paper, based on the analysis of the dynamic test scheduling model, a disturbance factor is designed to judge the urgency of disturbance events for evaluating the dynamic scheduling cycle. On this basis, based on the comprehensive rescheduling index, a suitable adjustment strategy is selected to formulate the dynamic test scheduling scheme. The experimental results show that the algorithm proposed in this paper can achieve fast response capability for different disturbance events and exhibit good adaptivity.

关键词： scheduling algorithms Perturbation methods Heuristic algorithms Dynamic scheduling Control systems Computer crashes Sensors Test equipment Indexes Data communication

来源：评论

学校读者我要写书评

暂无评论

FLEX: Adaptive Task Batch scheduling with Elastic Fusion in Multi-Modal Multi-View Machine Perception

FLEX: Adaptive Task Batch Scheduling with Elastic Fusion in ...

引用

Real-Time Systems Symposium (RTSS)

作者： Yuhang Xu Zixuan Liu Xinzhe Fu Shengzhong Liu Fan Wu Guihai Chen Shanghai Jiao Tong University Massachusetts Institute of Technology

ISBN: (数字)9798331540265

ISBN: (纸本)9798331540272

This paper presents FLEX, a real-time scheduling framework that adaptively allocates limited machine attention (i.e., computing resources) among different spatial views (partitioned by camera facing directions) and sensory modalities (i.e., LiDAR and cameras) within multi-modal multi-view machine perception on resource-constrained embedded platforms. It is achieved through the effective wiring of two features: First, considering the heterogeneous and time-varying criticality among views and modalities within dynamic sensing contexts (i.e., object locations), we calibrate an “anytime” multi-modal perception pipeline that dynamically adjusts the modality fusion strategies of each view. Second, to optimize the GPU processing throughput with time guarantees, FLEX centers around an adaptive batch scheduling algorithm that intelligently groups consecutive asynchronous view inspection tasks based on the job sequence 1 generated from a non-preemptive EDF schedule to maximize a measure of system utility, with the runtime elastic fusion used as a subroutine. Temporal load balancing is maintained during the scheduling by always ensuring the sequential schedulability of future tasks in early batching decisions. We implement FLEX on NVIDIA Jetson Orin and conduct extensive experiments with a large-scale driving dataset. The results demonstrate the superiority of FLEX in improving perception quality and system throughput with time guarantees. 1 Following the real-time conventions, we use “job” to denote the instance of periodic tasks.

关键词： Wiring Flexible printed circuits Adaptive systems scheduling algorithms Graphics processing units Throughput Cameras Real-time systems Time measurement Sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：