I need help with this assignment. in the attach you will find the questions about the assignment and the lecture notes about it.
Represent the decimal values 5, –2, 14, –10, 26, –19, 51, and –43, as signed, 7-bit numbers in the following binary formats: CST 6301 – Advanced Computer Architecture Fall 2022 Assignment #3 Due on Tuesday before 7:30pm, November 1 (Tuesday), 2022 This assignment weights 10 points. Note: · A cover page with "CST 6301, Fall 2022, Assignment #2", your NAME, and your E-MAIL address on it. · My preference is typed report. Writing and hand-draw are OK but it should be legible. · Upload your submission to Canvas. 1. Suppose that there are five PCs in the network and all five PC users are active only 10 percent of the time and is idle during the remaining 90 percent of the time. Also, suppose that all PCs are powered on and connected to the Internet for 24 hours. Calculate how long there are less than two simultaneous active PCs for 24 hours. [2 points] 2. Consider a $3000 wafer having 30 cm diameter. This wafer will be chopped into dies that are 0.7 cm on a side. [3 points] a) How many dies can we produce? b) If we assume a defect density of 0.6 per cm2, how many good dies can we produce? (assume α value is equal to 4) c) How much does each die cost? 3. Assume that we are going to replace the CPU in a computer with a faster version. This new CPU is known providing 10 times faster on a computation in the floating point calculations than the original CPU. The original CPU is currently busy with floating point calculations 50% of time and doing other calculations remaining 50 % of time. [2 points] a) What is the overall speedup gained by incorporating enhancement? b) How much percentage is the computer system with a new CPU faster than the computer system with old CPU? 4. Consider the following set of processes, with the length of the CPU execution time given in milliseconds. The processes are assumed to have arrived in the order P1, P2, P3, P4, at the following times. Draw CPU grant chart that illustrates the execution of these processes using the FcFs, SJF without preemptive, and SJF with preemptive scheduling algorithm and calculate the average waiting time over all processes, respectively. [3 points] Process Arrival Time Execution Time --------------------------------------------------------------------------------- P1 0 60 P2 20 30 P3 40 10 P4 50 40 Computer System Organization with Hardware Components: Buffer System bus (= bps) Each I/O device has its own I/O buffer. I/O operation will happen between the I/O device and its local buffer. If the buffer is full, the system control will transfer the data from the buffer to main memory (RAM). Then, the CPU will access the RAM to execute the data. That is, the CPU will only access the RAM. I/O operation and CPU execution can be done concurrently. · I/O operation: between I/O device and its associated buffer · CPU execution: between CPU and main memory · These two operations can be performed simultaneously and independently DMA (Direct Memory Access): If the device is equipped with DMA technology, the device can transfer data from its buffer to main memory by itself without CPU intervention. If we use DMA technology, the device will interrupt CPU per every block rather every byte. System bus has its data transmission rate, called bandwidth, and its capacity is typically represented by bps (= Bit Per Second) BPS How many bits it can transmit for one second. Example) Memory HDD 8Mbps 4Mbyte In order to transmit 4Mbyte file to RAM, how long time it will take? Data size 4Mbyte 32Mbits 8Mbps It can transmit 8Mbits for one second. Data Size/Bandwidth = 32Mbits/8Mbps = 4 seconds How to provide security in term of confidentiality? The sender will not send the data as a plaintext to receiver. Instead, it will encrypt the data to ciphertext and send the ciphertext. Then, how to construct the ciphertext? Encryption. Sender Encrypt the plaintext to ciphertext Receiver Decrypt the ciphertext to plaintext How to do that? Encryption Key We have two different kinds of key. Symmetric key: Encryption key is same as decryption key. Secret key, One key, Single key, Shared key Asymmetric key: Encryption key and decryption key are different. Private key, Public key Symmetric encryption with secret key Sender Receiver C = ES_K(P) C P = DS_K(C) = DS_K(ES_K(P)) Asymmetric encryption with private key and public key Private key: The owner is the only one who knows its private key Public key: Everyone including the owner know its public key If we encrypt with private key, then we have to decrypt with public key If we encrypt with public key, then we have to decrypt with private key A B Sender Receiver C = EK(P) PrA (YES)