QUEUING THEORY BASED ON DECENTRALIZED ONLOAD DATA ARRIVAL USING EXPECTED MAX-MIN PROBABILISTIC DECISION FOR REDUCING WORKLOAD
Journal of Critical Reviews · 2020
Calculating probabilistic decision using the queuing theory, is a new technology with the aim of making it easier for the user to obtain the pre-requisite services in hardware and software access to a wide range of Internet-based services. That is, an important aspect of modeling the delivery of workflow data services in the process of efficient load balancing in a shared environment of arrival. In order to provide a service, matrix theory has become a very essential and important aspect between data requests and wait and see responses. Load balancing, as there is less response time and higher output separation including equal load. Various mechanisms have been proposed to provide an efficient load balance. To realize the desired level of computation time, we propose a maximum precedence algorithm for scheduling Meta tasks by static illustration to use Enhanced Max-min Algorithm with (EMM) optimized Enhanced decentralized onload data arrival Mode (DO-DAM) with hyper switching methods.by arriving the service distributions are notated as Kendall Notations as (Max-A/S/Min-R/J/D). A queuing model improves the utilization and consumption to manage the resources that uses switch over Probability service time distribution to allot the job to data allotment support on scheduling application on static queue demands. This proposed queuing theory implements to improve the time consumption, utilization, scalability, make span and throughput performance.