Conflict-free star-access in parallel memory systems

Journal of Parallel and Distributed Computing

Volumn 66, Issue 11, 2006, Pages 1431-1441

  Das, Sajal K ^a   Finocchi, Irene ^b   Petreschi, Rossella ^b  

^a The University of Texas at Arlington   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Coloring; Data distribution; Hypercubes; Parallel memory systems; Tori

Indexed keywords

DATA DISTRIBUTION; HYPERCUBES; PARALLEL MEMORY SYSTEMS; TORI;

ALGORITHMS; BROADCASTING; COLORING; COMPUTER NETWORKS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

PARALLEL PROCESSING SYSTEMS;

EID: 33749537645     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2006.06.004     Document Type: Article

References (35)

1. Abello J.M., and Vitter J.S. External of Memory Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 50 (1999), AMS, Providence, RI
2. G. Agnarsson, M.M. Halldorson, Coloring powers of planar graphs, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA 00), 2000, pp. 654-662.
3. Auletta V., Das S.K., De Vivo A., Pinotti M.C., and Scarano V. Optimal tree access by elementary and composite templates in parallel memory systems. IEEE Trans. Parallel Distributed Systems 13 4 (2002) 399-412
4. Auletta V., De Vivo A., and Scarano V. Multiple template access of trees in parallel memory systems. J. Parallel Distributed Comput. 49 1 (1998) 22-39
5. Battiti R., Bertossi A., and Bonuccelli M.A. Assigning codes in wireless networks: bounds and scaling properties. Wireless Networks 5 (1999) 195-209
6. Berge C. Graphs and Hypergraphs (1973), North-Holland, Amsterdam
7. Bertossi A., and Pinotti M.C. Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees. J. Parallel Distributed Comput. 62 (2002) 1314-1333
8. Blelloch G.E., Gibbons P.B., Mattias Y., and Zagha M. Accounting for memory bank contentions and delay in high-bandwidth multiprocessors. IEEE Trans. Parallel Distributed Systems 8 (1997) 943-958
9. Budnik P., and Kuck D.J. The organization and use of parallel memories. IEEE Trans. Comput. 20 (1971) 1566-1569
10. T. Calamoneri, R. Petreschi, On the radiocoloring problem, Proceedings of the Fourth International Workshop on Distributed Computing, Mobile and Wireless Computing (IWDC'02), Lecture Notes in Computer Science, vol. 2571, 2002, pp. 118-127.
11. Chlamtac I., and Pinter S.S. Distributed nodes organizations algorithm for channel access in a multihop dynamic radio network. IEEE Trans. Comput. 36 (1987) 728-737
12. Colbourn C.J., and Heinrich K. Conflict-free access to parallel memories. J. Parallel Distributed Comput. 14 (1992) 193-200
13. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms (2001), McGraw-Hill, New York
14. R. Creutzburg, L. Andrews, Recent results on the parallel access to tree-like data structures-The isotropic approach, Proceedings of the International Conference on Parallel Processing, vol. 1, 1991, pp. 369-372.
15. S.K. Das, I. Finocchi, R. Petreschi, Star-coloring of graphs for conflict-free access in parallel memory systems, Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 04), IEEE CS Press, Silver Spring, MD, 2004.
16. S.K. Das, M.C. Pinotti, Conflict-free access to templates of trees and hypercubes in parallel memory systems, Proceedings of the Third International Conference on Computing and Combinatorics (COCOON 97), Lecture Notes in Computer Science, vol. 1276, 1997, pp. 1-10.
17. Das S.K., and Pinotti M.C. Optimal mappings of q-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates. J. Parallel Distributed Comput. 60 8 (2000) 998-1027
18. Das S.K., Pinotti M.C., and Sarkar F. Optimal and load balanced mapping of parallel priority queues in hypercubes. IEEE Trans. Parallel Distributed Systems 7 6 (1996) 555-564
19. S.K. Das, F. Sarkar, Conflict-free data access of arrays and trees in parallel memory systems, Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, Dallas (Texas) USA, 1994, pp. 377-383.
20. Georges J.P., Mauro D.W., and Stein M.I. Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math. 14 (2000) 28-35
21. M. Gössel, B. Rebel, Memories for parallel subtree access, Proceedings of the International Workshop on Parallel Algorithms and Architectures, Lecture Notes in Computer Science, vol. 299, 1987, pp. 122-130.
22. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
23. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
24. Kaznachey D., Jagota A., and Das S.K. Neural network-based heuristic algorithms for hypergraph coloring problems with applications. J. Parallel Distributed Comput. 63 9 (2003) 786-800
25. Kim K., and Prasanna Kumar V.K. Latin squares for parallel array access. IEEE Trans. Parallel Distributed Systems 4 4 (1993) 361-370
26. Leighton T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes (1992), Morgan Kaufmann Publishers, Los Altos, CA
27. Lih K.W. The equitable coloring of graphs. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization vol. 3 (1998), Kluwer, Boston 543-566
28. McCormick S.T. Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. Math. Program. 26 (1983) 153-171
29. Ngo H.Q., Du D.Z., and Graham R.L. New bounds on a hypercube coloring problem. Inform. Process. Lett. 84 5 (2002) 265-269
30. Shapiro H.D. Theoretical limitations on the efficient use of parallel memories. IEEE Trans. Comput. 17 (1978) 421-428
31. Vitter J.S., and Shriver E.A.M. Algorithms for parallel memory I: two-level memories. Algorithmica 12 2/3 (1994) 110-147
32. Vitter J.S., and Shriver E.A.M. Algorithms for parallel memory II: hierarchical multilevel memories. Algorithmica 12 2/3 (1994) 148-169
33. Wan P.J. Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Combin. Optim. 1 (1997) 179-186
34. Wijshoff H.A.G. Storing trees into parallel memories. Parallel Computing (1986), Elsevier Science Publishers, Amsterdam 253-261
35. Wijshoff H.A.G. Data Organization in Parallel Memories (1989), Kluwer Academic Publishers, Boston