Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
What is FIFO?
FIFO is used as buffering element or queuing element into the system that is by common sense, is needed only while you slow at reading than the write operation. Therefore size of the FIFO fundamentally implies the amount of data needed to buffer that depends upon data rate at that data is written and the data rate at that data is read. Data rate varies statistically into the system majorly depending onto the load in the system. Therefore to acquire safer FIFO size we require considering the worst case scenario for the data transfer across the FIFO under concerning. For worst scenario case, difference between the data rate between write and read must be maximised. Therefore, for write operation maximum data rate must be considered and for read operation minimum data rate must be considered. Therefore in the question itself, data rate of read operation is specified through the number of idle cycles and for write operation, maximum data rate must be considered along with no idle cycle.
Therefore for write operation, we require to know Data rate = Number of data * rate of clock. There writing side is the source and reading side turns into sinking, data rate of reading side depends onto the writing side data rate and its own reading rate that is Frd/Idle_cycle_rd. In order to identify the data rate of write operation, we require knowing Number of data into a Burst that we have assumed to be B. Therefore following up along with the equation as described below as: Fifo size = Size to be buffered that is implies B - B * Frd / (Fwr* Idle_cycle_rd _rd ).
Now we have not considered the synchronizing latency when Write and Read clocks are Asynchronous. Superior the Synchronizing latency, higher the FIFO size need to buffer more additional data written.
State and prove Demorgan’s First theorems: Ans. Statement of First Theorem of De Morgan: = A‾. B‾ Proof: The two sides of the equation i.e. = is represented with logic
Explain different parameter passing mechanisms to a function with the help of example? The different parameter-passing mechanisms are given below: 1. Call by value 2.
Describe the VON NEUMANN ARCHITECTURE Most of present computer designs are based on idea developed by John vonNeumann referred to as the VON NEUMANN ARCHITECTURE. V
Q. Characteristics of Magnetic disk? Tracks and Sectors: Disk is divided in concentric rings known as tracks. Thus a track is one complete rotation of disk underneath read/wr
The logic circuit shown in the given figure can be minimised to Ans. The minimised figure of logic diagram is D, the output of the logic circuit is as Y=(X+Y')'+(X'+(X+
Differentiate between static and dynamic memory? The static RAM is simpler to use and has shorter read and write cycles. One of the main applications of static RAM is in execut
Example: CMP AX,BX ; compare instruction: sets flags JE THERE ; if equal then skip the ADD instruction ADD AX, 02 ; add 02
Electronic Data Interchange (EDI ) is used by companies for transactions that happen on regular basis to a pre-determined format. It is one of the electronic commerce technologies.
Indirect addressing A memory location is given that holds another memory location. This second memory location holds the real data. This mechanism solves problems caused by rea
Which approaches do not require knowledge of the system state? Ans. Deadlock detection, deadlock prevention and deadlock avoidance; none of the given require knowledge of the s
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd