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!
Consider that a list of record or a table is stored in the memory and you wish to find some information in that particular list. E.g. the list comprises three fields as displayed below:
Assume that we want to find the age and ID number of Ravi. If we use conventional RAM, it is essential to give the exact physical address of entry associated to Ravi in the instruction access entry such as:
READ ROW 3
Another alternative idea is that we explore the whole list by means of the Name field as an address in instruction like:
READ NAME = RAVI
Again with serial access memory this option may be implemented simply but it's a very slow process. An associative memory assists at this point and concurrently examines all the entries in the list and returns the desired list very rapidly. SIMD array computers have been developed with associative memory. This memory is content addressable memory by which it's meant that multiple memory words are accessible concurrently. The parallel accessing feature support parallel search and parallel compare too. This ability can be used in numerous applications like:
The inherent parallelism characteristic of this memory has huge advantages and impact in parallel computer architecture. The associative memory is expensive compared to RAM. The array processor built with associative memory is termed as Associative array processor. In this section we explain a number of categories of associative array processor. Kinds of associative processors are based on organisation of associative memory. So first we discuss about associative memory organisation.
What is replacement algorithm? When the cache is full and a memory word that is not in the cache is referenced, the cache control hardware must decide which block should be del
What are the advantages of CCS over in-channel signalling? The advantages of CCS over in-channel signalling are given below: a. Information can be exchange among the process
Memory Stack Stack could exist as a stand-alone unit or could be executed in a random-access memory attached to the CPU. The implementation of a stack in a CPU is done by assig
a. Define parsing? Give difference among top down parsing and bottom up parsing. b. Determine the self-relocating programs? Why self-relocating programs are less efficient then
Write the truth table for a clocked J-K flip-flop that is triggered by the positive-going edge of the clock signal. Ans. Logic diagram of JK flip flop Truth T
aggregation in dbms?
How many lists can a program can produce? Every program can produce up to 21 lists: one basic list and 20 secondary lists. If the user makes a list on the next level (that is,
Iterative Deepening Search: So, breadth first search is always guaranteed to find a solution (if one exists), actually it eats all the memory. For the depth first search, ther
Name some register output control signals. Pc out , MDR out , Z out , Offset out , R1 out , R2 out , R3 out and TEMP out .
Q. Explain about Registers? A register is a group of flip-flops that store binary information and gates that controls when and how information is transferred to register. An n-
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