Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <h3>Overview, as you wanted</h3> <p>There are some popular techniques for distributed algorithms, e.g. using <strong>clocks</strong>, <strong>waves</strong> or <strong>general purpose routing algorithms</strong>.</p> <p>You can find these in the great distributed algorithm books <a href="http://rads.stackoverflow.com/amzn/click/0521794838" rel="nofollow">Introduction to distributed algorithms by Tel</a> and <a href="http://rads.stackoverflow.com/amzn/click/1558603484" rel="nofollow">Distributed Algorithms by Lynch</a>.</p> <h3>Reductions</h3> <p>are particularly useful since general distributed algorithms can become quite complex. You might be able to use a reduction to a simpler, more specific case.</p> <p>If, for instance, you want to avoid having a single point of failure, but a symmetric distributed algorithm is too complex, you can use the standard distributed algorithm of <a href="http://en.wikipedia.org/wiki/Leader_election" rel="nofollow"><strong>(leader) election</strong></a> and afterwards use a simpler asymmetric algorithm, i.e. one which can make use of a master. </p> <p>Similarly, you can use <a href="http://en.wikipedia.org/wiki/Synchronizer_%28algorithm%29" rel="nofollow"><strong>synchronizers</strong></a> to transform a synchronous network model to an asynchronous one. </p> <p>You can use <a href="http://en.wikipedia.org/wiki/Snapshot_algorithm" rel="nofollow"><strong>snapshots</strong></a> to be able to analyze offline instead of having to deal with varying online process states.</p>
    singulars
    1. This table or related slice is empty.
    1. PODistributed algorithm design
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USDaveFar
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PODistributed algorithm design
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COIntroduction to distributed algorithms by Tel looks like an interesting read. I like the idea of using a leader election algorithm, I can think of how it would make replication easier, I'm not so sure about the snapshots, in a case where the system has extremely high read/write rates, wouldn't a snapshot algorithm lead to some items being out of date because it's been pushed out the queue from a read request but replication has taken too long to propagate? Another thing I've just thought of is how would distributed deletes be handled? I'll update my question
      singulars
      1. PO
      1. USzcourts
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload