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

4th International Conference on E-Business, Information Management and Computer Science, EBIMCS 2021

作者： Li, Ming Wei, Suyang Sun, Wentao Zhang, He CETC Avionics CO. LTD University Of Electronic Science And Technology Of China China

ISBN: (纸本)9781450395687

The Integrated Modular Avionics (IMA) has become a popular aircraft avionics system, and ARINC653 is a standard interface for IMA architecture of aircraft avionics equipment, and real-time scheduling for ARINC653 partition Operating System (OS) is a key issue. There are lots of scheduling algorithms for ARINC653 partition OS based on a single-core processor. This paper presents a partition scheduling proposal based on parameter configuration and designs a scheduling algorithm based on multi-core Load Proportional Round-Robin (MLPRR). The algorithm calculates the task weight according to the load ratio of the task and completes the scheduling of the task on the multi-core processor to meet the realtime requirements of the multi-core partition OS. Experimental results show that MLPRR is feasible and efficient. © 2021 Association for Computing Machinery.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A hardware architecture to deploy complex multiprocessor scheduling algorithms

A hardware architecture to deploy complex multiprocessor sch...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Renato Mancuso Prakalp Srivastava Deming Chen Marco Caccamo University of Illinois at Urbana-Champaign USA

An increasing demand for high-performance systems has been observed in the domain of both general purpose and real-time systems, pushing the industry towards a pervasive transition to multi-core platforms. Unfortunately, well-known and efficient scheduling results for single-core systems do not scale well to the multi-core domain. This justifies the adoption of more computationally intensive algorithms, but the complexity and computational overhead of these algorithms impact their applicability to real OSes. We propose an architecture to migrate the burden of multi-core scheduling to a dedicated hardware component. We show that it is possible to mitigate the overhead of complex algorithms, while achieving power efficiency and optimizing processors utilization. We develop the idea of “active monitoring” to continuously track the evolution of scheduling parameters as tasks execute on processors. This allows reducing the gap between implementable scheduling techniques and the ideal fluid scheduling model, under the constraints of realistic hardware.

关键词： Hardware Program processors scheduling algorithms Monitoring scheduling Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Research on Automotive TSN network scheduling Analysis and Simulation

Research on Automotive TSN network Scheduling Analysis and S...

引用

Electrical Engineering, Big Data and algorithms (EEBDA), IEEE International Conference on

作者： Zhu Libin Zhao Hongchen Xu Wenchen Zhou Zhuxin CATARC Automotive Test Center (Changzhou) Co. Ltd. Changzhou China

In order to study the end-to-end delay characteristics of various types of traffic in time-sensitive networking (TSN) in automobiles under different scheduling algorithms, the algorithm and scheduling model of the corresponding TSN scheduling mechanism are given, and a TSN simulation model is built based on RTaW to analyze the traffic delay simulation results under different scheduling mechanisms and the delay characteristics of traffic under each scheduling algorithm.

关键词： Electrical engineering Analytical models Connected vehicles scheduling algorithms Network topology Simulation Big Data

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Task scheduling Combining DDPG and Path Selection in LEO Satellite Networks

Fine-Grained Task Scheduling Combining DDPG and Path Selecti...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Gaowei Zhang Xu Zhou Xiaobo Zhang Computer Network Information Center Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China China Academy of Electronics and Information Technology Beijing China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

In low Earth orbit (LEO) satellite networks, a single satellite’s computing and storage resources are limited, necessitating fine-grained partitioning of computing tasks. Because the topology of LEO satellite networks frequently changes, traditional scheduling strategies may lead to an increase in total task delay while scheduling multiple computing subtasks to satellite nodes. Therefore, this paper proposes a fine-grained task scheduling algorithm (DDPG-FTS) based on the deep deterministic policy gradient (DDPG). This algorithm continuously interacts with the LEO satellite network environment, learning the selection strategy of satellite nodes. In addition, in order to reduce the path re-plan delay during task transmission, a path selection algorithm for the LEO satellite network is introduced. The algorithm reduces the path re-plan caused by Inter-Satellite Link (ISL) connectivity changes and effectively reduces the transmission delay of tasks. Simulation experiments validate that our proposed algorithm more effectively adapts to the dynamic changes of topology in LEO satellite networks, reducing the total task delay and improving the acceptance rate of tasks compared with the baseline algorithm.

关键词： Satellites Network topology scheduling algorithms Heuristic algorithms Low earth orbit satellites Dynamic scheduling Delays

来源：评论

学校读者我要写书评

暂无评论

Symphony: Optimized DNN Model Serving using Deferred Batch scheduling

arXiv

引用

arXiv 2023年

作者： Chen, Lequn Xin, Yu Deng, Weixin Zhuo, Danyang Krishnamurthy, Arvind Canumalla, Anirudh Philipose, Matthai University of Washington United States Duke University United States Microsoft United States

Having large batch sizes is one of the most critical aspects of increasing the accelerator efficiency and the performance of DNN model inference. However, existing model serving systems cannot achieve adequate batch sizes while meeting latency objectives as these systems eagerly dispatch requests to accelerators to minimize the accelerator idle time. We propose Symphony, a DNN serving system that explores deferred batch scheduling to optimize system efficiency and throughput. Further, unlike other prior systems, Symphony’s GPU usage is load-proportional: it consolidates workloads on the appropriate number of GPUs and works smoothly with cluster auto-scaling tools. Symphony consists of two core design points. First, Symphony defines a schedulable window in which a batch of inference requests can be dispatched. This window is computed in order to improve accelerator efficiency while meeting the request’s SLO. Second, Symphony implements a scalable, low-latency, fine-grained coordination scheme across accelerators to dispatch and execute requests in the schedulable window. Through extensive scheduler-only benchmarks, we demonstrate that Symphony can schedule millions of requests per second and coordinate thousands of GPUs while also enabling robust autoscaling that adapts to workload changes. Symphony outperforms prior systems by achieving 5x higher goodput when given the same number of GPUs and 60% reduction in GPUs when given the same workload. Copyright © 2023, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

QoS provision in hierarchical and non-hierarchical switch architectures

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2021年 148卷 138-150页

作者： Cano-Cano, Javier Andujar, Francisco J. Alfaro-Cortes, Francisco J. Sanchez, Jose L. Univ Castilla La Mancha Comp Syst Dept Albacete 02071 Spain Univ Valladolid Comp Syst Dept Valladolid 47011 Spain

Quality of service (QoS) provision has become an important aspect of high-performance computing interconnection networks. Proof of that is the inclusion of mechanisms targeted to the provision of QoS by the main interconnection technologies such as Gigabit Ethernet, Infiniband (IB) and Omni-Path (OPA). A key component of QoS provision is the output scheduling algorithm, which determines when a packet should be transmitted. An ideal scheduling algorithm should satisfy two main properties: good end-to-end latency and implementation simplicity. Table-based schedulers are able to provide these two properties, and because of this, IB and OPA have implemented this approach. In this paper, we present a comparative study in terms of QoS provision between these two dominating interconnection technologies. Those interconnection technologies are also two examples of non-hierarchical and hierarchical switch architectures, respectively, which gives the results of this study greater significance. In order to carry out the study, the Deficit Table scheduler (DTable) has been used. DTable is a table-based scheduling algorithm which offers a good balance between end-to-end latency and implementation cost. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Quality of Service scheduling algorithms Interconnection networks simulation Hierarchical and non-hierachical switches Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Packet scheduling in Multihop Networks with End-to-End Deadline Constraints

arXiv

引用

arXiv 2023年

作者： Tsanikidis, Christos Ghaderi, Javad Columbia University United States

scheduling packets with end-to-end deadline constraints in multihop networks is an important problem that has been notoriously difficult to tackle. Recently, there has been progress on this problem in the worst-case traffic setting, with the objective of maximizing the number of packets delivered within their deadlines. Specifically, the proposed algorithms were shown to achieve Ω(1/log(L)) fraction of the optimal objective value if the minimum link capacity in the network is Cmin = Ω(log(L)), where L is the maximum length of a packet’s route in the network (which is bounded by the packet’s maximum deadline). However, such guarantees can be quite pessimistic due to the strict worst-case traffic assumption and may not accurately reflect real-world settings. In this work, we aim to address this limitation by exploring whether it is possible to design algorithms that achieve a constant fraction of the optimal value while relaxing the worst-case traffic assumption. We provide a positive answer by demonstrating that in stochastic traffic settings, such as i.i.d. packet arrivals, near-optimal, (1 − ∊)-approximation algorithms can be designed if Cmin = Ω(log(∊L2/∊)). To the best of our knowledge, this is the first result that shows this problem can be solved near-optimally under nontrivial assumptions on traffic and link capacity. We further present extended simulations using real network traces with non-stationary traffic, which demonstrate that our algorithms outperform worst-case-based algorithms in practical settings. © 2023, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Time-Sensitive Multi-Service Transmission Control Method with Integrated Communication Perspective for Smart Grid

引用

International Journal of High Speed Electronics and Systems 2025年

作者： Shuyi, Yan Zhongkui, Dang Xingmin, Gu Yan, Liu Sujie, Shao State Grid Ningxia Electric Power Co. Ltd. Ningxia Provence Yinchuan China Guyuan Power Supply Company State Grid Ningxia Electric Power Co. Ltd. Ningxia Provence Guyuan China Beijing University of Posts and Telecommunications Beijing China

The development of smart grids makes the demand for time-sensitive service carrying capacity of the power communication network more and more challenging. In recent years, the Power Integrated Communication Networks (PICN), joint multiple wireline or wireless systems, have brought more choices for business access and at the same time brought the complexity of deterministic transmission control. In this paper, we propose a multi-service transmission control method under the PICN. First, the multi-service transmission control architecture and models with time-sensitive constraints are constructed by combining the characteristics of the power business. After that, a routing algorithm based on Bidirectional A∗ (BA) and a flow scheduling algorithm based on Improved Quantum Particle Swarm (IQPS) algorithm are proposed. Simulation results show that the algorithms proposed in this paper can quickly find the optimized flow transmission path and set the Gate Control List (GCL), reducing the flow transmission delay by about 16.5%. © 2025 World Scientific Publishing Company.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

NUMA-Aware Contention scheduling on Multicore Systems 16

NUMA-Aware Contention Scheduling on Multicore Systems

引用

16th IEEE International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2021

作者： He, Dongsheng Chen, Lijun Liang, Jinrong Kang, Chunmei Bai, Jiaqing Xian University of Posts and Telecommunications Dept. School of Computer Science and Technology Xi'an China Xi'an International Studies University Dept. School of Advanced Translation Xi'an China

ISBN: (纸本)9781665405539

More and more modern multi-processor systems have adopted Non-uniform Memory Access (NUMA) architecture, and each processor uses a chip multiprocessor (CMP) architecture. Therefore, some hardware resources (such as the last-level cache and memory controller) are shared among multiple physical cores in a single processor. However, contention for shared resources may cause severe and unpredictable performance impacts on threads running on the CMP. Previous work has studied alleviating resource contention by scheduling threads or migrating memory. However, because NUMA has multiple nodes, nodes with serious contention for shared resources may change at any time. Simply scheduling threads or migrating memory may cause the second competition for shared resources. After analyzing the memory access control flow under the NUMA architecture, this paper proposes a competition-aware scheduling algorithm, and designs a NUMA competition-aware framework based on PMU and eBPF, which dynamically perceives the shared resource competition load of NUMA nodes (hot nodes and cold nodes), and adjust the mapping relationship between threads and NUMA nodes in memory according to the contention load. © 2021 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Integrated scheduling Algorithm of Inbound and Depart Flights in Airport Based on Integrated Operation 2021

Research on Integrated Scheduling Algorithm of Inbound and D...

引用

2nd International Conference on Computing and Data Science, CONF-CDS 2021

作者： Zhuang, Qing Deng, Ke Ye, Xinxin Nanjing les Information Technology Co. Ltd. Nanjing China Cetc les Information System Co. Ltd. Nanjing China

ISBN: (纸本)9781450389570

In the past decade, with the development of economy, flight traffic flow is increasing, and the phenomenon of flight congestion and delay is increasing. The departure command and approach command lack of efficient linkage and coordination, the tower and approach determine the insertion and release intervals and time slots through manual coordination communication. The time slot resource interval cannot be fully used, so it is urgent to study a set of integrated flight scheduling algorithm based on integrated operation to improve the scene operation efficiency. From the perspective of process management system construction, this paper describes the construction background, construction content, technical innovation and existing problems of the project. The research results effectively promote the research progress in this field in China and lay a foundation for practical operation. © 2021 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：