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

Recent Advances in Engineering and Computational Sciences (RAECS)

作者： Lokesh Kumar Arya Amandeep Verma University Institute of Engg. & Technology Panjab University Chandigarh India

Cloud computing is an emerging IT field. In cloud, service providers managed and provided resources to users. Software or hardware can be used on rental basis; there is no need to buy them. Most of the cloud applications are modeled as a workflow. In workflows to complete the whole task applications require various sub-tasks to be executed in a particular fashion. Key role in cloud computing systems is managing different tasks. Workflow scheduling is the most important part of cloud computing, because based on the different criteria it decides cost, execution time and other performances. This review paper describes about cloud computing introduction, basics of workflows and scheduling, some scheduling algorithms used in workflow management, factors considered by these algorithms, type of algorithm and tool used.

关键词： Cloud computing scheduling algorithms scheduling Genetic algorithms Optimization Data transfer

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A survey of backpressure based scheduling algorithms for delay tolerant networks

A survey of backpressure based scheduling algorithms for del...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： J. Dhivya M. Vanithalakshmi S.A Engineering College Chennai Communication Systems India

ISBN: (纸本)9781479936984

The Delay Tolerant Networks (DTN) are networks where the end-to-end paths between source and destination are unstable or unlikely. In such networks, conventional path-discovery-based MANET routing techniques like AODV and DSR are not possible because the network may not form a single connected partition at any time, and thus a full path may never exist between the source and the destination. In such cases a store and forward algorithm is required, where the data packets can be stored in the network and be delivered before its deadline is over. Backpressure is one such algorithm, which stores data packets in queues and tries to deliver data packets to their final destination by building up gradients. It has been proved that this algorithm works effectively during peak traffic period compared to other DTN algorithm such as epidermis, spray and wait, Maxprop, etc., This paper is brief study of backpressure algorithm from its origin to its developed versions at present. It also explains the methods that can improve the working of backpressure in high traffic as well as low traffic with reduced overloads at the nodes maintaining queues.

关键词： Delays Routing Educational institutions scheduling algorithms Throughput Telecommunication traffic Redundancy

来源：评论

学校读者我要写书评

暂无评论

Work-in-Progress: Measuring Security Protection in Real-time Embedded Firmware 43

Work-in-Progress: Measuring Security Protection in Real-time...

引用

43rd IEEE Real-Time Systems Symposium (RTSS)

作者： Wu, Yuhao Wang, Yujie Zhai, Shixuan Li, Zihan Li, Ao Wang, Jinwen Zhang, Ning Washington Univ St Louis MO 63110 USA

ISBN: (数字)9781665453462

ISBN: (纸本)9781665453462

The proliferation of real-time cyber-physical systems (CPS) is making profound changes to our daily life. Many real-time CPSs are security and safety-critical because of their continuous interactions with the physical world. While the general perception is that the security protection mechanism deployment is often absent in real-time embedded systems, there is no existing empirical study that measures the adoption of these mechanisms in the ecosystem. To bridge this gap, we conduct a measurement study for real-time embedded firmware from both a security perspective and a real-time perspective. To begin with, we collected more than 16 terabytes of embedded firmware and sampled 1,000 of them for the study. Then, we analyzed the adoption of security protection mechanisms and their potential impacts on the timeliness of real-time embedded systems. Besides, we measured the scheduling algorithms supported by real-time embedded systems since they are also security-critical.

关键词： Bridges Embedded systems scheduling algorithms Ecosystems Cyber-physical systems Real-time systems Security

来源：评论

学校读者我要写书评

暂无评论

Handling heterogeneous workflows in the Cloud while enhancing optimizations and performance 15

Handling heterogeneous workflows in the Cloud while enhancin...

引用

15th IEEE International Conference on Cloud Computing (IEEE CLOUD) / IEEE World Congress on Services (IEEE SERVICES)

作者： Cadorel, Emile Coullon, Helene Menaud, Jean-Marc Univ Lille CRIStAL INRIA Spirals Lille France IMT Atlantique INRIA LS2N Nantes France

ISBN: (纸本)9781665481373

The goal of a workflow engine is to facilitate the writing, the deploying, and the execution of a scientific workflow (i.e., graph of coarse-grain and heterogeneous tasks) on distributed infrastructures. With the democratization of the Cloud paradigm, many workflow engines of the state of the art offer a way to execute workflows on distant data centers by using the Infrastructure-as-a-Service (IaaS) or the Function-as a-Service (FaaS) services of Cloud providers. Hence, workflow engines can take advantage of the (presumably) infinite resources and the economical model of the Cloud. However, two important limitations lie in this vision of Cloud-oriented workflow engines. First, by using existing services of Cloud providers, and by managing the workflows at the user side, the Cloud providers are unaware of both the workflows and their user needs, and cannot apply specific resource optimizations to their infrastructure. Second, for the same reasons, handling the heterogeneity of tasks (different operating systems) in workflows necessarily degrades either the transparency for the users (who must provision different types of resources), or the completion time performance of the workflows, because of the stacking of virtualization layers. In this paper, we tackle these two limitations by presenting a new Cloud service dedicated to scientific workflows. Unlike existing workflow engines, this service is deployed and managed by the Cloud providers, and enables specific resource optimizations and offers a better control of the heterogeneity of the workflows. We evaluate our new service in comparison to Argo, a well-known workflow engine of the literature based on FaaS services. This evaluation was made on a real distributed experimental platform with a realistic and complex scenario.

关键词： Cloud computing scheduling algorithms Heuristic algorithms FAA Writing Dynamic scheduling Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：