Sciweavers

5448 search results - page 109 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
PODC
2006
ACM
15 years 9 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
SIGCSE
2003
ACM
125views Education» more  SIGCSE 2003»
15 years 9 months ago
Introducing middle school girls to fault tolerant computing
During summer 2002, we ran a workshop module for a group of 28 eighth-grade girls. Our aim was ambitious: to introduce these students, ages 12 and 13, to computer science by focus...
Paolo A. G. Sivilotti, Murat Demirbas
GLOBAL
2003
Springer
15 years 9 months ago
Performance Evaluation for Global Computation
Abstract. Global computing applications co-ordinate distributed computations across widely-dispersed hosts. Such systems present formidable design and implementation challenges to ...
Linda Brodo, Pierpaolo Degano, Stephen Gilmore, Ja...
130
Voted
IPPS
1997
IEEE
15 years 8 months ago
Fast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial fx over an arbitrary ring, the shift of fx by c is the operation which computes coefficients of the polynomial fx + c. In this paper we conside...
Eugene V. Zima
ICPP
2009
IEEE
15 years 1 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun