Sciweavers

1422 search results - page 79 / 285
» How to measure a large open-source distributed system
Sort
View
DSRT
2000
IEEE
15 years 10 months ago
Scheduling for Very Large Virtual Environments and Networked Games Using Visibility and Priorities
The problem of network bundwidth limitutions is encountered in ulmost uny distributed virtuul environment or networkedgume. In U typicul client-serversetup, where the virtuul worl...
Chris Faisstnauer, Dieter Schmalstieg, Werner Purg...
CLOUDCOM
2010
Springer
15 years 4 months ago
Efficient Metadata Generation to Enable Interactive Data Discovery over Large-Scale Scientific Data Collections
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...
Sangmi Lee Pallickara, Shrideep Pallickara, Milija...
ICC
2007
IEEE
106views Communications» more  ICC 2007»
16 years 19 days ago
A Distributed Approach to End-to-End Network Topology Inference
Abstract— To construct an efficient overlay network, the information of underlay is important. However, the inference of an underlay topology is not easy. We consider using end-...
Xing Jin, Qiuyan Xia, Shueng-Han Gary Chan
ICDCS
2009
IEEE
15 years 4 months ago
A Case Study of Traffic Locality in Internet P2P Live Streaming Systems
With the ever-increasing P2P Internet traffic, recently much attention has been paid to the topology mismatch between the P2P overlay and the underlying network due to the large a...
Yao Liu, Lei Guo, Fei Li, Songqing Chen
PDCN
2004
15 years 7 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer