There ar many techniques works done on mainframe programming that worked on outturn, time of arrival and latency. engaged on mainframe programming improved with the passage of your time. The author worked on dynamic time quantum that calculates programming parameter of mainframe. The result shows that the way to increase the time quantum for few processor because of the brink worth. The author planned associate algorithmic program that supported priority primarily basedalgorithmic program and compares with normal spherical robin. The fuzzy technique supported pre priority and execution time and compare with the various algorithmic program and shows higher leads to . V FJFDRR targeted on spherical robin with dynamic time slice and compare with the various technique and shows the higher lead to . planned a replacement technique that calculates match issue and dynamic time slice. match issue supported the mixture of FCFS, SJF, and priority algorithmic program and show the higher result as compared to the opposite programming algorithmic program. SJFDRR works on time quantum and improves the potency of spherical robin. during this paper, there ar user and system priority. User priority has necessary than system priority and reduced the context switch in . Self Adjustment spherical Robin (SARR) solves the matter of dynamic time-quantum that regulate the burst time in line with the running method. The planned algorithmic program also canbe enforced on an oversized processor and also the software system itself can determine the optimum time quantum in .represents the algorithmic program that is named priority-based dynamic spherical robin that calculates intelligent time slice for individual method and changes the time slice before every execution. FPRRDQ shows the higher result as compared to alternative 2 that is predicated on each the user priority and quantum time amendment when each execution in line with priority and burst time in . Optimum service time conception for round-robin algorithmic program works on associate optimum priority of every method associated placed in an order of execution in line with calculated priority in .FCFS work on the idea of the inventory accounting. every method dead in line with its range. FCFS performs well for smaller values. It shows poor waiting time, turnaround for giant computation.SJF worked on the idea of shortest mainframe burst length. within which short method enter in execution queue and execute 1st. SJF perform best for long processes as compared to FCFS. it’s potential that long method waits within the prepared queue for brief method that complete its task however typically it behaves like starvation. RR worked in time quantum. RR worked sensible for brief method and provides the results of minimum average time, minimum turnaround and minimum throughout. In real time system, the overhead invokes when every context switch because of context switch exaggerated for brief time quantum. just in case of long-time quantum, method executes inside one time slice and performs higher result. Priority-based algorithmic program worked on low and high priority. typically it becomes suffer a serious downside known as starvation as a result of low priority failed to execute because of high priority. To avoid the matter of overhead and starvation, a replacement technique ought to be introduced to resolve this downside and average waiting time, average turnaround and average latency ought to be exaggerated.