Optimal computation of census functions in the postal model

Discrete Applied Mathematics

Volumn 58, Issue 3, 1995, Pages 213-222

  Bar Noy, Amotz ^a   Kipnis, Shlomo ^a   Schieber, Baruch ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Census computation; Combining algorithms; Distributed systems; Gossiping; Message passing systems; Parallel computers; Postal model

Indexed keywords

EID: 0040252193     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)E0148-6     Document Type: Article

References (23)

1. Message-time tradeoff for combining data in message-passing systems
2. Multiple message broadcasting in the postal model
3. Multiple message broadcasting with generalized Fibonacci trees
4. An optimal algorithm for concatenating data in message-passing systems
5. PARIS: an approach to integrated high-speed private networks
6. New models and algorithms for future networks
7. The AURORA gigabit testbed
8. LogP: towards a realistic model of parallel computation
9. The J-Machine: a fine-grain concurrent computer
10. A survey of gossiping and broadcasting in communication networks
11. Optimal broadcast and summation in the LogP model
12. New gossips and telephones
13. The network architecture of the Connection Machine CM-5
14. Représentation des nombers naturels par une somme de nombres de Fibonacci ou de nombers de Lucas
15. Architecture and implementation of Vulcan