Questions tagged [operating-systems]

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

Filter by
Sorted by
Tagged with
4
votes
6answers
971 views

Why are all these full-fledged workstations running massive OSes with massive software required all over the world?

I've grown up with computers. I use them every single day, all day. I'm old enough (mid-30s) to have experienced a lot of interactions with "the general public". In particular in later years, I have ...
0
votes
0answers
8 views

How Are Segment Descriptors Used

I am following through James Molloy OS tutorials and I can't get my head around the GDT. I understand that it contains entries that describe segments, what I don't understand is,how are the segment ...
0
votes
1answer
3k views

Operating Systems - SJN/Round Robin - turn around time + waiting time

2.(10 pts) a) You are given 4 processes in a batch system that all arrive at time 0 with the following CPU burst times: P1 : 35, P2: 25, P3: 13, P4: 22. Assuming there is no context switch ...
0
votes
0answers
12 views

Doubt in effective memory access time in case of n level paging + TLB

I am getting confused with calculation of EEMAT(Effective memory access time). I decided to close the book and think on my own and make an equation. Please see whther this is correct or not. I thought ...
0
votes
0answers
17 views

how worst fit better than best fit?

I am a beginner. I have recently started studying OS. In textbook, it is written as best fit is worse than worst fit. Reason - external fragmentation. IMO,in case of variable partionioning, best ...
0
votes
1answer
323 views

LRU vs FIFO page replacement

I am wondering if there is an instance where FIFO results in less page faults than LRU. For example: 2,6,5,7... In this string, if I have to complete it by ...
0
votes
3answers
195 views

What architectural features will allow this microprocessor to access a separate “I/O space”?

I'm studying for my final and don't understand this question. Here is the full question (from Stallings 8th edition): Consider a hypothetical microprocessor generating a 16-bit address (e.g., ...
6
votes
5answers
94k views

What is the average turnaround time?

For the following jobs: The average wait time would be using a FCFS algorithm: (6-6)+(7-2)+(11-5)+(17-5)+(14-1) -> 0+5+6+10+13 -> 34/5 = 7 (6.8) What would the average turnaround time be?
1
vote
1answer
25 views

doubt in pipelining

I am not from cse but trying to learn computer architecture on my own. Please clarify the following. In case of pipelining, each stage or subcomponent or subtask is assumed to be done in 1 CPU ...
0
votes
1answer
28 views

When does a semaphore issue a wait and when does it issue a signal?

In my textbook, Operating Systems: Internals and Design Principles (9th Edition) by William Stallings in chapter 5, it explains how semaphores work: The fundamental principle is this: Two or more ...
0
votes
2answers
13k views

Calculating disk seek times

I have a system where disk requests come to a disk drive for cylinders in the order 10, 22, 20, 2, 40, and 38 at a time when the disk drive is reading from cylinder 20. The seek time is 6ms per ...
0
votes
0answers
8 views

Study of cache behaviour of algorithms on Virtualbox

I want to study certain cache oblivious algorithms and cache behaviour of some other algorithms I wrote in general. I want to understand, is it advisable, if I do this study in an virtualized ...
1
vote
1answer
16 views

Paging - access less than a page of memory

I'm having a bit of trouble understanding how less than a page of memory can be used. From what I understand, memory is given out in page size chunks - say pages are 4096 bytes, and 4 bytes are ...
0
votes
0answers
9 views

Are there any models of operating systems which don't require rings of privileges, that are also secure?

I am working on a simple operating system in JavaScript and have noticed that there are two kinds of processes: the "main" process (or "kernel" process), and all the other processes. Basically they ...
1
vote
2answers
31 views

How many registers does a computer *need*?

I read about Why does a processor have 32 registers?, and others. Currently I am messing around with an OS in JavaScript, and wondering how many registers -- or more specifically, how many temporary ...
1
vote
1answer
102 views

How can I solve this deadlock related problem mathematically?

I came across following problem: A system has n resources R0,…,Rn-1,and k processes P0,….Pk-1.The implementation of the resource request logic of each process Pi is as follows: ...
0
votes
1answer
41 views

Can timestamp be used in synchronization of processes having Race Condition?

I am wondering whether timestamp can be used to solve process synchronization problem, when race condition occurs? Below is an algorithm for entry as well as exit sections for every process who wants ...
1
vote
0answers
23 views

Given only TLB Lookup time, and memory access time, can the TLB hit rate be negative?

I'm given the following problem: TLB lookup time is given as 8ns and memory access time for a computer system is given as 40ns. What should be the TLB miss rate to achieve effective memory ...
1
vote
3answers
10k views

Difference between dynamic loading and dynamic linking in the OS

First of all, I saw many answers of this topic in Quora, Stackoverflow, and this site. But, I couldn't definitely understand the difference between dynamic loading and dynamic linking. What I ...
0
votes
0answers
10 views

What IaaS services are needed in order to run a server?

I have just learn't about Iaas, Paas and Saas and I was wondering whether a business can host a server by using IaaS services. However, many IaaS providers such as AWS, Azure and Google provide ...
0
votes
0answers
31 views

Does exec cause a context switch?

If we start a new process with exec('process-2') Does this cause an immediate context switch in order to halt the current process and then start the new '...
-1
votes
2answers
7k views

How to compute total internal and external fragmentation

I want to find the total external and internal fragmentation. What I understand is that external fragmentation occurs when processes are loaded and removed from memory, causing memory to be broken ...
0
votes
1answer
2k views

How to calculate average waiting time for round robin cpu scheduling?

I have tried to calculate average waiting time for the below details there are two answers I'm getting using two methods I'm not understanding which one is correct? The time quantum is 2 This is the ...
0
votes
1answer
28 views

Why no context switch is required in case of spinlock in operating systems?

I have a query regarding the fact that how Spinlocks are advantageous in terms of context switching ?
-3
votes
1answer
66 views

What is the name of this experimental OS?

I am trying to find an OS that had a network to verify it's users. It classified itself in classes going from greatest signifigance to least, and the names were galaxy, system, planet, comet etc. I ...
13
votes
2answers
6k views

What is a GPU year?

I am reading papers in machine learning and they say things like, "This computation took $x$ number of GPU years". What is a GPU year? How long is that?
0
votes
0answers
20 views

What assumptions do I have to make about monitors (in OS)?

I am taking a course in Operating Systems. I am going through old exams and there is a question about monitors. We are supposed to give a solution for the producer-consumer problem using monitors. ...
2
votes
2answers
2k views

Does a context switch happen when a process has terminated?

I know this might sound like a newbie question but let's say we have a priority based scheduling algorithm (non-preemptive) where all processes arrive at time 0 and based on priority the order is P1, ...
3
votes
1answer
78 views

What should be the minimum value when the two threads are executed concurrently

int count=0; void *thfunc() { int ctr=0; for(ctr=0;ctr<100;ctr++) count++; } If *thfunc() is executed by two threads concurrently in a uniprocessor ...
2
votes
1answer
73 views

How can a 32bit CPU have an addressable memory size of 16TB?

Frequently, on a 32-bit CPU, each page-table entry is 4 bytes long, but that size can vary as well. A 32-bit entry can point to one of $2^{32}$ physical page frames. If frame size is 4 KB (212), ...
1
vote
0answers
23 views

Expected value of next CPU burst using exponential averaging

The burst time is needed for Shortest Job First (SJF) and Shortest Run Time First (SRTF) scheduling. To get the approximate burst time, we use the equation $$\tau_{n + 1} = t_n + (1 - \alpha)\tau_n$$ ...
0
votes
1answer
31 views

Calculation of speed up of a program executed in multi-threaded system

Speed up of execution of a program is to be calculated within a multi-threading rather than a single thread system. The program's 30% instruction can be executed serially & rest can be executed ...
0
votes
1answer
54 views

Converting physical address to logical

In 8-bit address space there are 16 pages and the page table stores: 68792EA51BD3CF04 (hex) The physical address is 39h, what is the corresponding logical address? I have literally no idea what to ...
0
votes
0answers
12 views

Does a safe state ensures there will never ever be a deadlock?

In Banker's algorithm of deadlock avoidance, if one can obtain a safe state, does that necessarily mean there will never be a deadlock, or is there still some way that the system could fall into a ...
0
votes
1answer
37 views

Is logical address generated by CPU and MMU same if Physical and Virtual address space are same?

The system has same physical and virtual address space i.e. 32-bit. Are the logical address generated by CPU and address generated by MMU same?
0
votes
1answer
43 views

Lack of Stack Pointer Register

Suppose a processor lacks STACK Pointer Register. But, It does have STACK. Then, in my opinion, a program will still be able to call subroutines but, will be unable to return back from the subroutines....
3
votes
2answers
2k views

Scheduling algorithms and quantum time

I would like to know what impacts does a scheduling algorithm, let's say Round Robin or FIFO, have on an Operating System. I understand that a scheduling algorithm has the processes run in burst then ...
0
votes
1answer
38 views

How many segments a process can have in operating system employing Segmentation for memory management

Some facts about "Segmented Paging" 1) Each process has one segment table. 2) There is one-page table per segment. Fact about "Paged segmentation" 3) Contains page table of segment table. Now ...
9
votes
1answer
1k views

Writing a multitasking operating system for a processor without MMU

I've been thinking of writing a hobby operating system for some of the ARM processors. There are many popular single-board computers with ARM MPU, so I simply wanted to purchase one of those (choosing ...
0
votes
0answers
18 views

How many page-table entries can fit into TLB space

I am looking to calculate how many page-table entries can fit into a corresponding TLB space (Translation Look-aside Buffer ). I just want to make sure I am getting the calculation right, as I fear I ...
0
votes
0answers
14 views

How many page-table entries are needed in case the program uses the whole logical address space

Say I have: page size = 2^12 bytes physical memory = 2^24 bytes logical address space = 2^32 How many page-table entries are needed in case the program uses the whole logical address space?
3
votes
1answer
491 views

Convoy effect in priority scheduling and SJF (Non preemptive)

In books, I have read that FCFS suffers from convoy effect. I think that even SJF and priority(both preemptive and non preemptive) can suffer from convoy effect. In SJF, if a process with large burst ...
4
votes
1answer
90 views

Task scheduling algorithm that limits concurrency

My prof introduced us an algorithm with semaphores that was used to solve the "dining philosophers" problem. The algo is ok, apart from that it limits concurrency. What does mean that it "limits ...
0
votes
1answer
51 views

What is a batch based interface? [closed]

I came across this description of Batch Interface: "commands and directives are used to manage those commands that are entered into files and those files get executed. " I would really appreciate if ...
1
vote
0answers
23 views

Doubts on Virtually Indexed,Physically tagged Cache

I tried referring a few material (videos on youtube and this link as well), but I still couldn't wrap my head around the concept. My (brief) understanding of the Virtually addressed, Physically ...
0
votes
1answer
50 views

How are hardware interrupts handled?

I have read that a hardware interrupt is handled asynchronously by the CPU, which means that the interrupt signal may arrive at any point of time with respect to the CPU clock cycle. Now, this means ...
0
votes
1answer
42 views

Software management of TLB misses?

I'm reading an OS textbook and it was talking about TLB misses being handled by software. I'm very new to all this by the way. So there's a context switch to some kernel procedure. But surely in this ...
1
vote
1answer
133 views

How can i draw a general resource graph which cannot be completely reduced but which is free from deadlock?

How can i draw a general resource graph which cannot be completely reduced but which is free from deadlock? A general resource graph which can be completely reduced and hence is free from deadlock is ...
0
votes
1answer
73 views

What is a 'dynamic entity' in computer science?

I am doing some reading into computer science and how the computing system works in order to be ready for my 1st year at university doing a Computer Science degree. I came across a term within the ...
0
votes
1answer
1k views

Segmentation and paging

I am given a system with a segmented paging architecture. Both physical and virtual address spaces contain $2^{16}$ bytes each. The virtual address space is divided in $8$ equal size segments. The ...