Sciweavers

782 search results - page 141 / 157
» Dag-Consistent Distributed Shared Memory
Sort
View
158
Voted
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
16 years 28 days ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
161
Voted
IPPS
2008
IEEE
16 years 23 days ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
193
Voted
ICPP
2006
IEEE
16 years 12 days ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
170
Voted
IRI
2005
IEEE
15 years 12 months ago
Data-knowledge-context: an application model for collaborative work
For many years, researchers and software developers have been seeking to develop systems and applications to enable efficient and effective group work and organizational memory. ...
Lee A. Iverson
268
Voted
SPAA
2005
ACM
15 years 12 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski