Shared Nothing Architecture
A Shared Nothing Architecture is a Distributed Computing that ...
- See: Distributed Computing, Single Point of Contention, State (Computer Science), Database, Application Server, World Wide Web, Michael Stonebraker, University of California, Berkeley, Teradata, Tandem Computers, NonStop SQL, Scalability, Google.
References
2014
- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/shared_nothing_architecture Retrieved:2014-8-11.
- A shared nothing architecture (SN) is a distributed computing architecture in which each node is independent and self-sufficient, and there is no single point of contention across the system. More specifically, none of the nodes share memory or disk storage.
People typically contrast SN with systems that keep a large amount of centrally-stored state information, whether in a database, an application server, or any other similar single point of contention. While SN is best known in the context of web development, the concept predates the web: Michael Stonebraker at the University of California, Berkeley used the term in a 1986 database paper. [1] In it he mentions existing commercial implementations of the architecture (although none are named explicitly). Teradata, which delivered its first system in 1983, was probably one of those commercial implementations. Tandem Computers officially released NonStop SQL, a shared nothing database, in 1984. [2] Shared nothing is popular for web development because of its scalability. As Google has demonstrated, a pure SN system can scale almost infinitely simply by adding nodes in the form of inexpensive computers, since there is no single bottleneck to slow the system down. Google calls this sharding. A SN system typically partitions its data among many nodes on different databases (assigning different computers to deal with different users or queries), or may require every node to maintain its own copy of the application's data, using some kind of coordination protocol. This is often referred to as database sharding. There is some doubt about whether a web application with many independent web nodes but a single, shared database (clustered or otherwise) should be counted as SN. One of the approaches to achieve SN architecture for stateful applications (which typically maintain state in a centralized database) is the use of a data grid, also known as distributed caching. This still leaves the centralized database as a single point of failure. Shared nothing architectures have become prevalent in the data warehousing space. There is much debate as to whether the shared nothing approach is superior to shared Disk [3] with sound arguments presented by both camps. Shared nothing architectures certainly take longer to respond to queries that involve joins over large data sets from different partitions (machines). However the potential for scaling is huge. [4]
- A shared nothing architecture (SN) is a distributed computing architecture in which each node is independent and self-sufficient, and there is no single point of contention across the system. More specifically, none of the nodes share memory or disk storage.
- ↑ The Case for Shared Nothing Architecture by Michael Stonebraker. [Originally published in Database Engineering, Volume 9, Number 1 (1986).](PDF)
- ↑ NonStop SQL, A Distributed, High-Performance, High-Availability Implementation of SQL, Tandem Technical Report TR-87.4, http://www.hpl.hp.com/techreports/tandem/TR-87.4.pdf
- ↑ Independent article comparing Shared Nothing and Shared Disk
- ↑ Article on Shared Nothing from the point of view of a Shared Nothing Vendor(PDF)