4926 search results - page 168 / 986 » Two Graph Algorithms On an Associative Computing Model |
136
click to vote
DSN
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
160
Voted
GEOS
2007
Springer
15 years 11 months ago
2007
Springer
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of...
140
click to vote
IJPP
2011
14 years 12 months ago
2011
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
124
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
139
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...