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”

Modular Multiprogramming

Jayadev Misra · 1998

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. This paper shows that 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.

Cited by 0

Optimal multiprogramming

Peter J. Denning, Kevin C. Kahn, Jacques Leroudier et al. · Acta Informatica · 1976

Cited by 70

Exercises in multiprogramming

P.D. Moerland · Munich Personal RePEc Archive (Ludwig Maximilian University of Munich) · 1993

The ultrastructure of interneurons was studied in the cat and it was found to differ from that of the pyramidal and granule cells. The size, shape and topographic situation of the cell body of interneurons were the criteria for approaching their identification with the cells found in Golgi material. Some interneuron dendrites are also described. The varicose and spindle-shaped dendritic profiles belonging to interneurons are different in size. In Golgi material the interneurons have beaded (varicose) or spindle-shaped dendrites. The arrangement of synaptic terminals on the interneuron dendritic surface seems to be their characteristic feature.

Cited by 3Open access

STRUCTURED MULTIPROGRAMMING PER

Brinch Hansen · 2008

This paper presents a proposal for structured representation of multiprogramming in a high level language. The notation used explicitly associates a data structure shared by concurrent processes with operations defined on it. This clarifies the meaning of programs and permits a large class of time-dependent errors to be caught at compile time. A combination of critical regions and event variables enables the programmer to control scheduling of resources among competing processes to any degree desired. These concepts are sufficiently safe to use not only within operating systems but also within user programs. 1

Cited by 0

A Multiprogramming Queue

I. Adiri, Micha Hofri, M. Yadin · Journal of the ACM · 1973

A simple computer system is described, which consists of a CPU and I/O unit and which works in a multiprogramming manner. The model assumes that the system works under heavy load so that the incoming queue is never empty, that the service times at the two units are exponentially distributed independent random variables, and that the number of iterations of the programs is geometrically distributed. Head of the line priority of programs which are being processed over newcomers is considered.

Cited by 10Open access

-Multiprogramming [Dij68, Dij83b].

Nelson H. F. Beebe · 2013

Version 2.44 Title word cross-reference 2 n [AC83]. 8 [Wic82]. χ 2 [LCJ86]. F [LCJ86]. k [FT83]. M/M/s [Cla81]. O(1) [Bro88]. O(n) [Dei80]. P 2 [JC85].

Cited by 0

Multiprogramming and multiprocessing

A. J. Critchlow · IEEE Spectrum · 1964

Multiprogramming and multiprocessing make economically feasible the capabilities of on-line debugging, man — machine interaction, and remote operation and communication in information handling systems

Cited by 2

Multiprogramming BSP Programs

D. B. Skillicorn · 1996

We explore the problem of transforming a BSP program for execution on a multiprogramming architecture, where it has to share resources with other BSP programs executing at the same time. 1 The BSP model The Bulk Synchronous Parallelism (BSP) [2] model is a general-purpose model that is both architecture-independent and efficient for most problems on today's architectures. A BSP program consists of a set of supersteps, each of which consists of: ffl a set of threads, involving local computation on locally-held variables; ffl a global communication in which data is moved between threads; and ffl a barrier synchronisation, which ends the superstep, and defines the moment at which moved data becomes locally visible. BSP does not exploit locality, so programmers may not make any assumptions about how threads will be mapped to processors. In practice, BSP implementations randomise this placement so that the set of messages to be delivered at any moment during the communication phase will ...

Cited by 0

Multiprogramming and Multiprocessing

Evangelos P. Markatos, Thomas J. LeBlanc · Wiley Encyclopedia of Electrical and Electronics Engineering · 1999

Abstract The sections in this article are Multiprogramming Shared‐Memory Multiprocessors Multiprogramming Distributed‐Memory Multiprocessors Multiprogramming Networks of Workstations Summary Acknowledgments

Cited by 0

Multiprogramming the RCA 601

Roger Smith · 1961

Multiprogramming may be defined as the execution of several computer programs concurrently, under a time-sharing mode, with the aim of keeping all independently operable computer components continuously busy. The benefit to be derived from such a multiprogramming mode of operation then is to achieve maximum computer effectiveness. However, the running time required to achieve multiprogramming must be significantly less than the resultant gain in computer effectiveness.

Cited by 1

Multiprogramming for hybrid computation

Mark S. Fineberg, Omri Serlin · 1967

A significant recent development in hybrid computation is the increasing use of multiprogramming techniques and multiprocessing hardware. To some extent this trend is motivated by the development of multi-user systems in the pure digital field. However, the primary justification for hybrid multiprogramming is economic. It is possible to show that, by sharing a large, powerful central facility, the cost-per-computation can be reduced by almost an order of magnitude, as compared with the alternative of using several smaller, wholly-committed computers.

Cited by 57Open access

Multiprogramming and memory contention

Alan Jay Smith · Software Practice and Experience · 1980

Abstract We study memory contention during multiprogramming when programs are free to compete for page frames. A random walk between the possible partitions of memory over the set of active programs is used to model memory contention and calculate throughput. Our model of contention takes into account program characteristics by using miss ratio curves, and also considers memory size and page fetch latency. With the aid of numerous trace‐driven simulations, we are able to verify our model, finding good agreement both in the observed distribution of memory among competing programs and in CPU utilization. We find that for high ratios of secondary to primary memory access time and under conditions of high memory contention, small programs with compact working sets are able to run with far less than expected interference from larger, more diffuse programs. In the case of multiprogramming the same program several times, we find that observed partition distributions are not necessarily even and that higher than expected levels of CPU use are observed. Lower ratios of access time are found to yield different results; programs compete on a more even basis and partition memory relatively more evenly than with higher ratios.

Cited by 9