Learn More
We propose a technique for analyzing cache-related preemption delays of tasks that cause unpredictable variation in task execution time in the context of xed-priority preemptive scheduling. The proposed technique consists of two steps. The rst step performs a per-task analysis to estimate cache-related preemption cost for each execution point in a given(More)
We propose an enhanced technique for analyzing and thus, bounding cache-related preemption delay in fixed-priority preemptive scheduling focusing on instruction caching. The proposed technique improves upon previous techniques in two important ways. First, the technique takes into account the relationship between a preempted task and the set of tasks that(More)
Cache memory is used in almost all computer systems today to bridge the ever increasing speed gap between the processor and main memory. However, its use in multitasking computer systems introduces additional preemption delay due to reloading of memory blocks that were replaced during preemption. This cache-related preemption delay poses a serious problem(More)
In wireless sensor networks, the limited battery resources of sensor nodes have a direct impact on network lifetime. To improve energy efficiency, there have been a variety of sensor node scheduling methods to keep only a minimum number of sensor nodes in active mode. However, those existing sensor node scheduling methods mainly focus on the coverage(More)
  • 1