[Back]


Talks and Poster Presentations (with Proceedings-Entry):

M. Hutle:
"On omega in sparse networks (Fast Abstract)";
Talk: 20th IEEE International Conference on Software Maintenance (ICSM'04), Papeete,Tahiti,French Polynesia; 2004-03-03 - 2004-03-05; in: "Proceedings of the 10th IEEE International Symposium Pacific Rim Dependable Computing ", LAAS-CNRS, (2004), 37 - 38.



English abstract:
Most implementations of failure detectors rely on a fully connected network. In this paper we modify the Omega-algorithm of Aguilera et al. to work in a sparsely connected graph and and use this example for pointing out why implementing algorithms on sparse graphs can be beneficial.


Online library catalogue of the TU Vienna:
http://aleph.ub.tuwien.ac.at/F?base=tuw01&func=find-c&ccl_term=AC04968474


Created from the Publication Database of the Vienna University of Technology.