Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Magnetic-core memory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Type of computer memory used from 1955 to 1975}} {{Redirect|Core memory}} {{Use dmy dates|date=December 2020}} [[File:KL CoreMemory.jpg|thumb|upright=1.2|A 32 Γ 32 core memory plane storing 1024 bits (or 128 [[byte]]s) of data. The small black rings at the intersections of the grid wires, organised in four squares, are the ferrite cores.]] {{Memory types}} In [[computing]], '''magnetic-core memory''' is a form of [[random-access memory]]. It predominated for roughly 20 years between 1955 and 1975, and is often just called '''core memory''', or, informally, '''core'''. Core memory uses [[toroid]]s (rings) of a [[hard magnetic material]] (usually a [[Ferrite (magnet)#Semi-hard ferrites|semi-hard ferrite]]). Each core stores one [[bit]] of information. Two or more wires pass through each core, forming an X-Y array of cores. When an electrical current above a certain threshold is applied to the wires, the core will become magnetized. The core to be assigned a value – or ''written'' – is selected by powering one X and one Y wire to half of the required current, such that only the single core at the intersection is written. Depending on the direction of the currents, the core will pick up a clockwise or counterclockwise magnetic field, storing a 1 or 0. This writing process also causes electricity to be [[electromagnetic induction|induced]] into nearby wires. If the new pulse being applied in the X-Y wires is the same as the last applied to that core, the existing field will do nothing, and no induction will result. If the new pulse is in the opposite direction, a pulse will be generated. This is normally picked up in a separate "sense" wire, allowing the system to know whether that core held a 1 or 0. As this readout process requires the core to be written, this process is known as ''destructive readout'', and requires additional circuitry to reset the core to its original value if the process flipped it. When not being read or written, the cores maintain the last value they had, even if the power is turned off. Therefore, they are a type of [[non-volatile memory]]. Depending on how it was wired, core memory could be exceptionally reliable. [[Read-only storage|Read-only]] [[core rope memory]], for example, was used on the mission-critical [[Apollo Guidance Computer]] essential to [[NASA]]'s successful Moon landings.<ref>{{cite episode |url=https://www.youtube.com/watch?v=ndvmFlg1WmE |title=Computer for Apollo |series=MIT Science Reporter |station=[[WGBH-TV|WGBH]] |date=1965}}</ref> Using smaller cores and wires, the [[memory density]] of core slowly increased. By the late 1960s a density of about 32 kilobits per cubic foot (about 0.9 kilobits per litre){{Citation needed|date=May 2025}} was typical. The cost declined over this period from about $1 per bit to about 1 cent per bit. Reaching this density requires extremely careful manufacturing, which was almost always carried out by hand in spite of repeated major efforts to automate the process. Core was almost universal until the introduction of the first [[semiconductor memory]] chips in the late 1960s, and especially [[dynamic random-access memory]] (DRAM) in the early 1970s. Initially around the same price as core, DRAM was smaller and simpler to use. Core was driven from the market gradually between 1973 and 1978. Although core memory is obsolete, computer memory is still sometimes called "core" even though it is made of semiconductors, particularly by people who had worked with machines having actual core memory. The files that result from saving the entire contents of memory to disk for inspection, which is nowadays commonly performed automatically when a major error occurs in a computer program, are still called "[[core dump]]s". Algorithms that work on more data than the main memory can fit are likewise called [[External memory algorithm|out-of-core algorithms]]. Algorithms that only work inside the main memory are sometimes called in-core algorithms.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)