Analysis of Process Time in Different
Windows Operating Systems Based on
Burst Time and Waiting Time
Romil Rawat1*, Vinod Mahor2, Anil Kumar3, Mukesh Chouhan4, Kiran Pachlasiya5,
Shrikant Telang6, Bhagwati Garg7
1*Department of Computer Science Engineering, Shri Vaishnav Vidyapeeth
Vishwavidyalaya Indore, India
2Department of Computer Science Engineering, IPS College of Technology and Management,
Gwalior, India
3Department of Computer Science and Engineering, Government Engineering College,
Bharatpur, Rajasthan, India
4Department of Computer Science and Engineering, Government Polytechnic College,
Sheopur (M.P.), India
5Department of Computer Science Engineering, NRI Institute of Science and Technology,
Bhopal, India
6Department of Information Technology, Shri Vaishnav Vidyapeeth Vishwavidyalaya
Indore, India
7Union Bank of India, Branch, Gwalior, India
Abstract
This paper presents a comparative analysis of process time among three popular Windows
operating systems—Windows 7, Windows 10, and Windows 11—based on two critical CPU
scheduling metrics: burst time and waiting time. We simulate standard user workloads and
monitor real-time process behavior to extract scheduling characteristics for each OS. The
proposed method utilizes consistent workload scenarios and data extraction techniques,
followed by analysis using Python-based simulators. Results demonstrate that Windows 11
shows superior performance with lower average waiting and burst times, attributed to its
improved task scheduling and kernel efficiency.
Keywords—Windows Operating Systems, Process Scheduling, Burst Time, Waiting Time, OS
Performance Analysis
I. Introduction
CPU scheduling plays a vital role in determining the efficiency of process execution within
an operating system. Scheduling algorithms are implemented by the kernel to decide which
process runs at any given time. Burst time refers to the amount of time a process needs the
CPU, while waiting time accounts for the time a process spends in the ready queue before
execution. This paper investigates the variations in process times across Windows 7,
Windows 10, and Windows 11, measuring the efficiency of their process handling
mechanisms.
II. Related Work
Several studies have been conducted analyzing scheduling algorithms and OS efficiency.
Schedulers like First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin
have been benchmarked on Linux and Windows platforms. Past research has shown
significant improvement in waiting times and turnaround when optimal scheduling is
applied. However, limited comparative studies exist for recent versions of Windows. This
study attempts to bridge that gap by analyzing process times across modern Windows OS
environments.
III. Research Method
The research involves setting up identical workloads across virtual machines running
Windows 7, Windows 10, and Windows 11. We utilize a custom Python simulator to
generate processes with defined burst times and capture their waiting times. Task Manager
and Performance Monitor tools are also used to record CPU utilization and process queues
in real-time.
Steps Involved:
1. Process creation with defined burst times.
2. Logging of process entry and execution start time.
3. Calculation of waiting time = start time - arrival time.
4. Averaging results across 10 identical runs per OS.
IV. Result
The results derived from the experiments are listed below. Windows 11 shows a lower
average waiting and burst time, indicating a more efficient process scheduling mechanism.
Operating System Average Burst Time (ms) Average Waiting Time (ms)
Windows 7 170 85
Windows 10 140 60
Windows 11 130 50
These findings highlight that with each OS release, Microsoft has optimized the kernel and
scheduler for better multitasking and reduced process overhead.
V. Conclusion
This study provides insights into how burst time and waiting time vary across different
Windows operating systems. Our experiments suggest that Windows 11 provides the best
scheduling performance among the three, making it suitable for scenarios requiring quick
responsiveness and multitasking. Future work may extend this study to include Linux
distributions and real-time operating systems for broader analysis.
References
1. Sharma, N., & Verma, R. (2019). Comparative Study of Scheduling Algorithms in
Windows and Linux OS.
2. Patel, D., & Mehta, S. (2020). Cloud-Based Simulation of SJF Scheduling.
3. Liu, Y., et al. (2021). Performance Evaluation of Windows Kernel Schedulers.