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

IEEE Aerospace Conference (AeroConf)

作者： Deprez, Cecile Giorgi, Gabriele German Aerosp Ctr DLR Inst Commun & Nav D-82234 Wessling Oberpfaffenhof Germany

ISBN: (纸本)9781728174365

Future Global Navigation Satellite Systems (GNSSs) may implement Inter-Satellite Links (ISLs) enabling one-to-one connections between satellites of the constellation, making available an intra-system communication layer, supporting clock synchronization, and providing precise ranging. We analyze in this work the problem of scheduling ISLs for a number of scenarios in which satellites are equipped with a limited number of ISL terminals capable of point-to-point connections. Two baseline architectures are addressed. The first is based on the current Galileo system, in which two ISL terminals are assumed to be installed on each navigation satellite. The second architecture is an envisioned evolution of the Galileo system, with name Kepler, in which a Galileo-like Medium Earth Orbit (MEO) segment is complemented with a constellation of LEO satellites carrying ISL terminals and zenith-pointing antennas for GNSS signal monitoring in space. The MEO satellites are equipped with two terminals for MEO-to-MEO links and a third terminal for linking to Low Earth Orbit (LEO) satellites. The MEO-to-MEO links between neighboring satellites in the same orbital plane are assumed continuous. Different schedulers are proposed for the two scenarios, factoring multiple operational constraints such as the number of available ISL terminals on each satellite, the terminal's field-of-regard (azimuth and elevation span), the maximum link range, and the minimum required duration of each link. Within these boundaries, a link schedule is applied to determine which satellites are paired over time. The pairing criterion aims at establishing dynamically changing closed paths that maintain all the satellites of the constellation connected over time. In this paper, we analyze the link scheduling strategy devised on the two system architectures proposed. We provide a number of key performance parameters as function of the operational envelope of the ISL terminals and, for the Kepler scenario, for a nu

关键词： Space vehicles Machine-to-machine communications Global navigation satellite system Schedules Satellites scheduling algorithms Low earth orbit satellites

来源：评论

学校读者我要写书评

暂无评论

PIPO: Efficient Programmable scheduling for Time Sensitive Networking 29

PIPO: Efficient Programmable Scheduling for Time Sensitive N...

引用

29th IEEE International Conference on Network Protocols (ICNP)

作者： Zhang, Chuwen Chen, Zhikang Song, Haoyu Yao, Ruyi Xu, Yang Wang, Yi Miao, Ji Liu, Bin Tsinghua Univ Beijing Peoples R China Futurewei Santa Clara CA USA Fudan Univ Shanghai Peoples R China Southern Univ Sci & Technol Shenzhen Peoples R China Peng Cheng Lab Shenzhen Peoples R China

ISBN: (纸本)9781665441315

Time Sensitive Networking (TSN) is an emerging Ethernet technology for real-time systems. To address different Quality-of-Service (QoS) requirements of applications, IEEE 802.1 TSN Task Group has standardized several packet scheduling and shaping algorithms. The software implementation of these algorithms is hard to meet the performance requirements, while the hardware implementation in Application-Specific Integrated Circuit (ASIC) is inflexible. A hardware-programmable scheduler is necessary to deal with this dilemma. Among the existing primitives, the most expressive one is Push-In-Extract-Out (PIED), but its complexity makes the implementation very expensive. A relatively lower-cost implementation of PIED cannot guarantee the scheduling correctness for the most critical Time-Triggered (TT) traffic in TSN. As a remedy, in this paper we propose a new Push-In-Pick-Out (PIPO) primitive under a TSN programmable scheduling framework. Composed of simple priority queues, PIPO can express all existing TSN scheduling and shaping algorithms, and is flexible enough to support future ones. Our PIPO implementation guarantees the TT traffic scheduling correctness. The simulation results corroborate the theoretical analysis that the low-cost PIPO can closely approximate PIED and sustain a high bandwidth utilization. The prototype on Xilinx FPGA shows that, with 2,048 inputs, the PIPO-based scheduler achieves a throughput of 70 Mpps, which is 1.64x higher than the PIEO-based one, but using only 14.7% Look-Up Tables (LUTs) and 40.5% Block RAMs of the latter.

关键词： Costs scheduling algorithms Software algorithms Prototypes Quality of service Throughput Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

E-VM: An Elastic Virtual Machine scheduling Algorithm to Minimize the Total Cost of Ownership in a Hybrid Cloud 19

E-VM: An Elastic Virtual Machine Scheduling Algorithm to Min...

引用

19th IEEE International Symposium on Parallel and Distributed Processing with Applications (IEEE ISPA)

作者： Shetti, Milan M. Li, Bingzhe Du, David H. C. Rocket Software Waltham MA 02451 USA Oklahoma State Univ Stillwater OK 74078 USA Univ Minnesota Minneapolis MN 55455 USA

ISBN: (纸本)9781665435741

A hybrid cloud that combines both public and private clouds is becoming more and more popular due to the advantages of improved security, scalability, and guaranteed SLA (Service-Level Agreement) at a lower cost than a separate private or public cloud. The existing studies rarely consider VM migrations in a hybrid cloud environment with dynamically changed VM workloads. From an enterprise's perspective, these migrations are necessary to minimize the cost of utilizing public clouds and guarantee SLAs of VMs in a hybrid cloud environment. In this paper, we propose an elastic VM allocation and migration algorithm for a hybrid cloud, called E-VM, to fully utilize the resources in a private cloud and to minimize the cost of using a public cloud while guaranteeing the SLAs of all VMs. The E-VM considers the bi-direction migration between private and public clouds. Two components, VM-predictor and VMselector, are designed and implemented in E-VM to determine if a migration has to be triggered between private and public clouds and which VMs will be migrated to the opposite cloud, respectively. Moreover, E-VM is designed based on the existing public cloud pricing models and can be easily adapted to any cloud service provider. According to simulator results based on a set of captured industrial VM traces/workloads and additional experiments directly on a real-world hybrid cloud, the proposed E-VM can significantly reduce the total cost of using the public cloud compared to the existing VM migration schemes.

关键词： Cloud computing Costs Web services scheduling algorithms Scalability Pricing Bidirectional control

来源：评论

学校读者我要写书评

暂无评论

Deadlock Resolution for Intelligent Intersection Management with Changeable Trajectories

Deadlock Resolution for Intelligent Intersection Management ...

引用

33rd IEEE Intelligent Vehicles Symposium (IEEE IV)

作者： Lin, Li-Heng Wang, Kuan-Chun Lee, Ying-Hua Lin, Kai-En Lin, Chung-Wei Jiang, Iris Hui-Ru Natl Taiwan Univ Taipei Taiwan

ISBN: (纸本)9781665488211

Intelligent intersection management aims to schedule vehicles so that vehicles can pass through an intersection efficiently and safely. However, inaccurate control, imperfect communication, and malicious information or behavior lead to robustness issues of intelligent intersection management. In this work, we focus on improving robustness against deadlocks by changing the trajectories of vehicles. To guarantee the resolvability of deadlocks, we limit the number of vehicles in an intersection to be smaller than or equal to an intersection-specific value called the maximal deadlock-free load. We develop an algorithm to compute the maximal deadlock-free load. We further reduce the computation time by computing the loads which are pessimistic (smaller) but still deadlock-free. Since the maximal deadlock-free load only depends on the given intersection, it can be integrated with different scheduling algorithms. Experimental results demonstrate that, by changing the trajectories of vehicles and limiting the number of vehicles under maximal deadlock-free loads, our approach can guarantee deadlock-freeness and maintain good traffic efficiency.

关键词： Schedules Limiting scheduling algorithms Intelligent vehicles System recovery Robustness Trajectory

来源：评论

学校读者我要写书评

暂无评论

Incorporate mobility management into industrial wireless sensor networks 18

Incorporate mobility management into industrial wireless sen...

引用

18th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC)

作者： Jerbi, Wassim Cheikhrouhou, Omar Guermazi, Abderrahmen Hamam, Habib Trabelsi, Hafedh Univ Sfax CES Lab ENIS Higher Inst Technol Studies Sfax Sfax 3038 Tunisia Univ Sfax CES Lab ENIS Sfax 3038 Tunisia Univ Moncton Fac Engn Moncton NB E1A3E9 Canada Univ Sfax Natl Sch Engn Sfax CES Lab Sfax Tunisia

ISBN: (纸本)9781665467490

Technologies dedicated radio infrastructure deployments are no longer adequate to ensure large-scale, low-cost, and reliable communications with the growing adoption of scattered wireless technologies for current services. The goal of this article is to allow the deployment of a radio network infrastructure for numerous client applications, hence building the Internet of Things (IoT). IEEE established IEEE 802.15.4e time slotted channel hopping (TSCH), an extremely efficient, reliable, and predictable time-frequency enabled medium access control (MAC) protocol for the industrial sector, on top of the low-power IEEE 802.15.4 radio. A MAC communication schedule may be constructed from an IEEE 802.15.4e TSCH communication schedule. The IEEE 802.15.4e TSCH definition, on the other hand, makes no mention of how such scheduling may be generated, modified, or maintained. It also has no jurisdiction over the unit in charge of these obligations. This means that the standard is missing the required scheduling mechanism. To meet this demand, several communication scheduling approaches have been presented in the literature. We first establish a novel decentralized communication scheduling approach called mobile scheduling updated TSCH (MSU-TSCH), which implies that network traffic can move in any direction rather than from leave nodes to the root, in this study. The MSU-TSCH algorithm tries to plan time slots by selecting the node that is nearest to the user. While selecting a nearby node, it seeks to assign a roughly equal quantity of dedicated time slots to each member node (or member neighbor). Other scheduling algorithms may not be able to construct better schedules with neighbor nodes as a consequence.

关键词： Wireless Sensor Networks Internet of Things IoT WSNs MSU-TSCH IEEE 802.15.4e TSCH scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

RISA: Round-Robin Intra-Rack Friendly scheduling Algorithm for Disaggregated Datacenters

arXiv

引用

arXiv 2023年

作者： Kabir, Rashadul Kim, Ryan G. Nikdast, Mahdi Colorado State University Fort CollinsCO United States Intel Labs HillsboroOR United States

Recent trends see a move away from a fixed-resource server-centric datacenter model to a more adaptable "disaggregated" datacenter model. These disaggregated datacenters can then dynamically group resources to the specific requirements of an incoming workload, thereby improving efficiency. To properly utilize these disaggregated datacenters, workload allocation techniques must examine the current state of the datacenter and choose resources that not only optimize the current workload request, but future ones. Since disaggregated datacenters are severely bottlenecked by the available network resources, our work proposes a heuristic-based approach called RISA, which significantly reduces the network usage of workload allocations in disaggregated datacenters. Compared to the state-of-the-art, RISA reduces the power consumption for optical components by 33% and reduces the average CPU-RAM round-trip latency by 50%. Additionally, RISA significantly outperforms the state-of-the-art in terms of execution time. © 2023, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Cost and Reliability Aware scheduling of Workflows Across Multiple Clouds with Security Constraints

arXiv

引用

arXiv 2023年

作者： Tekawade, Atherve Banerjee, Suman Department of Computer Science and Engineering Indian Institute of Technology Jammu India Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India

Many real-world scientific workflows can be represented by a Directed Acyclic Graph (DAG), where each node represents a task and a directed edge signifies a dependency between two tasks. Due to the increasing computational resource requirements of these workflows, they are deployed on multi-cloud systems for execution. In this paper, we propose a scheduling algorithm that allocates resources to the tasks present in the workflow using an efficient list-scheduling approach based on the parameters cost, processing time, and reliability. Next, for a given a task-resource mapping, we propose a cipher assignment algorithm that assigns security services to edges responsible for transferring data in time-optimal manner subject to a given security constraint. The proposed algorithms have been analyzed to understand their time and space requirements. We implement the proposed scheduling and cipher assignment algorithm and experimented with two real-world scientific workflows namely Epigenomics and Cybershake. We compare the performance of the proposed scheduling algorithm with the state-of-art evolutionary methods. We observe that our method outperforms the state-of-art methods always in terms of cost and reliability, and is inferior in terms of makespan in some cases. © 2023, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning-Augmented scheduling for Solar-Powered Electric Vehicle Charging

arXiv

引用

arXiv 2023年

作者： Li, Tongxin Sun, Chenxi The Chinese University of Hong Kong Shenzhen China the Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

We tackle the challenge of learning to charge Electric Vehicles (EVs) with Out-of-Distribution (OOD) data. Traditional scheduling algorithms typically fail to balance near-optimal average performance with worst-case guarantees, particularly with OOD data. Model Predictive Control (MPC) is often too conservative and data-independent, whereas Reinforcement Learning (RL) tends to be overly aggressive and fully trusts the data, hindering their ability to consistently achieve the best-of-both-worlds. To bridge this gap, we introduce a novel OOD-aware scheduling algorithm, denoted OOD-CHARGING. This algorithm employs a dynamic "awareness radius", which updates in real-time based on the Temporal Difference (TD)-error that reflects the severity of OOD. The OOD-CHARGING algorithm allows for a more effective balance between consistency and robustness in EV charging schedules, thereby significantly enhancing adaptability and efficiency in real-world charging environments. Our results demonstrate that this approach improves the scheduling reward reliably under real OOD scenarios with remarkable shifts of EV charging behaviors caused by COVID-19 in the Caltech ACN-Data. © 2023, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

WMDRS: Workload-Aware Performance Model Based Multi-Task Dynamic-Quota Real-Time scheduling for Neural Processing Units

WMDRS: Workload-Aware Performance Model Based Multi-Task Dyn...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Chong Liu Yuan Yao Yi Dang Gang Yang Wei Jia Xinyu Tian Xingshe Zhou School of Computer Science Northwestern Polytechnical University Xi’an China Department of Aviation Electronics Xian Aisheng Technology Group Co.Ltd Xi’an China

To further improve the capacity of airborne embedded system for dealing with deep learning (DL) applications and reduce overall power consumption, it is necessary to equip Neural Processing Units (NPUs). Comparing with the cloud system, the airborne embedded system usually has a fixed application set, but strict real-time constraints. Unfortunately, the inherent NPU scheduler does not consider the application priority, which cannot provide the sufficient real-time capability for the airborne embedded system. At present, there are few researches on multi-task real-time scheduling for NPUs. Therefore, we propose WMDRS, a workload-aware performance model multi-task dynamic-quota real-time scheduling for Neural Processing Units. The NPU performance model based on workload-awareness can accurately predict the remaining execution time of a task, which is running concurrently with other tasks on NPU. The multi-task dynamic-quota real-time scheduling algorithm can provide the approximate preemption by dynamically adjusting NPU computing resources for active applications. In addition, we implement a prototype NPU scheduler without any hardware extension. Furthermore, the proposed NPU performance model and real-time scheduling algorithm are evaluated in realistic application sets. Experimental results demonstrate that WMDRS can achieve low prediction error and high scheduling success ratio.

关键词： Embedded systems scheduling algorithms Computational modeling Atmospheric modeling Prototypes Predictive models Multitasking

来源：评论

学校读者我要写书评

暂无评论

scheduling in Multi-Hop Wireless Networks using a Distributed Learning Algorithm

Scheduling in Multi-Hop Wireless Networks using a Distribute...

引用

International Conference on Trends in Electronics and Informatics (ICEI)

作者： Amit Jaykumar Chinchawade S. Rajyalaxmi Shashank Singh R.Anil Kumar Ravi Rastogi Mohd Asif Shah Department of Electronics and Computer Engineering Sharad Institute of Technology College of Engineering Yadrav (Ichalkaranji) Maharashtra India Department of Information Technology Vasavi College of Engineering Hyderabad Telangana India Department of Computer Science and Engineering Integral University Lucknow Uttar Pradesh India Aditya College of Engineering and Technology Surampalem Andhra Pradesh India Scientist C NIELIT Gorakhpur Uttar Pradesh India Adjunct Faculty University School of Business Chandigarh University Gharuan Mohali Punjab India

This study takes on the challenge of learning and scheduling in a Multi-Hop Wireless Network (MHWN) without having any prior knowledge of connection charges. Earlier scheduling methods needed knowledge of the connection rates, whereas Techniques for training often required a centralized authority and had an exponential performance. These represent a significant barrier to creating a reliable distributed strategy for resource allocation that relies on learning in massive multi-hop networks. Management of multihop control It is a tough task to implement wireless networks in a distributed fashion while meeting end-to-end timing constraints for a variety of flows. Using the notions of Draining Time and Continuous Review, which originate from the notion of fluid boundaries of queues, an algorithm is constructed that meets delay needs for various streams in a system. This study proposes a regulated maximal matching, a completely distributed scheduling algorithm that ensures at least 50% of the performance of a centralized method. The approach employs a distributed optimization procedure called iterative gradient ascent, which is carried out in a cyclic fashion between nodes with little data interchange. The system prioritizes flows using weights that change over time. The effectiveness of the algorithm is analyzed in a network setting where interruption is symbolized by isolated nodes.

关键词： Training Job shop scheduling scheduling algorithms Wireless networks Spread spectrum communication Sharing economy Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：