Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | Shared memory 1. Memory in a parallel computer, usually RAM, which can be accessed by more than one processor, usually via a shared bus or network. It usually takes longer for a processor to access shared memory than to access its own private memory because of contention for the processor-to-memory connections and because of other overheads associated with ensuring synchronised access. Computers using shared memory usually have some kind of local cache on each processor to reduce the number of accesses to shared memory. This requires a cache consistency protocol to ensure that one processor's cached copy of a shared memory location is invalidated when another processor writes to that location. The alternative to shared memory is message passing where all memory is private to some particular processor and processors communicate by sending messages down special links. This is usually slower than shared memory but it avoids the problems of contention for memory and can be implemented more cheaply. 2. Memory which can be access by more than one process in a multitasking operating system with memory protection. Some Unix variants, e.g. SunOS provide this kind of shared memory. Unix manual pages: shmop(2), shmctl(2), shmget(2). (1994-10-20). Source: The Free On-line Dictionary of Computing. |
Math | All processors have the same global image of (and access to) all of the memory. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: SHARED MEMORY |
| Specialty definitions using "SHARED MEMORY": cache coherency ♦ descriptor, distributed memory ♦ message passing, ML Threads ♦ P4, Parallel C, Parallel Fortran, parallel random access machine, PARMACS ♦ Scalable Coherent Interface ♦ The Force ♦ Windows Messaging. (references) |
| Domain | Title | ||
Books |
| ||
Music |
| ||
Source: compiled by the editor from various references; see credits. | |||
| The following statistics estimate the number of searches per day across the major English-language search engines as identified by various trade publications. Hyperlinks lead to commercial use of the expression at Amazon.com. |
| Expression | Frequency per Day |
shared memory | 11 |
| Source: compiled by the editor from various references; see credits. | |
| Language | Translations for "SHARED MEMORY"; alternative meanings/domain in parentheses. | ||||||||||
French | la tâche verrouille la mémoire partagée (the task is said to acquire a lock in shared memory). (various references) | ||||||||||
Italian | il compito ha acquisito la capacità di blocco nella memoria condivisa (the task is said to acquire a lock in shared memory). (various references) | ||||||||||
Pig Latin | aredshay emorymay la tarea cierra un seguro en la memoria compartida (the task is said to acquire a lock in shared memory). (various references) | ||||||||||
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-d-e-e-h-m-m-o-r-r-s-y" | |
-3 letters: hammerers, hydrosere, rehammers, yammerers. | |
-4 letters: adherers, dreamers, hammered, hammerer, hoarders, homemade, mesoderm, redhorse, redreams, rehammer, rosemary, seadrome, shamoyed, sorehead, yammered, yammerer. | |
-5 letters: adherer, adheres, adorers, armored, dammers, dormers, dreamer, drosera, emerods, hammers, hareems, harmers, hayseed, headers, hearers, hearsed, hemmers, herders, hoarder, hoarser, homered, hydrase, mameyes, mayhems, moseyed, oedemas, radomes, rammers, ramrods, readers, reamers. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
| 1. Crosswords 2. Usage: Commercial 3. Expressions: Internet 4. Translations: Modern | 5. Anagrams 6. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.