Efficient scheduling techniques of computing resources are essential for achieving satisfactory performance for users as computersystems and their applications become more complex. In this paper, we survey research o...
详细信息
Efficient scheduling techniques of computing resources are essential for achieving satisfactory performance for users as computersystems and their applications become more complex. In this paper, we survey research on scheduling algorithms, review previous classifications of scheduling problems, and present a broader classification scheme. Using a uniform terminology for scheduling strategies and the new classification scheme, previous work on scheduling strategies is reviewed and trends in scheduling research are identified. Finally, a methodology for developing scheduling strategies is presented.
A method of evaluating recursively defined functions which uses two (or more) stacks is described in this paper. This method is designed to reduce the stack storage needed and requires simpler ‘linkage’ information ...
详细信息
A method of evaluating recursively defined functions which uses two (or more) stacks is described in this paper. This method is designed to reduce the stack storage needed and requires simpler ‘linkage’ information than the single stack method. In addition, a study of ‘go-to’ (or iterative) type recursive definitions is made and it is shown that these require bounded stack storage for their evaluation.
We present a simple algorithm for emulating an N-processor CROW PRAM on an N-ode butterfly. Each step of the PRAM is emulated in time O(log N) with high probability, using FIFO queues of size O(1) at each node. The on...
详细信息
We present a simple algorithm for emulating an N-processor CROW PRAM on an N-ode butterfly. Each step of the PRAM is emulated in time O(log N) with high probability, using FIFO queues of size O(1) at each node. The only use of randomization is in selecting a hash function to distribute the shared address space of the PRAM onto the nodes of the butterfly. The routing itself is both deterministic and oblivious, and messages are combined without the use of associative memories or explicit sorting. As a corollary we improve the result of Pippenger by routing permutations with bounded queues in logarithmic time, without the possibility of deadlock. Besides being optimal, our algorithm has the advantage of extreme simplicity and is readily suited for use in practice.
作者：
BARD, YIBM CORP
DATA PROC DIV SCI CTRTECHNOL SQCAMBRIDGEMA 02138
This paper describes a method for predicting the paging behavior of a program in a virtual memory multiprogramming environment. The effect of overall system activity on the program is summarized in one parameter, the ...
详细信息
This paper describes a method for predicting the paging behavior of a program in a virtual memory multiprogramming environment. The effect of overall system activity on the program is summarized in one parameter, the page survival index. The model correlates well with observations taken on programs running under CP-67. The model can be used for paging load prediction, simulator input verification, and evaluation of program rearrangement and sharing.
This paper presents algorithms and their implementations for table look-up modeling of static and dynamic behavior of electronic devices for transient simulation. More specifically, multivariate Bernstein polynomials ...
详细信息
This paper presents algorithms and their implementations for table look-up modeling of static and dynamic behavior of electronic devices for transient simulation. More specifically, multivariate Bernstein polynomials are used to interpolate the operating point from tabular input-output data. For most device characteristics quadratic tensor product of input-output polynomial functions in Bernstein form offer operating point values within a few percent of the analytical function value. This range of accuracy is acceptable for most transient simulation scenarios. The algorithm outlined here consists of dot product evaluations and thus it is computationally simpler than analytical models.
This article presents a general algorithm for prettyprinting and holophrasting interactively created objects. It is shown how an environment with knowledge of the entities it manipulates can automatically produce cath...
详细信息
This article presents a general algorithm for prettyprinting and holophrasting interactively created objects. It is shown how an environment with knowledge of the entities it manipulates can automatically produce cathode-ray tube displays with more helpful contextual information for the user than a traditional display of contiguous lines from a source file.
An algorithm is given which forms the worst case permutation for one of the most efficient versions of quicksort (median-of-three quicksort). This makes the experimental evaluation of this important algorithm possible...
详细信息
An algorithm is given which forms the worst case permutation for one of the most efficient versions of quicksort (median-of-three quicksort). This makes the experimental evaluation of this important algorithm possible. The paper includes a simple experimental comparison of the median-of-three and original versions of quicksort.
Some straightforward methods of table look-up are described, suitable for routine use with moderately small tables in practical applications. Particular attention is paid to the different circumstances in which differ...
详细信息
Some straightforward methods of table look-up are described, suitable for routine use with moderately small tables in practical applications. Particular attention is paid to the different circumstances in which different methods are applicable, to the methods of constructing, coding, loading and updating of the table to be searched, and to the action to be taken when a suitably matching entry is not found.
Ways of increasing CPU usage in a multiprogrammed environment are considered. Simulation of a multiprogramming operating system shows a significant increase in CPU utilisation as the I/O buffer size is increased; resu...
详细信息
Ways of increasing CPU usage in a multiprogrammed environment are considered. Simulation of a multiprogramming operating system shows a significant increase in CPU utilisation as the I/O buffer size is increased; result also confirm a reduction in CPU idle time as the number of I/O disc channels is increased. The investigation suggest that such systems would benefit from an increased I/O buffer *** article s'attache a étudier les différentes manières d'augmenter sensiblement l'utilisation d'une CPU dans un environne de multiprogrammation. A l'issue d'une simulation d'un système de multiprogrammation, il a été constaté que le temps effectif d'utilisation d'une CPU diminue quand la taille des tampons d'entrées/sorties, elle, augmente. Des résultats similaries confirment qu'une augmentation de canaux d'entrées/sorties utilisant des disques, réduit d'une manière appreciable le temps d'attente de l'unité de traitement (CPU). Gain de temps et de souplesse, si la taille des tampons d'entrées/sorties est augmentée, est la concusion que suggère cette étude.
暂无评论