home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!mips!darwin.sura.net!jvnc.net!yale.edu!qt.cs.utexas.edu!cs.utexas.edu!swrinde!sdd.hp.com!hpscdc!cupnews0.cup.hp.com!dhepner
- From: dhepner@cup.hp.com (Dan Hepner)
- Newsgroups: comp.databases
- Subject: Re: Hot Standby DBMS's
- Message-ID: <BtKEqE.9uy@cup.hp.com>
- Date: 26 Aug 92 00:30:14 GMT
- References: <CHRIS.92Aug25123032@yen.imsi.com>
- Sender: news@cupnews0.cup.hp.com
- Organization: Hewlett-Packard
- Lines: 21
- X-Newsreader: Tin 1.1scd1 PL4
-
- From: chris@yen.imsi.com (Chris Payne)
-
- > One clean solution to the hot-backup equivalence problem is to
- >serialize the request stream. Guarantee that when a credit precedes a
- >debit on one db server, it precedes the debit on all active servers.
-
- If this advice "credit must always precede debit" is not followed you
- might get deadlocks even without replication. However, this is insufficient
- to prevent the other kind of out-of-order deadlocks. What you have to
- guarantee is that a transaction will acquire locks in a specified order
- across copies. I.e. execution of credit on copy 1 must always complete
- before beginning on copy 2.
-
- >If you want to catch-up a server which is down periodically, keep a
- >copy of the request stream.
-
- How would you guarantee that transactions will be executed in the same
- serial order as was implied by the online system? As has been pointed
- out, such a guarantee is required to keep the copies synchronized.
-
- Dan Hepner
-