432 search results - page 12 / 87 » Internally deterministic parallel algorithms can be fast |
72
Voted
SIROCCO
2008
14 years 11 months ago
2008
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between t...
ANCS
2006
ACM
15 years 3 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
SIROCCO
2007
14 years 11 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
105
click to vote
HPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
102
click to vote
POPL
2011
ACM
14 years 9 days ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...