Sciweavers

2950 search results - page 173 / 590
» Computing with Infinitely Many Processes
Sort
View
152
Voted
IPPS
2007
IEEE
16 years 18 days ago
Pipelining Tradeoffs of Massively Parallel SuperCISC Hardware Functions
Parallel processing using multiple processors is a well-established technique to accelerate many different classes of applications. However, as the density of chips increases, ano...
Colin J. Ihrig, Justin Stander, Alex K. Jones
CONCUR
2005
Springer
15 years 12 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
ICDCS
1995
IEEE
15 years 9 months ago
Newtop: A Fault-Tolerant Group Communication Protocol
: A general purpose group communication protocol suite called Newtop is described. It is assumed that processes can simultaneously belong to many groups, group size could be large,...
Paul D. Ezhilchelvan, Raimundo A. Macêdo, Sa...
ICPP
1999
IEEE
15 years 10 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward