Shared-nothing architecture
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.
- Comment
- enA 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.
- Has abstract
- enA 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 without a system-wide shutdown. A SN system can scale simply by adding nodes, since no central resource bottlenecks the system. 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.
- Is primary topic of
- Shared-nothing architecture
- Label
- enShared-nothing architecture
- Link from a Wikipage to another Wikipage
- Byzantine fault tolerance
- Category:Data partitioning
- Category:Distributed computing architecture
- Computer cluster
- Database scalability
- Data warehousing
- Distributed computing
- Distributed hash table
- EXASOL
- Gluster
- Greenplum
- Grid computing
- InfiniDB
- Michael Stonebraker
- MySQL Cluster
- NonStop SQL
- Openstack
- Oracle RAC
- Scylla (database)
- Shard (database architecture)
- Single point of failure
- Tandem Computers
- Teradata
- University of California, Berkeley
- Vertica
- Web development
- SameAs
- Arquitectura shared nothing
- haeQ
- Q1734086
- Shared Nothing Architecture
- シェアード・ナッシング・アーキテクチャ
- Subject
- Category:Data partitioning
- Category:Distributed computing architecture
- WasDerivedFrom
- Shared-nothing architecture?oldid=1083372776&ns=0
- WikiPageLength
- 3468
- Wikipage page ID
- 275651
- Wikipage revision ID
- 1083372776
- WikiPageUsesTemplate
- Template:Columns-list
- Template:Reflist