Map
Index
Random
Help
Topics
th

Topic: information as a hint

topics > computer science > Group: information



Group:
operating system

Topic:
data caching
Topic:
optimistic update for concurrency control
Topic:
replicated data
Topic:
self-identifying data structures
Topic:
updating information in a distributed system

Summary

Information may be a hint instead of a fact. A hint says that this might be true, or this might be valid, or did you consider this.

Hints are widely used in computer systems. Data caching records information even though it may become out-of-date. Optimistic approaches assume that something works and then check it later. (cbb 11/07)

Subtopic: hints for efficiency -- cache up

Quote: use hints to speed up normal execution; like cache but may be wrong and doesn't need associative lookup [»lampBW10_1983]

Subtopic: stored information as hints -- Clearinghouse up

Quote: we treat information from a telephone clearinghouse as a hint which is verified when we make a call [»oppeDC7_1983]
Quote: the Clearinghouse contains the truth about an entry or will contain it soon [»oppeDC7_1983]
Quote: depending on time scale the Clearinghouse holds either truth or hint [»oppeDC7_1983]
Quote: data (hints) stored by Clearinghouse may be inconsistent or incorrect [»oppeDC7_1983]
Quote: depending on time scale the Clearinghouse holds either truth or hint [»oppeDC7_1983]

Subtopic: use of hints up

Quote: a page consists of absolutes (file id, version number, page number) and hints (for efficiency, verified, reconstructible) [»lampBW4_1974]
Quote: for Alto and Pilot, a file's leader page defined the file's directory and string name; the actual directory entry was just a hint [»lampBW10_1983]
Quote: the bit table for free disk pages is a hint, verified against the label of the free page [»lampBW10_1983]
Quote: on the Ethernet, lack of a carrier is a hint that a packet can be sent [»lampBW10_1983]
Quote: Mach implements task address maps by an ordered list; memory faults use a hint from the previous lookup request [»rashRF11_1986]
Quote: Cedar partitions the disk into big and small file areas to curtail fragmentation; the areas are hints [»hagmR_1987]
Quote: the first DO-TRANSACTION broadcasts the server's port to find its physical network address; used for future transactions (a hint) [»vanrR10_1988]
Quote: ADMS+- has an incremental access model: it reuses previously found access paths to data [»rousN12_1986]
Quote: in ADMS+-, updates are logged but not broadcast; if an access path is outdated, it is updated and cached; low cost [»rousN12_1986]
Quote: if 'almost up-to-date' data is ok, ADMS- will process a query on the workstation without waiting for current updates [»rousN12_1986]
Quote: if an analysis uses an item that becomes modified, the former value has a timestamp to limit its validity [»shavMJ2_1980]
Quote: V's name cache flushes stale data when detected by using that data
[»cherDR3_1988]

Related Topics up

Group: operating system   (27 topics, 924 quotes)

Topic: data caching (35 items)
Topic: optimistic update for concurrency control (35 items)
Topic: replicated data (51 items)
Topic: self-identifying data structures (18 items)
Topic: updating information in a distributed system
(50 items)


Updated barberCB 7/04
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.