6A Novel Algorithm for Stationary Analysis of the Characteristics of the Queue-Dependent Random Probability for Co-Processor-Shared Memory Using Computational Sciences
Nandhini Varadharajan1, Vigneshwar Manoharan2, Rajadurai3 and Ahmed A. Elngar4*
1R & D - Bharath Labs, Bharath Corporate, Coimbatore, Tamil Nadu, India
2R & D and Academic Initiatives at CBAS Corp, Coimbatore, Tamil Nadu, India
3Government Arts College, Hudco Colony, Peelamedu, Coimbatore, TN, India
4Faculty of Computers and Artificial Intelligence, Beni-Suef University, Beni-Suef City, Egypt
Abstract
The implication of Queuing Theory is a probability random process applied along with Mathematical models for the allocation of resources using operational research. In an Operating system, there are several processes that will be in a queue or waiting for instructions. Then they are allocated for resource utilization by various operating system algorithms and methods. When these processes are about to enter for processing, there may lot many times and batch processing involved. Similarly, there are load-balancing servers that are implied for queuing up the process and allocating the resources, and balancing the load to the servers. This is a computational sciences model designed by implying Queue dependent random probability for co-processors which would be for a shared memory system.
Keywords: Stationary analysis, queue-dependent random, balancing, probability, computational sciences
6.1 Introduction - Processor-Shared ...
Get Handbook of Computational Sciences now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
