Chapter 6 Extern Memory
来源:互联网 发布:淘宝商城天猫首页 编辑:程序博客网 时间:2024/04/30 02:31
- Types of external memory
- Magnetic disk
- Hard disk&floppy disk
- RAID(redundant array of independent disks)
- Removable hard disk
- Material: aluminium ---> glass
- Read and Write mechanisms
- Recording & retrieval using a head
- May be a single read/write head or separate ones
- Read
- Traditional
- Coil is the same for read and write
- Contemporary
- Separate read head, close to write head
- High frequence operation
- Optical
- Magnetic tape
- Types of disk
- Floppy
- Hard disk
- Removable hard disk
- Data organization and formatting
- Disk velocity
- Phenomenon: Bit near center of rotating disk passes fixed point slower than bit on outside of disk
- Phenomenon ---> problem: Increase spacing between bits in further tracks
- Rotate disk at constant angular velocity(CAV)
- Control data in sector
- To locate the sector
- Extra data(Control data) is put into sector by formatting the disk
- Additional information is not visible to users
- Marks tracks and sectors
- Physical characteristics
- Fixed head: one read write head per track
- Movable head: one read write head per side
- Head mechanism
- Contact: the head on the disk surface
- Fixed gap: an air gap between the head and the surface
- Aerodynamic gap: the air pressure generated by spining is enough to make the head rise above the surface when the disk spining
- Organization of disk system
- Disk driver
- Disk controller
- Disks
- Disk performance parameters
- Multi-CPU system: uncertain
- Time of waiting for device
- Time of waiting for channel
- Seek time: uncertain
- T = S + n*m
- Rotational delay
- PC/Server/Laptop
- T = 1/(2r)
- Transfer time
- Number of bytes to be transferred
- Rotation speed of the disk
- T = b/(rN)
- Access time
- T = accessTime + Rotation delay + Transfer time
- e.g
- A disk with rotation speed of 15000rpm, average seek time of 4ms, 512B/sector, 500sectors/track, suppose that we wish to read a file consisting of 2500 sectors for a total of 1.28MB, estimate the total time for access.
- Case 1: sequence organization
- Time to read 1st track:
- Average seek:
- 4ms
- Average rotational delay:
- T = 1/(2r) = 1/(2*(15000/60))*1000 = 2ms
- Time to read a track:
- T = 1/r = 4ms
- total:
- 10ms
- For left tracks, seek is no long needed, time for reading a track:
- 2+4=6ms
- Total time:
- 10+4(2+4)=34ms
- Case 2: data random distribution
- For each sector:
- Seek time:
- 4ms
- Average rotational delay:
- 2ms
- Read a sector:
- 4/500 = 0.008ms
- Total time:
- 2500 x 6.008 = 15s
- Multi-CPU system: uncertain
- RAID: Redundant Array of Independent disks
- Operation independently and in parallel
- Three common characteristics:
- A set of physical disksviewed as a single logical drive by OS
- Data aredistributed across the physical drives of an array
- Redundant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure
- RAID 0
- No redundancy(Not support the third characteristic)
- Data stripped across all disks
- Round Robin stripping
- Increasing speed
- Disks seek in parallel
- Application
- High data transfer capacity
- High I/O request
- RAID 1
- Data is stripped across disks
- Mirror disks
- Read from either, write to both in parallel
- Advantages:
- Simple recovery, good error-tolerance
- In a transaction-oriented enviornment, if read request rate is very high, the performance of RAID 1 can approach double of that of RAID 0
- Disadvantage:
- Expensive
- Application
- Storing system software
- Highly critical files
- RAID 2(Not implemented)
- Multiple parity disks store Hamming code error correction in corresponding positions
- RAID 3: bit-interleaved parity
- Only one redundant disk, no matter how large the array
- Data on failed drive can be reconstructed from surviving data and parity info
- RAID 4: block-level parity
- RAID 5
- Parity striped across all disks
- Round robin allocation for parity stripe
- Avoid RAID 4 bottleneck at parity disk
- Application:
- Used in network servers
- RAID 6
- A high reliable RAID
- Two different parity calculations, stored in separate strips on different disks
- Advantage
- Extremely high data availability
- Disadvantage
- Write penalty
- CD-ROM
- Data stored as mocroscopic bits
- Constant packing density
- Constant linear velocity
- Advantage
- Large capacity
- Easy to mass produce
- Cheap
- Removable
- Robust
- Disadvantage
- Slow
- Read only
- Vulnerable
- Erasable Optical Disk
- High capacity, removable, reliability
- Magnetic tape
- Read and write in blocks, named physical records, separated by inter-record gaps
- Serial access, slow
- Application
- Backup and archive
0 0
- Chapter 6 Extern Memory
- Chapter 6 Memory Hierarchy --- Locality
- Chapter 6 Memory Hierarchy -- Summary
- Chapter 2. Memory Addressing
- Chapter 4 Cache Memory
- Chapter 5 Internal Memory
- Chapter 9 Memory Management
- Chapter 10 Virtual Memory
- Chapter 12. Dynamic Memory
- 《CS:APP》 chapter 6 The Memory Hierarchy笔记
- Chapter 4. Memory Management Debugging
- Chapter 6. Memory(Final,over)
- Chapter 2. Mbufs: Memory Buffers
- chapter 9.5: memory object和buffer allocation
- 《CS:APP》 chapter 9 Vitrual Memory 笔记
- MMU(Memory Management Units) Chapter-14
- Chapter 6
- Chapter 6
- android中SurfaceView的使用
- Chapter 5 Internal Memory
- JAVA学习中使用Eclipse创建一个动态的WEB项目
- (POJ 3984)迷宫问题
- vivado与modelsim的关联以及器件库编译
- Chapter 6 Extern Memory
- C#常用多线程方法
- Could not get JDBC Connection
- ajaxfileupload.js+SpringMVC实现文件上传
- Chapter 7 Input/Output
- 收尾--我的2016
- Chapter 9 Computer Arithmetic
- 老罗
- Chapter 10 Instruction Set: Charateristics and Functions