Broadcasting on a budget in the multi-service communication model

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn , Issue , 1998, Pages 163-170

  Itkis, G ^a   Newman, I ^b   Schuster, A ^c  

^a NDS Technologies Israel Ltd   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

QUALITY OF SERVICE;

COMMUNICATION MEDIA; COMMUNICATION MODELING; COMMUNICATION PROBLEMS; COMMUNICATION TECHNOLOGIES; EMERGING TECHNOLOGIES; INTERNET SERVICES; NETWORK COMMUNICATIONS; SERVICE ACTIVATION;

BUDGET CONTROL;

EID: 0006772402     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HIPC.1998.737985     Document Type: Conference Paper

References (10)

1. A. Bar-Noy, J. Bruck, C. Ho, S. Kipnis, and B. Schieber. Computing global combine operations in the multi-port postal model. IEEE Transactions on Parallel and Distributed Systems, 6(8):896-900, August 1995.
2. A. Bar-Noy and S. Kipnis. Multiple message broadcasting in the postal model. In Proc. 7th International Parallel Processing Symposium, pages 463-470. IEEE, April 1993.
3. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message-passing systems. Mathematical Systems Theory, 27(5):431-452, 1994.
4. A. Bar-Noy, S. Kipnis, and B. Schieber. Optimal computation of census functions in the postal model. Discrete Applied Mathematics, 58:213-222, 1995.
5. J. Bruck, R. Cypher, and C. Ho. Multiple message broadcasting with generalized Fibonacci trees. In Proc. 4th Symposium on Parallel and Distributed Processing, pages 424-431. IEEE, December 1992.
6. J. Bruck and C. Ho. Efficient global combine operations in multi-port message-passing systems. Parallel Processing Letters, 3(4):335-346, December 1993.
7. J. Bruck, C. Ho, S. Kipnis, and D. Weathersby. Efficient algorithms for all-To-All communications in multi-port message-passing systems. In Proc. 6th Annual Symposium on Parallel Algorithms and Architectures, pages 298-309. ACM, June 1994. To appear in IEEE Transactions on Parallel and Distributed Systems.
8. S.-N. Choi andM. Golin. Lopsided trees: Algorithms, Analyses and Applications. In Proc. of the 23rd Intl. Colloquium on Automata Languages and Programming, 1996.
9. M. Golin and A. Schuster. Optimal Point-To-Point Broadcast Algorithms via Lopsided Trees. In Proc. 5th Israeli Symp. on Theory of Computing and Systems, pages 63-73, 1997. To appear in Disc. Appl. Math.
10. O. Etzioni and S. Hanks and T. Jiang and R.M. Karp and O. Madani and O. Waarts. Efficient Information Gathering on the Internet. In Proc. 37th Symp. on Foundations of Computer Science, pages 234-243, 1996.