Sciweavers

4164 search results - page 172 / 833
» Application and desktop sharing
Sort
View
HPCA
1998
IEEE
15 years 10 months ago
Hardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
Ye Zhang, Lawrence Rauchwerger, Josep Torrellas
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 10 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
PPOPP
1993
ACM
15 years 10 months ago
Integrating Message-Passing and Shared-Memory: Early Experience
This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programm...
David A. Kranz, Kirk L. Johnson, Anant Agarwal, Jo...
ICDCS
2010
IEEE
15 years 10 months ago
Are Your Hosts Trading or Plotting? Telling P2P File-Sharing and Bots Apart
—Peer-to-peer (P2P) substrates are now widely used for both file-sharing and botnet command-andcontrol. Despite the commonality of their substrates, we show that the different g...
Ting-Fang Yen, Michael K. Reiter
ESORICS
2006
Springer
15 years 10 months ago
Finding Peer-to-Peer File-Sharing Using Coarse Network Behaviors
A user who wants to use a service forbidden by their site's usage policy can masquerade their packets in order to evade detection. One masquerade technique sends prohibited tr...
Michael P. Collins, Michael K. Reiter