Abstract
Due to the dynamic nature of contexts in pervasive computing, a context reasoner has to support real-time scheduling of reasoning jobs. Due to the fact that reasoning results remain fresh within a period of time, the concept of reasoning result reuse efficiency and its computation method are proposed. Then a Fresh-aware Real-time Scheduling Algorithm (FRSA) is proposed to promote the system throughput when the reasoner is overloaded, which schedules reasoning jobs according to their result reuse efficiencies and deadlines. The simulation demonstrates that when the reasoner is heavily overloaded, the throughput of FRSA is 10% to 30% better than those of classic scheduling algorithms SJF, EDF, LSF and FCFS.
| Original language | English |
|---|---|
| Pages (from-to) | 1185-1188 |
| Number of pages | 4 |
| Journal | Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology |
| Volume | 31 |
| Issue number | 5 |
| State | Published - May 2009 |
| Externally published | Yes |
Keywords
- Context reasoning
- Context-aware computing
- Freshness
- Pervasive computing
- Real-time scheduling