Sciweavers

247 search results - page 5 / 50
» Scalable propagation-based call graph construction algorithm...
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
Scalable constructions of fractional repetition codes in distributed storage systems
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
Joseph C. Koo, John T. Gill III
GC
2004
Springer
14 years 25 days ago
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...
PLDI
2009
ACM
14 years 2 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
HPCC
2005
Springer
14 years 29 days ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...
STACS
2010
Springer
14 years 2 months ago
Construction Sequences and Certifying 3-Connectedness
Given two 3-connected graphs G and H, a construction sequence constructs G from H (e. g. from the K4) with three basic operations, called the Barnette-Grünbaum operations. These...
Jens M. Schmidt