Sciweavers

856 search results - page 169 / 172
» Design and Performance of the Dawning Cluster File System
Sort
View
98
Voted
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
15 years 4 months ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
109
Voted
CSMR
2004
IEEE
15 years 3 months ago
Supporting Architectural Restructuring by Analyzing Feature Models
In order to lower the risk, reengineering projects aim at high reuse rates. Therefore, tasks like architectural restructuring have to be performed in a way that developed new syst...
Ilian Pashov, Matthias Riebisch, Ilka Philippow
JAVA
2000
Springer
15 years 3 months ago
Development routes for message passing parallelism in Java
Java is an attractive environment for writing portable message passing parallel programs. Considerable work in message passing interface bindings for the C and Fortran languages h...
J. A. Mathew, Heath A. James, Kenneth A. Hawick
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 5 days ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
MOBIHOC
2007
ACM
15 years 11 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi