EBK COMPUTER SYSTEMS
3rd Edition
ISBN: 8220101459107
Author: O'HALLARON
Publisher: YUZU
expand_more
expand_more
format_list_bulleted
Question
Chapter 6.1, Problem 6.2PP
Program Plan Intro
Given Information:
A disk with the following properties is given:
Number of platters= 2
Number of cylinders= 10,000
Number of tracks= average of “400” sectors per track
Number of bytes= 512 per sector
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
(c) Consider a hard disk with a transfer rate of 15 Mbytes/ second is constantly
transfering data to memory using DMA. The processor runs at 1 GHz, and takes
200 and 650 dlock cycles to initiate and complete DMA transfer respectively. If
the size of the transfer is 26 Kbytes, calculate the percentage of processor time
consumed for the transfer operation.
(Computer Organization and Design)
[1] (
Show your work. Show hoe you compute memory address by using the effective memory
address computation.
Assume the following values are stored at the indicated memory addresses and
registers:
Address Value
0x100
OxFF
0x104
OxAB
0x108
0x13
0x10c
0x11
Register
%rax
%rcx
%rdx
$0x108
(%rax)
4(%rax)
9(%rax, %rdx)
260(%rcx,%rdx)
OxFC (,%rcx, 4)
(%rax, %rdx, 4)
Value
0x100
0x1
0x3
Fill in the following table showing the values for the indicated operands:
Operand
Value
%rax
0x104
Chapter 6 Solutions
EBK COMPUTER SYSTEMS
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
Similar questions
- (MAC) In the MAC address table, MAC addresses are stored in a dynamic RAM. Assume the table was 8000 bytes in size and the memory access time was 100 nanoseconds. What would be the worst-case look-up time if a binary search was employed to locate an address?arrow_forward(3) (a) Consider the following interaction with Python: x= [1,2,34 ,5 ,6 , np.nan] y= (10,i,2,5, 'Missing',6.3) z= [0.1, 1.2 , np.nan , 4,5.1,0.5] df1=DataFrame ({'col1':Series (z),'co12':Series (y), 'col3': Series (x)}). df1.index= ['a','b','c', 'd','e','f'] Replace the NaN value in coll with -9, the Missing value in col2 with -99, and the NaN value in col3 with -999 with relevant functions. Name as dfl_replaced (b) Consider the following interaction with Python: df2=DataFrame (np. array ( [[1, np.nan ,3, 8], [np.nan , 2,3,5] , [10,2,3, np.nan], [10,2,3 , np.nan], [10,2,3,11]])) df2.columns = ['one', 'two', three', four '] df2. index= ['a','b','c 'd','e'] Remove the rows that have nan values from df2 and name as df2_row. Remove the columns that have nan values from df2 and name as df2_column. Use relevant functions.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
- (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_forwardH.W (3) Load the low parts of registers AX, BX,CX, and DX with constant D, C, B, A. These constants are 13h, 0001_1000b, 'M', and 14, respectively. Then load the memory location M2 with these values from registers.arrow_forward(6 a) 2.5 GB in MB ? 10 B) 32 X 2 bits in KB? =C) 3.5 MB in bits?arrow_forward
- Problem 1.10: Simplify F(A, B,C, D) = ACD+ A'B + D'arrow_forward(a) In a DLX machine, an educational version of RISC machines, conditional branch instructions are designed as the fixed length of 32 bits. Briefly describe the format of branch instructions in encoding, and indicate the possible problem introduced by branch instructions when the machine is pipelined.arrow_forward(TCOs 7, 9) Address each of the following:(a) Define cloud computing.(b) List and discuss the advantages and disadvantages of cloud computing.(c) Differentiate among three different types of cloud services and give an example of each.arrow_forward
- 1. (30%) Write LC-3 machine code routines for the followings: (a) To perform an OR on two binary numbers stored in x3100 and x3101. Store the result at x3102. (b) To perform an XOR on two binary numbers stored in x3100 and x3101. Store the result at x3102.arrow_forward(Part C) Design 32KW, fully associative cache that has 4 32-bit words per block. Assume a 32. bit address. Calculate the following: (a) How many bits are used for the byte offset? (b) How many bits are used for the block offset? (c) How many bits are used for the index field? (d) How many bits are used for the tag? (e) What is the physical size of each set (show as bits/row * # of rows, x * 2V)?arrow_forward(Part B) Design 32KW, 16-way set associative unblocked cache that has 8 bytes per word. Assume a 64 bit address. Calculate the following: (a) How many bits are used for the byte offset? (b) How many bits are used for the index field? (c) How many bits are used for the tag? (d) What is the physical size of each set (show as bits/row * # of rows, x * 2v)?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education