On Minimum Variance CPU-Scheduling Algorithm for Interactive Systems using Goal Programming

  title={On Minimum Variance CPU-Scheduling Algorithm for Interactive Systems using Goal Programming},
  author={Anas Jebreen Atyeeh Husain},
  journal={International Journal of Computer Applications},
Improving response time is considered a fundamental objective in interactive environments. CPU scheduling aimed mainly to optimize the response time by minimizing its average in order to attain faster responses to users’ requests. However, for interactive systems, reasonable and predictable services are more preferred than faster responses but highly variable. Delivering service in a timely manner at less variable response time is an issue that has been addressed in this paper. A goal… 
1 Citations
Big Data Analytics Evaluation, Selection and Adoption: A Developing Country Perspective
An Intuitionistic Fuzzy Goal Programming (IF_GP) algorithm based on goal programming and intuitionistic fuzzy numbers is developed to facilitate an agreement among a group of decision makers and eliminate the uncertainty to better represent their opinions.


Towards Minimizing Processes Response Time in Interactive Systems
This study schedules a batch of n processes, for servicing on a single resource, in such a way that the response time is minimized, using task and process terms interchangeably.
Online scheduling algorithms for average flow time and its variants
This dissertation focuses on scheduling problems that are found in a clientserver setting where multiple clients and one server (or multiple servers) are the participating entities, and gives the first scalable algorithms in several scheduling settings for the `1 norm or `k norms of flow time of all requests.
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor
This paper presents several online scheduling algorithms for two related perfor- mance metrics, namely maximum response time and maximum delay-factor, and also their weighted versions, and gives scalable algorithms; that is, algorithms that when given (1+e)-speed are O(poly(1=e))-competitive for any fixed e > 0.
Varying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP)
Experiment and comparison show that the VRRP outperforms other CPU scheduling algorithms and gives better evaluation results in the form of scheduling criteria.
A Comparative Study of Job Scheduling Strategies in Large-Scale Parallel Computational Systems
A comprehensive workload characterization is presented that can be used as a tool for optimizing system's performance and for scheduler design and helps to choose an appropriate job scheduling policy in a given scenario.
CPU scheduling and memory management for interactive real-time applications
The evaluation demonstrates that the CPU scheduler enables the simultaneous playback of multiple movies to perform at the stable frame-rates more than existing real-time CPU schedulers, while also improves the ratio of hard-deadline guarantee for randomly-generated task sets.
Optimizing CPU Scheduling for Real Time Applications Using Mean-Difference Round Robin (MDRR) Algorithm
The experimental results of the proposed Mean-Difference Round Robin Algorithm have been compared with other standard scheduling algorithms and the proposed algorithm is found to have produced optimum scheduling.
Analysis of SRPT scheduling: investigating unfairness
The degree of unfairness under SRPT is surprisingly small, and closed-form expressions for mean response time as a function of job size are proved in this setting.
A weighted-fair-queuing (WFQ)-based dynamic request scheduling approach in a multi-core system
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
It is shown that a natural greedy algorithm modeled after LWF (Longest-Wait-First) is not O(1)-competitive for maximum delay factor with any constant speed even in the setting of standard scheduling with unit-sized jobs.