1,335 Hits in 3.1 sec

Short-term scheduling in multiprogramming systems

Per Brinch Hansen
1971 Proceedings of the third symposium on Operating systems principles - SOSP '71  
This paper defines a set of scheduling primitives which have evolved from multiprogramming systems described by Dijkstra, Lampson, Saltzer, and the present author.  ...  integrity in spite of occasional malfunction of the hardware; I owe the terms short-term and medium-term schedulin$ to C.  ...  In the following, I describe a model of a multiprogramming system in which this mistake is avoided by treating all processes in a uniform manner at the most elementary level of scheduling.  ... 
doi:10.1145/800212.806506 dblp:conf/sosp/Hansen71 fatcat:enworr2nszeijlxgkxds7bfvv4

Simulation of Process Scheduling Algorithms

Daw Khin Po
2019 Zenodo  
In a multiprogramming system, multiple processes exist concurrently in main memory.  ...  The key to multiprogramming is scheduling. CPU scheduling deals with the problem of deciding which of the processes in the ready queue is to be allocated the CPU.  ...  Short-Term Scheduling: The decision as to which avaliable process will be executed by the processor. The short term also known as the dispate.  ... 
doi:10.5281/zenodo.3591437 fatcat:2qrcfsncd5h7xhhwlnyjmkajxu

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  
Typically in a job class system, jobs are scheduled for initiation from within classes and in many systems jobs are multiprogrammed one from each class.  ...  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

Processor allocation policies for message-passing parallel computers

Cathy McCann, John Zahorjan
1994 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '94  
In Proceedings of A CM SIGhfETRICS Conference, pages 226-236, May 1990. S. Majumdar, D.L. Eager, and R. Bunt. Scheduling in multiprogrammed parallel systems.  ...  Processor scheduling on multiprogrammed, distributed memory parallel systems. In Proceedings of.4 CM SIGMETRICS Conference, pages 158-170, May 1993.  ... 
doi:10.1145/183018.183022 dblp:conf/sigmetrics/McCannZ94 fatcat:zi3jy5wq3baelpwdzw76n4dszm

Processor allocation policies for message-passing parallel computers

Cathy McCann, John Zahorjan
1994 Performance Evaluation Review  
In Proceedings of A CM SIGhfETRICS Conference, pages 226-236, May 1990. S. Majumdar, D.L. Eager, and R. Bunt. Scheduling in multiprogrammed parallel systems.  ...  Processor scheduling on multiprogrammed, distributed memory parallel systems. In Proceedings of.4 CM SIGMETRICS Conference, pages 158-170, May 1993.  ... 
doi:10.1145/183019.183022 fatcat:hlhwokoafra23ed4z67wl4hizy

Optimality of scheduling policy for processing a job stream

Hisao Kameda
1984 ACM Transactions on Computer Systems  
However, a theoretical result has shown that the CPU utilization is independent of CPU scheduling in a finite-source queuing model of multiprogrammed systems.  ...  of jobs in the system remains fixed.  ...  Thus, in the model, the CPU scheduling policies have no different short-term effects on the CPU utilization, but have different long-term effects on the CPUboundedness of the total job mix.  ... 
doi:10.1145/2080.357395 fatcat:3thrmtohafem5ityeshjc6ed6i

Reconfigurable Gang Scheduling Algorithm [chapter]

Luís Fabrício Wanderley Góes, Carlos Augusto Paiva da Silva Martins
2005 Lecture Notes in Computer Science  
The RGSA uses combinations of independent features that are often implemented in GSAs such as: packing and re-packing schemes (alternative scheduling etc.), multiprogramming levels etc.  ...  In this paper, we propose, implement and analyze the performance of a Reconfigurable Gang Scheduling Algorithm (RGSA) using simulation.  ...  ACKNOWLEDGMENT We would like to thank the Graduate Program in Electrical Engineering, Computational and Digital Systems Laboratory (LSDC), CAPES and ProPPG for the support.  ... 
doi:10.1007/11407522_5 fatcat:3lxuine5gzfjdged7olm3x2hhm

Parallel Job Scheduling under Dynamic Workloads [chapter]

Eitan Frachtenberg, Dror G. Feitelson, Juan Fernandez, Fabrizio Petrini
2003 Lecture Notes in Computer Science  
Jobs that run on parallel systems that use gang scheduling for multiprogramming may interact with each other in various ways.  ...  These interactions are affected by system parameters such as the level of multiprogramming and the scheduling time quantum.  ...  Moreover, moving short jobs forward achieves an effect similar to the theoretical "shortest job first" algorithm, which is known to be optimal in terms of average response time.  ... 
doi:10.1007/10968987_11 fatcat:6v6ohop5abgyphjk5kwwlxn4xy

The impact of job memory requirements on gang-scheduling performance

Sanjeev Setia, Mark S. Squillante, Vijay K. Naik
1999 Performance Evaluation Review  
x e cute on the processors of the system.  ...  In this paper, we examine the impact of job memory requirements on the performance of gang-scheduling policies.  ...  Thanks also to Morris Jette of LLNL for providing us with data on the characteristics of the ASCI workload and allowing us to report that information in this paper.  ... 
doi:10.1145/309746.309751 fatcat:x4r2x5y3q5h7jaeazzx5ho2esy

Scheduler-Activated Dynamic Page Migration for Multiprogrammed DSM Multiprocessors

Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos, Theodore S. Papatheodorou, Jesús Labarta, Eduard Ayguadé
2002 Journal of Parallel and Distributed Computing  
The performance of multiprogrammed shared-memory multiprocessors suffers often from scheduler interventions that neglect data locality.  ...  system.  ...  The period between consecutive invocations should be reasonably long to compensate for possible transient effects in the page access pattern or short-term scheduler interventions.  ... 
doi:10.1006/jpdc.2001.1817 fatcat:mm4g6niwc5e4dn4adqub77grbu

Informing algorithms for efficient scheduling of synchronizing threads on multiprogrammed SMPs

C.D. Antonopoulos, D.S. Nikolopoulos, T.S. Papatheodorou
2001 International Conference on Parallel Processing, 2001.  
We refer to such algorithms with the term "informing algorithms".  ...  We compare the performance of our informing algorithms with the performance of corresponding scheduler-oblivious algorithms under multiprogramming.  ...  The problem of scheduling synchronizing threads in a multiprogramming environment has not been adequately addressed, if at all, in contemporary commercial SMP schedulers for small-and medium-scale systems  ... 
doi:10.1109/icpp.2001.952054 dblp:conf/icpp/AntonopoulosNP01 fatcat:itlttyxpynbrrpariy3642ori4

A page allocation strategy for multiprogramming systems

Donald D. Chamberlin, Samuel H. Fulier, Leonard Y. Liu
1973 ACM SIGOPS Operating Systems Review  
In a multiprogramming, virtual-memory computing system, many processes compete simultaneously for system resources, which include CPU's, main memory page frames, and the transmission capacity of the paging  ...  A strategy for the Scheduler is proposed in (2). In order to evaluate various strategies for the resource managers, it was necessary to construct a model of a time-sharing system.  ...  (In this paper, we assume that the page frame allocation to a given process is constant for the short term, and that a process can fetch a new page only by relinquishing a page it currently possesses in  ... 
doi:10.1145/957195.808051 fatcat:6cap4jle3bhgrlg3au3vquffgy

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 above spin-block approach only considers the penalty of blocking in terms of context switch and thread resumption.  ...  Our experiments show that the MPI system based on the proposed techniques has great performance advantages over the previous version of TMPI and the SGI MPI implementation in multiprogrammed environments  ...  Acknowledgment This work was supported in part by NSF CCR-9702640.  ... 
doi:10.1145/331532.331581 dblp:conf/sc/ShenTY99 fatcat:x3sbdt6cmnclzgxftkoavp4v3u

Scheduling of Real Time Tasks

Pankaj Udvanshi
2013 IOSR Journal of Engineering  
In some system, a newly created process begins in a swappedout condition in which case it is added to a queue for the medium term scheduler.  ...  If all process is I/O bound, the ready queue will always be empty and the short term scheduler will have nothing to do.  ...  Shortterm Scheduling is very fast. The short term scheduler is also called CPU scheduler.  ... 
doi:10.9790/3021-03624458 fatcat:sl4iut7zszgvlh4qmtsbxms6ei

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.  ...  Acknowledgements This work was supported in part by National Research Laboratory Program funded by Ministry of Science and Technology and university S/W research center program by Ministry of Information  ... 
doi:10.1016/s1383-7621(00)00020-5 fatcat:bgqgndhm45defdhs2ylfos3nxe
« Previous Showing results 1 — 15 out of 1,335 results