Search results for "Gossip"
showing 10 items of 14 documents
Gossip
2019
Nowadays, a growing number of servers and workstations feature an increasing number of GPUs. However, slow communication among GPUs can lead to poor application performance. Thus, there is a latent demand for efficient multi-GPU communication primitives on such systems. This paper focuses on the gather, scatter and all-to-all collectives, which are important operations for various algorithms including parallel sorting and distributed hashing. We present two distinct communication strategies (ring-based and flow-oriented) to generate transfer plans for their topology-aware implementation on NVLink-connected multi-GPU systems. We achieve a throughput of up to 526 GB/s for all-to-all and 148 G…
Maximum Lifetime of the Wireless Sensor Network and the Gossip Problem
2018
In the gossip problem each node of the graph G possesses a unique piece of information - the gossip message. A sequence of one-way or two-way communications between pair of nodes is made to spread the messages so that any node of the graph knows all the gossips. The question is, what is the minimum number of calls between pairs of nodes needed to exchange all gossip messages? The solution to the two-way communication gossip problem is that \(2N-4\) calls (\(N\ge 4\)) suffice if and only if the graph contains a four cycle subgraph. For one-way communication problem the classical results states that in a strongly connected graph \(2N-2\) calls (\(N\ge 4\)) suffice. In this paper we consider t…
Quantized Dissensus in Networks of Agents subject to Death and Duplication
2012
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…
Celebrities' Memorial Afterlives: Obituaries, Tributes, and Posthumous Gossip in the Romanian Media Deathscape.
2017
Cross-culturally, dead are protected from posthumous negative evaluations by the universal “nil nisi bonum” precept that governs the ethics within the community of mourners. In this study, we set out to test the observance of this injunction against posthumous gossiping in the Romanian public deathscape. Obituaries and other posthumous articles ( N = 1,148) were collected that covered the deaths of 63 celebrities who passed away between 2013 and 2016. Materials were gathered from the digital archives of three Romanian news sources (a news agency, a “quality” newspaper, and a tabloid), published one week after the moment of death. The findings show that 22% of the articles do contain negati…
Concurrent and Distributed Projection through Local Interference for Wireless Sensor Networks
2012
In this paper we use a gossip algorithm to obtain the projection of the observed signal into a subspace of lower dimension. Gossip algorithms allow distributed, fast and efficient computations on a Wireless Sensor Network and they can be properly modified to evaluate the sought projection. By combining computation coding with gossip algorithms we proposed a novel strategy that leads to important saving on convergence time as well as exponentially decreasing energy consumption, as the size of the network increases.
Privacy-Preserving Overgrid: Secure Data Collection for the Smart Grid
2020
In this paper, we present a privacy-preserving scheme for Overgrid, a fully distributed peer-to-peer (P2P) architecture designed to automatically control and implement distributed Demand Response (DR) schemes in a community of smart buildings with energy generation and storage capabilities. To monitor the power consumption of the buildings, while respecting the privacy of the users, we extend our previous Overgrid algorithms to provide privacy preserving data aggregation (PP-Overgrid). This new technique combines a distributed data aggregation scheme with the Secure Multi-Party Computation paradigm. First, we use the energy profiles of hundreds of buildings, classifying the amount of &ldquo
Quantized Dissensus in switching networks with nodes death and duplication* *Research supported by MURST-PRIN “Robust Techniques for uncertain system…
2009
Abstract In this paper we discuss agents exchanging quantized flows to diverge one from the others according to a dissensus protocol. A Quantized Gossip algorithm is considered. Evolutions of the states during switching intervals and at switching instants and their property are described and analyzed. The modeling of switching systems describing networks where death and duplication processes occur is described. Some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.
Gossip: The Architecture of SpreadPlots
2003
A spreadplot is a visualization that simultaneously shows several different views of a dataset or model. The individual views can be dynamic, can support high-interaction direct manipulation, and can be algebraically linked with each other, possibly via an underlying statistical model. Thus, when a data analyst changes the information shown in one view of a statistical model, the changes can be processed by the model and instantly represented in the other views. Spreadplots simplify the analyst's task when many different plots are relevant to the analysis at hand, as is the case in regression analysis, where there are many plots that can be used for model building and diagnosis. On the othe…
¿Qué creen? No soy chismoso pero…. Mexican gossip: Affiliation or self-interest?
2017
Whilst being taken more seriously, especially in anthropological and sociological studies, gossip is still often regarded trivial and of little academic research interest. Given that it is unstoppable, persistent and often enjoyable (Epstein, 2011), gossip has been examined in terms of function (e.g. talk about intimate matters to express shared values) and as a form of communication *for example, to express resistance (Goodman & Ben-Ze’ev, 1994). In this chapter, I examine the importance of gossip in the Mexican context. In Mexico, gossip has been examined in terms of function e.g. (Hagene, 2010), situation (Vázquez Garcia y Chávez Arellano, 2008) and resistance (Vázquez García 2007). …
How gender affects gossip and conversation : examining the assumptions in Deborah Tannen's "You just don't understand!" (1990)
2018
Tämä kandidaatintutkielma käsittelee sukupuolta ja sen roolia erilaisissa kielenkäyttötilanteissa, erityisesti juoruilussa. Tutkimuksen tavoitteena on luoda ymmärrystä ja nostaa esiin niitä ennakkoluuloja, joita yhteiskunnassa vallitsee sukupuolia ja juoruilua kohtaan. Tutkimus keskittyy löytämään mahdollisia eroavaisuuksia sukupuolien välillä, tarjoten samalla mahdollisia selityksiä aikaisemman tutkimustiedon valossa. Tutkimuksen tuloksia vertailtiin suosittuun, mutta kiisteltyyn Deborah Tannenin You Just Don’t Understand! (1990) teokseen. Tutkimus toteutettiin nettikyselyllä, jota jaettiin erilaisilla sosiaalisen median sivustoilla mahdollisimman laajan otannan takaamiseksi. Vastauksia ol…