• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 12,381
Next 10 →

Table 1: Consistency options provided by the Composable Consistency (CC) Model. Consistency semantics are expressed for an access session by choosing one of the alternative options in each row, which are mutually exclusive. Options in italics indicate reasonable defaults that provide close-to-open semantics suitable for many applications. In our discussion, when we leave an option unspecified, we assume its default value.

in Flexible Consistency for Wide area Peer Replication
by unknown authors
"... In PAGE 2: ... There are multiple reasonable options along each of these dimensions. Based on this classification, we de- veloped a novel composable consistency model that pro- vides the options listed in Table1 . When these options are combined in different ways, they yield a rich collec- tion of consistency semantics for shared data that cover the needs of a broad variety of applications.... In PAGE 3: ...pplications access (i.e., read or write) their data in ses- sions, and that consistency can be enforced at session boundaries or before and after each read or write access. In the CC model, an application expresses its consis- tency requirements for each session as a vector of con- sistency options , as listed in Table1 . Each row of the table indicates several mutually exclusive options avail- able to control the aspect of consistency indicated in its first column.... ..."

TABLE V MUTUAL EXCLUSIVE VTRD

in Secure Link State Routing Protocol: A Framework for Network Survivability
by Dijiang Huang, Amit Sinha, Deep Medhi

Table I. Mutual exclusion locks.

in Scheduler-Conscious Synchronization
by Leonidas I. Kontothanassis, Robert W. Wisniewski, Michael L. Scott

Table 62: Time Information for mutual exclusion

in Data flow analysis for verifying properties of concurrent programs
by Matthew B. Dwyer, Lori A. Clarke, Gleb Naumovich, Jamieson M. Cobleigh 1994
"... In PAGE 100: ...38 29.57 Table62 : Time Information for mutual exclusion... ..."
Cited by 131

Table 64: Time Information for mutual exclusion

in Data flow analysis for verifying properties of concurrent programs
by Matthew B. Dwyer, Lori A. Clarke, Gleb Naumovich, Jamieson M. Cobleigh 1994
"... In PAGE 102: ...95 347.28 Table64 : Time Information for mutual exclusion... ..."
Cited by 131

Table 66: Time Information for mutual exclusion

in Data flow analysis for verifying properties of concurrent programs
by Matthew B. Dwyer, Lori A. Clarke, Gleb Naumovich, Jamieson M. Cobleigh 1994
"... In PAGE 104: ...02 174.33 Table66 : Time Information for mutual exclusion... ..."
Cited by 131

Table 62: Time Information for mutual exclusion

in Flow Analysis for Verifying Properties of Concurrent Software Systems
by Matthew B. Dwyer, Lori A. Clarke, Gleb Naumovich, Jamieson M. Cobleigh 1994
"... In PAGE 100: ...38 29.57 Table62 : Time Information for mutual exclusion... ..."
Cited by 131

Table 64: Time Information for mutual exclusion

in Flow Analysis for Verifying Properties of Concurrent Software Systems
by Matthew B. Dwyer, Lori A. Clarke, Gleb Naumovich, Jamieson M. Cobleigh 1994
"... In PAGE 102: ...95 347.28 Table64 : Time Information for mutual exclusion... ..."
Cited by 131

Table 66: Time Information for mutual exclusion

in Flow Analysis for Verifying Properties of Concurrent Software Systems
by Matthew B. Dwyer, Lori A. Clarke, Gleb Naumovich, Jamieson M. Cobleigh 1994
"... In PAGE 104: ...02 174.33 Table66 : Time Information for mutual exclusion... ..."
Cited by 131

Table 1. Reasoning on exclusions and dependencies.

in Incremental Filtering Algorithms for Precedence and Dependency Constraints
by Roman Barták 2006
"... In PAGE 6: ... Reversely, if activity A becomes invalid then all activities C such that (C ) A) 2 Dep are made invalid (see rule /1/ below). Keeping the exclusions and dependencies explicitly has the advantage of stronger ltering ( Table1 ). In particular, if exclusion fA; Bg is to be added to Ex and there is a dependency (A ) B) 2 Dep then we can make activ- ity A invalid (and the exclusion is resolved so it does not need to be kept in Ex).... ..."
Cited by 4
Next 10 →
Results 1 - 10 of 12,381
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University