Priority Scheduling
A scheduling algorithms like round-robin treat all processes as same. But if we consider other information about a process, some process is more important than… Read More »Priority Scheduling
A scheduling algorithms like round-robin treat all processes as same. But if we consider other information about a process, some process is more important than… Read More »Priority Scheduling
The shortest job first algorithm associates the length of the next CPU burst with each process. The CPU time is assigned to a process with… Read More »Shortest-Job-First ( SJF )
The round-robin scheduling algorithm is suitable for time-sharing computers which are similar to FCFS. However, preemption is added to this algorithm to switch between processes.… Read More »Round Robin
The first come first served (FCFS) is the simplest CPU-scheduling algorithm. The process which requests CPU first will be allocated CPU first and so on.… Read More »First Come, First Served (FCFS)
The multi-programming technique wants high CPU utilization by executing some process all the time. The time-sharing computer keeps switching among processes so that all users… Read More »Types of Schedulers
The single processor system, one process runs, and other processes wait until CPU is free. In a multiprocessor system, some process always runs and thus… Read More »Process Scheduling Criteria
Networking is a complex computation problem that includes several tasks. The underlying hardware cannot do all the tasks, so a software layer is required to… Read More »Open Systems Interconnection (OSI) Model
The tracert command is a built-in networking tool that finds all the hops between localhost (where you run the command) and the destination computer on… Read More »Tracert Command in Windows
A ping is a built-in tool in the Microsoft Windows operating system. You can use it to test network connectivity with a remote host or… Read More »Ping Command in Windows