Home

Paulo Sérgio Almeida

  1. Spectra: Robust Estimation of Distribution Functions in Networks.

    Mon, 04/09/2012 - 15:01 — SomNambul
    Authors: Paulo Jesus, Carlos Baquero, Paulo Sérgio Almeida, Miguel Borges
    Subjects: and Cluster Computing, Distributed, Parallel
    Abstract

    Distributed aggregation allows the derivation of a given global aggregate
    property from many individual local values in nodes of an interconnected
    network system. Simple aggregates such as minima/maxima, counts, sums and
    averages have been thoroughly studied in the past and are important tools for
    distributed algorithms and network coordination. Nonetheless, this kind of
    aggregates may not be comprehensive enough to characterize biased data
    distributions or when in presence of outliers, making the case for richer
    estimates of the values on the network.

  2. Dependability in Aggregation by Averaging.

    Wed, 12/01/2010 - 16:01 — SomNambul
    Authors: Paulo Jesus, Carlos Baquero, Paulo Sérgio Almeida
    Subjects: and Cluster Computing, Distributed, Parallel
    Abstract

    Aggregation is an important building block of modern distributed
    applications, allowing the determination of meaningful properties (e.g. network
    size, total storage capacity, average load, majorities, etc.) that are used to
    direct the execution of the system. However, the majority of the existing
    aggregation algorithms exhibit relevant dependability issues, when prospecting
    their use in real application environments. In this paper, we reveal some
    dependability issues of aggregation algorithms based on iterative averaging
    techniques, giving some directions to solve them.

Math-arch

Syndicate content