enter search term and/or author name
Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems
Haisang Wu, Binoy Ravindran, E. Douglas Jensen, Peng Li
We present an energy-efficient, utility accrual, real-time scheduling algorithm called ReUA. ReUA considers an application model where activities are subject to time/utility function time constraints, mutual exclusion constraints on shared non-CPU...
EnviroSuite: An environmentally immersive programming framework for sensor networks
Liqian Luo, Tarek F. Abdelzaher, Tian He, John A. Stankovic
Sensor networks open a new frontier for embedded-distributed computing. Paradigms for sensor network programming-in-the-large have been identified as a significant challenge toward developing large-scale applications. Classical programming languages...
A split-mask countermeasure for low-energy secure embedded systems
Catherine H. Gebotys
Future wireless embedded devices will be increasingly powerful, supporting many more applications, including one of the most crucial---security. Although many embedded devices offer more resistance to bus---probing attacks because of their compact...
Parallelizing load/stores on dual-bank memory embedded processors
Xiaotong Zhuang, Santosh Pande
Many modern embedded processors such as DSPs support partitioned memory banks (also called X--Y memory or dual-bank memory) along with parallel load/store instructions to achieve higher code density and performance. In order to effectively utilize...
Reducing power while increasing performance with supercisc
Alex K. Jones, Raymond Hoare, Dara Kusic, Gayatri Mehta, Josh Fazekas, John Foster
Multiprocessor Systems on Chips (MPSoCs) have become a popular architectural technique to increase performance. However, MPSoCs may lead to undesirable power consumption characteristics for computing systems that have strict power budgets, such as...
Automatic rate desynchronization of embedded reactive programs
Alain Girault, Xavier Nicollin, Marc Pouzet
Many embedded reactive programs perform computations at different rates, while still requiring the overall application to satisfy very tight temporal constraints. We propose a method to automatically distribute programs such that the obtained parts...