共查询到20条相似文献,搜索用时 0 毫秒
1.
Energy harvesting has recently emerged as a feasible option to increase the operating time of sensor networks. If each node
of the network, however, is powered by a fluctuating energy source, common power management solutions have to be reconceived.
This holds in particular if real-time responsiveness of a given application has to be guaranteed. Task scheduling at the single
nodes should account for the properties of the energy source, capacity of the energy storage as well as deadlines of the single
tasks. We show that conventional scheduling algorithms (like e.g. EDF) are not suitable for this scenario. Based on this motivation,
we have constructed optimal scheduling algorithms that jointly handle constraints from both energy and time domain. Further
we present an admittance test that decides for arbitrary task sets, whether they can be scheduled without deadline violations.
To this end, we introduce the concept of energy variability characterization curves (EVCC) which nicely captures the dynamics
of various energy sources. Simulation results show that our algorithms allow significant reductions of the battery size compared
to Earliest Deadline First scheduling.
相似文献
Clemens MoserEmail: |
2.
3.
应用RTOS的TD-LTE无线综测仪的实现 总被引:1,自引:0,他引:1
针对通信软件设计中实时性和可靠性两大难题,提出了一种第三代合作伙伴(3GPP)长期演进(LTE)网络端协议栈通信软件的实现方案,即基于Nucleus PLUS实时操作系统的新一代宽带无线通信软件的设计。重点介绍了Nucleus PLUS实时多任务操作系统的主要组件及其相关功能,并论述了在Nucleus PLUS操作系统下对通信软件进行设计和实现的方法。实际测试表明,采用NucleusPLUS操作系统的终端测试仪确保了通信的可靠性和实时性,可应用于其他通信软件的开发过程中。 相似文献
4.
Deep neural networks (DNNs) are becoming the core components of many applications running on edge devices, especially for real time image-based analysis. Increasingly, multi-faced knowledge is extracted by executing multiple DNNs inference models, e.g., identifying objects, faces, and genders from images. It is of paramount importance to guarantee low response times of such multi-DNN executions as it affects not only users quality of experience but also safety. The challenge, largely unaddressed by the state of the art, is how to overcome the memory limitation of edge devices without altering the DNN models. In this paper, we design and implement Masa, a responsive memory-aware multi-DNN execution and scheduling framework, which requires no modification of DNN models. The aim of Masa is to consistently ensure the average response time when deterministically and stochastically executing multiple DNN-based image analyses. The enabling features of Masa are (i) modeling inter- and intra-network dependency, (ii) leveraging complimentary memory usage of each layer, and (iii) exploring the context dependency of DNNs. We verify the correctness and scheduling optimality via mixed integer programming. We extensively evaluate two versions of Masa, context-oblivious and context-aware, on three configurations of Raspberry Pi and a large set of popular DNN models triggered by different generation patterns of images. Our evaluation results show that Masa can achieve lower average response times by up to 90% on devices with small memory, i.e., 512 MB to 1 GB, compared to the state of the art multi-DNN scheduling solutions. 相似文献
5.
Carlos C. Amaro Author Vitae Sanjoy K. Baruah Author Vitae Author Vitae Wolfgang A. Halang Author Vitae 《Automatica》2003,39(6):957-967
Temporal load-balancing—“spreading out” the executions of tasks over time—is desirable in many applications. A form of temporal load-balancing is discussed, scheduling to maximize minimum minimum global inter-completion time (MGICT-scheduling). It is shown that MGICT-scheduling is, in general, NP-hard. A number of restricted classes of task systems are identified, which can be efficiently MGICT-scheduled. The technique is applied to a Defense Network System. Simulation results indicate that the proposed strategy achieves higher communication performance in multiprocessor systems. Specifically, our strategy significantly reduces average message delay and percentage of delayed messages. 相似文献
6.
Most of studies about energy management for MC systems are based on dynamic priority scheme. The disadvantages of dynamic priority scheme are high system overhead and poor predictability. Unlike previous studies, we focus on the problem of scheduling mixed-criticality (MC) periodic tasks with minimizing energy consumption in MC systems based on fixed priority scheme. Firstly, we explain a criticality rate monotonic scheduling (CRMS) and propose the sufficient schedulability condition of CRMS. Secondly, we compute the energy minimization uniform scaled speed and present an optimal static solution algorithm based on CRMS. The extra workload of the high criticality level (HI) task executes with the maximum processor speed in the high criticality mode (HI-mode). But this algorithm does not exploit the slack time generated from the HI task in the low criticality mode (LO-mode). For energy efficiency, we propose a dynamic fixed priority energy minimization algorithm which exploits the slack time generated from the HI task in LO-mode to save energy. In addition, it combines a dynamic voltage and frequency scaling technique and a dynamic power management technique to reduce energy consumption. Finally, the experiments are applied to evaluate the performance of the proposed algorithm and the experimental results show that the proposed algorithm can save up 23.89% energy compared with other existing algorithms. 相似文献
7.
This study aims to dig out user needs in cross-channel and cross-device shopping environments. To achieve this goal, 20 college students reported their shopping habits of choosing channels and using devices in the interview. The results were complemented by the focus group where seven college students discussed their implicit shopping needs. Based on that, five college students were observed for one week in the anthropology study. Four findings were derived. First, price difference mainly contributed to the participants' shopping choice in the online channel, while the experience of offline shopping and time-cost savings did in the offline channel; Second, smartphones were not the core device of every participant's ecosystems; Third, participants with lower work engagements preferred to shop online and enjoyed sharing shopping information compared to those with higher work engagements; Fourth, female participants, especially those with lower work engagements, had more cross-device interactions than male participants. These findings were integrated into four personas which would be of reference value for practitioners. 相似文献
8.
休眠管理作为自组网中节省能量的一种有效方法,正在被广泛的关注.休眠管理通过关闭节点射频,减少空闲状态能量消耗,有效延长了网络生存时间,提高了网络吞吐量;但是常常带来端到端延时增加和递交成功率降低等问题.针对这些问题,提出一种休眠管理算法TSM,各节点根据历史数据流量独立判断是否休眠,利用RTS丢失发现无法通信的邻居节点.NS-2仿真实验表明,相比基于MAC 802-11的AODV,在网络低负载情况下,TSM大幅延长网络生存时间,提高网络吞吐量;无论网络负载高低,TSM对端到端延时和递交成功率的影响很小. 相似文献
9.
在无线传感器网络中,节点睡眠-唤醒调度机制对于延长其生命周期至关重要。在现有的节点睡眠调度机制中,节点能耗是调度机制的唯一考虑目标。然而这种以节省节点能耗为目的调度机制很容易导致传感网络无法完全覆盖监测区域,导致严重后果。本文基于现有调度机制的不足,提出一种考虑到网络覆盖面的节能调度机制。这种机制既能降低网络能耗也能够兼顾到网络的监测覆盖情况。仿真结果表明该机制能在保证较高的网络覆盖面的前提下有效提高网络生命周期。 相似文献
10.
11.
随着计算机及Internet技术的飞速发展,便携式智能设备的应用变得普遍,而Android系统由于其开源性,更是得到了广大开发者的青睐。针对多设备的协同交互问题,设计了无线局域网内多Android设备协同交互系统。首先分析了交互系统功能及其涉及的Android开发技术,接着进行了人机交互设计,最终实现了Android设备间的图片、视频及控制命令的无线传输,从而完成不同Android设备之间的协同控制与交互功能。实际应用表明,该实验系统能够完成多设备的协同交互与控制,增强教学的趣味性和吸引力。 相似文献
12.
面向边缘设备的高能效深度学习任务调度策略 总被引:2,自引:0,他引:2
近年来,深度学习在图像和自然语言处理等诸多领域表现出色,与深度学习相关的各类移动应用发展迅速,但由于移动网络状态的不稳定性及网络带宽的限制,基于云计算的深度模型任务可能出现较大响应延迟,严重影响用户体验.与此同时,深度模型对设备的计算及存储能力有较高的要求,无法直接在资源受限的移动设备中进行部署.因此,亟须设计一种新的计算模式,使得基于深度模型的移动应用能够满足用户对快速响应、低能耗及高准确率的期望.本文提出一种面向边缘设备的深度模型分类任务调度策略,该策略通过协同移动设备与边缘服务器,充分利用智能移动终端的便捷性和边缘服务器强大的计算能力,综合考虑分类任务的复杂度和用户期望,完成深度模型在移动设备和边缘服务器中的动态部署,并对推理任务进行动态调度,从而提升任务执行效率,降低深度学习模型推理开销.本文以基于卷积神经网络的图像识别应用为例,实验结果表明,在移动环境中,相比于准确率最高的深度模型,本文提出的高能效调度策略的推理能耗可降低93.2%、推理时间降低91.6%,同时准确率提升3.88%. 相似文献
13.
14.
孙高峰 《数字社区&智能家居》2014,(4):2428-2430,2460
分布式光伏发电作为新型能源,在未来发展具有很广阔的前景。文章结合目前分布式光伏发电实际发展情况,介绍了光伏发电原理、光伏电源对配电网的影响及系统保护配置等,并具体介绍了分布式发电并网调度管理的运行步骤。 相似文献
15.
《Concurrency and Computation》2017,29(12)
Energy‐efficient scheduling is a step towards meeting green computing requirements. The work in this direction mainly aims at reducing dynamic energy consumption that includes clock gating, cache subbanking, and dynamic voltage and frequency scaling of underlying processors. However, the emergence of fast and compact transistor sizes has exponentially added onto the processor static power consumption, which has not been paid much attention. This article proposes a duplication‐controlled static energy‐efficient scheduling (C‐SEED) algorithm for scheduling precedence constrained applications on parallel computing systems. The C‐SEED algorithm couples adaptive threshold‐based duplication with system level dynamic power management technique to achieve its objectives. Dynamic power management works by selectively putting the energy‐consuming resources to efficient low‐power states for idle times to reduce energy consumption. Efficacy of the proposed algorithm is analyzed and compared against other relevant works on the basis of makespan and total energy (dynamic + static + communication) consumption. The extensive simulation results carried over large set of random and regular task graphs show that the proposed C‐SEED algorithm has potential to reduce energy consumption as well as makespan. 相似文献
16.
We use competitive analysis to study how best to use redundancy to achieve fault-tolerance in online real-time scheduling.
We show that the optimal way to use spatial redundancy depends on a complex interaction of the benefits, execution times,
release times, and latest start times of the jobs. We give a randomized online algorithm whose competitive ratio is O( logΦ log Delta ( log
2
n log m/ log log m)) for transient faults. Here n is the number of jobs, m is the number of processors, Φ is the ratio of the maximum value density of a job to the minimum value density of a job, and Δ is the ratio of the longest possible execution time to the shortest possible execution time. We show that this bound is
close to optimal by giving an Ω(( log ΔΦ/ log log m) ( log m log log m)
2
) lower bound on the competitive ratio of any randomized algorithm. In the case of permanent faults, there is a randomized
online algorithm that has a competitive ratio of O( log Phi log Δ (log m/log log m)). We also show a lower bound of Ω((log ΔΦ/ log log m) ( log m/log log m)) on the competitive ratio for interval scheduling with permanent faults.
Received October 1997; revised January 1999. 相似文献
17.
本文分析了嵌入式设备现有的节电技术和Linux系统的电源管理机制,并以iPAQ为例提出了一套使用以上机制来实现便携嵌入式设备的电源管理解决方案. 相似文献
18.
多灾害点应急资源调度研究与实现 总被引:4,自引:0,他引:4
针对多灾害点、多点出救、多目标应急调度问题,建立一种以时间最短、成本最低为目标的数学模型。考虑到调度过程中各灾害点对资源的竞争,提出利用表上作业算法对该模型进行优化求解,实现了在整体的优化方案中时间和成本总体消耗最少。提出的方法简单、实用、易用,并成功应用在省级应急管理信息示范平台上。最后,通过一个实例验证该方法的有效性。 相似文献
19.
拓扑控制是无线传感器网络研究中的核心问题之一.拓扑控制对于延长网络的生存时间、减小通信干扰、提高MAC(media access control)协议和路由协议的效率等具有重要意义.全面阐述了拓扑控制技术的研究进展,首先明确了拓扑控制研究的问题和设计目标,然后分别从功率控制和睡眠调度两个方面介绍代表性的研究工作,并加以分析和比较,同时指出了这些工作存在的不足.最后分析和总结了研究现状中存在的问题、需要进一步研究的内容以及拓扑控制研究的发展趋势. 相似文献
20.
The Ubiquitous Interactor (UBI) addresses the problems of design and development that arise from services that need to be accessed from many different devices. In the UBI, a service can present itself with different user interfaces on different devices. This is done by a separation of the user–service interaction and presentation. The interaction is kept the same for all devices, and different presentation information is provided for different devices. This way, tailored user interfaces for many different devices can be created without multiplying the development and maintenance work. In this paper, we describe the design of the UBI, the system implementation, and two services implemented for the system: a calendar service and a stockbroker service.
相似文献
Annika WaernEmail: |