Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    University of Engineering and Technology Peshawar: Assignment 2 External Memory

    Uploaded by

    Maaz Marwat
    This document is a computer architecture assignment submitted by Muhammad Maaz Khan to Ayesha Javed. It discusses striped data storage across multiple disks to improve data access speed. It also covers the distinction between parallel and direct access in RAID, and includes a numerical problem calculating disk capacity, addressing bits required, access time, and transfer rate given specifications for number of surfaces, tracks, sectors, and bytes per sector.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    University of Engineering and Technology Peshawar: Assignment 2 External Memory

    Uploaded by

    Maaz Marwat
    42 views5 pages
    This document is a computer architecture assignment submitted by Muhammad Maaz Khan to Ayesha Javed. It discusses striped data storage across multiple disks to improve data access speed. It also covers the distinction between parallel and direct access in RAID, and includes a numerical problem calculating disk capacity, addressing bits required, access time, and transfer rate given specifications for number of surfaces, tracks, sectors, and bytes per sector.

    Original Title

    A2-0687

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a computer architecture assignment submitted by Muhammad Maaz Khan to Ayesha Javed. It discusses striped data storage across multiple disks to improve data access speed. It also covers the distinction between parallel and direct access in RAID, and includes a numerical problem calculating disk capacity, addressing bits required, access time, and transfer rate given specifications for number of surfaces, tracks, sectors, and bytes per sector.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    42 views5 pages

    University of Engineering and Technology Peshawar: Assignment 2 External Memory

    Uploaded by

    Maaz Marwat
    This document is a computer architecture assignment submitted by Muhammad Maaz Khan to Ayesha Javed. It discusses striped data storage across multiple disks to improve data access speed. It also covers the distinction between parallel and direct access in RAID, and includes a numerical problem calculating disk capacity, addressing bits required, access time, and transfer rate given specifications for number of surfaces, tracks, sectors, and bytes per sector.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 5

    University of Engineering and Technology Peshawar

    Computer Architecture and Assembly Language

    Assignment 2
    External Memory

    Submitted by:
    Muhammad Maaz Khan
    19PWBCS0687
    Section B
    4th semester

    Submitted to:
    Ayesha Javed
    Striped Data:
    In computer we need to store data in such a way so that it can be
    accessed and manipulated faster.
    Data Striping is a technique through which we divide logically
    sequential data into segments, in a way that accesses of
    sequential segments are made to different physical storage
    devices referred to as stripes. Data striping transparently
    distributes data over multiple disks to make them appear as a
    single fast, large disk.
    A stripe consists of the data divided across the set of hard disks
    or SSDs. Because striping spreads data across more physical
    drives, multiple disks can access the contents of a file, enabling
    writes and reads to be completed more quickly.
    This data that is now distributed across multiple disks is called as
    striped data.

    Distinction between parallel and direct access in


    RAID:

    Parallel access:
    In a parallel access array, all member disks participate in the
    execution of every I/O request. All the disks are run at the same
    time. The spindles of the individual drives are synchronized so
    that each disk head is in the same position on each disk at any
    given time. This type of Access is used for same I/O requests
    when there is one I/O or same data is requested by participating
    I/O(s).
    Independent Access:
    In an independent access array, each member disk operates
    independently, so that separate I/O requests can be satisfied in
    parallel. Disks have no synchronized movement. The disks run
    separate of each other.

    Numerical Problem:
    Consider a disk with 16 platters , 2 surface per platter, 1K track
    per surface, 2k sectors per track; 2048 bytes per sector. Disk
    rotates with 3000 rpm. Seek time is 10ms
    Required data:
     Find the capacity of disk.
     Number of bits required for addressing this disk.
     Find disk access time.
     Find the disk transfer time.

    Given Data:
     Number of surfaces = 16
     Number of tracks per surface = 128
     Number of sectors per track = 256
     Number of bytes per sector = 512 bytes

    Solution:
     Capacity of Disk Space:
    Capacity of disk pack = Total number of surfaces x Number
    of tracks per surface x Number of sectors per track x
    Number of bytes per sector

    = 16 x 128 x 256 x 512 bytes


    = 228 bytes
    = 256 MB

     No. of bits required for Addressing the Disk


    Total number of sectors
    = Total number of surfaces x Number of tracks per surface x
    Number of sectors per track

    = 16 x 128 x 256 sectors


    = 24 x 27 x 28 sectors
    = 219

    Thus, Number of bits required to address the sector = 19 bits

     Disk Access Time

    Time taken for one full rotation

    = (60 / 3000) sec


    = (1 / 50) sec
    = 0.02 sec
    = 20 msec

    Average rotational delay


    = 1/2 x Time taken for one full rotation
    = 1/2 x 20 msec
    = 10 msec

    Now, average access time


    = Average seek time + Average rotational delay + Other
    factors

    = 11.5 msec + 10 msec + 0


    = 21.5 msec

     Data Transfer Rate

    Number of rotations in one second


    = (3600 / 60) rotations/sec
    = 60 rotations/sec

    Now, Data transfer rate


    = Number of heads x Capacity of one track x Number of
    rotations in one second

    = 16 x (256 x 512 bytes) x 60


    = 24 x 28 x 29 x 60 bytes/sec
    = 60 x 221 bytes/sec
    = 120 Mbps

    You might also like