Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Homework Help: Help! File Systems

  1. Apr 19, 2010 #1
    1. The problem statement, all variables and given/known data
    Big-Oh Run-Time Calculations

    The OS File Manager manages files and the directory structure. Two common disk
    formatting methods exist: disks formatted in blocks using an inode and the classical bytedriven
    semi-contiguous file using pointers after each contiguous portion. In either case
    the File Allocation Tables were basically similar. The inode will be a simple direct
    pointer inode (without the multilevel nodes). Assume the blocks are 4K large and
    pointers are 32 bits long.

    For this question discuss the:
    · Best-case, and
    · Worst-case
    run-times for both the blocked disk access method and semi-contiguous file access
    method.
    In other words assume the worst-case situation for how a file might exist on disk in the
    semi-contiguous and block files methods. Then compute using Big-Oh notation the
    performance of loading such a file entirely into memory. Do this again for the best-case
    situation.
    Finally discuss and compare your findings. Which is better, in what case and why?

    2. The attempt at a solution
    I read though the whole text book and can't find what is the so called classical byte driven semi contiguous file. And what makes it different from blocks...

    Thank you so much!
     
  2. jcsd
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted