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

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Son Dinh Christopher Gill Kunal Agrawal Washington University in St. Louis

ISBN: (数字)9781728144030

ISBN: (纸本)9781728144047

Federated scheduling is a generalization of partitioned scheduling for parallel tasks on multiprocessors, and has been shown to be a competitive scheduling approach. However, federated scheduling may waste resources due to its dedicated allocation of processors to parallel tasks. In this work we introduce a novel algorithm for scheduling parallel tasks that require more than one processor to meet their deadlines (i.e., heavy tasks). the proposed algorithm computes a deterministic schedule for each heavy task based on its internal graph structure. It efficiently exploits the processors allocated to each task and thus reduces the number of processors required by the task. Experimental evaluation shows that our new federated scheduling algorithm significantly outperforms other state-of-the-art federated-based scheduling approaches, including semi-federated scheduling and reservation-based federated scheduling, that were developed to tackle resource waste in federated scheduling, and a stretching algorithm that also uses the tasks' graph structures.

关键词： Task analysis Program processors Scheduling Schedules Scheduling algorithms real-time systems

来源：评论

学校读者我要写书评

暂无评论

Phase Estimation from Noisy Data with Gaps 13

Phase Estimation from Noisy Data with Gaps

引用

13th international conference on Sampling theory and applications (SampTA)

作者： Huang, Yitong Bowman, Clark Walch, Olivia Forger, Daniel Dartmouth Coll Dept Math Hanover NH 03755 USA Univ Michigan Dept Math Ann Arbor MI 48109 USA Univ Michigan Dept Neurol Ann Arbor MI 48109 USA Univ Michigan Dept Computat Med & Bioinformat Ann Arbor MI 48109 USA Univ Michigan Michigan Inst Data Sci Ann Arbor MI 48109 USA

ISBN: (纸本)9781728137414

Determining the phase of a rhythm embedded in a time series is a key step in understanding many oscillatory systems. While existing approaches such as harmonic regression and cross-correlation are effective even when some data are missing, we show that they can produce biased estimates of phase when missing data are consecutive (i.e., there is a gap). We propose a simple modification of the least-squares approach, Gap Orthogonalized Accelerated Least Squares (GOALS), which addresses this issue with a negligible increase in computational expense. We test GOALS against other approaches on a synthetic dataset and on a real-world dataset of activity recorded by an Apple Watch, showing in both cases that GOALS is effective at recovering phase estimates from noisy data with gaps.

关键词： embedded systems

来源：评论

学校读者我要写书评

暂无评论

Development of a hand pose recognition system on an embedded computer using Artificial Intelligence 26

Development of a hand pose recognition system on an embedded...

引用

ieee 26th international conference on Electronics, Electrical Engineering and computing (INTERCON)

作者： Nunez Fernandez, Dennis Univ Nacl Ingn Lima Peru

ISBN: (纸本)9781728136462

the recognition of hand gestures is a very interesting research topic due to the growing demand in recent years in robotics, virtual reality, autonomous driving systems, human machine interfaces and in other new technologies. Despite several approaches for a robust recognition system, gesture recognition based on visual perception has many advantages over devices such as sensors, or electronic gloves. this paper describes the implementation of a visual-based recognition system on a embedded computer for 10 hand poses recognition. Hand detection is achieved using a tracking algorithm and classification by a light convolutional neural network. Results show an accuracy of 94.50%, a low power consumption and a near real-time response. thereby, the proposed system could be applied in a large range of applications, from robotics to entertainment.

关键词： Gesture Recognition Human-Machine Interaction Recognition System Hand Poses embedded Computer

来源：评论

学校读者我要写书评

暂无评论

Overcoming Memory Constraint for Improved Target Classification Performance on embedded Deep Learning systems

Overcoming Memory Constraint for Improved Target Classificat...

引用

ieee international conference on High Performance computing and Communications (HPCC)

作者： Fan Wu Huanghe Liu Zongwei Zhu Cheng Ji Chun Jason Xue Suzhou Institute for Advanced Study University of Science and Technology of China China Nanjing University of Science and Technology China City University of Hong Kong Hong Kong

ISBN: (纸本)9781728176505

Pattern recognition applications such as face recognition, detection of broken eggs, and classification of agricultural products are all using image classification in deep neural networks to improve the quality of services. However, traditional cloud inference models suffer from several problems such as network delay fluctuations and privacy leakage. In this regard, most real-time applications currently need to be deployed on edge computing devices. Constrained by the computing power and memory limitations of edge devices, the use of an efficient memory manager for model reasoning is the key to improving the quality of service. this study firstly explored the incremental loading strategy of model weights for the model reasoning. Next, the memory space at runtime is optimized through data layout reorganization from the spatial dimension. In particular, our proposed schemes are orthogonal and transparent to the model. Experimental results demonstrate that the proposed approach reduced the memory consumption by 43.74% on average without additional reasoning time overhead.

关键词： Privacy Tensors Runtime Computational modeling Memory management Layout Quality of service

来源：评论

学校读者我要写书评

暂无评论

Preemption-Aware Allocation, Deadline Assignment for Conditional DAGs on Partitioned EDF

Preemption-Aware Allocation, Deadline Assignment for Conditi...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Houssam-Eddine ZAHAF Giuseppe Lipari Smail Niar Abou El Hassan Benyamina CRIStAL UMR 9189 HiPeRT Lab. Lille University Unimore University CRIStAL UMR 3380 Lille University LAMIH UPHF University LAPECI Oran 1 University

ISBN: (数字)9781728144030

ISBN: (纸本)9781728144047

Heterogeneous hardware platforms are often used for implementing complex critical real-time applications, like Advanced driver-assistance systems (ADAS) and autonomous driving. Typically, they are composed of CPU hosts and a set of accelerators. To better support real-time workloads, several hardware accelerators have evolved to allow preemption for computationally intensive tasks, such as GPUs. However, their preemption costs can be very high compared to classical CPU preemption, and therefore must be taken into account at design time and in the scheduling analysis. In this paper, we address mainly two tightly correlated problems: (i) task allocation for a set of real-time tasks, modeled by conditional directed acyclic graphs (C-DAG), onto multiprocessor platforms under partitioned preemptive Earliest Deadline First scheduling, assuming a non-negligible cost of preemption, and (ii) intermediate deadlines and offsets assignments to real-time C-DAGs, so to remove unnecessary preemption and reduce the total preemption overhead. the effectiveness of the proposed technique is evaluated using a large set of synthetic tasks sets.

关键词： Task analysis real-time systems Processor scheduling Resource management Computational modeling Computer architecture time factors

来源：评论

学校读者我要写书评

暂无评论

Integrating Preemption thresholds with Limited Preemption Scheduling

Integrating Preemption Thresholds with Limited Preemption Sc...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： John Cavicchio Nathan Fisher Wayne State University

ISBN: (数字)9781728144030

ISBN: (纸本)9781728144047

the benefits of the limited preemption scheduling model serve to minimize preemption overhead while enabling cooperative scheduling between real-time tasks. Preemption point placement (PPP) algorithms are employed to select a suitable subset of preemption locations for limited preemption scheduling that optimize task worst case execution time. Similarly, preemption threshold scheduling enhances schedulability in a fully-preemptive environment by taking advantage of execution time slack in a task set by adjusting preemption thresholds to permit tasks to completely execute non-preemptively where possible. the ability to execute non-preemptively offers reduced cache related preemption delay (CRPD) further enhancing limited preemption schedulability. In this work, we integrate limited preemption scheduling using preemption placement with preemption threshold scheduling to realize further task set schedulability benefits. A case study using synthetically generated tasksets will demonstrate the significantly improved (up to a 30% increase in breakdown utilization) schedulability benefits of our proposed integrated PPP and optimal threshold assignment (OTA) algorithm.

关键词： Task analysis Scheduling real-time systems Processor scheduling Computational modeling Optimal scheduling Delays

来源：评论

学校读者我要写书评

暂无评论

On the use of models for real-time reconfigurations of embedded systems 13

On the use of models for real-time reconfigurations of embed...

引用

13th international conference on Software Technologies, ICSOFT 2018

作者： Armaoui, Naima Naija, Mohamed Ahmed, Samir Ben Laboratory of Computer for Industrial Systems INSAT Tunis Tunisia

ISBN: (纸本)9789897583209

the development of Multi-Processor System-on-Chip (MPSoC) for high-performance embedded applications has become a major challenge for designers due to a number of crucial constraints to meet, such as functional correctness and temporal performance. this paper presents a new process intended to support and facilitate the co-design and scheduling analysis of high-performance applications on MPSoCs. the contribution of this process is that it is designed to i) model the system functionality, execution architectures and allocation of software and hardware parts using a high-level modeling language ii) verify scheduling analysis of the system using a simulation tool and iii) offer a reconfiguration technique in order to meet constraints and preserve the system non-functional properties (NFPs). As a proof of concepts, we present a case study consisting of a JPEG encoder, with very promising results. Copyright © 2018 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

GMAS: A Geo-Aware MAS-Based Workflow Allocation Approach on Hybrid-Edge-Cloud Environment

GMAS: A Geo-Aware MAS-Based Workflow Allocation Approach on ...

引用

ieee international conference on Cloud computing, CLOUD

作者： Meng Niu Bo Cheng Jun-Liang Chen State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9781728187808

ISBN: (纸本)9781728187815

Cloud computing is expanding to distributed edge computing(or known as fog computing). Connecting edge and cloud open great potential for real-time and mobility support workflow applications. However, scheduling workflow on a hybrid edge-cloud environment is an NP-hard problem. this paper proposes the Geo-Aware Multi-Agents-System-Based Workflow Allocation Approach(GMAS). Leveraging a novel geo-aware negotiation mechanism, GMAS addresses resource location caused transmission delays, which are the primary sources of workflow bottlenecks. In Multi-Agents-System(MAS), this paper proposes a geo-aware cost model and a dynamic workflow re-structuring strategy that decrease the impact of resource locations on workflow cost. Finally, this paper evaluates GMAS on Cloudsim, and the result shows that GMAS decreases the workflow makespan and traffic overheads.

关键词： Cloud computing Processor scheduling Telecommunication traffic real-time systems Resource management Synchronization Task analysis

来源：评论

学校读者我要写书评

暂无评论

Experimental Validation of a Novel Method for Harmonic Mitigation for a three-Phase Five-Level Cascaded H-Bridges Inverter

引用

ieee TRANSACTIONS ON INDUSTRY applications 2019年第6期55卷 6089-6101页

作者： Schettino, Giuseppe Viola, Fabio Di Tommaso, Antonino Oscar Livreri, Patrizia Miceli, Rosario Univ Palermo Dept Engn I-90133 Palermo Italy

Inmodern high-power electrical drives, the efficiency of the system is a crucial constraint. Moreover, the efficiency of power converters plays a fundamental role in modern applications requiring also a limited weight, such as the electric vehicles and novel more electric aircraft. the reduction of losses pushes for systems with a dc bus and a high number of dc/ac converters, widespread in the vehicle, not burdened by a too expensive data processing system. the purpose of this article is to concur to reduce losses by proposing an innovative selective harmonic mitigation method based on the identification of the working areas where the reference harmonics present lower amplitudes. In particular, the main objective is to find a new way to calculate the control angles in real-time operation without solving nonlinear equations, whose resolution would require expensive controllers. through a very simple approach, the polynomial equations, which drive the control angles, were detected for a three-phase five-level cascaded H-bridge inverter and implemented in a digital system to real-time operation with a low computational cost. As a result, a comparison between the simulation and experimental behavior is presented. In the last part of this article, a real electric machine is driven by considering the appropriate working areas and current harmonics are also evaluated.

关键词： Cascade systems field-programmable gate arrays inverters multilevel systems power conversion harmonics

来源：评论

学校读者我要写书评

暂无评论

Genet: A Quickly Scalable Fat-Tree Overlay for Personal Volunteer computing using WebRTC 13

Genet: A Quickly Scalable Fat-Tree Overlay for Personal Volu...

引用

13th ieee international conference on Self-Adaptive and Self-Organizing systems (SASO)

作者： Lavoie, Erick Hendren, Laurie Desprez, Frederic Correia, Miguel McGill Univ Sch Comp Sci Montreal PQ Canada INRIA Ctr Rech Grenoble Rhone Alpes Grenoble France Univ Lisbon INESC ID Inst Super Tecn Lisbon Portugal

ISBN: (纸本)9781728127316

WebRTC enables browsers to exchange data directly but the number of possible concurrent connections to a single source is limited. We overcome the limitation by organizing participants in a fat-tree overlay: when the maximum number of connections of a tree node is reached, the new participants connect to the node's children. Our design quickly scales when a large number of participants join in a short amount of time, by relying on a novel scheme that only requires local information to route connection messages: the destination is derived from the hash value of the combined identifiers of the message's source and of the node that is holding the message. the scheme provides deterministic routing of a sequence of connection messages from a single source and probabilistic balancing of newer connections among the leaves. We show that this design puts at least 83% of nodes at the same depth as a deterministic algorithm, can connect a thousand browser windows in 21-55 seconds in a local network, and can be deployed for volunteer computing to tap into 320 cores in less than 30 seconds on a local network to increase the total throughput on the Collatz application by two orders of magnitude compared to a single core.

关键词： WebRTC Browsers Relays Routing Servers Computer applications Distributed processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：