Sciweavers

8493 search results - page 1473 / 1699
» Implementing a distributed firewall
Sort
View
SPAA
2009
ACM
16 years 4 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
SPAA
2009
ACM
16 years 4 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
CAV
2009
Springer
133views Hardware» more  CAV 2009»
16 years 4 months ago
Cardinality Abstraction for Declarative Networking Applications
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
Andrey Rybalchenko, Atul Singh, Juan Antonio Navar...
KDD
2009
ACM
164views Data Mining» more  KDD 2009»
16 years 4 months ago
Social influence analysis in large-scale networks
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...
Jie Tang, Jimeng Sun, Chi Wang, Zi Yang
HPCA
2006
IEEE
16 years 4 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
« Prev « First page 1473 / 1699 Last » Next »