Sciweavers

1422 search results - page 84 / 285
» How to measure a large open-source distributed system
Sort
View
PE
2011
Springer
167views Optimization» more  PE 2011»
15 years 1 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
ICPADS
1996
IEEE
15 years 10 months ago
Implementation of MAP: A system for mobile assistant programming
We have de ne a network programming model called Mobile Assistant Programming (MAP) for development and execution of communication applications in large scale networks of heteroge...
Stéphane Perret, Andrzej Duda
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 11 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
IMC
2007
ACM
15 years 7 months ago
A global view of kad
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...
ICDCS
2009
IEEE
16 years 3 months ago
Reducing Disk I/O Performance Sensitivity for Large Numbers of Sequential Streams
Retrieving sequential rich media content from modern commodity disks is a challenging task. As disk capacity increases, there is a need to increase the number of streams that are ...
George Panagiotakis, Michail Flouris, Angelos Bila...