Abstract
We consider the schedulability-oriented replication problem of a set of periodic real-time tasks where each task can be decomposed into several modules and intermodule communications. The objective is to find an allocation in which there exists a feasible schedule for the given task set. In this paper, we adopt a communication model where the replication of modules is not for the sake of fault tolerance but for increasing the degree of schedulability. To solve the problem, we develop a replication technique and embed the technique in a simulated annealing algorithm. Experimental results show that such replication may lead to a higher degree of schedulability and obtain a feasible solution.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - International Conference on Distributed Computing Systems |
| Editors | Anon |
| Publisher | IEEE |
| Pages | 196-203 |
| Number of pages | 8 |
| Publication status | Published - 1995 |
| Event | Proceedings of the 15th International Conference on Distributed Computing Systems - Vancouver, Can Duration: 1995 May 30 → 1995 Jun 2 |
Other
| Other | Proceedings of the 15th International Conference on Distributed Computing Systems |
|---|---|
| City | Vancouver, Can |
| Period | 95-05-30 → 95-06-02 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture