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

30th IEEE International Conference on Network Protocols (ICNP)

作者： Xu, Zhuqing Luo, Junzhou Yin, Zhimeng Wang, Shuai Chen, Ciyuan Lin, Jingkai Xiong, Runqun He, Tian Southeast Univ Nanjing Peoples R China City Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781665482349

As an emerging Low-Power Wide Area Networks (LPWAN) technology, LoRa is dedicated to providing long-range connections for pervasive Internet-of-Things devices. As LoRa operates in the unlicensed spectrum, transmissions from multiple LoRa end-devices inevitably collide into each other, leading to packet losses and increased transmission delay. Targeting at collisions caused by interferences under the same spreading factor (SF) settings, researchers introduce multiple lines of techniques. Despite their efforts, these techniques commonly neglect the potential collisions caused by interferences under different SF settings, which are resulted by the imperfect orthogonality. Given the disparate transmission power configurations and diverse deployed locations, the collisions under different SFs commonly exist in practical networks, and significantly limit the LoRa reliability. In this paper, we present X-MAC, the first scheduler that is aware of imperfect orthogonality. Technically, X-MAC detects the collisions under different SFs via tracking historical transmissions, and further performs dynamic channel scheduling to avoid collisions caused by interferences both under the same and different SFs. Extensive evaluations on testbed devices show that, compared with the state-of-the-art methods, X-MAC boosts the network scalability (number of concurrent end-devices) by 2.41 x with packet reception rate (PRR) requirement of > 95%.

关键词： Performance evaluation Protocols scheduling algorithms Scalability Packet loss Dynamic scheduling Reliability engineering

来源：评论

学校读者我要写书评

暂无评论

ELITE: Near-Optimal Heuristics for Coflow scheduling 22

ELITE: Near-Optimal Heuristics for Coflow Scheduling

引用

22nd IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGrid)

作者： Arfaoui, Afaf Elazouzi, Rachid De Pellegrini, Francesco Richier, Cedric Leguay, Jeremie Univ Avignon LIA Avignon France Hassan II Univ Casablanca NEST Res Grp ENSEM Casablanca Morocco Huawei Technol France Res Ctr Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781665499569

Reducing Coflow Completion Time (CCT) has a significant impact on data-intensive application performance in dalacenter networks. An efficient allocation of network resources allows for accelerating the computations to be performed. In this paper, we propose a new scheduler, named ELITE, to minimize the Weighted Coflow Completion Time (WCCT). Our scheduling algorithm is a 2-approximation of the optimal and the rate allocation can achieve a 4-approximation as long as the scheduling priority is respected. We also present a new rate allocation procedure, named RACO, that shows near-optimal performance when combined with our scheduling algorithms. We also propose a low complexity online scheduler, named LSPRT to attain near-optimal performance in online setting. With extensive simulations, we demonstrate the effectiveness of our algorithms by measuring the performance gain of ELITE and LSPRT over previous solutions in the literature. In particular, ELITE and LSPRT perform about 44% better than Varys, while Sincronia achieves only 32% against Varys.

关键词： Social networking (online) scheduling algorithms Heuristic algorithms Optimal scheduling Performance gain Gain measurement Particle measurements

来源：评论

学校读者我要写书评

暂无评论

Cloud-nativeWorkflow scheduling using a Hybrid Priority Rule and Dynamic Task Parallelism 13

Cloud-nativeWorkflow Scheduling using a Hybrid Priority Rule...

引用

13th Annual ACM Symposium on Cloud Computing (SoCC)

作者： Shin, Jungeun Arroyo, Diana Tantawi, Asser Wang, Chen Youssef, Alaa Nagi, Rakesh Univ Illinois Urbana IL 61801 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY USA

ISBN: (纸本)9781450394147

Demand for efficient cloud-native workflow scheduling is growing as many data science workloads are composed of several tasks with dependencies. As container technology becomes more prevalent in cloud communities, containerized workflow orchestration tools are introduced and become standard for scheduling workflows. However, current schedulers use simple heuristics and rely on the user's choice on priority and parallelism level of tasks without accounting for workflow-specific information. We introduce aworkflow-aware scheduling algorithm that usesworkflowinformation for scheduling tasks, without user input, with an objective of improving resource utilization and minimizing weighted workflow completion time, duration multiplied by user specific workflow priority. Our scheduler comprises of two strategies, a hybrid priority rule inspired by production planning ideas, and a task splitting rule based on a convex task processing time curve for the parallelism level. Using simulation, we demonstrate that our algorithm (1) produces an efficient balance of weighted workflow completion time and resource utilization and (2) outperforms deterministic parallelism.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An O(n³)-Time Algorithm for the Min-Gap Unit-Length Job scheduling Problem 28th

An O(n<SUP>3</SUP>)-Time Algorithm for the Min-Gap Unit-Leng...

引用

28th International Computing and Combinatorics Conference (COCOON)

作者： Li, Fei George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

ISBN: (纸本)9783031221040;9783031221057

We consider a problem of scheduling n unit-length jobs with integer release times and integer deadlines on a single processor. The objective is to minimize the total number of gaps, defined as a maximal duration in which the processor does not process any job. In [2], an O(n(5))-time optimal algorithms for scheduling arbitrary-length jobs and an O(n(4))-time optimal algorithm for scheduling unit-length jobs are given. In [3], a 2-approximation algorithm with running time O(n(g* + 1) logn) = O(n(2) log n) and space requirement O(n) was given for scheduling unit-length jobs, where g * is the optimal number of gaps. In this paper, we present an optimal algorithm with running time O(n(3)) for scheduling unit-length jobs, improving the prior result O(n(4)) in [2].

关键词： scheduling algorithms Dynamic programming Amortized analysis

来源：评论

学校读者我要写书评

暂无评论

DIGEST: a decentralized divergecast scheduling algorithm for IEEE 802.15.4e TSCH in the internet of things

引用

WIRELESS NETWORKS 2021年第7期27卷 4535-4550页

作者： Demir, Alper Kamil Bilgili, Sedat Adana Alparslan Turkes Sci & Technol Univ Dept Comp Engn Adana Turkey

Internet of Things is emerging as a commercial phenomenon. It is conjectured that billions of appliances will be connected within the current Internet infrastructure by 2020. These networked appliances require low-power radio and reliability. Hence, IEEE brought up a very efficient, reliable and deterministic time-frequency enabled medium access control protocol, IEEE 802.15.4e time slotted channel hopping (TSCH), on top of low power IEEE 802.15.4 radio for the industrial market. IEEE 802.15.4e TSCH is able to run a communication schedule for MAC upon a communication schedule is built. However, the issue of how such scheduling will be made, updated, and maintained is beyond the scope of the IEEE 802.15.4e TSCH standard. The unit responsible for these tasks is also out of its scope. That means, required scheduling mechanism is absent in this standard. In order to complete this gap, several communication scheduling algorithms are introduced in the literature. In this study, we first introduce another decentralized divergecast communication scheduling algorithm, called as DIGEST, where divergecast implies that network traffic moves in any directions opposed to convergecast where network traffic moves from leave nodes to root. That DIGEST algorithm tries to schedule time slots by selecting a neighbor node at first. When choosing a neighbor node, it tries to make almost equal number of dedicated time slots to each neighbor. In this way, it can provide better schedules with neighbor nodes than other scheduling algorithms. We evaluate the effectiveness of DIGEST, Diva, and Berkeley's Aloha-based scheduling algorithms under static and mobile environments by running extensive simulations. Our simulation results indicate that the DIGEST algorithm is superior to the others in terms of the neighbor connectivity ratio.

关键词： IEEE 802 15 4 IEEE 802 15 4e TSCH IETF 6TiSCH scheduling algorithms Internet of things

来源：评论

学校读者我要写书评

暂无评论

A Schedulable Energy scheduling Algorithm With Fair Delay for Smart Grid Distributions

引用

IEEE SYSTEMS JOURNAL 2021年第2期15卷 2871-2882页

作者： Gao, Jingcheng Xiao, Yang Li, Shuhui Li, Tieshan Dalian Maritime Univ Nav Coll Gaoxinyuan 116026 Peoples R China Univ Alabama Dept Comp Sci Tuscaloosa AL 35487 USA Univ Alabama Dept Elect & Comp Engn Tuscaloosa AL 35487 USA Univ Elect Sci & Technol China Sch Automat Engn Chengdu 610054 Peoples R China

Fairness is now a significant issue in demand response because of its importance in customer attraction. Studies have shown that current demand response programs are lacking fairness considerations so that this may prevent demand response program penetration. In this article, fairness will be discussed and explored in terms of fair delay of energy usage instead of the existing fair bill approach. A mathematical formation of the system is provided and an algorithm is proposed, including back-off, carry-on, and optimization procedures. In order to find the best policy for using this algorithm, simulations are conducted to find the best policy in order to lower all the customers' total cost while bounding the customers' delays within a fairness range. The simulation results show the best policy under two different simulation setups. Moreover, the energy consumption scheduling algorithm with the fair delay control has much better fair delay index performance than the energy consumption scheduling algorithm without fair delay control, with 20%-65% improvement, depending on the environments.

关键词： Load management Delays Smart grids Energy consumption Pricing Home appliances scheduling algorithms Demand response energy consumption scheduling fair delay real-time pricing (RTP) smart grid total cost minimization

来源：评论

学校读者我要写书评

暂无评论

Poster: A Dynamic Task scheduling using Multi-Platoon Architecture in Vehicular Networks 42

Poster: A Dynamic Task Scheduling using Multi-Platoon Archit...

引用

42nd IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Xiao, Tingting Chen, Chen Pei, Qingqi Wan, Shaohua Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Zhongnan Univ Econ & Law Sch Informat & Safety Engn Wuhan 430073 Peoples R China

ISBN: (数字)9781665471770

ISBN: (纸本)9781665471770

The autonomous vehicle platoon has the potential to cope with the stress caused by the resource-constrained vehicles' demand for processing power and the spread-out deployment of MEC-BS. In this poster, we focus on a multi-platoons scenario for task scheduling. Our objective is to minimize the overall energy consumption subject to the long-term latency constraint. To characterize stochastic properties and deal with coupling between variables, we propose a dynamic task scheduling algorithm based on Lyapunov optimization (LOTS). We theoretically and empirically evaluate the performance of the proposed algorithm, which is illustrated to be significantly better than state-of-the-art and other benchmark approaches in terms of execution latency and energy consumption.

关键词： Energy consumption scheduling algorithms Heuristic algorithms Computer architecture Benchmark testing Dynamic scheduling Task analysis

来源：评论

学校读者我要写书评

暂无评论

Shield: Safety Ensured High-efficient scheduling for Magnetic MIMO Wireless Power Transfer System 41

Shield: Safety Ensured High-efficient Scheduling for Magneti...

引用

41st IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Zhou, Wangqiu Zhou, Hao Wang, Xiaoyu Guo, Kaiwen Tan, Haisheng Li, Xiang-Yang Univ Sci & Technol China Sch Comp Sci & Technol LINKE Lab Hefei Peoples R China Univ Sci & Technol China CAS Key Lab Wireless Opt Commun Hefei Peoples R China

ISBN: (纸本)9781665458221

Recently, the developed techniques such as magnetic resonant coupling (MRC) and multiple-input multiple-output (MIMO) transmission have significantly improved the charging efficiency and distance for wireless power transfer (WPT) systems. However, the electromagnetic radiation (EMR) safety of wireless charging is critical in practice while mostly ignored. In this work, we take the EMR safety into account in MIMO MRC-WPT systems. We propose a safety ensured high-efficient scheduling algorithm for magnetic MIMO wireless power transfer system (called Shield). Technically, we firstly devise a simple but accurate Z-axis rotational symmetrical EMR model along with a magnetic-field-line-based meshing scheme. Further, we express the EMR safety requirement in the continuous physical space with a limited number of constraints via random sampling and rule-based filtering. Finally, we build up a system prototype for Shield and conduct extensive experiments. With the given power budget and resonant frequency, the results reveal that the EMR safety requirement only influences the charging performance of an MRC-WPT system within a certain range. Furthermore, Shield can dramatically improve the payload power transfer efficiency (PTE) by up to 66.60% compared with state-of-the-art baselines while guaranteeing the EMR safety.

关键词： Shape scheduling algorithms Magnetic separation Magnetic resonance Wireless power transfer Magnetic noise Safety

来源：评论

学校读者我要写书评

暂无评论

On Batching Task scheduling 43

On Batching Task Scheduling

引用

43rd IEEE Real-Time Systems Symposium (RTSS)

作者： Shi, Hehuan Chen, Lin Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou Peoples R China Univ Paris Saclay Paris France

ISBN: (数字)9781665453462

ISBN: (纸本)9781665453462

We investigate the following batching task scheduling problem. There is a set of tasks to be executed on a number of machines. Some tasks can be executed simultaneously on a single machine, while others require exclusive use of an entire machine. The scheduler needs to find a schedule giving optimum system utility. We develop an algorithmic framework for this batching task scheduling by investigating four formulations of the problem, the bounded and unbounded batching, depending on whether the number of simultaneously executable tasks is bounded, the synchronous and asynchronous batching, depending on whether the batched tasks need to start synchronously. For each formulation, we develop our approximation algorithm whose approximation ratio outperforms the best existing result. We further perform numerical simulations in a wide variety of system settings to complement our theoretical analysis and demonstrate the effectiveness of our scheduling algorithms.

关键词： Schedules scheduling algorithms Numerical simulation Approximation algorithms Real-time systems Task analysis Single machine scheduling

来源：评论

学校读者我要写书评

暂无评论

Self-Cueing Real-Time Attention scheduling in Criticality-Aware Visual Machine Perception 28

Self-Cueing Real-Time Attention Scheduling in Criticality-Aw...

引用

28th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)

作者： Liu, Shengzhong Fu, Xinzhe Wigness, Maggie David, Philip Yao, Shuochao Sha, Lui Abdelzaher, Tarek Univ Illinois Urbana IL 61801 USA MIT Cambridge MA 02139 USA US Army Res Labs Washington DC USA George Mason Univ Fairfax VA 22030 USA

ISBN: (纸本)9781665499989

This paper presents a self-cueing real-time framework for attention prioritization in AI-enabled visual perception systems that minimizes a notion of state uncertainty. By attention prioritization we refer to inspecting some parts of the scene before others in a criticality-aware fashion. By self-cueing, we refer to not needing external cueing sensors for prioritizing attention, thereby simplifying design. We show that attention prioritization saves resources, thus enabling more efficient and responsive real-time object tracking on resource-limited embedded platforms. The system consists of two components: First, an optical flow-based module decides on the regions to be viewed on a subframe level, as well as their criticality. Second, a novel batched proportional balancing (BPB) scheduling policy decides how to schedule these regions for inspection by a deep neural network (DNN), and how to parallelize execution on the GPU. We implement the system on an NVIDIA Jetson Xavier platform, and empirically demonstrate the superiority of the proposed architecture through an extensive evaluation using a real-word driving dataset.

关键词： Visualization Schedules Uncertainty scheduling algorithms Pipelines Optical computing Real-time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：