Results 1  10
of
1,523,520
Weak Ordering  A New Definition
, 1990
"... A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory accesses will appear to execute atomically and in program order. An alternative model, weak ordering, offers greater perfor ..."
Abstract

Cited by 259 (14 self)
 Add to MetaCart
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory accesses will appear to execute atomically and in program order. An alternative model, weak ordering, offers greater
WeakOrder Extensions of an Order
 WG'97 (MOEHRING R.H., ED.), LECTURES NOTES IN COMPUTER SCIENCE
, 1997
"... In this paper, at first we describe a graph representing all the weakorder extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weakorder extensions of a partially ordered set, and implying a generation algorithm. Finally, ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper, at first we describe a graph representing all the weakorder extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weakorder extensions of a partially ordered set, and implying a generation algorithm. Finally
Weak Order Complexes
, 2004
"... The paper presents geometric models of the set WO of weak orders on a finite set X. In particular, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation of WO by means of a weak order polytope. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper presents geometric models of the set WO of weak orders on a finite set X. In particular, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation of WO by means of a weak order polytope. 1
Lattice Congruences of the Weak Order
 ORDER
, 2004
"... We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric description of the poset of joinirreducibles of the congruence la ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric description of the poset of joinirreducibles of the congruence
FLAG WEAK ORDER ON WREATH PRODUCTS
 SÉMINAIRE LOTHARINGIEN DE COMBINATOIRE 67 (2012), ARTICLE B67E
, 2012
"... A generating set for the wreath product Zr ≀Sn which leads to a nicely behaved weak order is presented. It is shown that the resulting poset has properties analogous to those of the weak order on the symmetric group: it is a selfdual lattice, ranked by the Foata–Han flag inversion number; any two m ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A generating set for the wreath product Zr ≀Sn which leads to a nicely behaved weak order is presented. It is shown that the resulting poset has properties analogous to those of the weak order on the symmetric group: it is a selfdual lattice, ranked by the Foata–Han flag inversion number; any two
An Alternative Characterization of Weak Order Dependence
, 2009
"... Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that can cater for reactive programs with their necessarily non–terminating computations. One important such definition is the de ..."
Abstract
 Add to MetaCart
is the definition of Weak Order Dependence, which was introduced to generalize classical control dependence for a control flow graph (CFG) without exit nodes. In this paper we show that for a standard CFG (where all nodes are reachable from each other), weak order dependence can be expressed in terms of traditional
Results 1  10
of
1,523,520