Jump to content

Shared-nothing architecture

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by The Anome (talk | contribs) at 14:04, 15 September 2023 (rv self). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A shared-nothing architecture (SN) is a distributed computing architecture in which each update request is satisfied by a single node (processor/memory/storage unit) in a computer cluster. The intent is to eliminate contention among nodes. Nodes do not share (independently access) the same memory or storage. One alternative architecture is shared everything, in which requests are satisfied by arbitrary combinations of nodes. This may introduce contention, as multiple nodes may seek to update the same data at the same time.

SN eliminates single points of failure, allowing the overall system to continue operating despite failures in individual nodes and allowing individual nodes to upgrade hardware or software without a system-wide shutdown.[1]

A SN system can scale simply by adding nodes, since no central resource bottlenecks the system.[2] In databases, a term for the part of a database on a single node is a shard. A SN system typically partitions its data among many nodes. A refinement is to replicate commonly used but infrequently modified data across many nodes, allowing more requests to be resolved on a single node.

History

Michael Stonebraker at the University of California, Berkeley used the term in a 1986 database paper.[3] Teradata delivered the first SN database system in 1983.[4] Tandem Computers NonStop systems, a shared-nothing implementation of hardware and software was released to market in 1976.[5][6] Tandem Computers later released NonStop SQL, a shared-nothing relational database, in 1984.[7]

Applications

Shared-nothing is popular for web development.

Shared-nothing architectures are prevalent for data warehousing applications, although requests that require data from multiple nodes can dramatically reduce throughput.[8]

See also

References

  1. ^ Wright, Dave (2014-09-17). "The Advantages of a Shared Nothing Architecture for Truly Non-Disruptive Upgrades". netapp.com. Retrieved 2019-10-31.
  2. ^ Blankenhorn, Dana (February 27, 2006). "Shared nothing coming to open source". ZDNet. Retrieved June 21, 2012.
  3. ^ Michael Stonebraker (1986). "The Case for Shared Nothing Architecture" (PDF). Database Engineering. 9 (1).
  4. ^ "Teradata History". Teradata.com. Retrieved 2013-06-16.
  5. ^ ""Tandem History: An Introduction"". Center Magazine: A Newsletter for Tandem Employees. 6 (1). Winter 1986.
  6. ^ "History of TANDEM COMPUTERS, INC. – FundingUniverse". www.fundinguniverse.com. Retrieved 2023-03-01.
  7. ^ "NonStop SQL, A Distributed, High-Performance, High-Availability Implementation of SQL, Tandem Technical Report TR-87.4" (PDF). Archived from the original (PDF) on 2012-03-16. Retrieved 2012-10-11.
  8. ^ "Article on Shared Nothing from the point of view of a Shared Nothing Vendor" (PDF).
Retrieved from "https://en.wikipedia.org/w/index.php?title=Shared-nothing_architecture&oldid=1175504535"