galvin

iarnav asked Apr 29, 2017

470 views

0 votes

what basic information is stored with each disk sector?

Operating System
disk-scheduling

+ –

iarnav asked Apr 29, 2017

iarnav

470 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

Inodes or index nodes, one for each file.

Or may be some block id, because we cannot store directly on sectors there is an abstraction of blocks(logical). So there had to be some id to figure out to which block they belong.

Injila answered Jul 3, 2017

Injila

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 answers

akash.dinkar12 asked Mar 22, 2019

478 views

Galvin Edition 9 Exercise 10 Question 15 (Page No. 499-500)
Compare the performance of $C-SCAN$ and $SCAN$ scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival of a request and the completion of that request's ... and the effective bandwidth. How does performance depend on the relative sizes of seek time and rotational latency ?

Compare the performance of $C-SCAN$ and $SCAN$ scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival o...

akash.dinkar12

478 views

akash.dinkar12 asked Mar 22, 2019

Operating System
galvin
operating-system
disk-scheduling
descriptive

+ –

0 votes

1 answer

akash.dinkar12 asked Mar 22, 2019

660 views

Galvin Edition 9 Exercise 10 Question 11 (Page No. 498-499)
Suppose that a disk drive has $5,000$ cylinders, numbered $0$ to $4,999$. The drive is currently serving a request at cylinder $2,150$, and the previous request was at cylinder $1,805$. The queue of pending requests, in $FIFO$ ... disk-scheduling algorithms ? $a. FCFS$ $b. SSTF$ $c. SCAN$ $d. LOOK$ $e. C-SCAN$ $f. C-LOOK$

Suppose that a disk drive has $5,000$ cylinders, numbered $0$ to $4,999$. The drive is currently serving a request at cylinder $2,150$, and the previous request was at cy...

akash.dinkar12

660 views

akash.dinkar12 asked Mar 22, 2019

Operating System
galvin
operating-system
disk-scheduling
descriptive

+ –

0 votes

0 answers

akash.dinkar12 asked Mar 22, 2019

364 views

Galvin Edition 9 Exercise 10 Question 10 (Page No. 498)
Explain why $SSDs$(Solid State Drives) often use an $FCFS$ disk-scheduling algorithm.

Explain why $SSDs$(Solid State Drives) often use an $FCFS$ disk-scheduling algorithm.

akash.dinkar12

364 views

akash.dinkar12 asked Mar 22, 2019

Operating System
galvin
operating-system
disk-scheduling
descriptive

+ –

0 votes

1 answer

akash.dinkar12 asked Mar 22, 2019

5,455 views

Galvin Edition 9 Exercise 10 Question 9 (Page No. 498)
None of the disk-scheduling disciplines, except $FCFS$, is truly fair (starvation may occur). a. Explain why this assertion is true. b. Describe a way to modify algorithms such as $SCAN$ to ensure fairness. c. Explain why ... more examples of circumstances in which it is important that the operating system be unfair in serving $I/O$ requests.

None of the disk-scheduling disciplines, except $FCFS$, is truly fair (starvation may occur).a. Explain why this assertion is true.b. Describe a way to modify algorithms ...

akash.dinkar12

5.5k views

akash.dinkar12 asked Mar 22, 2019

Operating System
galvin
operating-system
disk-scheduling
descriptive

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0