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

14th IEEE International Scientific and Technical Conference on Dynamics of Systems, Mechanisms and Machines (Dynamics)

作者： Monakhov, Yuri Kuznetsova, Anna Monakhov, Mikhail Telny, Andrey Bednyatsky, Ilya Vladimir State Univ Dept Informat & Informat Secur Vladimir Russia

ISBN: (纸本)9781728180960

In this article, authors present the results of testing the modified HTB traffic control algorithm in an experimental setup. The algorithm is implemented as a Linux kernel module. An analysis of the experimental results revealed the effect of uneven packet loss in priority classes. In the second part of the article, the authors propose a solution to this problem by applying a distribution scheme for the excess of tokens, according to which excess class tokens are given to the leaf with the highest priority. The new modification of the algorithm was simulated in the AnyLogic environment. The results of an experimental study demonstrated that dividing the excess tokens of the parent class between daughter classes is less effective in terms of network performance than allocating the excess tokens to a high-priority class during the competition for tokens between classes. In general, a modification of the HTB algorithm that implements the proposed token surplus distribution scheme yields more consistent delay times for the high-priority class.

关键词： network availability traffic control traffic prioritization scheduling algorithm QoS HTB packet loss

来源：评论

学校读者我要写书评

暂无评论

A novel dispatching rule for semi-heterarchical architectures in the Industry 4.0 context

引用

IFAC-PapersOnLine 2021年第1期54卷 86-91页

作者： Silvestro Vespoli Miriam Scarpati Guido Guizzi Andrea Grassi Università degli Studi di Napoli Federico II Dipartimento di Ingegneria Chimica dei Materiali e della Produzione Industriale P.le Tecchio 80 80125 Napoli ITALY

Industry 4.0 is changing the way to produce, pursuing increased flexibility of production systems and an ever-greater decision-making autonomy of the machines. The aim is to achieve high level of performances even in market scenarios requiring high level of customization, as the Mass Customisation (MC) paradigm imposes. Current hierarchical Manufacturing Planning and Control (MPC) systems showed limits in catching this goal, primarily due to their structural lack of flexibility. For this reason, the interest in the hybrid MPC architectures like the semi-heterarchical one is increasing. The objective of this work is to contribute to the design of such an architecture, proposing a new scheduling mechanism for the lowest decisional level. This mechanism, differently from the ones already proposed in the literature, schedules the next jobs to be admitted in the system choosing them by couples. The proposed rule has been tested through a simulation environment in three different scenarios of demand generation rate. The results showed an improvement in demand absorption and productivity compared to the rules used up to now.

关键词： Industry 4.0 Mass Customization Flow-Shop CONWIP scheduling algorithm semi-heterarchical architecture

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Cost Model to Minimize Energy Consumption and Processing Time for IoT Tasks in a Mobile Edge Computing Environment 18th

A Dynamic Cost Model to Minimize Energy Consumption and Proc...

引用

18th International Conference on Service-Oriented Computing (ICSOC)

作者： Grave Gross, Joao Luiz Matteussi, Kassiano Jose dos Anjos, Julio C. S. Resin Geyer, Claudio Fernando Univ Fed Rio Grande do Sul Inst Informat BR-91509900 Porto Alegre RS Brazil

ISBN: (纸本)9783030653101;9783030653095

The rapid growth of IoT devices and applications with data-intensive processing has led to energy consumption and latency concerns. These applications tend to offload task processing to remote Data Centers in the Cloud, distant from end-users, increasing communication latency and energy costs. In such a context, this work proposes a dynamic cost model to minimize energy consumption and total elapsed time for IoT devices in Mobile Edge Computing environments. The solution presents a Time and Energy Minimization Scheduler (TEMS) that executes the cost model, validated through simulation, which resulted in a reduction in energy consumption by up to 51.61% and in task completion time by up to 86.65%.

关键词： Mobile Edge Computing Internet of Things Cost minimization model Energy consumption scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Modified Compressed Sparse Row format for accelerated FPGA-based sparse matrix multiplication 52

Modified Compressed Sparse Row format for accelerated FPGA-b...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Pligouroudis, Michail Nuno, Rafael Angel Gutierrez Kazmierski, Tom Univ Southampton Sch Elect & Comp Sci Southampton Hants England

ISBN: (数字)9781728133201

ISBN: (纸本)9781728133201

This contribution presents a new Modified Compressed Sparse Row (MCSR) format designed for multi-core FPGA-based hardware accelerators for the calculation of Sparse Matrix Vector Multiplication (SMVM). Current state-of-the-art methods suffer from memory bandwidth bottlenecks affecting the speed of parallel SMVM. The salient feature of the proposed MCSR format is that an extension of Hu's scheduling algorithm has been adopted to relocate the non-zero entries of the sparse matrix to ensure a continuous flow of data at each core, thus eliminating redundant memory requests and unnecessary intermediate result storage. Consequently, effects of the memory bandwidth bottleneck are reduced. Dedicated Multiplication and Accumulation (MAC) cores have been used in the experiments presented in this paper. The correct functionality of the proposed method is verified through Modelsim simulations. A thorough investigation of the effectiveness of the new format was carried out using a number of case studies with variable sparsities and matrix sizes, resulting to a speedup that reaches up to four orders of magnitude compared with an Intel i7 CPU.

关键词： Matrix Vector Multiplication Compressed Sparse Raw Format Hardware Accelerator scheduling algorithm FPGA

来源：评论

学校读者我要写书评

暂无评论

Improved DAG Tasks Stretching algorithm Based on Multi-core Processors 11

Improved DAG Tasks Stretching Algorithm Based on Multi-core ...

引用

11th IEEE International Conference on Software Engineering and Service Science (IEEE ICSESS)

作者： Cao, Sheng Bian, Jiali Beijing Univ Posts & Telecommun Sch Comp Sci 10 Xitucheng Rd Beijing Peoples R China

ISBN: (纸本)9781728165790

The performance of multi-core real-time operating system is greatly affected by the quality of tasks scheduling algorithm. Directed acyclic graph (DAG) task model can better represent the dependency between subtasks in multi-core real-time system. However, the scheduling algorithm previously applied to independent sequential tasks is no longer suitable for this kind of tasks, the efficient DAG tasks scheduling algorithm has become the current research hotspot. This paper discusses the stretching algorithm with excellent performance, and on the basis of the stretching algorithm, an improved stretching algorithm is proposed to overcome its shortcoming of ignoring dependence between subtasks. The performance optimization is verified by simulation experiments.

关键词： multi-core real-time system DAG tasks scheduling algorithm stretching algorithm

来源：评论

学校读者我要写书评

暂无评论

Preemptive scheduling for approximate computing on heterogeneous machines: Tradeoff between weighted accuracy and makespan

引用

INFORMATION PROCESSING LETTERS 2020年 153卷 105870-000页

作者： Aggarwal, Vaneet Mao, Ruijiu Purdue Univ W Lafayette IN 47907 USA

Approximate computing is a research area which investigates a wide spectrum of techniques to trade off computation time for better accuracy. This paper models the accuracy of the computation as a concave, possibly non-differentiable function of job size to decide the accuracy of each job as well as the scheduling decision of the jobs on heterogeneous servers. The two metrics of interest are the makespan of the completion time of the jobs and the weighted accuracy of the different jobs. For a given makespan, an algorithm is provided that achieves the optimal weighted accuracy of computations, thus providing an optimal tradeoff between the two objectives for preemptive scheduling of approximate computing jobs on multiple servers. The proposed algorithm decides the task sizes of each of the jobs, which gives the accuracy of the jobs in addition to the schedule of these partial jobs on the servers. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Approximate computing Distributed computing scheduling algorithm Preemptive scheduling

来源：评论

学校读者我要写书评

暂无评论

Mapping TSN Traffic scheduling and Shaping to FPGA-Based Architecture

引用

IEEE ACCESS 2020年 8卷 221503-221512页

作者： Zhou, Zifan Berger, Michael Stubert Yan, Ying Tech Univ Denmark Dept Photon Engn DK-2800 Lyngby Denmark

Time-Sensitive Networking (TSN), which evolves from the Ethernet standards, has been developed to ensure deterministic transmission in data networks. Asynchronous Traffic Shaping (ATS) extends the conventional synchronized TSN with an asynchronous scheduler to guarantee a bounded transmitting delay. In this work, we present a Field Programmable Gate Arrays (FPGA) implementation of a TSN scheduling entity, which leverages ATS for the frame forwarding process. We explore the ATS design by function blocks and compare it with a benchmark design utilizing strict-priority scheduling. In terms of operating frequency, our results indicate that strict-priority scheduling performs 1.05% to 9.56% higher maximum frequency than ATS with the same configurations. Regarding resource utilization, ATS consumes 51% to 119% more logic blocks and 51% to 101% more registers than strict-priority scheduling. Based on the synthesis and fitting results from Register-Transfer Level (RTL) simulations, we provide a general vision of designing and implementing considerations of the ATS function. Specifically, we show the influences of the buffer and bus width configuration on the FPGA implementation scale and data rate.

关键词： Field programmable gate arrays Hardware Switches Ethernet Real-time systems Logic gates Throughput Ethernet networks real-time systems hardware scheduling algorithm FPGA

来源：评论

学校读者我要写书评

暂无评论

A Consortium Blockchain-Based Agricultural Machinery scheduling System

引用

SENSORS 2020年第9期20卷 2643-2643页

作者： Yang, Haotian Xiong, Shuming Frimpong, Samuel Akwasi Zhang, Mingzheng Jiangsu Univ Sch Comp Sci & Commun Engn Zhenjiang 212013 Jiangsu Peoples R China Univ Nottingham Sch Business Nottingham NG7 2RD England Ghana Technol Univ Coll Dept Comp Engn PMB 100 Accra Ghana

The introduction of a consortium blockchain-based agricultural machinery scheduling system will help improve the transparency and efficiency of the data flow within the sector. Currently, the traditional agricultural machinery centralized scheduling systems suffer when there is a failure of the single point control system, and it also comes with high cost managing with little transparency, not leaving out the wastage of resources. This paper proposes a consortium blockchain-based agricultural machinery scheduling system for solving the problems of single point of failure, high-cost, low transparency, and waste of resources. The consortium blockchain-based system eliminates the central server in the traditional way, optimizes the matching function and scheduling algorithm in the smart contract, and improves the scheduling efficiency. The data in the system can be traced, which increases transparency and improves the efficiency of decision-making in the process of scheduling. In addition, this system adopts a crowdsourcing scheduling mode, making full use of idle agricultural machinery in the society, which can effectively solve the problem of resource waste. Then, the proposed system implements authentication access mechanisms, and allows only authorized users into the system. It includes transactions based on digital currency and eliminates third-party platform to charge service fees. Moreover, participating organizations have the opportunity to obtain benefits and reduce transaction costs. Finally, the upper layers supervision improves the efficiency and security of consensus algorithm, allows supervisors to block users with malicious motives, and always ensures system security.

关键词： consortium blockchain matching function scheduling algorithm smart contract supervision consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Utility-based scheduling for Public Displays with Live Content 19

Utility-based Scheduling for Public Displays with Live Conte...

引用

8th ACM International Symposium on Pervasive Displays (Pervasive Displays)

作者： Bushman, Kristi Labrinidis, Alexandros Univ Pittsburgh Pittsburgh PA 15260 USA

ISBN: (纸本)9781450367516

The pervasiveness of public displays is prompting an increased need for "fresh" content to be shown, that is highly engaging and useful to passerbys. As such, live or time-sensitive content is often shown in conjunction with "traditional" static content, which creates scheduling challenges. In this work, we propose a utility-based framework and a novel scheduling algorithm for handling live and non-live content on public displays. We also experimentally evaluate our proposed algorithm against a number of alternatives under a variety of workloads.

关键词： pervasive displays scheduling algorithm utility function deadlines

来源：评论

学校读者我要写书评

暂无评论

Swarm-Based Energy Efficient scheduling for Wireless Sensor Networks

Swarm-Based Energy Efficient Scheduling for Wireless Sensor ...

引用

IEEE Conference on Standards for Communications and Networking (IEEE CSCN)

作者： Van der Lee, Tim Exarchakos, Georgios de Groot, Sonia Heemstra Eindhoven Univ Technol Dept Elect Engn Eindhoven Netherlands

ISBN: (纸本)9781728108643

In recent years, wireless sensor networks have become attractive to industries due to their low operational cost and potential productivity gain. Designed to operate on batteries, some devices can operate several years without requiring human intervention. However, scheduling reliable wireless communication becomes challenging when considering the energy consumption of the devices. Furthermore, actual industrial network deployments and data traffic are often unpredictable as they greatly vary depending on the field of application. While application-specific solutions exist, an adaptive and application-agnostic solution is preferred. This work proposes a new wireless scheduling algorithm to address the reliability issue in wireless sensor networks, while considering the energy cost. The algorithm operates as a swarm and optimizes the number of communication resources allocated to each device in a short time. Tested on the IEEE 802.15.4 TSCH communication protocol, the algorithm is compared to the Minimal scheduling Function (MSF), state of the art of TSCH scheduling. The algorithm highlights a strong performance in terms of packets reception ratio and latency. Furthermore, it shows an increased energy efficiency measured in current consumed per delivered packet.

关键词： Wireless Sensor Networks scheduling algorithm Reliability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：