Tag Archives: Algorithms

Multiprocessor and Real-Time Scheduling Shortest-Job-First (SJF) Scheduling Algorithm (Published)

Program that was designed to explains the application of the SJF(shortest –job- first) The purpose is to enter 4 CPU different values and implemented in a certain time in addition to sequencing the execution of these processors from slowest to fastest, and thus calculate the time for each processor, giving average the total time to take actions all 4 operations are complete and correct and the time of the execution of each Processor through the sequence to respond to the execution of the work and get results in the (special code) form output screen of my next explanation and used language visual basic 6.0 in the design of this program.

Keywords: Algorithms, CPU scheduling, Shortest Job First.

A GENERALIZED METHOD FOR ESTIMATING PARAMETERS AND MODEL OF BEST FIT IN LOG-LINEAR MODELS. (Published)

In this article, we proposed generalized method and developed algorithms for estimation of parameters and best model fit of log linear model for dimensional contingency tables. For purpose of this work, the method was used to provide estimates of parameters of log –linear model for four- dimensional contingency table. Parameters of higher dimensional tables can in like manner be estimated. In estimating these parameters and best model fit, computer programs in R were developed for the implementation of the algorithms. The iterative proportional fitting was used to estimate the parameters and goodness of fits of models of the log linear model. A real life data was used for illustration and the result obtained showed the best model fit for four dimensional contingency table is [BSG, BGA]. This showed that the best model fit must have sufficient evidence to fit the data without loss of information and must have the highest p-value and least likelihood ratio estimate.

Keywords: Algorithms, Categorical Data, Contingency Table, Generalized Method, Iterative Proportional Fitting., Parameters

Factorization of Large Composite Integer (Published)

In this paper we practically deal with the problem of factorizing large integers. The various algorithms that have been proposed are not efficient that is they do not run in polynomial time. We use the algebraic approach proposed by Wanambisi et al [1]. We define a large integer based on the number of digits and seek to decompose these numbers based on place values.

Keywords: Algebraic Approach, Algorithms, Composite Integer, Integer Factorization, Prime Differences, Primes