OS - Secondary Storage

1,900 views
1,776 views

Published on

Published in: Education, Technology, Spiritual
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
1,900
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
321
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

OS - Secondary Storage

  1. 1. Secondary Storage Devices Organized By: Vinay Arora Assistant Professor CSED, TU V.A. CSED,TU
  2. 2. Disclaimer This is NOT A COPYRIGHT MATERIAL Content has been taken mainly from the following books: Operating Systems Concepts By Silberschatz & Galvin,Operating Systems: Internals and Design Principles By William Stallings www.os-book.com www.cs.jhu.edu/~yairamir/cs418/os2/sld001.htm www.personal.kent.edu/~rmuhamma/OpSystems/os.html http://msdn.microsoft.com/en-us/library/ms685096(VS.85).aspxhttp://www.computer.howsttuffworks.com/operating-system6.htm http://williamstallings.com/OS/Animations.html Etc… VA. CSED,TU
  3. 3. Secondary Storage Devices VA. CSED,TU
  4. 4. Hard Disk VA. CSED,TU
  5. 5. Tracks & Sectors VA. CSED,TU
  6. 6. Removable & Non-Removable VA. CSED,TU
  7. 7. Group of Platters VA. CSED,TU
  8. 8. Cylinder VA. CSED,TU
  9. 9. Disk & R/W Head VA. CSED,TU
  10. 10. Moving Head Disk Mechanism VA. CSED,TU
  11. 11. Disk Performance Parameters VA. CSED,TU
  12. 12. Network Attached Storage VA. CSED,TU
  13. 13. Storage Area Network VA. CSED,TU
  14. 14. Disk Scheduling Operating System is responsible for using hardware efficiently — for the disk drives, this means having a fast access time. Access Time has two major components Seek time is the time for the disk are to move the heads to the cylinder containing the desired sector. Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. Minimize Seek Time. Seek time ≈ seek distance Disk bandwidth is the total number of bytes transferred, divided by the total time between the first request for service and the completion of the last transfer. VA. CSED,TU
  15. 15. Several algorithms exist to schedule the servicing of disk I/O requests.We illustrate them with a request queue (0-199). 98, 183, 37, 122, 14, 124, 65, 67 Head pointer 53 VA. CSED,TU
  16. 16. FCFS (640 moves) VA. CSED,TU
  17. 17. SSTF (236 moves) VA. CSED,TU
  18. 18. SCAN / Elevator (208 moves) VA. CSED,TU
  19. 19. C-SCAN VA. CSED,TU
  20. 20. C-LOOK VA. CSED,TU
  21. 21. RAID (Redundant Array of Inexpensive Disk) RAID – Multiple Disk drives provides Reliability via Redundancy. RAID is arranged into SIX different Levels. Data Striping Bit-Level Striping/Block Level Striping VA. CSED,TU
  22. 22. RAID (contd.) VA. CSED,TU
  23. 23. RAID (contd.) VA. CSED,TU
  24. 24. RAID (contd.) VA. CSED,TU
  25. 25. Reference ListOperating Systems Concepts By Silberschatz & Galvin, Operating systems By D M Dhamdhere, System Programming By John J Donovan, www.os-book.com www.cs.jhu.edu/~yairamir/cs418/os2/sld001.htmhttp://gaia.ecs.csus.edu/~zhangd/oscal/pscheduling.html http://www.edugrid.ac.in/iiitmk/os/os_module03.htm http://williamstallings.com/OS/Animations.html etc… VA. CSED,TU
  26. 26. Thnx… VA. CSED,TU

×