Although sometimes thought of as only a component of time-sharing operation, multiprogramming can involve broader questions of resource allocation, since fairness is not required to meet a response criterion. In a mul...
详细信息
Although sometimes thought of as only a component of time-sharing operation, multiprogramming can involve broader questions of resource allocation, since fairness is not required to meet a response criterion. In a multi-programmed system. it may serve maximal resource use to be unfair, for example by holding an input.: output channel idle for a program while it completes a small amount of processor usage, enabling further use of the channel. Several applications of this principle are given, and it is suggested that a multiprogramming executive might dynamically adjust its allocation algorithms to gain efficiency. Allocation of resources is closely connected to accounting for those resources, raising the problems of repeatability, minimal uncharged overhead, and relative weighting of charges for dependent resources. Since weightings may depend on allocation algorithms, these are not arbitrary accounting parameters. Often the only repeatable accounting is one which omits an extensive overhead; this overhead can be multiple-charged to all programs which benefit from it, so that in the worst case the overhead will be paid, and should multiprogramming prove efficient, overcharges will result. multiprogramming turns on allocation of the memory resource essential to control of other resources. The general suggestions for allocation and accounting are applied to this question, and some details provided for the case of a monitor which controls a virtual-memory machine. [ABSTRACT FROM AUTHOR]
This paper investigates the problem of scheduling a processor to optimize throughput in a multiprogramming environment. A deterministic model is used to study the scheduling of a batch of k programs residing in main m...
详细信息
This paper investigates the problem of scheduling a processor to optimize throughput in a multiprogramming environment. A deterministic model is used to study the scheduling of a batch of k programs residing in main memory of a system consisting of a single processor and k input–output devices in such a way as to minimize the time to complete all k jobs.
The author feels that the interrupt feature which is available in most modern computers is a potent source of programming pitfalls and errors, and that it therefore may heavily contribute to the unreliability of progr...
详细信息
The author feels that the interrupt feature which is available in most modern computers is a potent source of programming pitfalls and errors, and that it therefore may heavily contribute to the unreliability of programs making use of it. A programming scheme is presented which ovoids the concept of the interrupt and permits the specification of concurrent (or pseudoconcurrent) activities in a supposedly more perspicuous manner. It is intended to serve as a basis for the construction of operating systems, which are prime examples of programs with concurrent activities. The scheme includes a set of basic instructions for the generation, termination, and synchronization of parallel processes. A set of routines representing these instructions and thereby simulating hypothetical machine organization has been implemented and tested on the IBM System/360. Two programs using these instructions, written in PL360, are presented. [ABSTRACT FROM AUTHOR]
Queueing network models of computer systems with multiprogramming constraints generally do not possess a product-form solution in the sense of Jackson. Therefore, one is usually led to consider approximation technique...
详细信息
ISBN:
(纸本)9780897910798
Queueing network models of computer systems with multiprogramming constraints generally do not possess a product-form solution in the sense of Jackson. Therefore, one is usually led to consider approximation techniques when dealing with such models. Equivalence and decomposition is one way of approaching their solution. With multiple job classes, the equivalent network may be viewed as a set of interdependent queues. In general, the state-dependence in this equivalent network precludes a product-form solution, and the size of its state space grows rapidly with the number of classes and of jobs per class. This paper presents two methods for approximate solution of the equivalent state-dependent queueing network. The first approach is a manifold application of equivalence and decomposition. The second approach, less accurate than the first one, is a fast-converging iteration whose computational complexity grows near-linearly with the number of job classes and jobs in a class. Numerical examples illustrate the accuracy of the two methods.
When errors occur during a computer system run, it is sometimes necessary to stop the session and reinitialize the system. In order to keep the consequences of such a breakdown at a minimum the operating system must t...
详细信息
It has been brought to my attention that Figure 5 in my paper [1] is not consistent with Figure 2 in the paper [2], as it was meant to be. In the former the ordinate is defined as the incremental number of instruction...
详细信息
It has been brought to my attention that Figure 5 in my paper [1] is not consistent with Figure 2 in the paper [2], as it was meant to be. In the former the ordinate is defined as the incremental number of instructions executed between page demands, but the curve corresponds to the cumulative measure given in the latter.
A central problem in program design is to structure a large program such that it can be tested systematically by the simplest possible techniques. This paper describes the method used to test the RC 4000 multiprogramm...
详细信息
A common myth surrounding multiprogramming is that it it a necessary mode of operation to deal with the high levels of I/O activity found on most computers. This paper shows that the high level of I/O activity is to a...
详细信息
This paper defines a language called Modula, which is intended primarily for programming dedicated computer systems, including process control systems on smaller machines. The language is largely based on Pascal, but ...
详细信息
Ever since the discussions about a possible quantum computer arised, quantum simulations have been at the forefront of possible utilities, with the task of quantum simulations being one that promises quantum advantage...
详细信息
Ever since the discussions about a possible quantum computer arised, quantum simulations have been at the forefront of possible utilities, with the task of quantum simulations being one that promises quantum advantage. Recently, advancements have made it feasible to simulate complex molecules using Variational Quantum Eigensolvers or study the dynamics of many-body spin Hamiltonians. These simulations have the potential to yield valuable outcomes through the application of error mitigation techniques. Simulating smaller models carries a great amount of importance as well and currently, in the Noisy Intermediate Scale Quantum era, is more feasible since it is less prone to errors. The objective of this work is to examine the theoretical background and the circuit implementation of a quantum tunneling simulation, with an emphasis on hardware considerations. This study presents the theoretical background required for such implementation and highlights the main stages of its development. By building on classic approaches of quantum tunneling simulations, this study aims at improving the result of such simulations by employing error mitigation techniques, Zero Noise Extrapolation, and Readout Error Mitigation and uses them in conjunction with multiprogramming of the quantum chip, a technique used for solving the hardware under-utilization problem that arises in such contexts. Quantum simulations are regarded as a promising undertaking in the field of quantum computing. This study focuses on quantum tunneling and aims at simulating it on a quantum computer. With a focus on hardware run considerations for superconducting architectures, various circuit implementation alternatives are clarified. The role of the compiler, the need for hardware aware design, different error mitigation techniques and multiprogramming are discussed, giving a final workflow tailored for the Noisy Intermediate Scale Quantum era. image
暂无评论