Sciweavers

11242 search results - page 2142 / 2249
» Designing a Super-Peer Network
Sort
View
CASCON
1996
139views Education» more  CASCON 1996»
15 years 5 months ago
Data locality sensitivity of multithreaded computations on a distributed-memory multiprocessor
The locality of the data in parallel programs is known to have a strong impact on the performance of distributed-memory multiprocessor systems. The worse the locality in access pa...
Xinmin Tian, Shashank S. Nemawarkar, Guang R. Gao,...
HPDC
2010
IEEE
15 years 5 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
151
Voted
GD
2008
Springer
15 years 5 months ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...
152
Voted
GI
2008
Springer
15 years 5 months ago
A Novel Conceptual Model for Accessing Distributed Data and Applications, as well as Devices
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...
Lucia Terrenghi, Thomas Lang
CCS
2010
ACM
15 years 4 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
« Prev « First page 2142 / 2249 Last » Next »