Showing papers on "Fair-share scheduling published in 1970"
TL;DR: The authors solve the problem of scheduling a set of tasks whose operational precedence structure is representable as an acyclic directed graph and proof of an efficient algori thm for finding the minimal-length preemptive schedule for tree-structured computations.
172 citations
TL;DR: An algorithm based on convex programming is developed for optimum time compression in network scheduling systems that allows for the activity time-cost trade-off functions to be any differentiable convex function.
Abstract: An algorithm based on convex programming is developed for optimum time compression in network scheduling systems. The development allows for the activity time-cost trade-off functions to be any differentiable convex function. Decomposition theory is then applied to reduce the amount of computation necessary. This along with a limited number of rules to structure any incoming vector makes the algorithm amenable to time compression in large project networks.
72 citations
TL;DR: The queue size and average and the average for a t ime-shared sys tem using round-robin scheduling, w i th and wi thou t overhead, are derived from a cost analysis.
Abstract: The queue size d i s t r ibu t ion and average wai t ing t ime for a t ime-shared sys tem using round-robin scheduling, w i th and wi thou t overhead, are derived. Pr ior i t ies are assigned to incoming users based on a decreasing funct ion of program length. Using this pr ior i ty assignment, a cost analysis is made t ha t shows the effects of changing the sys tem paramete t s and determines the op t imum q u a n t u m length. The input ra te and the q u a n t u m length t h a t will saturate the sys tem are also determined.
38 citations
TL;DR: In this article, the authors focus on multi-stage production systems and present a zero-one programming model to solve the problem of scheduling and sequencing in such a system, where the problem is formulated as a two-phase problem.
Abstract: The paper focuses on multi-stage production systems. If such a system is of the more general type than a production line and many products have to be manufactured according to different technological sequence restrictions then two problems arise: (1) scheduling and (2) sequencing. The formulation of that problem requires the simultaneous consideration of the scheduling and sequencing aspect. The paper integrates these two functions into one single model using zero-one programming.
31 citations
TL;DR: A branch-and-bound type algorithm for the solution of the continuous-process job-shop scheduling problem (CPJS), which minimizes the total completion time (makespan) of all jobs.
Abstract: The continuous-process job-shop scheduling problem (CPJS) arises typically in the following way: (1) a set of M machines or production facilities are available; (2) a set of N jobs are to be processed through these machines in accordance with a technological matrix; (3) the machines associated with a given job must all be used simultaneously for the completion of this job; (4) a predetermined production time is required for each job; (5) the objective is to determine a production schedule which minimizes the total completion time (makespan) of all jobs A branch-and-bound type algorithm for the solution of the (CPJS) problem is presented
24 citations
TL;DR: The Theory of Scheduling as discussed by the authors is a very readable treatment of some of the "classical" solutions to scheduling problems, as well as some heuristic ad hoc approaches that are suitable in particular computer environments.
Abstract: Scheduling and resource allocation have come to the forefront of the problems that confront the designers of computer systems. This is particularly true in time-sharing, multiprogramming, and real-time systems, but it is also the case for somewhat less sophisticated systems due to problems created by disk accessing. Theory of Scheduling is a very readable treatment of some of the "classical" solutions to scheduling problems, as well as some heuristic ad hoc approaches that are suitable in particular computer environments. The operating systems designer should not consider this book as the panacea for all of his ills, however, because the methodology that is given for solving his scheduling problems may be unsatisfactory in the context in which he chooses to use it. For example, in a real-time system the scheduling algorithm must satisfy constraints on maximum computation time which are not necessarily satisfied by the algorithms described in the text.
3 citations
Book•
01 Jan 1970
2 citations
01 Jul 1970
TL;DR: This paper presents a discussion of the problem of scheduling N tasks on two processors when each task consists of three operations, and Johnson''s scheduling algorithm is generalized to solve two of these sub-problems.
Abstract: The job shop problem is one scheduling problem for which no efficient algorithm exists. That is, no algorithm is known in which the number of computational steps grow algebraically as the problem enlarges. This paper presents a discussion of the problem of scheduling N tasks on two processors when each task consists of three operations. The operations of each task must be performed in order and among the processors. We analyze this problem through four sub-problems. Johnson''s scheduling algorithm is generalized to solve two of these sub-problems, and functional equation algorithms are used to solve the remaining two problems. Except for one case, the algorithms are efficient. The exceptional case has been labelled the "core" problem and the difficulties are described.