UFS: User Friendly Scheduler

Almost all the scheduling algorithms developed so far focus to reduce the throughput time along with maximizing resource utilization. They prioritize and schedule jobs by considering their processor time requirements, services obtained, etc and do not consider user priorities over them. This paper shows a new approach of scheduling tasks as per user desire along with balancing it with the main motive of schedulers. The paper represents a unique user friendly scheduling algorithm for uniprocessor platform which schedules tasks by taking their system requirements as factors to sequence them. These factors are weighed by the user depending upon for what purpose he wants his system to get used. It represents the complete methodology of sequencing tasks and shows a starting approach for resource allocation to them, which is then the desired future work.