On the dynamic initialization of parallel computers

Journal of Supercomputing

Volumn 15, Issue 1, 2000, Pages 5-24

  Olariu, Stephan ^a   Stojmenović, Ivan ^b   Zomaya, Albert ^c  

^a ECS Building   (United States)

^b UNIVERSITY OF OTTAWA   (Canada)

^c UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; INTERCONNECTION NETWORKS; PARALLEL ALGORITHMS; TREES (MATHEMATICS);

BINARY TREES; INITIALIZATION PROBLEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033886441     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008120609055     Document Type: Article

References (18)

1. H. Attiya. Distributed computing theory, In A. Zomaya, ed. Parallel and Distributed Computing Handbook, pp. 127-162. McGraw Hill, New York, 1996.
2. D. Bhagavathi D., C.E. Grosch, and S. Olariu. A greedy hypercube-labeling algorithm. The Computer Journal, 37: 124-128, 1994.
3. Y.-C. Chen, W.-T. Chen, G.-H. Chen, and J.-P. Sheu. Designing efficient parallel algorithms on mesh connected computers with multiple broadcasting. IEEE Trans. Parallel and Distributed Systems, 1, 241-246, 1990.
4. P. Flocchini and B. Mans. Optimal elections in labeled hypercubes. Journal of Parallel and Distributed Computing, 33: 76-83, 1996.
5. M. Jane, R. Fawcett, and T. Mawly. Transputer Applications - Progress and Prospects, IOS Press, Amsterdam, 1992.
6. V.P. Kumar and C.S. Raghavendra. Array processor with multiple broadcasting. Journal of Parallel and Distributed Computing, 2: 173-190, 1987.
7. R.J. Lipton and A. Park. The processor identity problem, Information Processing Letters, 36: 91-94, 1990.
8. B. Mans. Optimal distributed algorithms in unlabeled tori and chordal rings. In Proceedings of the International Colloquium on Structural Information and Communication Complexity, Sirocco, Italy, June 6-8, 1996.
9. M. Maresca and H. Li. Connection autonomy and SIMD computers: a VLSI implementation. Journal of Parallel and Distributed Computing, 7: 302-320, 1989.
10. K. Nakano. Optimal initializing algorithms for a reconfigurable mesh. Journal of Parallel and Distributed Computing, 24: 218-223, 1995.
11. D. Nassimi and S. Sahni. An optimal routing algorithm for mesh-connected parallel computers. J. of ACM, 27(1): 6-29, 1980.
12. D. Nath, S.N. Maheshwari, and P.C.P. Bhatt. Efficient VLSI networks for parallel processing based on orthogonal trees. IEEE Transactions on Computers, 32: 569-581, 1983.
13. S. Olariu and I. Stojmenovic. On the dynamic initialization of parallel computers. In Proceedings of 10th IEEE International Symposium on High Performance Computers HPCS'96 (CD-ROM), Ottawa, Canada, June 5-7, 1996.
14. rd IEEE Comp. Soc. International Conf., 196-199, 1988.
15. K.V.S. Ramarao. Distributed algorithms for network recognition problems. IEEE Transactions on Computers, C-38, 1240-1248, 1989.
16. G. Singh. Leader election in the presence of link failures. IEEE Transactions on Parallel and Distributed Systems, 7, 231-236, 1996.
17. S. Sur and P.K. Srimani. Incrementally extendible hypercubes. Proc. Int. Phoenix Conf. on Computers and Communications, 1-7, 1992.
18. M. Yamashita and T. Kameda. Computing on anonymous networks. IEEE Transactions on Parallel and Distributed Systems, 7(1): 69-96, 1996.