Sciweavers

1033 search results - page 57 / 207
» Redistribution in distributed Ada
Sort
View
EUROSYS
2008
ACM
14 years 7 months ago
BorderPatrol: isolating events for black-box tracing
Causal request traces are valuable to developers of large concurrent and distributed applications, yet difficult to obtain. Traces show how a request is processed, and can be anal...
Eric Koskinen, John Jannotti
SAC
2010
ACM
14 years 4 months ago
Maintaining data reliability without availability in P2P storage systems
Peer-to-peer (P2P) storage is a promising technology to provide users with cheap and online persistence. However, due the instability of these infrastructures, P2P storage systems...
Lluis Pamies-Juarez, Pedro García Ló...
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
14 years 4 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
WIKIS
2009
ACM
14 years 4 months ago
Measuring the wikisphere
Due to the inherent difficulty in obtaining experimental data from wikis, past quantitative wiki research has largely been focused on Wikipedia, limiting the degree that it can be...
Jeff Stuckman, James Purtilo
EMSOFT
2007
Springer
14 years 4 months ago
Loosely time-triggered architectures based on communication-by-sampling
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...
Albert Benveniste, Paul Caspi, Marco Di Natale, Cl...