Research of real time embedded distributed systems

Real time embedded systems have to use relatively simple scheduling models and algorithms because of their constrained resource. In this paper, a kind of real-time distributed system architecture is presented. The system consists of a two-stages scheduling strategy, overload scheduling algorithm based on a multi-priorities, a improved real time scheduling algorithm based on preemption threshold, a priority driving Ethernet protocol and a embedded Java virtual machine. The characteristic to meet deadline in all components is analyzed with worst case response time.