Sciweavers

244 search results - page 39 / 49
» Analyzing the performance of randomized information sharing
Sort
View
GRID
2006
Springer
13 years 7 months ago
Flexible and Secure Logging of Grid Data Access
-- In Grid collaborations, scientists use middleware to execute computational experiments, visualize results, and securely share data on resources ranging from desktop machines to ...
Weide Zhang, David Del Vecchio, Glenn S. Wasson, M...
SPAA
2004
ACM
14 years 1 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
CN
2006
60views more  CN 2006»
13 years 7 months ago
Loss strategies for competing AIMD flows
We study in this paper two competing AIMD flows that share a common bottleneck link. When congestion occurs, one (or both) flows will suffer a loss that will cause its throughput ...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T...
SIGMETRICS
2011
ACM
237views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
Analysis of DCTCP: stability, convergence, and fairness
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...
Mohammad Alizadeh, Adel Javanmard, Balaji Prabhaka...
KCAP
2005
ACM
14 years 1 months ago
Automated story capture from conversational speech
While storytelling has long been recognized as an important part of effective knowledge management in organizations, knowledge management technologies have generally not distingui...
Andrew S. Gordon, Kavita Ganesan