A cache where data from any address can be stored in any cache location. The whole address must be used as the tag. 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.
See also direct mapped cache, set associative cache.
- Fully automated compiling technique
language (FACT, “Honeywell-800 Business Compiler”) A pre-COBOL English-like business data processing language for the Honeywell 800, developed ca. 1959. [Sammet 1969, p. 327]. (1994-12-01)
- Fully fashioned
adjective 1. (of stockings, knitwear, etc) shaped and seamed so as to fit closely
- Fully lazy lambda lifting
functional programming A transformation, described by Wadsworth in 1971, which ensures that subexpressions in a function body which do not depend on the function’s arguments are only evaluated once. E.g. each time the function f x = x + sqrt 4 is applied, (sqrt 4) will be evaluated. Since (sqrt 4) does not depend on […]
- Fully qualified domain name
networking (FQDN) The full name of a system, consisting of its local hostname and its domain name, including a top-level domain (tld). For example, “venera” is a hostname and “venera.isi.edu” is an FQDN. An FQDN should be sufficient to determine a unique Internet address for any host on the Internet. This process, called “name resolution”, […]