- Branche: Technology
- Number of terms: 2742
- Number of blossaries: 0
- Company Profile:
The National Institute of Standards and Technology (NIST) — known between 1901 and 1988 as the National Bureau of Standards (NBS) — is a measurement standards laboratory and a non-regulatory agency of the United States Department of Commerce. The institute's official mission is to promote U.S. ...
All processors have the same global image of (and access to) all of the memory.
Industry:Computer science
Alphabetical or "dictionary" order. For instance, ordering cities by name rather than, say, by country or population (attributes of the named entity). The exact order, for example A-Za-z vs. aA-zZ etc., depends on the locale and application.
Industry:Computer science
An abstract data type storing items, or values. A value is accessed by an associated key. Basic operations are new, insert, find and delete. Formal Definition: The operations new(), insert(k, v, D), and find(k, D) may be defined with axiomatic semantics as follows. <ol> <li>new() returns a dictionary <li>find(k, insert(k, v, D)) = v <li>find(k, insert(j, v, D)) = find(k, D) if k ≠ j </ol> where k and j are keys, v is a value, and D is a dictionary.
Industry:Computer science
An abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum). Some implementations also efficiently support join two priority queues (meld), delete an arbitrary item, and increase the priority of a item (decrease-key). Formal Definition: The operations new(), insert(v, PQ), find-minimum or min(PQ), and delete-minimum or dm(PQ) may be defined with axiomatic semantics as follows. <ol> <li>new() returns a priority queue <li>min(insert(v, new())) = v <li>dm(insert(v, new())) = new() <li>min(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then v else min(insert(w, PQ)) <li>dm(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then insert(w, PQ) else insert(v, dm(insert(w, PQ))) </ol> where PQ is a priority queue, v and w are items, and priority(v) is the priority of item v.
Industry:Computer science
An adaptive Huffman coding scheme. Coding is never much worse than twice optimal.
Industry:Computer science
An adaptive Huffman coding scheme. Typically this produces codings the same length as or shorter than static Huffman coding. In the worst case, this uses one more bit per codeword.
Industry:Computer science
An algebraic theory to formalize the notion of concurrent computation, best exemplified in CSP and CCS.
Industry:Computer science
