Sciweavers

1422 search results - page 229 / 285
» How to measure a large open-source distributed system
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Pagoda: a dynamic overlay network for routing, data management, and multicasting
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
Ankur Bhargava, Kishore Kothapalli, Chris Riley, C...
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 12 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
SOSP
2005
ACM
15 years 8 months ago
FS2: dynamic data replication in free disk space for improving disk performance and energy consumption
Disk performance is increasingly limited by its head positioning latencies, i.e., seek time and rotational delay. To reduce the head positioning latencies, we propose a novel tech...
Hai Huang, Wanda Hung, Kang G. Shin
EMSOFT
2007
Springer
15 years 6 months ago
Design and implementation of a comprehensive real-time java virtual machine
The emergence of standards for programming real-time systems in Java has encouraged many developers to consider its use for systems previously only built using C, Ada, or assembly...
Joshua S. Auerbach, David F. Bacon, Bob Blainey, P...
SENSYS
2006
ACM
15 years 5 months ago
Virtual high-resolution for sensor networks
The resolution at which a sensor network collects data is a crucial parameter of performance since it governs the range of applications that are feasible to be developed using tha...
Aman Kansal, William J. Kaiser, Gregory J. Pottie,...