Filters








1,438 Hits in 3.3 sec

Page 146 of Computer Performance Vol. 3, Issue 3 [page]

1982 Computer Performance  
Aaslytic Methods to obtain average performance measures when the degree of multiprogramming in each job class is variable. The paper concludes with some numerical examples.  ...  job class — varying number of jobs per class The present paper considers the case of multiclass computer systems with population-size constraints (variable multiprogramming level), where queueing for main  ... 

A Model for Computer Configuration Design

Trivedi, Kinicki
1980 Computer  
Concentrating on the hardware components of a computer configuration, the question addressed here is how to choose the devices for a batch-oriented, nonpaged multiprogramming computer system.  ...  The computer system is represented by a closed queueing network, and the design problem is formulated as a nonlinear optimization problem which includes both system cost and system performance.  ...  With the degree of multiprogramming n as a fixed parameter, the following two optimization problems are defined with respect to the m + 1 variables (r,So): It should be noted that the device speeds are  ... 
doi:10.1109/mc.1980.1653576 fatcat:6yujwsyxgbgw7b5vempmmpudva

Virtual storage and virtual machine concepts

R. P. Parmelee, T. I. Peterson, C. C. Tillman, D. J. Hatfield
1972 IBM Systems Journal  
Buzen, “Optimizing the degree of multiprogramming in demand paging systems,” JEEE Computer Society Conference, Boston, Massachusetts, 141-142 (September 22-24, 1971).  ...  Shows how the optimum degree of multiprogramming is determined, given the relationship between the average number of page demands per job and the degree of multiprogramming.  ... 
doi:10.1147/sj.112.0099 fatcat:peys2o3jyvcgvjb62erlopcczy

A Study of a Mechanism for Controlling Multiprogrammed Memory in an Interactive System

A. Brandwajn, J.-A. Hernandez
1981 IEEE Transactions on Software Engineering  
This paper deals with the following mechanism for controlling the multiprogramming set in a demand paging system: processes are dynamically divided into several categories according to the number of page  ...  Using a queueing network model of an interactive system with such a control mechanism we study the effectivenesss of the control considered, and, more particularly, its ability to partition the memory  ...  The numerical results obtained indicate that the system performance (as measured by the relative average response time) with several categories is, in general, worse than the optimum performance with a  ... 
doi:10.1109/tse.1981.230842 fatcat:kfgrjaqc55bvhj5eeka4qvjmca

Page 32 of Computer Performance Vol. 3, Issue 1 [page]

1982 Computer Performance  
At an early design stage, details of workload and system models may not be known to a sufficient degree to warrant expensive simulation or actual measurement.  ...  These models have addressed the optimization of batch-oriented multiprogrammed systems.  ... 

A scheduling policy for preserving cache locality in a multiprogrammed system

Inbum Jung, Jongwoong Hyun, Joonwon Lee
2000 Journal of systems architecture  
In a multiprogrammed system, when the operating system switches contexts, in addition to the cost for handling the processes being swapped out and in, the cache performance of processors also can be aected  ...  To solve this requirement, we propose a preemption-safe policy to exploit the cache locality of blocked programs in a multiprogrammed system.  ...  and Communication, Republic of Korea.  ... 
doi:10.1016/s1383-7621(00)00020-5 fatcat:bgqgndhm45defdhs2ylfos3nxe

Optimal multiprogramming: Principles and implementation [chapter]

Marc Badel, Jacques Leroudier
1978 Lecture Notes in Computer Science  
Three principles of optimality for multiprogranming are derived frc~ a general model of a virtual mea~ry computer system.  ...  The results obtained on the system performance in~rovement are presented.  ...  by considering the ratio of the'real execution time of n programs with no multiprogramming to the real execution time of n programs with a multiprogramming degree n.  ... 
doi:10.1007/3-540-08934-9_94 fatcat:xwimsdwtmra47ftgzgscy7raci

A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions

Alexandre Brandwajn
1977 Journal of the ACM  
the performance of computer systems [16, 15, 9] .  ...  This paper presents a queuelng model of a multlprogrammed computer system with virtual memory Two system organizations are conmdered (1) all the processes present in the system share prtmary storage, (  ...  We use the throughput of the system, defined as the average number of programs processed by the system per unit time in the long run, as a measure of system performance.  ... 
doi:10.1145/322003.322007 fatcat:zxbgibvtknh7vhwu2wqvvmnpam

Page 2773 of Mathematical Reviews Vol. , Issue 80G [page]

1980 Mathematical Reviews  
A joint approach is presented for optimization of a given system performance measure, namely, mean flow of jobs, and for the solution of the system performance failure problems, namely, the determinacy  ...  They state the existence of both an optimal multiprogramming degree and an optimal program mixture in the multiprogramming set.  ... 

Dynamic dispatching in job class scheduled systems

Jon C. Strauss
1975 Proceedings of the May 19-22, 1975, national computer conference and exposition on - AFIPS '75  
INTRODUCTION Many different approaches have been attempted to the problem of controlling the processing of a mUltiprogramming computer system so as to improve performance.  ...  The job class scheduled computer system of concern is depicted in Figure 1 . Jobs are multiprogrammed one from each of Me job classes.  ... 
doi:10.1145/1499949.1500016 dblp:conf/afips/Strauss75 fatcat:zbau2cxm2fbpfaophucfiddl5y

The evaluation of a time-sharing page demand system

Juan Rodriguez-Rosell, Jean-Pierre Dupuy
1971 Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall)  
Fusi, of IBM Italy Scientific Center, and J. P. LeHeiget, of Grenoble University, collaborated in the initial design of the measurement system.  ...  The work of the first author has been supported by a research grant from IBlVI Svenska A.B. and a scholarship from the French Government.  ...  IBM Research Report RC 23498 1969 13 G S SHEDLER A queuing imodel of a multiprogrammed computer system with a two level storage system IBM Research Report RJ 836 1971 systems  ... 
doi:10.1145/1478873.1478970 dblp:conf/afips/Rodriguez-RosellD72 fatcat:hr3vqh3fajhkfmtkyn66ynqtq4

Selecting benchmark combinations for the evaluation of multicore throughput

Ricardo A. Velasquez, Pierre Michaud, Andre Seznec
2013 2013 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)  
Computer architects usually study multiprogrammed workloads by considering a set of benchmarks and some combinations of these benchmarks.  ...  Most high-performance processors today are able to execute multiple threads of execution simultaneously.  ...  To our knowledge, the problem of defining workload samples that provide accurate speedups with high probability is still open.  ... 
doi:10.1109/ispass.2013.6557168 dblp:conf/ispass/VelasquezMS13 fatcat:g2xxyu3ejffvxpm4blwwewxd5m

Multiprogramming STRETCH: feasibility considerations

E. F. Codd, E. S. Lowry, E. McDonough, C. A. Scalzi
1959 Communications of the ACM  
The experiments to be performed with this system are aimed at exploring conditions under which multiprogramming is profitable to the user. Flow REFERENCES STRETCH 1. 8. W.  ...  This feature, combined with appro- priate control measures respecting the disabling of the entire interruption system, virtually eliminates the pos- sibility that an interruption of general concern is  ... 
doi:10.1145/368481.368502 fatcat:lju4m5hgtrfbxd3rcxcmjxnuda

Adaptive two-level thread management for fast MPI execution on shared memory machines

Kai Shen, Hong Tang, Tao Yang
1999 Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '99  
The improvement ratio can reach as much as 161% or even more depending on the degree of multiprogramming.  ...  This paper addresses performance portability of MPI code on multiprogrammed shared memory machines.  ...  Benchmark Performance evaluation on a multiprogrammed workload We first report an experiment that uses a multiprogrammed workload which contains multiple jobs and we measure the turn-around time of each  ... 
doi:10.1145/331532.331581 dblp:conf/sc/ShenTY99 fatcat:x3sbdt6cmnclzgxftkoavp4v3u

Analysis of demand paging policies with swapped working sets

Dominique Potier
1977 Proceedings of the sixth symposium on Operating systems principles - SOSP '77  
We present in this paper a modelling approach to quantify the effects of these factors on the performance of a system running with a swapped working-sets policy.  ...  Numerical examples illustrate the analysis, and these results are compared with measurements made on a real system running with swapped working-sets policies.  ...  We wish to thank Colin Adams, from the Computer Science Group at the University of Edinburgh, for many helpful discussions on the EMAS system.  ... 
doi:10.1145/800214.806555 dblp:conf/sosp/Potier77 fatcat:bgvruwfmznd5ddgdrf2lz2odc4
« Previous Showing results 1 — 15 out of 1,438 results