Sciweavers

292 search results - page 23 / 59
» Computing Replica Placement in Distributed Systems
Sort
View
SC
2000
ACM
15 years 4 months ago
Is Data Distribution Necessary in OpenMP?
This paper investigates the performance implications of data placement in OpenMP programs running on modern ccNUMA multiprocessors. Data locality and minimization of the rate of r...
Dimitrios S. Nikolopoulos, Theodore S. Papatheodor...
109
Voted
ICDCS
2006
IEEE
15 years 5 months ago
PRINS: Optimizing Performance of Reliable Internet Storages
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
Qing Yang, Weijun Xiao, Jin Ren
WORM
2004
15 years 1 months ago
Toward understanding distributed blackhole placement
The monitoring of unused Internet address space has been shown to be an effective method for characterizing Internet threats including Internet worms and DDOS attacks. Because the...
Evan Cooke, Michael Bailey, Zhuoqing Morley Mao, D...
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
14 years 11 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
CCGRID
2004
IEEE
15 years 3 months ago
Remote partial file access using compact pattern descriptions
We present a method for the efficient access to parts of remote files. The efficiency is achieved by using a file format independent compact pattern description, that allows to re...
Thorsten Schütt, André Merzky, Andrei ...