Sciweavers

393 search results - page 33 / 79
» FIFO Communication Models in Operating Systems for Reconfigu...
Sort
View
SRDS
1998
IEEE
14 years 27 days ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz
QEST
2007
IEEE
14 years 2 months ago
A Performance Analysis Tool for Scenario-Aware Streaming Applications
Dataflow models are often used for analysing streaming applications. The recently introduced scenario-aware extension of the synchronous dataflow model can capture the dynamism ...
Bart D. Theelen
ENTCS
2007
100views more  ENTCS 2007»
13 years 8 months ago
Extensionality of Spatial Observations in Distributed Systems
We discuss the tensions between intensionality and extensionality of spatial observations in distributed systems, showing that there are natural models where extensional observati...
Luís Caires, Hugo Torres Vieira
ARTS
1999
Springer
14 years 29 days ago
Process Algebra with Probabilistic Choice
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
Suzana Andova
RANDOM
1998
Springer
14 years 26 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang