Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.1, Problem 6.4PP
A.
Program Plan Intro
Given Information:
A 1 MB file consisting of 512 byte logical blocks is stored on a disk drive with the following characteristics:
| Parameter | Value |
| Rotational Rate | 10000 RPM |
| 5 ms | |
| Average numbers of sectors or tracks | 1000 |
| Surfaces | 4 |
| Sector size | 512 bytes |
B.
Program Plan Intro
Given Information:
A 1 MB file consisting of 512 byte logical blocks is stored on a disk drive with the following characteristics:
| Parameter | Value |
| Rotational Rate | 10000 RPM |
| 5 ms | |
| Average numbers of sectors or tracks | 1000 |
| Surfaces | 4 |
| Sector size | 512 bytes |
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
(c)
Assume that a Direct Mapping Function is apply on a memory system with 24-bit
address. The cache has 16384 blocks, each storing 4 words. Calculate its tag, block,
and word size.
a. Provide the four (4) memory allocation scheme of RAM
b. Provide the three (3) deallocation alternative situations
8. Consider a disk pack with a seek titme of 4
milliseconds and rotational speed of 10000
rotalions per mitute (RPM) thas sects
per track and each secton can store 512 bytes
of data. Consider a file stored in the disk The
ile contains 2000 sectors. Assume that every
sector sccess necessitates a seck, and the
average rotational latency for sccessing esch
sector is half of the tine for on complete
rotation The total time (in milliseconds)
needed to read the entire file is
Chapter 6 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 6.1 - Prob. 6.1PPCh. 6.1 - Prob. 6.2PPCh. 6.1 - Prob. 6.3PPCh. 6.1 - Prob. 6.4PPCh. 6.1 - Prob. 6.5PPCh. 6.1 - Prob. 6.6PPCh. 6.2 - Prob. 6.7PPCh. 6.2 - Prob. 6.8PPCh. 6.4 - Prob. 6.9PPCh. 6.4 - Prob. 6.10PP
Ch. 6.4 - Prob. 6.11PPCh. 6.4 - Prob. 6.12PPCh. 6.4 - Prob. 6.13PPCh. 6.4 - Prob. 6.14PPCh. 6.4 - Prob. 6.15PPCh. 6.4 - Prob. 6.16PPCh. 6.5 - Prob. 6.17PPCh. 6.5 - Prob. 6.18PPCh. 6.5 - Prob. 6.19PPCh. 6.5 - Prob. 6.20PPCh. 6.6 - Prob. 6.21PPCh. 6 - Prob. 6.22HWCh. 6 - Prob. 6.23HWCh. 6 - Suppose that a 2 MB file consisting of 512-byte...Ch. 6 - The following table gives the parameters for a...Ch. 6 - The following table gives the parameters for a...Ch. 6 - Prob. 6.27HWCh. 6 - This problem concerns the cache in Practice...Ch. 6 - Suppose we have a system with the following...Ch. 6 - Suppose we have a system with following...Ch. 6 - Suppose that a program using the cache in Problem...Ch. 6 - Repeat Problem 6.31 for memory address0x16E8 A....Ch. 6 - Prob. 6.33HWCh. 6 - Prob. 6.34HWCh. 6 - Prob. 6.35HWCh. 6 - Prob. 6.36HWCh. 6 - Prob. 6.37HWCh. 6 - Prob. 6.38HWCh. 6 - Prob. 6.39HWCh. 6 - Given the assumptions in Problem 6.38, determine...Ch. 6 - You are writing a new 3D game that you hope will...Ch. 6 - Prob. 6.42HWCh. 6 - Prob. 6.43HWCh. 6 - Prob. 6.45HWCh. 6 - Prob. 6.46HW
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- (a)What is the biggest size we can have for a file with SFS? (b)Provide data block numbers in sequence that will be read from the disk (only data blocks that contain file data) when read_t (inum, offset, buf1, count) is called in a user program, where inum is the corresponding inode number for the above inode, and buf1 is a pointer that points to a user-defined buffer.arrow_forwardProblem D. DNA Input file: Output file: Time limit: standard input standard output 1 second 256 megabytes Memory limit: As you know desoxyribonucleic acid consists of 4 mucleobases: adenine, guanine, cytosine, thymine. This nucleobases must form pairs: adenine with thymine and guanine with cytosine. You are given the sequence of nucleobases in the first part of DNA spiral. Please, find its second part. Input You are given the only string DNA. It is guaranteed that DNA consists only of uppercase letters 'A', "C', T', 'G'. Output Print the second part of DNA spiral. Examples standard input standard output ACTG TGÁC A GTA СATarrow_forward5. (c). “The use of Symmetric multiprocessing systems isbecoming very popular.” Explain three potentialadvantages of Symmetric multiprocessing systems. (d). Distinguish between User-visible registers and Control andstatus registers; and give at least one example of each ofarrow_forward
- Question 3 (Memory Management) a. Virtual memory allows us to simulate a larger memory space than we actually have. Explain how this is possible and give two disadvantages of virtual memory. b. Assume a system that uses virtual memory with a single level page table and a translation lookaside buffer (TLB): i. Briefly explain the functionality of the TLB. ii. Assuming that the memory access time is 90ns, the time the operating system takes to search the TLB is 15ns, the TLB hit rate is 98%, the page fault rate is 20% and the time to fetch a page from the drive is 8ms. What is the average expected access time to main memory? c. In a dynamic partitioning approach for memory management we could use a bitmap or a linked list to keep track of free and used memory. i. Briefly explain why linked lists are normally the preferred option. ii. Briefly explain a situation where bitmaps may be preferred. iii. Briefly explain the working of the best fit algorithm to allocate processes to memory when…arrow_forwarda) Assume, paging has been used as memory management technique and the page table is stored in memory which takes 150 nanoseconds. In addition, the associative memory is also used which takes 50 nanoseconds. What is the effective memory reference time, If 50% of all page-table references are found in the associative memory?arrow_forward4. A1 Kilobyte RAM has a word size of 16 bits,' (a) How many address bits does the RAM require? (b) How many D latches does the RAM require? (c) Draw a clearly labeled logic diagram of a binary storage cell and describ (d) Explain the concept of read and write for a memory unit. [arrow_forward
- Q. 1 How long does it take to load a 64-KB program from a disk whose average seek time is 5 msec, whose rotation time is 5 msec, and whose tracks hold 1 MB(a) for a 2-KB page size?(b) for a 4-KB page size?The pages are spread randomly around the disk and the number of cylinders is so large that the chance of two pages being on the same cylinder is negligible.arrow_forwardProblem 4.1 A memory system is needed in a new design to support a small amount of data storage outside of the processor. The design is to be based on the 16 K bit CY7C128A SRAM orga- nized as 2 K x 8. (a) Provide a high-level block diagram for such an interface. (b) Provide a high-level timing diagram for the interface to the SRAM from the microprocessor, assuming that separate address and data busses are available. Define any control signals that may be necessary. (c) Design the interface based on the timing diagram from part (a). (d) Analyze the memory performance for a write and a read operation of 1, 10, and 100 bytes.arrow_forward(c) The following Sigma 16 program has been loaded into memory at address 0000: load R3,y[RO] load R4,x[RO] lea R5, 2[RO] sub R1,R4,R3 mul R2,R1,R5 store R2,w[RO] trap RO,RO,RO x data 10 y data 12 w data 0 Show the content of the memory writing hexadecimal representation and using a table with 3 columns: the memory address, the contents of that memory address, and an explanation of what "the content (of that memory address) means". As a reference, here are the opcodes for RRR instructions: add 0, sub 1, mul 2, trap c. And here the opcodes for RX instructions: lea 0, load 1, store 2. [7]arrow_forward
- 3. Consider the following AT&T ISA 32 ASM codes for a C for loop: loop: puahl tabp tenp, tebp 8 (sebp), ecx 12 (tebp), tedx $0, teax Becx, tedx movl movl movl movl cmpl jge .L3 .L6: subl addl addl cmpl jg $1, tecx $1, Bedx $1, teax Sedx, tecx .L6 L3: $1, teax Sebp addl popl ret Based on the assembly code above, (Note: you may only use the symbolic variables x, y, and result in your expressions below – do not use register names.) int loop (int x, int y) int result; result++ ) { for return result;arrow_forward(d) You are working on a redesign of a simple 16-bit computer which supports at most 64 kilobytes of memory. Currently, memory is word-addressed and all memory accesses load or store a 16-bit value. For example, LDA Ox6502 loads a 16-bit value from address Ox6502 into register A. The change is to support additionally 8-bit accesses, thanks to an expanded machine language (already designed by a colleague) which now supports instructions such as: ; load 16 bits from addr 6502 into A ; load 8 bits from addr 6502 into A LDAW Ox6502 LDAB Ox6502 Outline, at a high level, how you would bring about this change in the CPU design, and mentioning any difficulties you expect to encounter.arrow_forward4. a) In the SRAM region, what is the corresponding bit-band alias address for the bit [4] of the memory address of 0x20000008 b) In the Peripheral region, if the value in the alias address Ox4200 0088 to 0x4200 008B was set to Ox00000001, what is the bit # and the address in the peripheral region that wants to set to 1?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr