A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads
IEEE Transactions on Software Engineering
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
IEEE Transactions on Software Engineering
Application performance and flexibility on exokernel systems
Proceedings of the sixteenth ACM symposium on Operating systems principles
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines
IEEE Transactions on Software Engineering
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
Effective Analysis for Engineering Real-Time Fixed Priority Schedulers
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Traditional operating systems control the sharing of the processor resources among processes using a fixed scheduling policy based on the utilization of a computer system such as real-time or timesharing systems. Since the control over the processor allocation is based on a fixed policy, not based on processes' execution behavior, this can hinder an effective use of a processor or can extend the processing time of a process unnecessarily. Thus, we proposed a couple of process scheduling policies which respond to processes' execution behavior. One of these policies is the policy for improving a Web server's response time. This policy controls multiple processes of a Web server by adjusting the execution of these processes according to their predicted behavior. And we evaluated the performance of a Web server using this policy in simple cases.In this paper, we evaluate the performance of a Web server when it is busy which is likely to be a realistic case. This could be the case in which it is most desirable to improve the response time of a Web server. Our experimental results show that the mean response times are improved greatly (up to 33.8% in the best case). They also show that the scheduling parameter is effectively predicted and updated by our mechanism based on the Web server's execution behavior.