User adjustable process scheduling mechanism for a multiprocessor embedded system

Authors:
Slo-Li Chu;Chih-Chieh Hsiao;Pin-Hua Chiu;Hsien-Chang Lin
Affiliations:
Department of Information and Computer Engineering, Chung-Yuan Christian University, Chung Li, Taiwan;Department of Information and Computer Engineering, Chung-Yuan Christian University, Chung Li, Taiwan;Department of Information and Computer Engineering, Chung-Yuan Christian University, Chung Li, Taiwan;Department of Information and Computer Engineering, Chung-Yuan Christian University, Chung Li, Taiwan
Venue:
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Year:
2006

Citing 2
Cited 2

Linux Kernel Development

Linux Kernel Development
Real-time sonar beamforming on workstations using process networksand POSIX threads

IEEE Transactions on Signal Processing

Design a Hardware Mechanism to Utilize Multiprocessors on a Uni-processor Operating System

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Hybrid reliable load balancing with MOSIX as middleware and its formal verification using process algebra

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multiprocessor computer systems become more popular for the improvement of the processor's design and fabrication's evolution. In the past, the multiprocessors systems are usually adopted in server systems. Nowadays, the configurations of multiprocessor are also adopted in the personal computers or embedded systems. But we cannot achieve the optimal performance of the multiprocessor systems efficiently because task-scheduling mechanism cannot be adjusted for the real performing situation. Even the task-scheduler of the operating system cannot handle this problem. Also, the parallel program is hard to develop for the specific system to improve performance. In this paper, we provide a tool, called MONOPOLY, for users to adjust the scheduling policies of OS dynamically. It can improve the utilization of the multiple processors' resources by allowing user to occupy a processor to make the specified program execute solely. In our experiment, the results show that the program will finish faster by using MONOPOLY. When the system is fully loaded, the execution time of the program with MONOPOLY will be much shorter then the program without this tool.