Sciweavers

569 search results - page 69 / 114
» Using Constraints for Exploring Catalogs
Sort
View
ESTIMEDIA
2007
Springer
14 years 1 months ago
Run-time Task Overlapping on Multiprocessor Platforms
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
Zhe Ma, Daniele Paolo Scarpazza, Francky Catthoor
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 2 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
CODES
2006
IEEE
14 years 1 months ago
The pipeline decomposition tree: : an analysis tool for multiprocessor implementation of image processing applications
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
Dong-Ik Ko, Shuvra S. Bhattacharyya
IPPS
2006
IEEE
14 years 1 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
IPSN
2004
Springer
14 years 1 months ago
Constraint-guided dynamic reconfiguration in sensor networks
This paper presents an approach for dynamic software reconfiguration in sensor networks. Our approach utilizes explicit models of the design space of the embedded application. The...
Sachin Kogekar, Sandeep Neema, Brandon Eames, Xeno...