Use the following information for all parts of the question: Memory Access = 640 ps ALU Operations = 320 ps Register Access = 160 ps 1. If we implement the DataPath as a single-cycle using variable cycle length, fill in the cycle time for the following statement types (critical data path) in ps. R-Type: = [A] ps Load Type = {[B] ps Store Type = [C] ps Branch Type = [D] ps Jump = [E] ps 2. If we implement the above DataPath using a single-cycle with fixed length, the cycle length would be _[F] ps. 3. If we are running a program with instruction mix: R-type = 50% Load type = 20% Store type 15% = Branch type = 13% Jump = 2% the average time to execute an instruction is [G] ps 4. If we implement the Critical DataPath using multiple cycles for each instruction (where each stage = 1 cycle), fill in the number of cycles required for each instruction type: R-type: = [H] Load-type = [I] Store type = [J] Branch type = [K] Jump = [L]

Use the following information for all parts of the question: Memory Access = 640 ps ALU Operations = 320 ps Register Access = 160 ps 1. If we implement the DataPath as a single-cycle using variable cycle length, fill in the cycle time for the following statement types (critical data path) in ps. R-Type: = [A] ps Load Type = {[B] ps Store Type = [C] ps Branch Type = [D] ps Jump = [E] ps 2. If we implement the above DataPath using a single-cycle with fixed length, the cycle length would be _[F] ps. 3. If we are running a program with instruction mix: R-type = 50% Load type = 20% Store type 15% = Branch type = 13% Jump = 2% the average time to execute an instruction is [G] ps 4. If we implement the Critical DataPath using multiple cycles for each instruction (where each stage = 1 cycle), fill in the number of cycles required for each instruction type: R-type: = [H] Load-type = [I] Store type = [J] Branch type = [K] Jump = [L]

Name: Help me with these computer architecture questions, please.I need help
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Help me with these computer architecture questions, please.I need help with questions 3 and 4. Use the following information for all parts of the question:Memory Access = 640 psALU Operations = 320 psRegister Access = 160 ps1. If we implement the Dat

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

Below C-code has a for loop which will repeat 1000 times of the operation. This code will be running on very simple machine. Change the code to reduce the number of branch instructions. You can have up to 5 lines (statements) within the for loop. What is the number of branch operations before and after? for (i=0; i<1000; i++){ y[i] = w * x[i] + b[i]; }
Computer Science #include<cmath>#include<stdio.h>__global__voidprocess_kernel1(float *input1,float *input2,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = sinf(input1[index]) + cosf(input2[index]);}__global__voidprocess_kernel2(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = logf(input[index]);}_global__voidprocess_kernel3(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x *…
Write the mnemonics of the following program: The pressure of two boilers is monitored and controlled by a microcomputer works based on microprocessor programming. A set of 6 readings of first boiler, recorded by six pressure sensors, which are stored in the memory location starting from 2050H. A corresponding set of 6 reading from the second boiler is stored at the memory location starting from 2060H. Each reading from the first set is expected to be higher than the corresponding position in the second set of readings. Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. If all the readings of first set is higher than the second set, store 00 in the ‘D’ register. If any one of the readings is lower than the corresponding reading of second set, stop the process and store FF in the register ‘D’. Data (H): First set: 78, 89, 6A, 80, 90, 85 Second Set:71, 78, 65, 89, 56, 75
An existing timer library is to be added. The following functional prototype is given. 1 void ConfigPWMChannel (TIM_TypeDef const * const timer, const uint8_t pwmMode, const uint8_t pwmChannel); 2 3 With the following description TIM_TypeDef Structure for all registers that are assigned to a timer. pwmMode contains the specific number of the selected PWM mode. pwmChannel contains the specific number of the selected channel. a) First, only enter the commands that check whether the transferred parameter Timer corresponds to Timers 2 or 1. If this is not the case, a suitable standard value should be used. b) Now enter the required commands so that the corresponding mode is set correctly. Implement the case for Channel 4. C) Make each (a) and (b) free of syntax errors. Notice. This only applies to a complete solution of (a) and (b) respectively
Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int…
CPU Priority Scheduling-preemptive: Write a Java program to implement a priority scheduling algorithm that uses low number to represent high priority. Your program should first prompts the user to input a list of process ID, arrival time, burst time, and priority for each process to be run on the CPU. The list is terminated by 0 0 0 0 for the process ID, arrival time, burst time, and priority. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the Priority scheduling algorithm. Also print the turnaround time, response time, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
Instruction: Explain the function of the program line by line thoroughly.Program: #include <iostream> using namespace std; //Swap functionvoid swap(int *xp, int *yp){ int temp = *xp; *xp = *yp; *yp = temp;} void selectionSort(int arr[], int n){ int i, j, min_idx; // One by one move boundary of // unsorted subarray for (i = 0; i < n-1; i++) { // Find the minimum element in // unsorted array min_idx = i; for (j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element // with the first element if(min_idx!=i) swap(&arr[min_idx], &arr[i]); }} //Function to print an arrayvoid printArray(int arr[], int size){ int i; for (i=0; i < size; i++) cout << arr[i] << " "; cout << endl;} int main(){ int x, n; cout << "Enter number of integers: "; cin >>n; int *arr = new int(n); for (int i = 0; i < n; i++) { cout << " Enter Integer No. " << (i + 1) << ": ";…
Language: c++ Please solve problem completely according to requirement, program should must be follow all the rules of menu base system which are required and write in question: Attach the output's screentshots and explain every line with comments: Whole code should be user defined inputs not fix: Task : Address Book (List)• Your program will be a menu driven program. Address book will be implemented using the ArrayList.Description: We want to build an address book that is capable of storing name, address & phone number of a person. Address book provides functionality in the form of a menu. The feature list includes:• Add – to add a new person record• Delete – to delete an existing person record by name• Search – to search a person record by name Sort - to sort the file after adding a new person record. · Exit – to exit from application
2. Consider the two main variables: Number and N. Number is a 1024 byte variable. It represents a huge unsigned integer. N is a 4 byte variable. It represents the number of bits by which the number will be shifted. assenbly language Write an SHL1024 function that receives two parameters on the stack: the address of a number of 1024 bytes and a value giving by how many bits the number of 1024 bytes will be shifted towards the left. This function must act like an SHL but on a 1024 byte variable. On return, the content of the Number variable will be shifted to the left by the number of bits demand. On return, the values of the general registers and the EFLAGS should be the same as before the call to SHL1024
A developer has written an AWS Lambda function. The function is CPU-bound. The developer wants to ensure that the function returns responses quickly. How can the developer improve the function's performance? O A. Increase the function's CPU core count. OB. Increase the function's memory. OC. Increase the function's reserved concurrency. OD. Increase the function's timeout.
Question 1: Convert the following infix expression into postfix one: (A+B^D)/(D-F)+G PS: you have to illustrate the different steps of this conversion one by one. Token #Scan Postfix Expression Stack 1 2 3 4 15 6 7 18 9 10 11 12 13 14 15 The final solution is: Question 2: Evaluate the postfix expression ABC D+ * / Where A = 66, B = 1, C = 12 and D=10
import java.lang.System; 3. public class FibonacciComparison { 4. // Fibonacci Sequence: 0, 1, 1, 2, 3, 5, 8 .... /* 7 input cases 8. 1) 0 9 2) 3 10 3) -1 11 4) 9 12 output cases 13 1) 0 14 2) 2 15 3) 0 16 4) 34 17 */ // Note that you need to return 0 if the input is negative. // Please pay close attention to the fact that the first index in our fib sequence is 0. 18 19 20 // Recursive Fibonacci public static int fib(int n) { // Code this func. 21 22 23 24 return -1; 25 26 // Iterative Fibonacci 27 28 public static int fiblinear(int n) { // Code this func. 29 30 return -1; 31 32 33 public static void main(String[] args) { 34 // list of fibonacci sequence numbers int[] nlist w { 5,10, 15, 20, 25, 30, 35, 40, 45}; 35 36 37 // Two arrays (one for fibLinear, other for fibRecursive) to store time for each run. // There are a total of nlist.length inputs that we will test double[] timingsEF = new double[nlist.Length]; double[] timingsLF = new double[nlist.length]; 38 39 40 41 42 // Every…