Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 579 papers for “multiprogramming”

Decomposability, instabilities, and saturation in multiprogramming systems

Pierre Courtois · Communications of the ACM · 1975

A step-by-step approach to model the dynamic behavior and evaluate the performance of computing systems is proposed. It is based on a technique of variable aggregation and the concept of nearly decomposable systems, both borrowed from Econometrics. This approach is taken in order to identify in multiprogramming paging systems (i) unstable regimes of operations and (ii) critical computing loads which bring the system into states of saturation. This analysis leads to a more complete definition of the circumstances in which “thrashing” can set in.

Cited by 140Open access

Multiprogramming and the Next Generation of Microprocessors

Christopher J. Payne · 2008

The next generation of multiprocessors in PC’s is currently being designed. The new design will be a departure from previous designs which relied for product upgrades and improvements on being able to increase, with each new generation of processor, the number of switches and gates which could be added to a silicon chip. The problems of heat caused by increasing the electrical activity within circuits of diminishing size has now placed a limit on further miniaturization. So so-called multicore microprocessors will replace single complicated processors with multiple processors which are each conceptually simpler. These multiple processors are intended to run simultaneously and asynchronously and thereby increase computing power while, at the same time, reducing hardware complexity and thus controlling the problem of destructive heat. However, this simultaneity presents enormous problems for the programmer of such devices. The traditional von Neumann Architecture for computer processor design is essentially linear and sequential and so conventional programming techniques have been developed for it. Thus most modern programming languages are not suited to non-sequential applications. Thus the programming of the multicore machine will require new programming methods and solutions to exploit its non-sequential mode of operation. At present these do not exist and a major research effort is currently underway to solve the software problems of asynchronous computing. This paper describes the conventional approaches to multiprocessor computing and outlines the problems and opportunities of a new paradigm for programming a multiprocessing microprocessor working non-sequentially.

Cited by 0

Multitype multiprogramming: Probability models and numerical procedures

Gaver, Donald Paul, Humfeld, George · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 1975

This report describes mathematical models for use in evaluating the performance of complex computer systems. Numerical methods are given to compute operating characteristics of systems when two types of jobs are present.

Cited by 1

A multiprogramming operating system for the TI980A

Henry R. Bauer, G.D. Thomas, Jeffrey VanBaalen · 1976

The University of Wyoming Computer Science Department has developed several versions of a multiprogramming operating system for research and for student use. This paper describes the background of the systems and the hardware facilities available. Major emphasis is placed on the message driven system and implementation problems presented by the hardware. The description includes the core-resident nucleus, the input/output communications, the file system and the high-level operating system.

Cited by 2

A Simple, Object-based View of Multiprogramming

Jayadev Misra · 1995

Object-based sequential programming has had a major impact on software engineering. However, object-based concurrent programming remains elusive as an effective programming tool. The class of applications that will be implemented on future high-bandwidth networks of processors will be significantly more ambitious than the current applications (which are mostly involved with transmissions of digital data and images), and object-based concurrent programming has the potential to simplify designs of such applications. Many of the programming concepts developed for databases, object-oriented programming and designs of reactive systems can be unified into a compact model of concurrent programs that can serve as the foundation for designing these future applications. We propose a model of multiprograms and a discipline of programming that addresses the issues of reasoning (e.g., understanding) and efficient implementation. The major point of departure is the disentanglement of sequential and multiprogramming features. We propose a sparse model of multiprograms that distinguishes these two forms of computations and allows their disciplined interactions.

Cited by 0

A multiprogramming nucleus with dynamic resource facilities

Alan Shaw, Nelson Weiderman, Gregory R. Andrews et al. · Software Practice and Experience · 1975

Abstract This paper describes a nucleus for controlling process interaction in multiprogramming systems. The nucleus has three components: a set of primitive operations and data structures for the management of processes and resources, a library of service routines for implementing a variety of resource management strategies and facilities for cleanly handling all input‐output and interrupts. The process management component is straightforward, but the resource facilities are novel in permitting the dynamic definition and control of classes of real or virtual resources. Resources are considered to be anything on which a process can be blocked and consequently encompass consumable (message‐like) as well as conventional, re‐usable objects. Applications of the nucleus as well as some implementation details are also presented.

Cited by 13

The structure of the “THE”-multiprogramming system

Edsger W. Dijkstra · Communications of the ACM · 1968

A multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical levels, in each of which one or more independent abstractions have been implemented. The hierarchical structure proved to be vital for the verification of the logical soundness of the design and the correctness of its implementation.

Cited by 1,087Open access

Multiprogramming in a medium-sized hybrid environment

W. R. Dodds · 1970

Of the many roles that the digital computer plays in a full hybrid environment, few are amenable to multiprogramming. Usually, the speed mismatch between a modern high-speed analog computer and the typical scientific digital computer used in hybrid systems demands that the digital be fully dedicated to the particular task in progress. However, the use of the digital computer for analog computer setup and checkout is a function which is performed several times a day in an active hybrid computation laboratory, and this task does not make any severe demands upon the digital computer. This paper describes a multiprogramming system used to effectively set up and check out an analog computer while still performing routine background processing such as compilation.

Cited by 0Open access

Online Job Scheduler for Fault-tolerant Quantum Multiprogramming

Nishio, Shin, Wakizaka, Ryo, Sakuma, Daisuke et al. · arXiv (Cornell University) · 2025

Fault-tolerant quantum computers are expected to be offered as cloud services due to their significant resource and infrastructure requirements. Quantum multiprogramming, which runs multiple quantum jobs in parallel, is a promising approach to maximize the utilization of such systems. A key challenge in this setting is the need for an online scheduler capable of handling jobs submitted dynamically while other programs are already running. In this study, we formulate the online job scheduling problem for fault-tolerant quantum computing systems based on lattice surgery and propose an efficient scheduler to address it. To meet the responsiveness required in an online environment, our scheduler approximates lattice surgery programs, originally represented as polycubes, by using simpler cuboid representations. This approximation enables efficient scheduling while improving overall throughput. In addition, we incorporate a defragmentation mechanism into the scheduling process, demonstrating that it can further enhance QPU utilization.

Cited by 0Open access

The effects of multiprogramming on barrier synchronization

Evangelos P. Markatos, Mark Crovella, P. Das et al. · 2002

One of the most common ways to share a multiprocessor among several applications is to give each application a set of dedicated processors. To ensure fairness, an application may receive fewer processors than it has processes. Unless an application can easily adjust the number of processes it employs during execution, several processes from the same application may have to share a processor. The authors quantify the performance penalty that arises when more than one process from the same application runs on a single processor of a NUMA (Non Uniform Memory Access) multiprocessor. They consider programs that use coarse-grain parallelism and barrier synchronization because they are particularly sensitive to multiprogramming. They quantify the impact on the performance of an application of quantum size, frequency of synchronization, and the type of barrier used. They conclude that dedicating processors to an application, even without migration or dynamic adjustment of the number of processes, is an effective scheduling policy for programs that synchronize frequently using barriers.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 24

Automatic multiprogramming bad smell detection with refactoring

et al. Verma · International Journal of ADVANCED AND APPLIED SCIENCES · 2017

A code smell detection and refactor is one of the very hot concepts in these days. A Lot of researcher worked on it to create an automatic bad smell detection and refactoring system. Main purpose behind the development of these type of systems is to create automatic for enhance the development quality of software systems. In the previous research the smell detection system perform detection on specific areas or specific language. Due to this companies needs to use more than one detector for software testing for large projects. The system is combination of various modules which can be developed in various languages. Our proposed method which is helpful their users to test their code and detect bad smell on more than one language. It acts as a bridge with some optimization techniques which provide highly accurate working for smell detection along with refactoring. Proposed approach uses optimization along with fact and rule programming to detect and refactor the bad smell from input programs. Various bad smells like long methods, dead code, lazy class, long class, etc. are used to check the quality of the code. The proposed approach is also working for Java, c++ and c#.net codes for the test all these bad smell and refactor c++ and Java code. The performance of the proposed approach is also better than other existing algorithms in terms of accuracy for detection and refactoring of bad smells. Some other challenges that the proposed approach faced to find the smells in the code also affect the performance. One of the main challenges is the way of writing code is different for everyone. So it's difficult to detect and refactor the thing on smell detection tool. Proposed approach used fact and rule processing for detection and eliminates unwanted entries with the help of the optimization process. The performance in terms of accuracy and FAR, FRR are stable and better for all the test cases in the comparison of existing methods and proposed approach.

Cited by 0Open access