36 search results - page 1 / 8 » Efficient Algorithms for Prefix and General Prefix Computati... |
ICPADS
1997
IEEE
13 years 8 months ago
1997
IEEE
The paper presents eficient scalable algorithms for performing Prefix (PC) and General Prefix (GPC) Computations on a Distributed Shared Memory ( D S M ) system with applications....
GG
2010
Springer
13 years 5 months ago
2010
Springer
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
ECAI
1998
Springer
13 years 8 months ago
1998
Springer
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
ISCA
2002
IEEE
13 years 4 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
ICDCS
1996
IEEE
13 years 8 months ago
1996
IEEE
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...