4 Consider a microprocessor that has a block I/O transfer instruction such as that foundon the Z8000. Following its first execution, such an instruction takes five clock cyclesto re-execute. However, if we employ a nonblocking I/O instruction, it takes a total of20 clock cycles for fetching and execution. Calculate the increase in speed with theblock I/O instruction when transferring blocks of 128 bytes.5 A system is based on an 8-bit microprocessor and has two I/O devices. The I/O con-trollers for this system use separate control and status registers. Both devices handledata on a 1-byte-at-a-time basis. The first device has two status lines and three controllines. The second device has three status lines and four control lines.a. How many 8-bit I/O control module registers do we need for status reading andcontrol of each device?b.What is the total number of needed control module registers given that the firstdevice is an output-only device?

Name: 4 Consider a microprocessor that has a block I/O transfer instruction
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 4 Consider a microprocessor that has a block I/O transfer instruction such as that foundon the Z8000. Following its first execution, such an instruction takes five clock cyclesto re-execute. However, if we employ a nonblocking I/O instruction, it ta

As per guidelines I can answer only first question. Thank You. Given data: Its first…

Engineering

Computer Science

Consider a microprocessor that has a block I/O transfer instruction such as that found on the Z8000. Following its first execution, such an instruction takes five clock cycles to re-execute. However, if we employ a nonblocking I/O instruction, it takes a total of 20 clock cycles for fetching and execution. Calculate the increase in speed with the block I/O instruction when transferring blocks of 128 bytes.

Consider a microprocessor that has a block I/O transfer instruction such as that found on the Z8000. Following its first execution, such an instruction takes five clock cycles to re-execute. However, if we employ a nonblocking I/O instruction, it takes a total of 20 clock cycles for fetching and execution. Calculate the increase in speed with the block I/O instruction when transferring blocks of 128 bytes.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In this classification, each instruction is executed uşing its own input data, independently of how other instructions get their data. We are using a(n): A Multiple Instruction Multiple Data. B Multiple Instruction Multiple Data. C Single Instruction Single Data. D Single Instruction Multiple Data
Suppose that you have a computer with a memory unit of 24 bits per word. In this computer, the assembly program's instruction set consists of 198 different operations. All instructions have an operation code part (opcode) and an address part (allowing for only one address). Each instruction is stored in one word of memory. a. How many bits are needed for the opcode? b. How many bits are left for the address part of the instruction? c. How many additional instructions could be added to this instruction set without exceeding the assigned number of bits? Discuss and show your calculations.
Consider two computers, P1 and P2, of the same instruction set (ISA). We have a program of 7.5x10⁹ instructions and we want to run this program on P1 and P2. The P1 computer is a 5 GHz machine with CPI of 0.8. The P2 computer is a 6 GHz machine with CPI of 1.2. How many times that computer is faster than another?
A microprocessor has an on-chip 2-way set associative cache with a total capacity of 8 kByte. Each line in cache can store sixteen 8-bit words. It has a total addressable space of 16 MBytes. Consider the following CPU instruction: Load AB1234., will store the result in set number; a. B1H O b. 24H O c. 12H O d. 23H
Consider a 16-bit processor in which the following appears in main memory, starting at location 200: B. The first part of the first word indicates that this instruction loads a value into an accumulator. The mode field specifies an addressing mode and if appropriate, indicates a source register; Assume that when used, the source register is R1, which has a value of 400. There is also an index register (XR) that contains 100. The value of 500 in location 201 may be part of the address calculation. Assume that location 399 contains the value 999, location 400 contains the value 1000, and so on. Determine the effective address and the operand to be loaded for the following address modes:
Consider the following hexadecimal readout: 000000 8A00 8E00 CFA1 48BF 7900 3202 9015 AD34 000010 0218 6D30 028D 3402 AD35 0288 3102 8D35 000020 0E30 0290 DAEE 3102 4C00 0200 0040 004B Refer to the first byte of memory shown above, address 000000. Assume that this byte is used to store an 8-bit unsigned integer. What is the decimal value stored in this byte? Group of answer choices 138 -27 22,842 66
H.W.: Consider a hypothetical machine with two steps instruction cycle: fetch cycle and execute cycle. The characteristics of the machine is given in Figure 8 with the following explanation: The processor contains a single data register, called an accumulator (AC). • Both instructions and data are 8 bits long. • The memory is organized using 8-bit words. • The instruction format provides 2 bits for the opcode, and up to 26 = 64 words of memory can be directly addressed. Opcode Address (a) Instruction format Magnitude (b) Integer format Program counter (PC)= Address of instruction Instruction register (IR)- Instruction being executed Accumulator (AC) Temporary storage (c) Internal CPU registers -Load AC from memory Store AC to memory - Add to AC from memory (d) Partial list of opcodes Figure 8 Characteristics of a Hypothetical Machine Figure 9 illustrates a partial program execution, showing the relevant portions of memory and processor registers after the first instruction, 64H has…
Assume that an interrupt mechanism uses the hardware stack to store PC and other registers of the interrupted computations. The interrupt mechanism recognizes 4 interrupt vectors IV [1], IV [2], IV [3], IV [4] initialized by addresses of their corresponding ISR I =1..4. The elements of the hardware stack are a record R, where each field stores a specific CPU register (R.PC is the field, which stores the program counter PC and so on). The Hardware stack is manipulated using the standard stack operation Pop, Push, EmptyStack.a) Explain how the CPU detects an interrupt signal I and what actions should be taken?b) Write the initial and final sequences of instruction of a given ISR I (Transparency).c) Write the ISR4 such that whatever number of interrupted computation (in the stack) it gives the control to the first one interrupted.
A program sees a 4% miss rate on both the Instruction Cache and the Data Cache. Every instruction requires access to the Instruction cache. Only 35% of the instructions require data access from the Data Cache. The miss penalty for either the data or the instruction cache is 100 cycles. Assume the average Clocks per Instruction (CPI) is 2 without any memory stalls (this is a hypothetical machine where if there were no misses on that instruction, it would get executed in 2 clock cycles. We are not worrying about how it is implemented, just, that suppose it was possible). Assume the number of instructions in a program is X. F1: What is the number of 'instruction miss cycles'? (The number of clock cycles lost due to a miss on the Instruction Cache) F2: What is the number of 'data miss cycles'? F3: What is the total run time of the program including the missed cycles dues to data and instruction misses?
A digital computer has a memory unit with 24 bits per word. The instruction set consists of 150 different operations. All instructions have an operation code part (opcode) and an address part (allowing for only one address, similar to Marie). Each instruction is stored in one word of memory. a) How many bits are needed for the opcode? b) How many bits are left for the address part of the instruction? c) What is the maximum allowable size for memory?
8086Mp memory is logically divided into segments, the size of each segment is: 1Mbyte 64Kbyte 128Kbyte 2Kbyte 10Kbyte 32Кbyte 1Kbyte Let CS=5A71H, IP=BF6CH. What is the name of the memory segment given in the following figure AFTER executing the instruction (CALL [BX+DI] )? if IPnew=8C23H. * BF H 6F80BH 6C H 6F80AH Extra segment Stack segment Code segment Data segment
Given the following snippet of byte addressable memory with the base address already loaded in register $t1: Address 10010000 08 10010001 25 10010002 10 10010003 30 10010004 12 10010005 13 Update the appropriate memory locations if the following instruction was run: sw $s1,0($t1) and that $s1 contained the following value 0xfd06c012