Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Real-Time Systems
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Move-to-rear list scheduling: a new scheduling algorithm for providing QoS guarantees
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
The Real-Time Specification for Java
Computer
Hi-index | 0.00 |
A 1:1 mapping model between a user thread and a system thread has a merit that supports parallelism, and a M:N mapping has a merit that supports parallelism and fast context exchange. It is necessary to improve performances in order to guarantee soft real-time by minimizing the context exchange between threads. This paper proposes a Java thread model, which supports a M:N mapping in a Linux Java virtual machine, by introducing the concept of LWP Light Weight Process (LWP) in a Java application level. The proposed model is able to maintain a fast processing speed, and independence from a Java platform. In addition, this model guarantees the soft real-time of a Java application program by applying a MTL-LS algorithm to LWP scheduling, and guarantees an excellent performance and soft real-time of the proposed model, which is introduced using a comparison between previous 1:1 model and previous M:1 mapping model.