(redirected from Memory location)
Also found in: Dictionary, Thesaurus, Medical, Financial, Acronyms, Encyclopedia.

MEMORY. Understanding; a capacity to make contracts, a will, or to commit a crime, so far as intention is necessary.
     2. Memory is sometimes employed to express the capacity of the understanding, and sometimes its power; when we speak of a retentive memory, we use it in the former sense; when of a ready memory, in the latter. Shelf. on Lun. Intr. 29, 30.
     3. Memory, in another sense, is the reputation, good or bad, which a man leaves at his death. This memory, when good, is highly prized by the relations of the deceased, and it is therefore libelous to throw a shade over the memory of the dead, when the writing has a tendency to create a breach of the peace, by inciting the friends and relations of the deceased to avenge the insult offered to the family. 4 T. R. 126; 5 Co. R. 125; Hawk. b. 1, c. 73, s. 1.

MEMORY, TIME OF. According to the English common law, which has been altered by 2 & 3 Wm. IV., c. 71, the time of memory commenced from the reign of Richard the First, A. D. 1189. 2 Bl. Com. 31.
     2. But proof of a regular usage for twenty years, not explained or contradicted, is evidence upon which many public and private rights are held, and sufficient for a jury in finding the existence of an immemorial custom or prescription. 2 Saund. 175, a, d; Peake's Ev. 336; 2 Price's R. 450; 4 Price's R. 198.

A Law Dictionary, Adapted to the Constitution and Laws of the United States. By John Bouvier. Published 1856.
References in periodicals archive ?
The semiexpectation analysis is a backward analysis that takes as an input a set of statements and memory locations (the semiexpectable set of the last program point).
There exists a polynomial-time algorithm for the prefetch/caching problem on D parallel disks, that produces a solution with at most D times the optimum stall time using at most D - 1 extra memory locations.
Observe that if we make the reasonable assumption that all the values computed in the program are useful (i.e., are either output variables, or are used by some other computation), then two distinct values must not be written to the same memory location the same time, i.e.,
But unlike lock synchronization, optimistic synchronization imposes no additional order between accesses to different memory locations. Although interactions between the caches, optimistic synchronization, and out-of-order execution complicate the implementation on modern processors, in principle the machine can use the same relaxed ordering constraints for optimistically synchronized updates as it does for unsynchronized updates.
Cache protocols must enforce that all processors observe all stores to the same memory location in the same order [Scheurich and Dubois 1987].
The difficulty comes from the memory location recall and auto-ranging steps, which take an indeterminate amount of extra time (see Table 1).
Bytecode verification treats each memory location with type u as unusable, since no single instruction can deal with all possible data in such a memory location in a type-correct way.(3)
CREW algorithms must arrange that no two processors attempt to write into the same global memory location at the same time.
This phase will yield the two segments that contain the racing instructions and the memory location involved in the race.
The queue allows each waiting CPU to spin on its own memory location, avoiding the excessive memory-bandwidth consumption under high contention.