| podobné slovo | definícia |
associatively
(encz) | associatively,asociativně adv: Zdeněk Brož |
nonassociative
(encz) | nonassociative, adj: |
Associative
(gcide) | Associative \As*so"ci*a*tive\, a.
Having the quality of associating; tending or leading to
association; as, the associative faculty. --Hugh Miller.
[1913 Webster] |
nonassociative
(gcide) | nonassociative \nonassociative\ adj.
not associative. Opposite of associative.
[WordNet 1.5] |
associative aphasia
(wn) | associative aphasia
n 1: aphasia in which the lesion is assumed to be in the
association tracts connecting the various language centers
in the brain; patient's have difficulty repeating a
sentence just heard [syn: conduction aphasia,
associative aphasia] |
nonassociative
(wn) | nonassociative
adj 1: not associative [ant: associative, associatory] |
associative array
(foldoc) | associative array
(Or "hash", "map", "dictionary") An array
where the indices are not just integers but may be
arbitrary strings.
awk and its descendants (e.g. Perl) have associative
arrays which are implemented using hash coding for faster
look-up.
(2007-10-02)
|
associative memory
(foldoc) | content addressable memory
associative memory
(CAM, or "associative memory") A kind of
storage device which includes comparison logic with each bit
of storage. A data value is broadcast to all words of storage
and compared with the values there. Words which match are flagged
in some way. Subsequent operations can then work on flagged
words, e.g. read them out one at a time or write to certain bit
positions in all of them. A CAM can thus operate as a {data
parallel} (SIMD) processor.
CAMs are often used in caches and memory management units.
(1995-02-16)
|
associative memory parallel processing language
(foldoc) | Associative Memory Parallel Processing Language
AMPPL-II
(AMPPL-II) A language from the early 1970s.
(1995-11-14)
|
fully associative cache
(foldoc) | fully associative cache
A type of cache in which data from any
address can be stored in any cache location. The whole address
must be used as the tag (the value that identifies a block of data
in the cache). All tags must be compared simultaneously
(associatively) with the requested address and if one matches then
its associated data is accessed. This requires an {associative
memory} to hold the tags which makes this form of cache more
expensive. It does however solve the problem of contention for
cache locations (cache conflict) since a block need only be
flushed when the whole cache is full and then the block to flush
can be selected in a more efficient way.
The alternatives are direct mapped cache or {set associative
cache}.
(2013-08-09)
|
set associative cache
(foldoc) | set associative cache
A compromise between a direct mapped cache
and a fully associative cache where each address is mapped
to a certain set of cache locations. The address space is
divided into blocks of 2^m bytes (the cache line size),
discarding the bottom m address bits. An "n-way set
associative" cache with S sets has n cache locations in each
set. Block b is mapped to set "b mod S" and may be stored in
any of the n locations in that set with its upper address bits
as a tag. To determine whether block b is in the cache, set
"b mod S" is searched associatively for the tag.
A direct mapped cache could be described as "one-way set
associative", i.e. one location in each set whereas a fully
associative cache is N-way associative (where N is the total
number of blocks in the cache). Performance studies have
shown that it is generally more effective to increase the
number of entries rather than associativity and that 2- to
16-way set associative caches perform almost as well as fully
associative caches at little extra cost over direct mapping.
(2004-10-18)
|