Sciweavers

358 search results - page 26 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
145
Voted
ISSTA
2006
ACM
15 years 10 months ago
Test input generation for java containers using state matching
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
Willem Visser, Corina S. Pasareanu, Radek Pel&aacu...
141
Voted
JVA
2006
IEEE
15 years 10 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
IPPS
2006
IEEE
15 years 10 months ago
An advanced performance analysis of self-stabilizing protocols: stabilization time with transient faults during convergence
A self-stabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended b...
Yoshihiro Nakaminami, Hirotsugu Kakugawa, Toshimit...
160
Voted
HPDC
2012
IEEE
13 years 6 months ago
Exploring the performance and mapping of HPC applications to platforms in the cloud
This paper presents a scheme to optimize the mapping of HPC applications to a set of hybrid dedicated and cloud resources. First, we characterize application performance on dedica...
Abhishek Gupta, Laxmikant V. Kalé, Dejan S....
PODC
2010
ACM
15 years 8 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela