Quote: survey of consistency models for hardware-based shared memory systems; includes programmer-centric view of relaxed consistency models [»adveSV12_1996]

Quote: relaxed memory consistency models differ in how they relax program order and write atomicity; e.g., a read may return another processor's write before it is globally visible [»adveSV12_1996]

Quote: relaxed memory consistency models often provide a fence instruction or other safety net to force synchronization; these allow compilers to safely optimize large regions of code [»adveSV12_1996]

Quote: programmers can identify synchronization and data operations in performance-critical areas for weak order optimization; example of programmer-centric approach to relaxed memory consistency [»adveSV12_1996]

Quote: Bayou supports four session guarantees: read your writes, monotonic reads, writes follow reads, and monotonic writes; allows self consistency [»edwaWK10_1997]

Quote: review concurrency control methods with reduced lock contention, indices, aggregate data, transactions, relaxed queries

Quote: write atomicity if writes to the same location are serialized and reads are disallowed until the write is visible to all processors [»adveSV12_1996]

Quote: in very large databases, locking is not necessary since conflicts are rare [»akscRM5_1984]

Quote: KMS users rarely modify the same frame at the same time [»akscRM7_1988a]

Quote: informal locking in KMS by writing an 'in use' item [»akscRM7_1988a]

Quote: Colab broadcasts changes with optimistic update (voice locks when needed) [»stefM1_1987]

Quote: optimistic concurrency control by dummy locks for detecting transaction failures; allows long-term transactions [»haliU7_1991]

Quote: lookahead-rollback synchronization--execute until a conflict is discovered then roll back the offending processes and reexecute [»jeffDR7_1985]

Quote: Bayou identifies stable and tentative writes. Tentative writes may be re-executed if earlier writes are received [»edwaWK10_1997]

Quote: in ADMS+-, updates are logged but not broadcast; if an access path is outdated, it is updated and cached; low cost [»rousN12_1986]

Quote: V's name cache flushes stale data when detected by using that data [»cherDR3_1988]

Quote: in some applications, can detect stale data on use and recover by locating a correct copy [»cherDR5_1986]

Quote: in some applications, cached data may be slightly out of date [»cherDR5_1986]

Quote: if 'almost up-to-date' data is ok, ADMS- will process a query on the workstation without waiting for current updates [»rousN12_1986]

Quote: a data fetch may be optional; e.g., an application could extrapolate, substitute, or forward a request [»cherDR5_1986]

Quote: a relaxed fetch operation may return stale data, incorrect data, or "don't know" [»cherDR5_1986]

Quote: a relaxed store operation may discard the store because of update conflicts

Quote: optimistic recovery for distributed system via repeatable, message-driven recovery units; reconstruct consistent state after failure [»stroRE8_1985]

Quote: roll-back initiates a state interval of a recovery unit; messages between recovery units define a partial order of state intervals [»stroRE8_1985]

Quote: Bayou uses optimistic concurrency control; a write consists of an update set and a dependency check that calls a merge procedure on failure [»edwaWK10_1997]

Quote: with time-split b-trees, read-only transactions only need a timestamp for concurrency control; ignores all later records [»lomeD6_1989]

Quote: if an analysis uses an item that becomes modified, the former value has a timestamp to limit its validity [»shavMJ2_1980]

Quote: if update conflict, KMS creates a new frame for manual recovery [»akscRM7_1988a]

Quote: KMS checks for update conflicts when frame is first modified [»akscRM7_1988a]

Quote: before release, need to merge bug fixes into main development work; DSEE provides a multi-window interactive merge command to help automate the process [»leblDB5_1984]

Quote: Cedar isolates changes by requiring an explicit request to merge changes into your version [»leblDB5_1984]

Quote: with reversible operations, execute immediately and redo if conflict [»sariS10_1985]

Quote: applications may tolerate lost or revoked store operations; e.g., if fetched and stored values are not compared [»cherDR5_1986]

Quote: either allow synchronization to back out a user's changes or propagate just the non-conflicting changes; the later is better for unsupervised reconciliations [»fostJN8_2005]

Quote: a syncronizer should be safe, maximal, and schema preserving; do not back out changes; do not make up content; do not propagate conflicts [»fostJN8_2005]