Sciweavers

3181 search results - page 580 / 637
» Automated Deployment Support for Parallel Distributed Comput...
Sort
View
140
Voted
SPAA
2004
ACM
15 years 8 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
125
Voted
PODC
1999
ACM
15 years 6 months ago
Liveness-Preserving Simulation Relations
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
Paul C. Attie
HPCA
1998
IEEE
15 years 6 months ago
Enhancing Memory Use in Simple Coma: Multiplexed Simple Coma
Scalable shared-memory multiprocessors that are designed as Cache-Only Memory Architectures Coma allow automatic replication and migration of data in the main memory. This enhance...
Sujoy Basu, Josep Torrellas
137
Voted
OPODIS
2010
15 years 13 days ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...
122
Voted
HIPC
2009
Springer
15 years 9 days ago
Detailed analysis of I/O traces for large scale applications
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...
Nithin Nakka, Alok N. Choudhary, Wei-keng Liao, Le...