| Budget Amount *help |
¥1,700,000 (Direct Cost: ¥1,700,000)
Fiscal Year 1998: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 1997: ¥1,000,000 (Direct Cost: ¥1,000,000)
|
|---|
| Research Abstract |
In this fiscal year. we have developed a pre-runtime scheduling method and discussed its effectiveness based on simulation results of it and other methods. Furthermore, we have developed a dynamic scheduling method based on the resource reservation and discussed its applications to the scheduling of real-time transactions. These results are summarized as follows :
1. A scheduling algorithm for distributed real-time systems with end-to-end timing constraints
In this research, we have developed a scheduling algorithm for distributed real-time systems with various timing constraints such as end-to-end timing constraints and jitter constraints. The proposed algorithm has capability to schedule networks as well as processors satisfying various constraints and is applicable to the systems with networks which need not have real-time commimication facilities. Simulation study shows that the proposed algorithm is very efficient while achieving high success ratio.
2. A real-time synchronization protocol and scheduling method based on the resource reservation
In this research, we have developed a dynamic synchronization protocol and scheduling method based on time-stamp ordering for real-time transactions. First, in this research. the synchronization protocol which prevents transaction abortions by reservation of shared resources is developed, Next, in this research, the dynamic transaction scheduling method based on timestamp ordering and priority is developed. This method makes it possible to decrease the deadline miss of transactions. Finally, in this research, simulation results of proposed and other methods are presented and efficiency of proposed methods are discussed.
|
