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.
Which is valid syntax of the Fork and Join Primitive? Ans. A valid syntax of the Fork and Join Primitive is as given below: Fork Join
Reg data type as Combinational element module reg_combo_example( a, b, y); input a, b; output y; reg y; wire a, b; always @ ( a or b) begin y = a & b; e
MAC is the abbreviation for: (A) Multimedia access control (B) Media access control (C) Mobile access control (D) Master access point control Ans: MAC is th
Grid Computing means applying the resources of a lot of computers in a network simultaneously to a one problem for solving a scientific or a technical problem that needs a large nu
The current 32 and 64 bit machines can represent integers of around 9 digits and 30 digits respectively, while various scientific and mathematical applications have to represent in
Explain about the term false path? How it find out in circuit? What the effect of false path in circuit? By timing all the paths into the circuit the timing analyzer can find o
A1->A2A3 A2->A3A1|b A3->A1A2|a
Q. Binary number system using 8 bit registers? Add 25 and -30 in binary number system using 8 bit registers using: Signed magnitude representation Signed 1's comple
Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr
Sun and Ni's Law The Sun and Ni's Law is a generalization of Amdahl's Law as well as Gustafson's Law. The fundamental idea underlying the Sun and Ni's Law is to find the soluti
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