Questions tagged [operating-systems]

Questions about the principles of software that interfaces between hardware and applications.

Filter by
Sorted by
Tagged with
0
votes
0answers
33 views

How is segmentation a solution to external fragmentation

As per Galvin's book, segmentation is the solution to external fragmentation. But in segmentation, the memory blocks are of different sizes. So, if one segment is removed that creates a hole. If we ...
1
vote
1answer
34 views

What are the minimum functions, services, or features of a software to be called as an operating system?

When can we say that a software is an operating system and not a firmware, in terms of what it can do? I know that firmware is usually stored in ROM and OS is stored on HDD/SSD, but technically you ...
-4
votes
0answers
26 views

Operating System

suppose that the operating system is running a non-preemptive scheduler and that process P is currently running. A context switch can occour : When P terminates When P blocks. When another process ...
1
vote
2answers
37 views

How could a page be invalid in demand paging?

I was reflecting on what I learned about demand paging and I have a question: In demand paging, we have entries in the page table only for frames that are present in physical memory. So I was ...
2
votes
2answers
391 views

Why does page size affect page table size?

I am revising operating systems theory (I'm Italian, forgive me for bad English) and there is a slide that states: If page size is small then we avoid internal fragmentation (I get that) but we have ...
0
votes
1answer
39 views

Understanding how internal fragmentation occurs in systems using only paging with huge page size

The excerpt below is from the OS text by Galvin et. al. When we use a paging scheme, we have no external fragmentation: any free frame can be allocated to a process that needs it. However, we may ...
1
vote
2answers
23 views

disadvantages of a long time quantum in scheduling

I'm trying to understand the example showing disadvantages of a long time quantum in Tanenbaum's book in Section 2.4.3 “Scheduling in Interactive Systems”. To improve the CPU efficiency, we could set ...
0
votes
2answers
70 views

When are a controller's registers loaded and ready to inform an I/O Operation?

Below, I appended a fragmented paragraph from Operating Systems Concepts on interrupts. To start an I/O operation, the device driver loads the appropriate registers in the device controller. The ...
1
vote
1answer
33 views

How LRU is used without special hardware?

I had been curious as to which page replacement algorithm is used in OSes like Windows and Linux. I could find that most information on the internet pointed at LRU(Least Recently Used) Algorithm. But ...
0
votes
1answer
25 views

Are Paging and page cache the same in Operating system?

I was looking at paging in OS. It seems like there are two concepts with the same name but with different features, and I wanted to be clear about those, Paging and page cache. Before I thought paging ...
0
votes
1answer
22 views

Are pages moved to the disk when the process is scheduled?

When process A has run long enough and the scheduler decides to run process B, will all the pages of process A be moved to the disk or they remain in the main memory?
0
votes
1answer
17 views

Where will the TLB entries be stored if the cache memory get full (or can this situation occur)?

As we know that the entries of the TLB get copied into the cache memory once another process is chosen to be run by the scheduler. But what if the cache memory is full and there is no space left for ...
0
votes
0answers
23 views

LONG TERM SCHEDULER and how does it interact with USER

If I select chrome browser, then I select Android Studio, do they directly open in Ready Queue (allocated to RAM main memory), what processes actually goes into job queue? Does Job Queue gets filled ...
0
votes
1answer
22 views

Are the number of entries in the TLB(Translation Lookaside Buffer) limited?

If not, then why aren't all the pages loaded into the TLB so that TLB misses never happen.
0
votes
1answer
38 views

Is whole OS copied to ram when running?

If so, for any OS more than 10gb, how does it run on a computer with limited ram like 4gb? If not, which part of OS is copied to the ram? Or is it dynamically loaded whenever certain part is needed?
0
votes
1answer
22 views

Whats the difference between baremetal and full-featured in Embedded Systems?

Our professor talked about the "two" types of embedded systems in today's lecture, listing these. 1.) Baremetal 2.) Full-featured Now I found out what he means by baremetal, but I can't find ...
0
votes
1answer
62 views

Where are process pages stored - in the swap space or under file system? Can demand paging work without space space?

The Galvin OS text says that on older systems, there used to be a method, where the entire running process (when in idle state) was moved from the main memory (when main memory ran low) to the disk ...
0
votes
0answers
22 views

Starvation in Dekkers Algorithm

In the dekkers algorithm for the critical section problem, I happened to have come across a scenario in which P0 can starve out P1 in accessing the critical section(CS)(This is not an assertion, This ...
1
vote
3answers
83 views

concurrency vs parallelism

I am so confused between concurrency vs parallelism in multi-core processors. If a concurrent process has many threads and if the processor is multi-core then can each thread run on multiple cores? If ...
0
votes
1answer
47 views

Prove correctness of a solution to the critical section problem in general?

I was wondering if there is any formal, general way to prove the correctness of a candidate solution to the critical section problem in synchronization. For example, in the image enclosed, I have ...
0
votes
2answers
78 views

concurrency in multiple core

I know the basic definition between parallelism and concurrency. But there is not much information about concurrency in multiple core. what is the difference between concurrency in single-core vs ...
1
vote
1answer
26 views

What happens if there is context switch while executing system call?

Suppose a process does system call, hence it goes to kernel mode, the registers are saved. Now the system call will be running in process' allocated kernel stack. Can there be a context switch when a ...
0
votes
0answers
22 views

Process Scheduling (SRTF)-

Consider a uniprocessor system with four processes having the following arrival and burst times: (i) Calculate the average waiting time and also the average turnaround time if shortest (remaining) ...
0
votes
0answers
25 views

What does it mean that Atomicity is composable?

I'm reading a book from Michel Reynal called Fault-Tolerant Message-Passing Distributed Systems. In chapter five of the book, The Read/Write Register Abstraction, I have a few questions. On page 85, ...
-1
votes
1answer
41 views

How does a command interpreter/Shell recognize a command?

I want to know when we enter a command in a shell then how does the computer recognize that command? Does it match that command with something already stored in files?
0
votes
0answers
10 views

How do you work out the segmentation table, offset and frame size in segmented memory management?

If I had a process, 1, which has the following segments: Segment 1 - 50 bytes Segment 2 - 200 bytes Segment 3 - 90 bytes and I know that the total bytes in memory is 1024, how do I work out the offset/...
0
votes
0answers
25 views

Confusion about the definition of “Exponential Average”

I was having doubt regarding the concept of "exponential averaging". Till now I have come across the concept twice and they seem to be quite similar (except that they have minor but sharp ...
0
votes
0answers
40 views

In Round-Robin Scheduling with $n$ processes in ready queue and time quantum $q$, each process gets $1/n$ of CPU time in chunks of at most $q$

I was going through the Round-Robbin Scheduling Section of the dinosaur book by Galvin et. al. where I came across the following statement by the authors: If there are $n$ processes in the ready ...
0
votes
0answers
10 views

Difficulty in understanding the “expontential average” plot of the estimate of the next CPU burst with the actual CPU burst

I was going through the portion of exponential averaging (to find the CPU bursts) under Shortest Job First (SJF) Scheduling from the dinosaur by Galvin et. al. Let $t_n$ be the length of the $n$th ...
0
votes
3answers
47 views

In Operating Systems, I can't understand why deadlock happens, why does a process not let go of a resource when it is done using it?

I know deadlock occurs when Process A has resource R1 and is waiting for resource R2, while process B has resource R2 and is waiting for resource R1, however why don't both processes just let go of ...
2
votes
2answers
47 views

Is the kernel loaded into memory for every user simultaneously using a Multi-User O.S. system?

I have a doubt about loading kernel for every user using a Multi-User system. Every user's processes and programs are scheduled to CPU in a time-sharing fashion. But, do every user on the multi-user ...
0
votes
0answers
15 views

How to determine memory allocation for single level table

I received this problem on my study guide but I have no idea if I'm doing it correctly: How much space needs to be allocated for a single-level page table for a machine with a 32 bit virtual memory ...
0
votes
1answer
50 views

(reference) Where can I learn more about I/O operations in OS?

I have basic understanding of file I/O. I know how to operate the read and write system calls in Linux. I know that there is blocking and non-blocking I/O. I want to know more about the underlying ...
0
votes
1answer
69 views

What exactly is execution-time address binding?

According to these two definitions: Logical address: every memory address generated by the CPU. Physical address: address which identifies uniquely a (real) memory cell. my textbook (Operating ...
1
vote
0answers
7 views

How could one construct a TLB so that not all the bits of the presented address need match to result in a hit?

I was wondering besides the typical matching of all bits in the presented address to the resulting page, is there another way of doing so? what are the benefits/ cons and how would one go about doing ...
0
votes
2answers
66 views

What is meant by a single-threaded kernel?

I was looking at this course but I cannot seem to understand what is meant by the term "single-threaded kernel". Does it mean that: only a single kernel thread is made available by the OS? ...
3
votes
1answer
66 views

CPU scheduling Decisions

Operating System - CPU scheduling Decisions The question above talks about why CPU scheduling does not take place when ready to running. But I wonder why CPU scheduling does not take place when new ...
-1
votes
1answer
113 views

Page Size, Physical Memory Size, max Program Size

In a 64 bit computer, the logical address space is 64MB and physical memory size is 2GB. Paging is implemented with 4KB pages. Determine the logical and physical address components. (That is, how many ...
0
votes
0answers
39 views

Renaming of linear list directory

Consider a linear list-based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of ...
0
votes
0answers
22 views

What would happen in this priority-based round-robin CPU scheduling algorithm case?

I've been implementing some kind of CPU Scheduling Algorithms in Python. And I am really confused with one of the cases what'd be implemented in this case. Let us assume that the time quantum is 10. ...
1
vote
1answer
24 views

If we execute kernel programs in the user mode and user programs in kernel mode what are some consequences

Question on operating system If we execute kernel programs in the user mode and user programs in kernel mode what are some consequences
3
votes
0answers
33 views

Is there a “theory” of operating systems?

Is there a theory for Operating Systems? That is, subfields of CS have theoretical parts; i.e. PL has type theory, ML has mathematical theorems, security has a lot of provable properties, etc. There ...
1
vote
2answers
47 views

Memory addressing rapidity

I've got a few questions related to the different types of memory that we can find: To my understanding, since there are registers that are close physically to the CPU, these are much faster to access,...
0
votes
2answers
65 views

Best operating system for a computing degree? [closed]

Not sure which OS is best to invest in for my computer science degree. Have had varying opinions - from your experience in education or working in the sector, what is the operating system that will ...
3
votes
1answer
57 views

How to use Parallel Semaphores for Dining Philosophers Problem

I am in an intro to OS class and we are learning about mutual exclusion and semaphores. One classical problem we learned about was the dining philosophers problem. My professor touched on the ...
2
votes
2answers
175 views

How are kernels (and operating systems in general) written in C?

I'm trying to understand how you set about writing an OS in something like C. I've always used C to write applications - using commands like malloc and ...
1
vote
0answers
47 views

Starvation and Livelock

I think Option C is false. Following is my thought process: Starvation in general mean Process is waiting indefinitely for the resource or to get scheduled etc. [A/c to Galvin Book]. So, here in this ...
2
votes
6answers
899 views

Representation of unsigned integer on a little endian, big endian computer

This is a GATE 2021 exam question. If the numerical value of a 2-byte unsigned integer on a little endian computer is 255 more than that on a big endian computer, which of the following choices ...
0
votes
0answers
38 views

Is it okay to understand Job Queue Like this?

I have a hard time understanding the concept of job queue. Is it right if I understand job queue like the following??? For example, when user click the icon of an exe file, the newly created process ...
1
vote
1answer
35 views

Question about pointer in PCB structure and meaning of job queue

PCB structure exists inside kernel area. And in ready queue, which is Linked List, each Node of the queue is PCB. And this mean PCB Node has the next address of PCB in the queue, right?? Then My ...

1
2 3 4 5
14