Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Commitment_ordering> ?p ?o. }

• Commitment_ordering abstract "Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related applications. It allows optimistic (non-blocking) implementations. With the proliferation of multi-core processors, CO has been also increasingly utilized in concurrent programming, transactional memory, and especially in software transactional memory (STM) for achieving serializability optimistically. CO is also the name of the resulting transaction schedule (history) property, which was originally defined in 1988 with the name dynamic atomicity. In a CO compliant schedule the chronological order of commitment events of transactions is compatible with the precedence order of the respective transactions. CO is a broad special case of conflict serializability, and effective means (reliable, high-performance, distributed, and scalable) to achieve global serializability (modular serializability) across any collection of database systems that possibly use different concurrency control mechanisms (CO also makes each system serializability compliant, if not already).Each not-CO-compliant database system is augmented with a CO component (the commitment order coordinator—COCO) which orders the commitment events for CO compliance, with neither data-access nor any other transaction operation interference. As such CO provides a low overhead, general solution for global serializability (and distributed serializability), instrumental for global concurrency control (and distributed concurrency control) of multi database systems and other transactional objects, possibly highly distributed (e.g., within cloud computing, grid computing, and networks of smartphones). An atomic commitment protocol (ACP; of any type) is a fundamental part of the solution, utilized to break global cycles in the conflict (precedence, serializability) graph. CO is the most general property (a necessary condition) that guarantees global serializability, if the database systems involved do not share concurrency control information beyond atomic commitment protocol (unmodified) messages, and have no knowledge whether transactions are global or local (the database systems are autonomous). Thus CO (with its variants) is the only general technique that does not require the typically costly distribution of local concurrency control information (e.g., local precedence relations, locks, timestamps, or tickets). It generalizes the popular strong strict two-phase locking (SS2PL) property, which in conjunction with the two-phase commit protocol (2PC) is the de facto standard to achieve global serializability across (SS2PL based) database systems. As a result CO compliant database systems (with any, different concurrency control types) can transparently join such SS2PL based solutions for global serializability.In addition, locking based global deadlocks are resolved automatically in a CO based multi-database environment, an important side-benefit (including the special case of a completely SS2PL based environment; a previously unnoticed fact for SS2PL).Furthermore, strict commitment ordering (SCO; Raz 1991c), the intersection of Strictness and CO, provides better performance (shorter average transaction completion time and resulting better transaction throughput) than SS2PL whenever read-write conflicts are present (identical blocking behavior for write-read and write-write conflicts; comparable locking overhead). The advantage of SCO is especially significant during lock contention. Strictness allows both SS2PL and SCO to use the same effective database recovery mechanisms.Two major generalizing variants of CO exist, extended CO (ECO; Raz 1993a) and multi-version CO (MVCO; Raz 1993b). They as well provide global serializability without local concurrency control information distribution, can be combined with any relevant concurrency control, and allow optimistic (non-blocking) implementations. Both use additional information for relaxing CO constraints and achieving better concurrency and performance. Vote ordering (VO or Generalized CO (GCO); Raz 2009) is a container schedule set (property) and technique for CO and all its variants. Local VO is a necessary condition for guaranteeing global serializability, if the atomic commitment protocol (ACP) participants do not share concurrency control information (have the generalized autonomy property). CO and its variants inter-operate transparently, guaranteeing global serializability and automatic global deadlock resolution also together in a mixed, heterogeneous environment with different variants.".
• Commitment_ordering wikiPageExternalLink freeabs_all.jsp?arnumber=281924.
• Commitment_ordering wikiPageExternalLink nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=%22commitment+ordering%22.TI.&OS=TTL.
• Commitment_ordering wikiPageExternalLink nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=2&f=G&l=50&co1=AND&d=PTXT&s1=%22commitment+ordering%22.TI.&OS=TTL.
• Commitment_ordering wikiPageExternalLink nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=3&f=G&l=50&co1=AND&d=PTXT&s1=%22commitment+ordering%22.TI.&OS=TTL.
• Commitment_ordering wikiPageExternalLink citation.cfm?id=153858.
• Commitment_ordering wikiPageExternalLink the_principle_of_co.
• Commitment_ordering wikiPageID "4379212".
• Commitment_ordering wikiPageRevisionID "596925106".
• Commitment_ordering essayLike "November 2011".
• Commitment_ordering hasPhotoCollection Commitment_ordering.
• Commitment_ordering jargon "November 2011".
• Commitment_ordering moreFootnotes "November 2011".
• Commitment_ordering notability "December 2011".
• Commitment_ordering subject Category:Concurrency_control.
• Commitment_ordering subject Category:Data_management.
• Commitment_ordering subject Category:Databases.
• Commitment_ordering subject Category:Distributed_algorithms.
• Commitment_ordering subject Category:Transaction_processing.
• Commitment_ordering type Abstraction100002137.
• Commitment_ordering type Act100030358.
• Commitment_ordering type Activity100407535.
• Commitment_ordering type Algorithm105847438.
• Commitment_ordering type DistributedAlgorithms.
• Commitment_ordering type Event100029378.
• Commitment_ordering type Procedure101023820.
• Commitment_ordering type PsychologicalFeature100023100.
• Commitment_ordering type Rule105846932.
• Commitment_ordering type YagoPermanentlyLocatedEntity.
• Commitment_ordering comment "Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related applications. It allows optimistic (non-blocking) implementations. With the proliferation of multi-core processors, CO has been also increasingly utilized in concurrent programming, transactional memory, and especially in software transactional memory (STM) for achieving serializability optimistically.".
• Commitment_ordering label "Commitment ordering".
• Commitment_ordering label "コミットメント順序付け".
• Commitment_ordering sameAs コミットメント順序付け.
• Commitment_ordering sameAs m.0b_2v6.
• Commitment_ordering sameAs Q5152903.
• Commitment_ordering sameAs Q5152903.
• Commitment_ordering sameAs Commitment_ordering.
• Commitment_ordering wasDerivedFrom Commitment_ordering?oldid=596925106.
• Commitment_ordering isPrimaryTopicOf Commitment_ordering.