scispace - formally typeset

Journal ArticleDOI

Estimation of Ready Queue Processing Time using Transformed Factor-Type (T-F-T) Estimator in Multiprocessor Environment

18 Oct 2013-International Journal of Computer Applications (Foundation of Computer Science (FCS))-Vol. 79, Iss: 16, pp 40-48

TL;DR: This paper suggests two new estimation methods to predict the remaining total processing time required to process completely the ready queue provided sources of auxiliary information are negatively correlated.

Abstractready queue processing time estimation problem appears when many processes remain in the ready queue just before the occurrence of sudden failure of system. The system administrator has to decide immediately, how much further time is required to process the remaining jobs in the ready queue, before shutting down the entire system as precautionary measure, so that while restart, it may remain in the safe state. In lottery scheduling, this prediction is possible with the help of sampling techniques. Factor- Type estimation method, existing in literature of sampling, was used by many authors to predict the time required provided the highly correlated sources of auxiliary information are available. This paper suggests two new estimation methods to predict the remaining total processing time required to process completely the ready queue provided sources of auxiliary information are negatively correlated. Under this approximation, the bias and m.s.e of the proposed estimators have been obtained using the set up of random sampling applicable to lottery scheduling. Performance of both estimation methods are compared in terms of mean squared error. The confidence intervals are calculated for comparing the efficiency of the estimate. One proposed estimator found better over other. . KeywordsScheduling, Transformed Factor-Type (T-F-T) Estimator, Mean Squared Error (M.S.E), Variance, Confidence Intervals

Topics: Multilevel queue (60%), Estimator (58%), Mean squared error (58%), Queue (57%), Lottery scheduling (53%)

...read more

Content maybe subject to copyright    Report

Citations
More filters

Journal Article
TL;DR: This paper presents a methodology to obtain the approximate bounded area and probability computation using methods of numerical analysis and main focus is on utilization of Simpson 1/3 rule and Weddle rule along with the mutual comparisons.
Abstract: Many authors have derived the expressions for the probability of traffic sharing between two operators in computer networking environment. The mathematical expressions for these probabilities are generally in quadratic function of blocking probabilities of computer network along with the probability of initial choice of customer. The expressions are not easily integrated and, therefore, effort is difficult to obtain the total bounded area under the probability curve. It is a challenging problem to obtain the probability density computation of the traffic sharing parameter. This paper presents a methodology to obtain the approximate bounded area and probability computation using methods of numerical analysis. The main focus is on utilization of Simpson 1/3 rule and Weddle rule along with the mutual comparisons.

4 citations


Book ChapterDOI
01 Jan 2020
TL;DR: The lottery scheduling scheme provides the fairness and also removes starvation, and some new methods in ready queue processing time estimation in multiprocessor environment are proposed.
Abstract: Ready queue processing time estimation problem deals with many constraints. Because the processes which reside in the ready queue of computer memory come in varieties such as process size, process requirement indifferences and process types. To match up all these differences is a difficult task to solve so that the processes can be used to perform its task efficiently at any platform. A prior estimation of ready queue processing time helps to meet the system reliability and robustness. A pre-calculated time will ensure the system from failure; also, the backup of task performed can be maintained. In this paper, the existing methods on this approach are described, and how some new methods can be used for the better performance is demonstrated. For this purpose, some sampling techniques are used, and the lottery scheduling procedure is explained which very efficiently performs this task of scheduling on the basis of probabilistic approach and randomness property. The estimation is performed by using sampling methods; with the help of some mathematical calculations, the results are obtained, and finally, confidence interval will ensure the accuracy of the result. So that some new methods can be generated; this provides the result as more efficient than the previous ones. Although various scheduling schemes are available, the lottery scheduling scheme provides the fairness and also removes starvation. Rather than working on the complete data set, some samples can be generated to modularize the work which will be efficient too. So, this paper proposed some new methods in ready queue processing time estimation in multiprocessor environment.

References
More filters

01 Jan 2012
Abstract: From the Publisher: This best-selling book, now in its fifth edition, provides a solid theoretical foundation for understanding operating systems. Authors Abraham Silberschatz and Peter Galvin discuss key concepts that are applicable to a variety of systems. They also present a large number of examples taken from common operating systems, including WindowsNT and Solaris 2. This book teaches general principles in operating systems while giving the teacher and students the flexibility to choose the implementation system.

2,475 citations


Book
01 Jan 1983
TL;DR: This best-selling book provides a solid theoretical foundation for understanding operating systems while giving the teacher and students the flexibility to choose the implementation system.
Abstract: From the Publisher: This best-selling book, now in its fifth edition, provides a solid theoretical foundation for understanding operating systems. Authors Abraham Silberschatz and Peter Galvin discuss key concepts that are applicable to a variety of systems. They also present a large number of examples taken from common operating systems, including WindowsNT and Solaris 2. This book teaches general principles in operating systems while giving the teacher and students the flexibility to choose the implementation system.

1,724 citations


Proceedings ArticleDOI
14 Nov 1994
TL;DR: A prototype lottery scheduler for the Mach 3.0 microkernel is implemented, and it is found that it provides flexible and responsive control over the relative execution rates of a wide range of applications.
Abstract: This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capabilities of conventional schedulers, and is desirable in systems that service requests of varying importance, such as databases, media-based applications, and networks. Lottery scheduling also supports modular resource management by enabling concurrent modules to insulate their resource allocation policies from one another. A currency abstraction is introduced to flexibly name, share, and protect resource rights. We also show that lottery scheduling can be generalized to manage many diverse resources, such as I/O bandwidth, memory, and access to locks. We have implemented a prototype lottery scheduler for the Mach 3.0 microkernel, and found that it provides flexible and responsive control over the relative execution rates of a wide range of applications. The overhead imposed by our unoptimized prototype is comparable to that of the standard Mach timesharing policy.

707 citations


"Estimation of Ready Queue Processin..." refers background in this paper

  • ...Unlike priority scheduling, every job has equal chance of being represented to the processors [1] [2]....

    [...]


Dissertation
01 Jan 1995
Abstract: This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are introduced, including both randomized and deterministic algorithms that provide proportional-share control over resource consumption rates. Such control is beyond the capabilities of conventional schedulers, and is desirable across a broad spectrum of systems that service clients of varying importance. Proportional-share scheduling is examined for several diverse resources, including processor time, memory, access to locks, and disk bandwidth. Resource rights are encapsulated by abstract, first-class objects called tickets. An active client consumes resources at a rate proportional to the number of tickets that it holds. Tickets can be issued in different amounts and may be transferred between clients. A modular currency abstraction is also introduced to flexibly name, share, and protect sets of tickets. Currencies can be used to isolate or group sets of clients, enabling the modular composition of arbitrary resource management policies. Two different underlying mechanisms are introduced to support these abstractions. Lottery scheduling is a novel randomized resource allocation mechanism. An allocation is performed by holding a lottery, and the resource is granted to the client with the winning ticket. Stride scheduling is a deterministic resource allocation mechanism that computes a representation of the time interval, or stride, that each client must wait between successive allocations. Stride scheduling cross-applies and generalizes elements of rate-based flow control algorithms designed for networks to dynamically schedule other resources such as processor time. A novel hierarchical stride algorithm is also introduced that achieves better throughput accuracy than prior schemes, and can reduce response-time variability for some workloads. The proposed techniques are compared and evaluated using a variety of quantitative experiments. Simulation results and prototype implementations for operating system kernels demonstrate flexible control over a wide range of resources and applications.

273 citations