2009•Science and Technology of West ChinaRequires access

An Improved Scheduling Algorithm

Liang Li

Abstract

Scheduling or process scheduling algorithm is widely used in computers in various fields,such as Linux process scheduling algorithm;curriculum scheduling algorithm.In this paper,we use the undirected graph model,and obtain an improved scheduling or process scheduling algorithm.We show that the algorithm can greatly improve work efficiency in practical applications.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Rate-monotonic scheduling, Computer science, Fair-share scheduling, Dynamic priority scheduling, Two-level scheduling, Round-robin scheduling, Earliest deadline first scheduling, Flow shop scheduling