|
1 | | -<!-- $PostgreSQL: pgsql/doc/src/sgml/high-availability.sgml,v 1.9 2006/11/2203:44:52 momjian Exp $ --> |
| 1 | +<!-- $PostgreSQL: pgsql/doc/src/sgml/high-availability.sgml,v 1.10 2006/11/2204:00:19 momjian Exp $ --> |
2 | 2 |
|
3 | 3 | <chapter id="high-availability"> |
4 | 4 | <title>High Availability and Load Balancing</title> |
@@ -184,22 +184,22 @@ protocol to make nodes agree on a serializable transactional order. |
184 | 184 | </varlistentry> |
185 | 185 |
|
186 | 186 | <varlistentry> |
187 | | - <term>Multi-MasterClustering</term> |
| 187 | + <term>Multi-MasterReplication</term> |
188 | 188 | <listitem> |
189 | 189 |
|
190 | 190 | <para> |
191 | | - Inclustering, each server can accept write requests, and |
192 | | - modified data is transmitted from the original server to every |
193 | | - other server before each transaction commits. Heavy write |
194 | | - activity can cause excessive locking, leading to poor performance. |
195 | | - In fact, write performance is often worse than that of a single |
196 | | - server. Read requests can be sent to any server. Some |
197 | | - implementations use cluster-wide shared memory or shared disk |
198 | | - to reduce the communication overhead. Clustering is best for |
199 | | - mostly read workloads, though its big advantage is that any |
200 | | - server can accept write requests — there is no need to |
201 | | - partition workloads between master and slave servers, and |
202 | | - because the data changes are sent from one server to another, |
| 191 | + Inmulti-master replication, each server can accept write |
| 192 | +requests, andmodified data is transmitted from the original |
| 193 | +server to everyother server before each transaction commits. |
| 194 | +Heavy writeactivity can cause excessive locking, leading to |
| 195 | +poor performance.In fact, write performance is often worse |
| 196 | +than that of a singleserver. Read requests can be sent to |
| 197 | +any server. Someimplementations use cluster-wide shared memory |
| 198 | +or shared diskto reduce the communication overhead. Clustering |
| 199 | +is best formostly read workloads, though its big advantage is |
| 200 | +that anyserver can accept write requests — there is no |
| 201 | +need topartition workloads between master and slave servers, |
| 202 | +andbecause the data changes are sent from one server to another, |
203 | 203 | there is no problem with non-deterministic functions like |
204 | 204 | <function>random()</>. |
205 | 205 | </para> |
@@ -246,7 +246,7 @@ protocol to make nodes agree on a serializable transactional order. |
246 | 246 | </varlistentry> |
247 | 247 |
|
248 | 248 | <varlistentry> |
249 | | - <term>Clustering For Parallel Query Execution</term> |
| 249 | + <term>Multi-Server Parallel Query Execution</term> |
250 | 250 | <listitem> |
251 | 251 |
|
252 | 252 | <para> |
|