Results 1 
5 of
5
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 2979 (2 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
ORTHOGONAL PACKINGS IN TWO DIMENSIONS
, 1980
"... We consider problems of packing an arbitrary collection of rectangular pieces into an openended, rectangular bin so as to minimize the height achieved by any piece. This problem has numerous applications in operations research and studies of computer operation. We devise efficient approximation alg ..."
Abstract
 Add to MetaCart
We consider problems of packing an arbitrary collection of rectangular pieces into an openended, rectangular bin so as to minimize the height achieved by any piece. This problem has numerous applications in operations research and studies of computer operation. We devise efficient approximation algorithms, study their limitations, and derive worstcase bounds on the performance of the packings they produce. Key words, twodimensional packing, bin packing, resource constrained scheduling
An approximation algorithm . . . twodimensional knapsack problems
, 1995
"... An efficient heuristic for solving twodimensional knapsack problems is proposed. The algorithm selects an optimal subset of optimal generated strips by solving a sequence of onedimensional knapsack problems. We show that the number of these knapsacks can be reduced to only four knapsacks. The algo ..."
Abstract
 Add to MetaCart
An efficient heuristic for solving twodimensional knapsack problems is proposed. The algorithm selects an optimal subset of optimal generated strips by solving a sequence of onedimensional knapsack problems. We show that the number of these knapsacks can be reduced to only four knapsacks. The algorithm gives an excellent worstcase experimental approximation ratio (0.98), and a high percentage of optimal solutions (91%). From this heuristic, we derive an approximation algorithm for which we prove some refined bounds and we show that its approximation ratio is ~. 4 Our numerical study on large size instances shows the efficiency of these algorithms for solving realworld problems which are hardly handled by other known methods, which are often limited by computer storage facilities.
AND
"... ABSTR.~kCT. The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utihzation which ..."
Abstract
 Add to MetaCart
ABSTR.~kCT. The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utihzation which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadhnes. A combination of these two scheduling techmques is also discussed.
Summary AN EXPERIMENTAL TIMESHARING SYSTEM
, 1962
"... It is the purpose of this paper to discuss briefly the need for timesharing, some of the implementation problems, an experimental timesharing system which has been developed for the contemporary IBM 7090, and finally a scheduling algorithm of one of us (FJC) that illustrates some of the techniques ..."
Abstract
 Add to MetaCart
It is the purpose of this paper to discuss briefly the need for timesharing, some of the implementation problems, an experimental timesharing system which has been developed for the contemporary IBM 7090, and finally a scheduling algorithm of one of us (FJC) that illustrates some of the techniques which may be employed to enhance and be analyzed for the performance limits of such a timesharing system.