Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
653,816
Distributed Snapshots: Determining Global States of Distributed Systems
- ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1985
"... This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to s ..."
Abstract
-
Cited by 1208 (6 self)
- Add to MetaCart
disappeared.” The stable property detection problem is that of devising algorithms to detect a given stable property. Global state detection can also be used for checkpointing.
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract
-
Cited by 3252 (70 self)
- Add to MetaCart
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type
Trace Scheduling: A Technique for Global Microcode Compaction
- IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract
-
Cited by 683 (5 self)
- Add to MetaCart
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages
Efficient graph-based image segmentation.
- International Journal of Computer Vision,
, 2004
"... Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show ..."
Abstract
-
Cited by 940 (1 self)
- Add to MetaCart
that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm
Global properties of . . .
, 1996
"... We describe degenerations of projective plane curves to curves containing a fixed line l as a component, and show that H 1 (V n,d,m, O(r)) = 0, r ∈ Z, where Vn,d,m ⊂ P N (N = n(n + 3)/2) is the subscheme consisting of irreducible plane curves having smooth contact of order at least m with l at a ..."
Abstract
- Add to MetaCart
We describe degenerations of projective plane curves to curves containing a fixed line l as a component, and show that H 1 (V n,d,m, O(r)) = 0, r ∈ Z, where Vn,d,m ⊂ P N (N = n(n + 3)/2) is the subscheme consisting of irreducible plane curves having smooth contact of order at least m with l at a fixed point p ∈ l and d nodes and no other singularities.
Global properties of spacelike curves in
, 2005
"... We study global properties of closed spacelike curves in Minkowski 3-space. 1 ..."
Abstract
- Add to MetaCart
We study global properties of closed spacelike curves in Minkowski 3-space. 1
Generative communication in Linda
- ACM Transactions on Programming Languages and Systems
, 1985
"... Generative communication is the basis of a new distributed programming langauge that is intended for systems programming in distributed settings generally and on integrated network computers in particular. It differs from previous interprocess communication models in specifying that messages be adde ..."
Abstract
-
Cited by 1194 (2 self)
- Add to MetaCart
be added in tuple-structured form to the computation environment, where they exist as named, independent entities until some process chooses to receive them. Generative communication results in a number of distinguishing properties in the new language, Linda, that is built around it. Linda is fully
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract
-
Cited by 2075 (49 self)
- Add to MetaCart
. It can be used to support a wide range of peer-to-peer applications like global data storage, global data sharing, and naming. An insert operation in Pastry stores an object at a user-defined number of diverse nodes within the Pastry network. A lookup operation reliably retrieves a copy of the requested
Results 1 - 10
of
653,816
