Graph workloads increasingly rely on large, continuously evolving datasets, where SSD data placement and migration strongly influence query and update efficiency. Prior SSD based graph management schemes, including log based designs that follow a read modify write pattern and GraphSSD, target servers and PCs with stable power. When deployed on intermittently powered systems, these power unaware designs often scatter frequently updated hub node edges across many flash pages, which increases over read and triggers excessive flash I/O. The resulting energy overhead is further amplified after each power recovery because the system must reload graph data from NAND into DRAM, repeatedly paying for unnecessary reads and reducing the number of graph queries completed per charge cycle. We propose Graph Evolving aware ChecKpOinter (GECKO), which leverages graph evolution awareness to improve hub edge locality and applies power aware I/O coordination to reduce redundant flash accesses under intermittent power. Across evolving graph updates and queries, GECKO significantly lowers flash I/O, enabling better energy efficiency on energy constrained intermittent systems.

Tiny battery-free devices running deep neural networks (DNNs) embody intermittent TinyML, a paradigm at the intersection of intermittent computing and deep learning, bringing sustainable intelligence to the extreme edge. This paper, as an overview of a special session at Embedded Systems Week (ESWEEK) 2025, presents four tales from diverse research backgrounds, sharing experiences in addressing unique challenges of efficient and reliable DNN inference despite the intermittent nature of ambient power. The first explores enhancing inference engines for efficient progress accumulation in hardware-accelerated intermittent inference and designing networks tailored for such execution. The second investigates computationally light, adaptive algorithms for faster, energy-efficient inference, and emerging computing-in-memory architectures for power failure resiliency. The third addresses battery-free networking, focusing on timely neighbor discovery and maintaining synchronization despite spatio-temporal energy dynamics across nodes. The fourth leverages modern nonvolatile memory fault behavior and DNN robustness to save energy without significant accuracy loss, with applicability to intermittent inference on nano-satellites. Collectively, these early efforts advance intermittent TinyML research and promote future cross-domain collaboration to tackle open challenges.

The fusion of tiny energy harvesting devices with deep neural networks (DNN) optimized for intermittent execution is vital for sustainable intelligent applications at the edge. However, current intermittent-aware neural architecture search (NAS) frameworks overlook the inherent intermittency management overhead (IMO) of DNNs, leading to under-performance upon deployment. Moreover, we observe that straightforward IMO minimization within NAS may degrade solution accuracy. This work explores the relationship between DNN architectural characteristics, IMO, and accuracy, uncovering the varying sensitivity toward IMO across different DNN characteristics. Inspired by our insights, we present two guidelines for leveraging IMO sensitivity in NAS. First, the overall architecture search space can be reduced to exclude parameters with low IMO sensitivity, and second, network blocks with high IMO sensitivity can be primarily focused during the search, facilitating the discovery of highly accurate networks with low IMO. We incorporate these guidelines into TiNAS, which integrates cutting-edge tiny NAS and intermittent-aware NAS frameworks. Evaluations are conducted across various datasets and latency requirements, as well as deployment experiments on a Texas Instruments device under different intermittent power profiles. Compared to two variants, one minimizing IMO and the other disregarding IMO, TiNAS, respectively, achieves up to 38% higher accuracy and 33% lower IMO, with greater improvements for larger datasets. Its deployed solutions also achieve up to a 1.33 times inference speedup, especially under fluctuating power conditions.

Guaranteeing reliable deep neural network (DNN) inference despite intermittent power is the cornerstone of enabling intelligent systems in energy-harvesting environments. Existing intermittent inference approaches support static neural networks with deterministic execution characteristics, accumulating progress across power cycles. However, dynamic neural networks adapt their structures at runtime. We observe that because intermittent inference approaches are unaware of this non-deterministic execution behavior, they suffer from incorrect progress recovery, degrading inference accuracy and performance. This work proposes non-deterministic inference progress accumulation to enable dynamic neural network inference on intermittent systems. Our middleware, NodPA, realizes this methodology by strategically selecting additional progress information to capture the non-determinism of the power-interrupted computation while preserving only the changed portions of the progress information to maintain low runtime overhead. Evaluations are conducted on a Texas Instruments device with both static and dynamic neural networks under time-varying power sources. Compared to intermittent inference approaches reliant on determinism, NodPA is less prone to inference non-termination and achieves an average inference speedup of 1.57 times without compromising accuracy, with greater improvements for highly dynamic networks under weaker power.

Designing intelligent, tiny devices with limited memory is immensely challenging, exacerbated by the additional memory requirement of residual connections in deep neural networks. In contrast to existing approaches that eliminate residuals to reduce peak memory usage at the cost of significant accuracy degradation, this paper presents DERO, which reorganizes residual connections by leveraging insights into the types and interdependencies of operations across residual connections. Evaluations were conducted across diverse model architectures designed for common computer vision applications. DERO consistently achieves peak memory usage comparable to plain-style models without residuals, while closely matching the accuracy of the original models with residuals.

Deep neural network inference on energy harvesting tiny devices has emerged as a solution for sustainable edge intelligence. However, compact models optimized for continuously-powered systems may become suboptimal when deployed on intermittently-powered systems. This paper presents the pruning criterion, pruning strategy, and prototype implementation of iPrune, the first framework which introduces intermittency into neural network pruning to produce compact models adaptable to intermittent systems. The pruned models are deployed and evaluated on a Texas Instruments device with various power strengths and TinyML applications. Compared to an energy-aware pruning framework, iPrune can speed up intermittent inference by 1.1 to 2 times while achieving comparable model accuracy.

Intermittent deep neural network (DNN) inference is a promising technique to enable intelligent applications on tiny devices powered by ambient energy sources. Nonetheless, intermittent execution presents inherent challenges, primarily involving accumulating progress across power cycles and having to refetch volatile data lost due to power loss in each power cycle. Existing approaches typically optimize the inference configuration to maximize data reuse. However, we observe that such a fixed configuration may be significantly inefficient due to the fluctuating balance point between data reuse and data refetch caused by the dynamic nature of ambient energy. This work proposes DynBal , an approach to dynamically reconfigure the inference engine at runtime. DynBal is realized as a middleware plugin that improves inference performance by exploring the interplay between data reuse and data refetch to maintain their balance with respect to the changing level of intermittency. An indirect metric is developed to easily evaluate an inference configuration considering the variability in intermittency, and a lightweight reconfiguration algorithm is employed to efficiently optimize the configuration at runtime. We evaluate the improvement brought by integrating DynBal into a recent intermittent inference approach that uses a fixed configuration. Evaluations were conducted on a Texas Instruments device with various network models and under varied intermittent power strengths. Our experimental results demonstrate that DynBal can speed up intermittent inference by 3.26 times, achieving a greater improvement for a large network under high intermittency and a large gap between memory and computation performance.

Internet of Things (IoT) devices are gradually adopting battery-less, energy harvesting solutions, thereby driving the development of an intermittent computing paradigm to accumulate computation progress across multiple power cycles. While many attempts have been made to enable standalone intermittent systems, little attention has focused on IoT networks formed by intermittent devices. We observe that the computation progress improved by distributed task concurrency in an intermittent network can be significantly offset by data unavailability due to frequent system failures. This article presents an intermittent-aware distributed concurrency control protocol which leverages existing data copies inherently created in the network to improve the computation progress of concurrently executed tasks. In particular, we propose a borrowing-based data management method to increase data availability and an intermittent two-phase commit procedure incorporated with distributed backward validation to ensure data consistency in the network. The proposed protocol was integrated into a FreeRTOS-extended intermittent operating system running on Texas Instruments devices. Experimental results show that the computation progress can be significantly improved, and this improvement is more apparent under weaker power, where more devices will remain offline for longer duration.

Deep neural network (DNN) inference on intermittently powered battery-less devices has the potential to unlock new possibilities for sustainable and intelligent edge applications. Existing intermittent inference approaches preserve progress information separate from the computed output features during inference. However, we observe that even in highly specialized approaches, the additional overhead incurred for inference progress preservation still accounts for a significant portion of the inference latency. This work proposes the concept of stateful neural networks, which enables a DNN to indicate the inference progress itself. Our runtime middleware embeds state information into the DNN such that the computed and preserved output features intrinsically contain progress indicators, avoiding the need to preserve them separately. The specific position and representation of the embedded states jointly ensure both output features and states are not corrupted while maintaining model accuracy, and the embedded states allow the latest output feature to be determined, enabling correct inference recovery upon power resumption. Evaluations were conducted on different Texas Instruments devices under varied intermittent power strengths and network models. Compared to the state-of-the-art, our approach can speed up intermittent inference by 1.3 to 5 times, achieving higher performance when executing modern convolutional networks with weaker power.

Energy harvesting creates an emerging intermittent computing paradigm but poses new challenges for sophisticated applications such as intermittent deep neural network (DNN) inference. Although model compression has adapted DNNs to resource-constrained devices, under intermittent power, compressed models will still experience multiple power failures during a single inference. Footprint-based approaches enable hardware-accelerated intermittent DNN inference by tracking footprints, independent of model computations, to indicate accelerator progress across power cycles. However, we observe that the extra overhead required to preserve progress indicators can severely offset the computation progress accumulated by intermittent DNN inference. This work proposes the concept of model augmentation to adapt DNNs to intermittent devices. Our middleware stack, JAPARI, appends extra neural network components into a given DNN, to enable the accelerator to intrinsically integrate progress indicators into the inference process, without affecting model accuracy. Their specific positions allow progress indicator preservation to be piggybacked onto output feature preservation to amortize the extra overhead, and their assigned values ensure uniquely distinguishable progress indicators for correct inference recovery upon power resumption. Evaluations on a Texas Instruments device under various DNN models, capacitor sizes, and progress preservation granularities show that JAPARI can speed up intermittent DNN inference by 3× over the state of the art, for common convolutional neural architectures that require heavy acceleration.

Intermittent systems enable batteryless devices to operate through energy harvesting by leveraging the complementary characteristics of volatile (VM) and non-volatile memory (NVM). Unfortunately, alternate and frequent accesses to heterogeneous memories for accumulative execution across power cycles can significantly hinder computation progress. The progress impediment is mainly due to more CPU time being wasted for slow NVM accesses than for fast VM accesses. This paper explores how to leverage heterogeneous cores to mitigate the progress impediment caused by heterogeneous memories. In particular, a delegable and adaptive synchronization protocol is proposed to allow memory accesses to be delegated between cores and to dynamically adapt to diverse memory access latency. Moreover, our design guarantees task serializability across multiple cores and maintains data consistency despite frequent power failures. We integrated our design into FreeRTOS running on a Cypress device featuring heterogeneous dual cores and hybrid memories. Experimental results show that, compared to recent approaches that assume single-core intermittent systems, our design can improve computation progress at least 1.8x and even up to 33.9x by leveraging core heterogeneity.

The increasing paradigm shift towards i ntermittent computing has made it possible to intermittently execute d eep neural network (DNN) inference on edge devices powered by ambient energy. Recently, n eural architecture search (NAS) techniques have achieved great success in automatically finding DNNs with high accuracy and low inference latency on the deployed hardware. We make a key observation, where NAS attempts to improve inference latency by primarily maximizing data reuse, but the derived solutions when deployed on intermittently-powered systems may be inefficient, such that the inference may not satisfy an end-to-end latency requirement and, more seriously, they may be unsafe given an insufficient energy budget. This work proposes iNAS, which introduces intermittent execution behavior into NAS to find accurate network architectures with corresponding execution designs, which can safely and efficiently execute under intermittent power. An intermittent-aware execution design explorer is presented, which finds the right balance between data reuse and the costs related to intermittent inference, and incorporates a preservation design search space into NAS, while ensuring the power-cycle energy budget is not exceeded. To assess an intermittent execution design, an intermittent-aware abstract performance model is presented, which formulates the key costs related to progress preservation and recovery during intermittent inference. We implement iNAS on top of an existing NAS framework and evaluate their respective solutions found for various datasets, energy budgets and latency requirements, on a Texas Instruments device. Compared to those NAS solutions that can safely complete the inference, the iNAS solutions reduce the intermittent inference latency by 60% on average while achieving comparable accuracy, with an average 7% increase in search overhead.

Spatiotemporal super-resolution (SR) aims to upscale both the spatial and temporal dimensions of input videos, and produces videos with higher frame resolutions and rates. It involves two essential sub-tasks: spatial SR and temporal SR. We design a two-stream network for spatiotemporal SR in this work. One stream contains a temporal SR module followed by a spatial SR module, while the other stream has the same two modules in the reverse order. Based on the interchangeability of performing the two sub-tasks, the two network streams are supposed to produce consistent spatiotemporal SR results. Thus, we present a cross-stream consistency to enforce the similarity between the outputs of the two streams. In this way, the training of the two streams is correlated, which allows the two SR modules to share their supervisory signals and improve each other. In addition, the proposed cross-stream consistency does not consume labeled training data and can guide network training in an unsupervised manner. We leverage this property to carry out semi-supervised spatiotemporal SR. It turns out that our method makes the most of training data, and can derive an effective model with few high-resolution and high-frame-rate videos, achieving the state-of-the-art performance. The source code of this work is available at https://hankweb.github.io/STSRwithCrossTask/.

Self-powered intermittent systems typically adopt runtime checkpointing as a means to accumulate computation progress across power cycles and recover system status from power failures. However, existing approaches based on the checkpointing paradigm normally require system suspension and/or logging at runtime. This article presents a design which overcomes the drawbacks of checkpointing-based approaches, to enable failure-resilient intermittent systems. Our design allows accumulative execution and instant system recovery under frequent power failures while enforcing the serializability of concurrent task execution to improve computation progress and ensuring data consistency without system suspension during runtime, by leveraging the characteristics of data accessed in hybrid memory. We integrated the design into FreeRTOS running on a Texas Instruments device. The experimental results show that our design can still accumulate progress when the power source is too weak for checkpointing-based approaches to advance, and significantly improves the computation progress while reducing the recovery time.

Current peripheral execution approaches for intermittently powered systems require full access to the internal hardware state for checkpointing or rely on application-level energy estimation for task partitioning to make correct forward progress. Both requirements present significant practical challenges for energy-harvesting, intelligent edge Internet-of-Things devices, which perform hardware-accelerated deep neural network (DNN) inference. Sophisticated compute peripherals may have an inaccessible internal state, and the complexity of DNN models makes it difficult for programmers to partition the application into suitably sized tasks that fit within an estimated energy budget. This article presents the concept of inference footprinting for intermittent DNN inference, where accelerator progress is accumulatively preserved across power cycles. Our middleware stack, HAWAII, tracks and restores inference footprints efficiently and transparently to make inference forward progress, without requiring access to the accelerator internal state and application-level energy estimation. Evaluations were carried out on a Texas Instruments device, under varied energy budgets and network workloads. Compared to a variety of task-based intermittent approaches, HAWAII improves the inference throughput by 5.7%-95.7%, particularly achieving higher performance on heavily accelerated DNNs.

Many production datacenters nowadays service multiple applications with dynamically allocated network bandwidth, and some applications are time-critical so their data transfers or flows are constrained by deadlines. To meet deadlines, several flow scheduling schemes for datacenter networks are proposed, but most of them are unaware of bandwidth variations, leading to suboptimal throughputs. In this paper, we present a flow scheduling scheme, called UBAS, to improve deadline-meeting throughputs for time-critical applications with uncertain time-varying bandwidth allocations. First, we model an optimization problem of scheduling deadline-constrained flows under uncertain time-varying bandwidth allocations to maximize the expected deadline-meeting throughput. The problem is NP-hard. Then, we propose an approximation algorithm under a mild condition for the problem in a special case, where bandwidth allocations are certain, as well as a conditional approximation algorithm for the problem in general. To adapt to practice, scalable and online variants of the algorithm are also presented. In evaluation, we conduct simulations based on a real traffic trace in a production datacenter. The results demonstrate that, with severe practical settings, UBAS still achieves nearly optimal deadline-meeting throughputs. Moreover, the throughput improvements of UBAS against existing bandwidth-agnostic schemes are more substantial when the variance of bandwidth allocations over time increases.

Perceptual similarity measurement allows mobile applications to eliminate unnecessary computations without compromising visual experience. Existing pixel-wise measures incur significant overhead with increasing display resolutions and frame rates. This paper presents an ultra lightweight similarity measure called LSIM, which assesses the similarity between frames based on the transformation matrices of graphics objects. To evaluate its efficacy, we integrate LSIM into the Open Graphics Library and conduct experiments on an Android smartphone with various mobile 3D games. The results show that LSIM is highly correlated with the most widely used pixel-wise measure SSIM, yet three to five orders of magnitude faster. We also apply LSIM to a CPU-GPU governor to suppress the rendering of similar frames, thereby further reducing computation energy consumption by up to 27.3% while maintaining satisfactory visual quality.

Self-powered intermittent systems enable accumulative execution in unstable power environments, where checkpointing is often adopted as a means to achieve data consistency and system recovery under power failures. However, existing approaches based on the checkpointing paradigm normally require system suspension and/or logging at runtime. This paper presents a design which enables failure-resilient intermittently-powered systems without runtime checkpointing. Our design enforces the consistency and serializability of concurrent task execution while maximizing computation progress, as well as allows instant system recovery after power resumption, by leveraging the characteristics of data accessed in hybrid memory. We integrated the design into FreeRTOS running on a Texas Instruments device. Experimental results show that our design achieves up to 11.8 times the computation progress achieved by checkpointing-based approaches, while reducing the recovery time by nearly 90%.

Concurrency control allows multiple tasks that share data objects to be concurrently executed in a serializable order, thus significantly improving computation progress. However, to accumulate forward progress on energy-harvesting intermittent systems while achieving data consistency across power cycles, existing approaches based on the checkpointing paradigm typically require system suspension at runtime. The runtime overheads incurred by suspension will be more manifest when more tasks are suspended and resumed during checkpointing, offsetting the computation progress improved by concurrent task execution. This paper presents a multiversion concurrency control design, which enables concurrent task execution without system suspension during checkpointing, while maintaining the serializability of task execution and ensuring data consistency after system recovery. We integrated our design into FreeRTOS running on a Texas Instruments device. Experimental results show that, at the very best, our design can double computation progress by reducing the runtime overheads incurred by system checkpointing, especially when tasks are executed with high concurrency.

Self-powered intermittent systems waste considerable I/O energy because volatile I/O modules repeatedly issue identical operations under power failure conditions, and also due to the use of the inefficient I/O stack originally developed for battery-powered systems. This paper presents the concept, design, and implementation of autonomous I/O, which can accumulatively and transparently complete I/O operations regardless of power stability. We define its two essential functionalities, separate the general I/O stack to make accumulatively-completed I/O operations transparent to application tasks, and propose an access protocol that allows for energy efficiency and compatibility with the general I/O stack. To evaluate the efficacy, we implement our design and conduct extensive experiments on a Texas Instruments device with commodity sensor and Wi-Fi modules. Experimental results show that autonomous I/O can achieve 1.8 times the throughout achieved with nonvolatile I/O when the power is relatively steady, while reducing the completion time of individual I/O operations by at least 34% with relatively unstable power.

Graphics-intensive mobile games place different and varying levels of demand on the associated central processing units (CPUs) and graphics processing units (GPUs). In contrast to the workload variability that characterizes games, the current design of the energy governor employed by mobile systems appears to be outdated. In this paper, we review the energy-saving mechanism implemented in an Android system coupled with graphics-intensive gaming workloads from three perspectives: 1) user perception; 2) application status; and 3) the interplay between the CPU and GPU. We observe that there are information gaps in the current system, which may result in unnecessary energy wastage. To resolve the problem, we propose an online user-centric CPU-GPU governing framework. To bridge the identified information gaps, we classify rendered game frames into redundant/changing frames to satisfy user demand, categorize an application into GPU sensitive/insensitive phases to understand the application's demand, and determine the frequency scaling intents of the CPU and GPU to capture processor demand. In response to the measured demand, we employ a required workload estimator, a unified policy selector, and a frequency-scaling intent communicator in the framework to save energy. The proposed framework was implemented on an LG Nexus 5X smartphone, and extensive experiments with real-world 3-D gaming applications were conducted. According to the experiment results, for an application which is low interactive and infrequent phase changing, the proposed framework can, respectively, reduce energy consumption by 25.3% and 39% compared with our previous work and Android governors while maintaining user experience.

Electrophoretic displays are ideal for self-powered systems, but currently require an uninterrupted power supply to carry out the full display update cycle. Although sensible for battery-powered devices, when directly applied to intermittently-powered systems, guaranteeing display update atomicity usually results in repeated execution until completion or can incur high hardware/software overheads, heavy programmer intervention and large energy buffering requirements to provide sufficient display update energy. This paper introduces the concept, design and implementation of accumulative display updating, which relaxes the atomicity constraints of display updating, such that the display update process can be accumulatively completed across power cycles, without the need for sufficient energy for the entire display update. To allow for process logical continuity, we track the update progress during execution and facilitate a safe display shutdown procedure to overcome physical and operability issues related to abrupt power failure. Additionally, a context-aware updating policy is proposed to handle data freshness issues, where the delay in addressing new update requests can cause the display contents to be in conflict with new data available. Experimental results on a Texas Instruments device with an integrated electrophoretic display show that, compared to atomic display updating, our design can significantly increase accurate forward progress, decrease the average response time of display updating and reduce time and energy wastage when displaying fresh data.

Wireless body area networks (WBANs) have emerged recently to provide health monitoring for chronic patients. In a WBAN, the patient's smartphone is deemed an appropriate sink to help forward the sensing data to back-end servers. Through a real-world case study, we observe that temporary disconnection between sensors and the associated smartphone can happen frequently due to postural changes, causing a significant amount of data to be lost forever. In this paper, we propose a scheme to parasitize the data in surrounding Wi-Fi networks whenever temporary disconnection occurs. Specifically, we model data parasitizing as an optimization problem, with the objective of maximizing the system lifetime without any data loss. Then, we propose an optimal offline algorithm to solve the problem, as well as an online algorithm that allows practical implementations. We have also implemented a prototype system, where the online algorithm serves as the underlying technique, based on Arduino. To evaluate our scheme, we conduct a series of experiments with the prototype system in controlled and real-world environments. The results show that the lifetime is prolonged by 100 times, and it could be further doubled if the health monitoring application permits a few packet losses.

In the future, mobile systems will increasingly feature more advanced organic light-emitting diode (OLED) displays. The power consumption of these displays is highly dependent on the image content. However, existing OLED power-saving techniques either change the visual experience of users or degrade the visual quality of images in exchange for a reduction in the power consumption. Some techniques attempt to enhance the image quality by employing a compound objective function. In this article, we present a win-win scheme that always enhances the image quality while simultaneously reducing the power consumption. We define metrics to assess the benefits and cost for potential image enhancement and power reduction. We then introduce algorithms that ensure the transformation of images into their quality-enhanced power-saving versions. Next, the win-win scheme is extended to process videos at a justifiable computational cost. All the proposed algorithms are shown to possess the win-win property without assuming accurate OLED power models. Finally, the proposed scheme is realized through a practical camera application and a video camcorder on mobile devices. The results of experiments conducted on a commercial tablet with a popular image database and on a smartphone with real-world videos are very encouraging and provide valuable insights for future research and practices.

This paper addresses two obstacles hindering advances in accurate gesture recognition on mobile devices. First, gesture recognition performance is highly dependent on feature selection, but optimal features typically vary from gesture to gesture. Second, diverse user behaviors and mobile environments result in extremely large intra-class variations. We tackle these issues by introducing a new network layer, called an adaptive hidden layer (AHL), to generalize a hidden layer in deep neural networks and dynamically generate an activation map conditioned on the input. To this end, an AHL is composed of multiple neuron groups and an extra selector. The former compiles multi-modal features captured by mobile sensors, while the latter adaptively picks a plausible group for each input sample. The AHL is end-to-end trainable and can generalize an arbitrary subset of hidden layers. Through a series of AHLs, the great expressive power from exponentially many forward paths allows us to choose proper multi-modal features in a sample-specific fashion and resolve the problems caused by the unfavorable variations in mobile gesture recognition. The proposed approach is evaluated on a benchmark for gesture recognition and a newly collected dataset. Superior performance demonstrates its effectiveness.

The increasingly high display resolution of mobile devices imposes a further burden on energy consumption. Existing schemes manage either OLED or GPU power to save energy. This paper presents the design, algorithm, and implementation of a co-managing scheme called Duet, which automatically trades off perceptual quality for energy efficiency in accordance with static and dynamic visual acuity when users interact with mobile applications. The results of experiments conducted on a commercial smartphone with popular interactive apps show that Duet saves more energy while retaining better visual quality, compared with a joint scheme that simultaneously uses dynamic pixel disabling and dynamic resolution scaling to save OLED and GPU energy in isolation.

Mobile devices running augmented reality applications consume considerable energy for graphics-intensive workloads. This paper presents a scheme for the differentiated handling of camera-captured physical scenes and computer-generated virtual objects according to different perceptual quality metrics. We propose online algorithms and their real-time implementations to reduce energy consumption through dynamic frame rate adaptation while maintaining the visual quality required for augmented reality applications. To evaluate system efficacy, we integrate our scheme into Android and conduct extensive experiments on a commercial smartphone with various application scenarios. The results show that the proposed scheme can achieve energy savings of up to 39.1% in comparison to the native graphics system in Android while maintaining satisfactory visual quality.

This paper presents a novel CNN model called Soft Stagewise Regression Network (SSR-Net) for age estimation from a single image with a compact model size. Inspired by DEX, we address age estimation by performing multi-class classification and then turning classification results into regression by calculating the expected values. SSR-Net takes a coarse-to-fine strategy and performs multi-class classification with multiple stages. Each stage is only responsible for refining the decision of its previous stage for more accurate age estimation. Thus, each stage performs a task with few classes and requires few neurons, greatly reducing the model size. For addressing the quantization issue introduced by grouping ages into classes, SSR-Net assigns a dynamic range to each age class by allowing it to be shifted and scaled according to the input face image. Both the multi-stage strategy and the dynamic range are incorporated into the formulation of soft stagewise regression. A novel network architecture is proposed for carrying out soft stagewise regression. The resultant SSR-Net model is very compact and takes only 0.32 MB. Despite its compact size, SSR-Net’s performance approaches those of the state-of-the-art methods whose model sizes are often more than 1500× larger.

Self-powered intermittent systems featuring nonvolatile processors (NVPs) allow for accumulative execution in unstable power environments. However, frequent power failures may cause incorrect NVP execution results due to invalid data generated intermittently. This paper presents a HW/SW co-design, called HomeRun, to guarantee atomicity by ensuring that an uninterruptible program section can be run through at one execution. We design a HW module to ensure that a power pulse is sufficient for an atomic section, and develop a SW mechanism for programmers to protect atomic sections. The proposed design is validated through the development of a prototype pattern locking system. Experimental results demonstrate that the proposed design can completely guarantee atomicity and significantly improve the energy utilization of self-powered intermittent systems.

Real-time computing provides insightful ways to explore the optimization in resource usages, especially from the time point of view. Nevertheless, real-time task scheduling is recognized by its high complexity when there are non-preemptive shared resources and multiple processors. When more and more practical factors in system designs are considered, such as energy consumption and memory allocation, even some sub-problems in real-time task scheduling become intractable. Although people often criticize various artificial assumptions in real-time task scheduling, they have to admit that ideas in real-time computing and their extensions, such as tradeoff in cost, performance, energy, and even the quality of service, can be applied to multi-dimensional optimization in system designs. In this direction, we witness the rapid development of the embedded system industry and join the task force in system designs, especially mobile devices and non-volatile memory systems. Resource management on mobile devices, with a special emphasis on user experience, should not only consider the response time but also the visual perception of users. Non-volatile memory has also blurred the boundary between the memory and the storage. It enables certain unified considerations of the main memory and storage and also in-memory computing. It shows the ways to break the boundaries between hardware and software layers and have better integration of computing and memory/storage units. The advances in mobile systems and memory innovations inspire the evolution of embedded system designs and have also brought us insights to solutions regarding how systems should be restructured and how computing should be done. They might also provide their feedback to real-time computing and even shape the future direction of real-time computing in various innovative ways.

Users roaming cellular signal coverage with their mobile devices essentially form a mobile cyber-physical system (CPS). By modeling cyber human mentality and physical signal coverage, as well as their interplay, user mobility can be leveraged to improve users' mobile experience with limited wireless bandwidth. Through a real-world case study, we observed that numerous “null zones” and “hot zones” exist in cellular signal coverage areas, where mobile devices cannot obtain sufficiently high data rates for delay-sensitive applications. Over one third of the locations in a crowded area could have weak signal coverage and low bandwidth shares, resulting in poor mobile connectivity experience. This paper considers the practicality of a mobile CPS called Oasis, which guides users to leave those zones and move to nearby locations with better mobile experience. To realize the system, we model and maximize a user's willingness to travel to another location, where the willingness involves the compound impact of the travel distance and the improved perceptual quality. We also develop a prototype system that creates a feedback control loop to allow self-adaptation to users' needs. To evaluate the efficacy, we conducted a series of experiments based on the real data collected in downtown Taipei, Taiwan. The results demonstrate that our mobile CPS can further reduce the average distance per unit of quality improvement achieved with OpenSignalMaps by about 80%, and motivate further research.

Owing to high cell density caused by the advanced manufacturing process, the reliability of flash drives turns out to be rather challenging in flash system designs. To enhance the reliability of flash drives, error-correcting code (ECC) has been widely utilized in flash drives to correct error bits during programming/reading data to/from flash drives. Although ECC can effectively enhance the reliability of flash drives by correcting error bits, the capability of ECC would degrade while the program/erase (P/E) cycles of flash blocks is increased. Finally, ECC could not correct a flash page, because a flash page contains too many error bits. As a result, reducing error bits is an effective solution to further improve the reliability of flash drives when a specific ECC is adopted in the flash drive. This work focuses on how to reduce the probability of producing error bits in a flash page. Thus, we propose a pattern-aware write strategy for flash reliability enhancement. The proposed write strategy considers both the P/E cycle of blocks and the pattern of written data while a flash block is allocated to store the written data. Since the proposed write strategy allocates young blocks (respectively, old blocks) for hot data (respectively, cold data) and flips the bit pattern of the written data to the appropriate bit pattern, the proposed strategy can effectively improve the reliability of flash drives. The experimental results show that the proposed strategy can reduce the number of error pages by up to 50%, compared with the well-known DFTL solution. Moreover, the proposed strategy is orthogonal with all ECC mechanisms so that the reliability of the flash drives with ECC mechanisms can be further improved by the proposed strategy.

OLED power management on mobile devices is very challenging due to the dynamic nature of human-screen interaction. This paper presents the design, algorithms, and implementation of a lightweight mobile app called ShiftMask, which allows the user to dynamically shift OLED power to the portion of interest, while dimming the remainder of the screen based on visual acuity. To adapt to the user's focus of attention, we propose efficient algorithms that consider visual fixation in static scenes, as well as changes in focus and screen scrolling. The results of experiments conducted on a commercial smartphone with popular interactive apps demonstrate that ShiftMask can achieve substantial energy savings, while preserving acceptable readability.

Application paradigms will increasingly exceed a mobile device's physical boundaries. This paper presents a system solution for a mobile device to mount remote sensors on other devices. Our design is generic to mobile senor stacks, thus supporting unmodified apps and commodity sensors. Furthermore, it uses an asynchronous access model to facilitate semantics passing and data reporting in between. Such semantic information allows the development of an energy-efficient reporting policy for remote sensing applications. The results of experiments conducted on commercial Android smartphones with popular apps demonstrate that our design is very efficient in terms of energy consumption and completion time.

Resident applications, which autonomously awaken mobile devices, can gradually and imperceptibly drain device batteries. This paper introduces the concept of alarm similarity into wakeup management for mobile systems in connected standby. First, we define hardware similarity to reflect the degree of energy savings and time similarity to reflect the impact on user experience. We then propose a policy that aligns alarms based on their similarity to save standby energy while maintaining the quality of the user experience. Finally, we integrate our design into Android and conduct extensive experiments on a commercial smartphone running popular mobile apps. The results demonstrate that our design can further extend the standby time achieved with Android's native policy by up to one-third.

How to tolerate fault is a fundamental requirement to the designs of many cyber-physical systems. Devices or sensors might have different requirements on their levels of reliability and/or timely services in the composition of a cyber-physical system. In this work, a system framework is explored to virtualize devices/sensors and service migration is considered during run time, so that faults are masked and the timeliness in services is enhanced. In particular, a disaster messaging system supporting seamlessly service recovery in small and large scale network is developed and evaluated, where an acceptable level of connectivity in the face of numerous faults for responsive deliveries of information critical to the success of emergency response and rescue operations. The framework also takes into account the energy consumption and reliability of sensing services, while using different types of memory components. Last but not least, augmented sensing using smart phones allows users to receive the sensed information nearby; this is critical when communication infrastructures are damaged.

Energy harvesting wearable sensor nodes offer low maintenance and high mobility, but suffer from unstable power supply and insufficient energy. Featuring low standby power and instant backup and restore operations, nonvolatile processors have emerged as one of the most promising technologies for the improvement of energy harvesting wearable devices. However, device quality of service (QoS) is still limited by lack of sufficient energy. To address this problem, this paper attempts to maximize QoS by optimizing task scheduling for DVFS-enabled nonvolatile processor-based embedded devices. First, we model the task scheduling problem as an optimization problem to maximize the total value (which represents QoS) given available harvested energy and time. We then prove the problem to be NP-hard. In addition, we propose a pseudopolynomial-time optimal algorithm based on dynamic programming, as well as an approximation algorithm that allows for a trade-off between running time and total value. We evaluate algorithm performance on an ultra-lowpower platform produced by Texas Instruments, and conduct extensive simulations with different system models and task sets. The results demonstrate that the platform can execute optimal sequences derived by the dynamic-programming algorithm, with differences between simulation results and real traces of less than 1%. Also, our approximate algorithm executes approximately 10 5 times faster than the dynamic-programming algorithm at a value degradation cost of less than 3%.

Mobile applications will become progressively more complicated and diverse. Heterogeneous computing architectures like big.LITTLE are a hardware solution that allows mobile devices to combine computing performance and energy efficiency. However, software solutions that conform to the paradigm of conventional fair scheduling and governing are not applicable to mobile systems, thereby degrading user experience or reducing energy efficiency. In this article, we exploit the concept of application sensitivity, which reflects the user’s attention on each application, and devise a user-centric scheduler and governor that allocate computing resources to applications according to their sensitivity. Furthermore, we integrate our design into the Android operating system. The results of experiments conducted on a commercial big.LITTLE smartphone with real-world mobile apps demonstrate that the proposed design can achieve significant gains in energy efficiency while improving the quality of user experience.

Organic Light-Emitting Diode (OLED) technology is regarded as a promising alternative to mobile displays. In this article, we introduce the design, algorithm, and implementation of a novel framework called CURA for quality-retaining power saving on mobile OLED displays. First, we link human visual attention to OLED power saving and model the OLED image scaling optimization problem. The objective is to minimize the power required to display an image without adversely impacting the user’s visual experience. Then, we present the algorithm used to solve the modeled problem, and prove its optimality even without an accurate power model. Finally, based on the framework, we implement two practical applications on a commercial OLED mobile tablet. The results of experiments conducted on the tablet with real images demonstrate that CURA can reduce significant OLED power consumption while retaining the visual quality of images.

Improving PCM endurance is a fundamental issue when it is considered as an alternative to replace DRAM as main memory. Memory-based wear leveling (WL) is an effective way to improve PCM endurance, but its major challenge is how to efficiently determine the appropriate memory pages for allocation or swapping. In this article, we present a constant-cost WL design that is compatible with existing memory management. Two implementations, namely bucket-based and array-based WL, with constant-time (or nearly zero) search cost are proposed to be integrated into the OS layer and the hardware layer, respectively, as well as to trade between time and space complexity. The results of experiments conducted based on an implementation in Android, as well as simulations with popular benchmarks, to evaluate the effectiveness of the proposed design are very encouraging.

This work is motivated by the demand for scheduling tasks upon the increasingly popular island-based many-core architectures. On such an architecture, homogeneous cores are grouped into islands, each of which is equipped with a scratchpad memory module (referred to as local memory). We first show the NP-hardness and the inapproximability of the scheduling problem. Despite the inapproximability, positive results can still be found when different cases of the problem are investigated. A$(3-\frac{1}{F})$- approximation algorithm is proposed for the minimization of the maximum system utilization, where$F$is the number of cores in the platform. When the technique of resource augmentation is considered, this paper further develops a$(\gamma +1)$-memory$\frac{2\gamma -1}{\gamma -1}$-approximation algorithm, where$\gamma$represents the trade-off between CPU utilization and local memory space. On the other hand, a special case is also considered when the ratio of the worst-case execution time of a task without and with using the local memory is bounded by a constant. The capabilities of the proposed algorithms are then evaluated with benchmarks from MRTC, UTDSP, NetBench and DSPstone, where the maximum system utilization can be significantly reduced even when the local memory size is only 5 percent of the total footprint of all of the tasks.

Virtual cluster is a useful resource descriptive model, in terms of virtual machines (VMs) and link bandwidth, for many data center applications that require predictable performance. Bandwidth-constrained data centers often use reservation schemes to statically allocate underlying physical resources to virtual clusters. However, due to highly varying workloads, existing reservation schemes may place VMs improperly, causing a waste of bandwidth reservation and eventually leading to rejecting new virtual cluster requests even the VM capacity is sufficient. In this paper, we propose a mechanism to detect and rectify such bandwidth-wasting VM placements via VM reshuffling. To compute a new VM placement accommodating new requests as many as possible, we formulate an optimization problem, with the objective of minimizing the reservations of limited bandwidth. The problem is NP-hard. We propose two efficient algorithms for a practical special case and the general case of the problem respectively. To evaluate our mechanism, we conduct simulation with the settings close to real data center environments. The results show that our mechanism with VM reshuffling achieves a significant reduction in rejecting virtual cluster requests and increases data center throughput over various high loads.

Meeting flow deadlines is crucial for a business running its interactive applications in a shared datacenter. Current deadline-aware transport protocols fall short in terms of throughput and fairness, when datacenter tenants compete for network capacity by their deadline-sensitive traffic. This paper presents an admission control mechanism to work with a deadline-aware transport protocol. Following pay-as-you-use paradigm, we model a revenue-maximizing problem for the mechanism to admit a right fraction of deadline-constrained traffic to the underlying transport layer, while respecting per-flow fairness by an economic notion, envy-free pricing. To tackle fast-changing traffic, we propose a greedy algorithm for the problem in the mechanism, which can easily adopt a batch processing method to mitigate the incurred overhead. By packet-level simulation, we demonstrate that the admission control mechanism sustains high application throughput and good revenues in heavy traffic loads. In addition, we present two service policies, each of which is demonstrated to have a desirable service property in dynamic environments.

Graphics-intensive mobile games are becoming increasingly popular, but such applications place high demand on device CPUs and GPUs. The design of current mobile systems results in unnecessary energy waste due to lack of consideration of application phases and user attention (a “demand-level” gap) and because each processor administers power management autonomously (a “processor-level” gap). This paper proposes a user-centric CPU-GPU governing framework which aims to reduce energy consumption without significantly impacting the user experience. To bridge the gap at the demand level, we identify the user demand at runtime and accordingly determine appropriate governing policies for the respective processors. On the other hand, to bridge the gap at the processor level, the proposed framework interprets the frequency scaling intents of processors based on the observation of the CPU-GPU interaction and the processor status. We implemented our framework on a Samsung Galaxy S4, and conducted extensive experiments with real-world 3D gaming apps. Experimental results showed that, for an application being highly interactive and frequent phase changing, our proposed framework can reduce energy consumption by 45.1% compared with state-of-the-art policy without significantly impacting the user experience.

Mobile systems will increasingly feature emerging OLED displays, whose power consumption is highly dependent on the image content. Existing OLED power-saving techniques change users' visual experience or degrade images' visual quality in exchange for power reduction, or seek a chance to also enhance image quality by employing a compound objective function. This paper presents a win-win scheme that always enhances image quality and reduces power consumption simultaneously. We define metrics to assess the profit and the cost for potential image enhancement and power reduction. Then, we propose algorithms that ensure the transformation of images into their quality-enhanced power-saving versions. Finally, the proposed scheme is realized as a practical camera application on mobile devices. The results of experiments conducted on a commercial tablet with a popular image database are very encouraging and provide valuable insights for future research and practices.

Understanding the implications in smartphone usage and the power breakdown among hardware components has led to various energy-efficient designs for mobile systems. While energy consumption has been extensively explored, one critical dimension is often overlooked - unperceived activities that could steal a significant amount of energy behind users' back potentially. In this paper, we conduct the first exploration of unperceived activities in mobile systems. Specifically, we design a series of experiments to reveal, characterize, and analyze unperceived activities invoked by popular resident applications when an Android smartphone is left unused. We draw possible solutions inspired by the exploration and demonstrate that even an immediate remedy can mitigate energy dissipation to some extent.

Mobile devices, which are inherently of limited computing capabilities, face a growing demand to support increasingly complex applications. Computation offloading addresses this issue by enabling mobile devices to offload computations to a remote server. Advancing on previous work, this paper presents a cloud-based offloading service, which models an optimization problem with the objective of minimizing the operation cost of the service provider while achieving the agreed quality of service (QoS) for subscribers. The problem is shown to be NP-hard. We propose a pseudo-polynomial-time optimal algorithm for the offline scenario, as well as an efficient online algorithm that has a provable QoS guarantee and allows practical implementations. To evaluate our algorithms, we synthesize remotable tasks and conduct extensive simulations based on real mobile user traces and application workload patterns. Our results demonstrate that our online algorithm could achieve comparable performance to the optimal offline algorithm, in terms of both the required cloud cost and the provided user benefit.

An increasing number of mobile devices are being equipped with 802.11n interfaces to support bandwidth-intensive applications; however, the improved bandwidth increases power consumption. To address the issue, researchers are focusing on antenna management. In this paper, we present a dynamic antenna management (DAM) scheme to improve the uplink energy efficiency on mobile devices whose packet workloads may vary significantly and frequently. First, we model antenna management as an optimization problem, with the objective of minimizing the energy required to transmit a sequence of variable-length packets with random arrival times. Then, we propose an optimal offline algorithm to solve the problem, as well as a competitive online algorithm that has a provable performance guarantee and allows compatible implementations on 802.11n mobile devices. To evaluate our scheme, we conducted extensive simulations based on real mobile user traces and application transmission patterns. Nearly all commercial 802.11n mobile devices support the power save mode (PSM). Our results demonstrate that DAM can improve the energy efficiency of PSM significantly at a cost of slight throughput degradation.

Mobile devices have increasingly been used to run multimedia applications which are extremely downlink-intensive. The conventional rate adaptive and/or margin adaptive approach for radio resource allocation may result in unnecessary energy consumption on mobile devices, which will not be energy efficient for mobile multimedia applications. In this paper, we develop an energy adaptive approach and design an energy-efficient downlink resource allocation scheme to support multimedia applications. The objective is to minimize the total energy consumption of mobile devices for data reception while meeting the data rate requirements at mobile devices and the transmit power constraint at the base station. We show that the optimization problem is NP-hard and then propose an efficient algorithm that has a provable performance guarantee under a certain condition. We have conducted extensive simulations to evaluate the efficacy of the proposed algorithm and our results provide useful insights into the design of energy-efficient resource allocation for wireless systems.

Improving the performance of storage systems without losing the reliability and sanity/integrity of file systems is a major issue in storage system designs. In contrast to existing storage architectures, we consider a PCM-based storage architecture to enhance the reliability of storage systems. In PCM-based storage systems, the major challenge falls on how to prevent the frequently updated (meta)data from wearing out their residing PCM cells without excessively searching and moving metadata around the PCM space and without extensively updating the index structures of file systems. In this work, we propose an adaptive wear-leveling mechanism to prevent any PCM cell from being worn out prematurely by selecting appropriate data for swapping with constant search/sort cost. Meanwhile, the concept of indirect pointers is designed in the proposed mechanism to swap data without any modification to the file system's indexes. Experiments were conducted based on well-known benchmarks and realistic workloads to evaluate the effectiveness of the proposed design, for which the results are encouraging.

Reducing the communication energy is essential to facilitate the growth of emerging mobile applications. In this paper, we introduce signal strength into location-based applications to reduce the energy consumption of mobile devices for data reception. First, we model the problem of data fetch scheduling, with the objective of minimizing the energy required to fetch location-based information without impacting the application's semantics adversely. To solve the fundamental problem, we propose a dynamic-programming algorithm and prove its optimality in terms of energy savings. Then, we perform postoptimal analysis to explore the tolerance of the algorithm to signal strength fluctuations. Finally, based on the algorithm, we consider implementation issues. We have also developed a virtual tour system integrated with existing Web applications to validate the practicability of the proposed concept. The results of experiments conducted based on real-world case studies are very encouraging and demonstrate the applicability of the proposed algorithm toward signal strength fluctuations .

Organic light-emitting diode (OLED) technology is considered as a promising alternative to mobile displays. This paper explores how to reduce the OLED power consumption by exploiting visual attention. First, we model the problem of OLED image scaling optimization, with the objective of minimizing the power required to display an image without adversely impacting the user's visual experience. Then, we propose an algorithm to solve the fundamental problem, and prove its optimality even without the accurate power model. Finally, based on the algorithm, we consider implementation issues and realize two application scenarios on a commercial OLED mobile tablet. The results of experiments conducted on the tablet with real images demonstrate that the proposed methodology can achieve significant power savings while retaining the visual quality.

Mobile devices will provide improved computing resources to sustain progressively more complicated applications. However, the design concept of fair scheduling and governing borrowed from legacy operating systems cannot be applied seamlessly in mobile systems, thereby degrading user experience or reducing energy efficiency. In this paper, we posit that mobile applications should be treated unfairly. To this end, we exploit the concept of application sensitivity and devise a user-centric scheduler and governor that allocate computing resources to applications according to their sensitivity. Furthermore, we integrate our design into the Android operating system. The results of extensive experiments on a commercial smartphone with real-world mobile apps demonstrate that the proposed design can achieve significant energy efficiency gains while improving the quality of user experience.

With the increasing sophistication and maturity of biomedical sensors and the significant advances on low-power circuits and wireless communications technologies, wireless body area networks (WBANs) have emerged recently to provide pervasive health monitoring for humans. In WBANs, smart phones can serve as data sinks to forward the sensing data to back-end servers. Due to the battery concern of smart phones and the postural changes of humans, temporary disconnection between sensors and their associated smart phones may frequently happen in WBANs. In this case, the sensing data would be lost when the limited memory space of sensors overflows. To prevent excessive data loss, this paper proposes a scheme to parasitize the data on existing public Wi-Fi networks, once the links from sensors to the smart phones become unavailable. Specifically, an optimization problem to maximize the time during which data loss can be avoided by exploiting the data parasitizing scheme is formulated, where a decision set of the packets' size and sending timing to public Wi-Fi networks needs to be determined. We develop an offline algorithm to obtain an optimal decision set and present an efficient online algorithm for practical implementations. The feasibility of the proposed scheme and the efficacy of the algorithms are demonstrated through prototype implementations on a WBAN testbed with biomedical sensor devices for real-world experiments.

As cloud computing gains its momentum in big data processing and providing on-line services, there are increasing demands to offer responsive services to users and to improve the effectiveness in server utilization. Most previous work studied the fairness among user requests, the workload balancing among servers, and the support of real-time applications individually. Different from those state-of-the-art work, we focus on the joint considerations of workload balancing and deadline satisfaction in facing user requests for MapReduce. In particular, scheduling algorithms are proposed with a constant approximation bound to balance the server workloads and, at the same time to meet the response time requirements of MapReduce jobs. The proposed scheduling algorithms are then implemented with our proposed resource manager for the open source implementation of Hadoop. We evaluate our design based on performance metrics including balancing server workloads and meeting jobs' response-time requirements. Experimental results show the effectiveness of our design through real testbed implementation.

With the increasing variety of mobile applications, reducing the energy consumption of mobile devices is a major challenge in sustaining multimedia streaming applications. This paper explores how to minimize the energy consumption of the backlight when displaying a video stream without adversely impacting the user's visual experience. First, we model the problem as a dynamic backlight scaling optimization problem. Then, we propose algorithms to solve the fundamental problem and prove the optimality in terms of energy savings. Finally, based on the algorithms, we present a cloud-based energy-saving service. We have also developed a prototype implementation integrated with existing video streaming applications to validate the practicability of the approach. The results of experiments conducted to evaluate the efficacy of the proposed approach are very encouraging and show energy savings of 15-49 percent on commercial mobile devices.

In recent years, advances in virtualization technology have enabled multiple virtual machines to run on a physical machine, such that each virtual machine can perform independently with its own operating system. The IT industry has adopted virtualization technology because of its ability to improve hardware resource utilization, achieve low-power consumption, support concurrent applications, simplify device management, and reduce maintenance costs. However, because of the hardware limitation of storage devices, the I/O capacity could cause performance bottlenecks. To address the problem, we propose a hybrid storage access framework that exploits solid-state drives (SSDs) to improve the I/O performance in a virtualization environment.

Reducing the communication energy is essential to facilitate the growth of emerging mobile applications. In this paper, we introduce signal strength into location-based applications to reduce the energy consumption of mobile devices for data reception. First, we model the problem of data fetch scheduling, with the objective of minimizing the energy required to fetch location-based information without adversely impacting user experience. Then, we propose a dynamic-programming algorithm to solve the fundamental problem and prove its optimality in terms of energy savings. We also provide an optimality condition with respect to signal strength fluctuations. Finally, based on the algorithm, we consider implementation issues. We have also developed a virtual tour system integrated with existing web applications to validate the practicability of the proposed concept. The results of experiments conducted based on real-world case studies are very encouraging.

In recent years, virtualization technology enables multiple virtual machines to run on a physical machine, where each virtual machine can run independently and own its operating system. Virtualization technology has been adopted in many IT industries because of its ability to improve hardware resource utilization, achieve low-power consumption, simplify server management, and reduce maintenance cost. However, since the hardware limitation of storage devices, I/O capacity could cause performance bottleneck. In the paper, we will propose a hybrid storage access framework for virtualization environment to dynamically adjust and enhance I/O performance by using solid-state drives (SSDs).

In cognitive radio (CR) networks, upon the request of a primary user (PU) to utilize the licensed spectrum, all the secondary users (SUs) using the same licensed spectrum must terminate the spectrum usage immediately and switch their data transmissions to unoccupied spectra to avoid interference with the PU. The spectrum switching may lead to severe throughput degradation in SU networks. To mitigate the impact of spectrum usage termination and switching, Minimum Interference Robust Topology Construction (MIRTC) is a critical problem. In this paper, we formulate the problem as an integer programming problem and propose a genetic-algorithm-based channel assignment (GACA) scheme to construct a robust CR topology while minimizing interference. Our proposed formulation maintains the connectivity of each source-destination pair under the interruption of any single channel. A Bisearch algorithm is further proposed to approach the optimal solution of the problem. Simulation results demonstrate that the proposed scheme can reduce network interference and enhance network throughput efficiently.

Reducing the energy consumption of the emerging genre of smart handheld devices while simultaneously maintaining mobile applications and services is a major challenge. This work is inspired by an observation on the resource usage patterns of mobile applications. In contrast to existing DVFS scheduling algorithms and history-based prediction techniques, we propose a resource-driven DVFS scheme in which resource state machines are designed to model the resource usage patterns in an online fashion to guide DVFS. We have implemented the proposed scheme on Android smartphones and conducted experiments based on real-world applications. The results are very encouraging and demonstrate the efficacy of the proposed scheme.

Wireless charging technology is considered as one of the promising solutions to solve the energy limitation problem for large-scale wireless sensor networks. Obviously, charger deployment is a critical issue since the number of chargers would be limited by the network construction budget, which makes the full-coverage deployment of chargers infeasible. In many of the applications targeted by large-scale wireless sensor networks, end-devices are usually equipped by the human and their movement follows some degree of regularity. Therefore in this paper, we utilize this property to deploy chargers with partial coverage, with an objective to maximize the survival rate of end-devices. We prove this problem is NP-hard, and propose an algorithm to tackle it. The simulation results show that our proposed algorithm can significantly increase the survival rate of end-devices. To our knowledge, this is one of very first works that consider charger deployment with partial coverage in wireless rechargeable sensor networks.

Improving the endurance of PCM is a fundamental issue when the technology is considered as an alternative to main memory usage. In the design of memory-based wear leveling approaches, a major challenge is how to efficiently determine the appropriate memory pages for allocation or swapping. In this paper, we present an efficient wear-leveling design that is compatible with existing virtual memory management. Two implementations, namely, bucket-based and array-based wear leveling, with nearly zero search cost are proposed to tradeoff time and space complexity. The results of experiments conducted based on popular benchmarks to evaluate the efficacy of the proposed design are very encouraging.

A major challenge in the design of multicore embedded systems is how to tackle the communications among tasks with performance requirements and precedence constraints. In this paper, we consider the problem of scheduling real-time tasks over multilayer bus systems with the objective of minimizing the communication cost. We show that the problem is NP-hard and determine the best possible approximation ratio of approximation algorithms. First, we propose a polynomial-time optimal algorithm for a restricted case where one multilayer bus, and the unit execution time and communication time are considered. The result is then extended as a pseudopolynomial-time optimal algorithm to consider multiple multilayer buses with arbitrary execution and communication times, as well as different timing constraints and objective functions. We compare the performance of the proposed algorithm with that of some popular heuristics, and provide further insights into the multilayer bus system design.

Layer-based video coding, together with adaptive modulation and coding, is a promising technique for providing real-time video multicast services on heterogeneous mobile devices. With the rapid growth of data communications for emerging applications, reducing the energy consumption of mobile devices is a major challenge. This paper addresses the problem of resource allocation for video multicast in fourth-generation wireless systems, with the objective of minimizing the total energy consumption for data reception. First, we consider the problem when scalable video coding is applied. We prove that the problem is {\cal NP}-hard and propose a 2--approximation algorithm to solve it. Then, we investigate the problem under multiple description coding, and show that it is also {\cal NP}--hard and cannot be approximated in polynomial time with a ratio better than 2, unless {\cal P}={\cal NP}. To solve this case, we develop a pseudopolynomial time 2-approximation algorithm. The results of simulations conducted to compare the proposed algorithms with a brute-force optimal algorithm and a conventional approach are very encouraging.

While solid-state drives are excellent alternatives to hard disks in mobile devices, a number of performance and reliability issues need to be addressed. In this work, we design an efficient flash management scheme for the performance improvement of low-cost MLC flash memory devices. Specifically, we design an efficient flash management scheme for multi-chipped flash memory devices with cache support, and develop a two-level address translation mechanism with an adaptive caching policy. We evaluated the approach on real workloads. The results demonstrate that it can improve the performance of multi-chipped solid-state drives through logical-to-physical mappings and concurrent accesses to flash chips.

ZigBee, a unique communication standard designed for low-rate wireless personal area networks, has extremely low complexity, cost, and power consumption for wireless connectivity in inexpensive, portable, and mobile devices. Among the well-known ZigBee topologies, ZigBee cluster-tree is especially suitable for low-power and low-cost wireless sensor networks because it supports power saving operations and light-weight routing. In a constructed wireless sensor network, the information about some area of interest may require further investigation such that more traffic will be generated. However, the restricted routing of a ZigBee cluster-tree network may not be able to provide sufficient bandwidth for the increased traffic load, so the additional information may not be delivered successfully. In this paper, we present an adoptive-parent-based framework for a ZigBee cluster-tree network to increase bandwidth utilization without generating any extra message exchange. To optimize the throughput in the framework, we model the process as a vertex-constraint maximum flow problem, and develop a distributed algorithm that is fully compatible with the ZigBee standard. The optimality and convergence property of the algorithm are proved theoretically. Finally, the results of simulation experiments demonstrate the significant performance improvement achieved by the proposed framework and algorithm over existing approaches.

With the emergence of many-core systems, managing blocking costs effectively will soon become a critical issue in the design of real-time systems. In contrast to previous works on multi-core real-time task scheduling algorithms and synchronization protocols, this paper proposes a dedicated-core framework to separate the executions of application tasks and (system) services over cores such that blocking among tasks can be better explored and managed. The rationale behind the framework is that we can exploit the characteristics of many-core systems to resolve the challenges raised by the systems themselves. We define three core minimization problems with respect to the constraints on core configurations, and present corresponding task allocation algorithms with optimal, approximate, and heuristic solutions. The results of simulations conducted to evaluate the proposed framework provide further insights into task scheduling in many-core real-time systems.

Zigbee, formalized by the IEEE 802.15.4 standard, is a specification for wireless personal area networks with low power, low cost, and a low data rate. In Zigbee, tree topology is commonly practiced to form wireless sensor networks and perform data delivery applications. In Zigbee wireless applications, data de livery failures occur constantly due to the node movements and topology changes of networks. To tackle the topology changes, conventional route reconstruction often involves huge resource consumption. In this paper, we utilize the regularity of mobility patterns to reduce the frequency of route reconstructions and achieve higher efficiency in sending data to mobile nodes. To increase the data delivery ratio, we introduce the metric of mobility-robustness in a tree topology, and propose tree construction with an objective to maximize the mobility-robustness of the constructed tree. We develop an efficient algorithm for effective tree construction. The effectiveness of network topologies constructed using this mobility-robustness metric is demonstrated by NS2 simulations against a real-world scenario.

Scalable video coding with adaptive modulation and coding is a promising technique to provide real-time multicast services for heterogeneous mobile devices. Nevertheless, as the rapid growth of data communication for emerging applications, energy consumption is an critical challenge of mobile devices. This paper targets the problem of resource allocation for scalable video multicast with adaptive modulation-coding schemes in next generation cellular wireless networks, with an objective to minimize the total energy consumption of all mobile devices for reception. We show the NP-hardness of the target problem and propose a 2-approximation algorithm. Extensive simulations are conducted to compare the proposed algorithm with a brute-force optimal algorithm and a conventional approach, which provides some useful insights into power-aware scalable video multicast in 4G wireless systems.

The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. We study an optimization problem for multihop link scheduling with bandwidth and delay guarantees over WRNs. Our optimization problem is investigated under a more general interference model with a generic objective. The objective can be based on various kinds of performance indexes (e.g., throughput, fairness, and capacity), which can be determined by service providers. Through our theoretical analysis, the intractability and inapproximability of the optimization problem are shown. Due to the intractable computational complexity, we present efficient algorithms to provide a reasonable small approximation factor against any optimal solution even for a worst-case input. Furthermore, some experimental results indicate that our algorithms yield near-optimal performance in the average case.

This research is motivated by the demands of personalized storage devices that fit the quality-of-service needs of each individual user. In particular, the design of a virtual storage device, that consists of multiple heterogeneous storage devices, is proposed with the capability in dynamic reconfiguration to fit the needs of users. A dynamic remapping mechanism is presented with a heap-based data structure to manage the moving of data among component storage devices for performance optimization. A lazy swapping method is then proposed to reduce the mapping overheads. The capability of the proposed design is evaluated with a prototype virtual storage device of a flash drive and a hard drive over an ex2 file system and realistic/generated workloads.

One major challenging issue in the designs of multi-core embedded systems is to tackle the communication problem among tasks with performance requirements and precedence constraints. This paper targets the problem of scheduling real-time tasks with chain-based precedence constraints over multi-layer bus systems with an objective to minimize the bus cost. We show the NP-hardness of the problem and the best possible approximation ratio of approximation algorithms. A polynomial-time optimal algorithm is first proposed for a restricted case in which one multi-layer bus and unit execution and communication times are considered. The result is then extended as a pseudo-polynomial-time optimal algorithm in the considerations of multiple multi-layer buses and arbitrary execution and communication times. The capability of the proposed algorithm was evaluated to provide more insights in system designs, compared to some popular heuristics.

Routing problems have become highly challenging because of the popularity of mobile devices. This paper targets power-aware routing when network topologies and data traffic may change quickly in an unpredictable way. We propose a distributed algorithm and its realization to maximize the minimum residual energy of all the nodes for each multicast, where no global information is assumed to be efficiently maintained at any node. A transient multicast tree is established on demand and derived based on the autonomous decisions of intermediate nodes. We prove that the derived tree is loop-free and theoretically optimal in the maximization of minimum residual energy. The performance of the proposed protocol was evaluated over NS2 with a series of simulations for which we have very encouraging results.

Wireless sensor networks have been extensively adopted in numerous application scenarios. However, increasing environmental constraints and performance requirements has spurred the development of tools to expedite deployment and minimize human intervention. This study extends previous work by the authors in network development and aims at the performance evaluation of applications operating in to-be-deployed networks. We prove that the determination of a ZigBee cluster tree over an underlying network is NP - hard and propose an algorithm for generating tree topology. Based on the proposed algorithm/technologies, an integrated development tool is developed. The capability of the tool is demonstrated by a case study of the system deployed in an office building.

Wireless sensor networks have been widely considered as an effective tool in various application domains. One of the major implementation issues is on the network deployment problem. In this paper, we target issues in the deployment of wireless sensor nodes in three-dimensional indoor environments and with irregular radiation patterns for both message communicating and sensing. Our objective is to develop a more effective way to deploy sensor networks and to minimize the number of deployed nodes. We propose several search-oriented strategies to improve the performance of search algorithms, such as simulated annealing. The capability of the proposed strategies is demonstrated by real-case studies in the deployment of sensor networks in several office flats

Medication dispensers treated in this paper are designed to help improve compliance by users who live at homes and take medications over long periods of time. The paper first presents an overview of medication specifications that define constraints for dispensers and dispenser components that administer medications as specified. When given a specification and constraints defined by it, the dispenser scheduler checks for consistency and feasibility of constraints and schedules medications to meet the constraints. Several basic algorithms needed for these purposes are described and evaluated.

A smart pantry holds non-perishable household supplies and automates the purchasing and delivery of their replenishments. By relieving its user from the chore of keeping the home stocked of essentials, it provides convenience and peace of mind not only to elderly individuals but also busy people of all ages. This paper describes two alternative smart pantry designs and tradeoffs. Underlying methods and technologies used for their implementation are also described.

We describe here the prescription algebra and its implementation for medication authoring tools. The tools are parts of medication use process, which consists of prescription entry systems, medication authoring tool, medication scheduling specification, medication scheduler, and programmable pill dispenser. A medication authoring tool aids the pharmacists to collect and integrate prescriptions, to verify drug-drug interactions amongst prescriptions one took for the prescribed duration, and to generate the scheduling specifications for pill dispensers. We design a prescription algebra for medication authoring tool to correctly complete its work. We have implemented the platform-independent medication authoring tool using JAVA. The screen snapshot are shown in the paper.