Sciweavers

1517 search results - page 24 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
AAIM
2009
Springer
172views Algorithms» more  AAIM 2009»
14 years 1 days ago
PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications
Abstract. This paper presents PLDA, our parallel implementation of Latent Dirichlet Allocation on MPI and MapReduce. PLDA smooths out storage and computation bottlenecks and provid...
Yi Wang, Hongjie Bai, Matt Stanton, Wen-Yen Chen, ...
VECPAR
2004
Springer
14 years 22 days ago
Data Management in Large-Scale P2P Systems
Peer-to-peer (P2P) computing offers new opportunities for building highly distributed data systems. Unlike client-server computing, P2P can operate without central coordination and...
Patrick Valduriez, Esther Pacitti
HPDC
2006
IEEE
14 years 1 months ago
Effective Prediction of Job Processing Times in a Large-Scale Grid Environment
Grid applications that use a considerable number of processors for their computations need effective predictions of the expected computation times on the different nodes. Currentl...
Menno Dobber, Robert D. van der Mei, Ger Koole
ICA3PP
2005
Springer
14 years 28 days ago
Mining Traces of Large Scale Systems
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
Christophe Cérin, Michel Koskas
IPPS
2007
IEEE
14 years 1 months ago
A Model for Large Scale Self-Stabilization
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
Thomas Hérault, Pierre Lemarinier, Olivier ...