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.
Propositional Logic - artificial intelligence: This is a limited logic, which permit us to write sentences about propositions - statements about the world - which can either b
Implement the Y(A, B, C) = ∑(2,3,5,6) function using 4-to-1 multiplexer. Ans. Y(A,B,C)=∑(2,3,5,6) Here we take B,C as the select bits also A as input. To select the input we can
An 8-bit successive approximation ADC has a resolution of 20mV. What will be its digital output for an analog input of 2.17V? Ans: Given data Resolution =20mv Analog input =2.
mips rating
Define busy waiting and spinlock. When a process is in its critical section, any other process that tries to enter its critical section must loop continuously in the entry cod
Q. Explain Design of adder? Adders play one of the most significant roles in binary arithmetic. As a matter of fact fixed point addition is frequently used as a simple measure
Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,
The aim of this Assignment is to demonstrate knowledge about the analysis and design of a software system and understanding of the application of an object-oriented metho
What is meant by bitwise operations? C has distinction of supporting special operators known as bit wise operators for manipulation of data at bit level. These operators are us
If you are using C language to implement the heterogeneous linked list, what pointer type will you use? The heterogeneous linked list having different data types in its nodes a
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