Star-coloring of graphs for conflict-free access to parallel memory systems

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 691-700

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

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONFLICT-FREE ACCESS; HYPERCUBES; MEMORY SYSTEMS; STAR-COLORING;

ALGORITHMS; COLOR; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; TOPOLOGY;

DATA STORAGE EQUIPMENT;

EID: 12444297571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. J. M. Abello and J. S. Vitter. External Memory Algorithms. DIMACS Series in Discrete Math, and Theoretical Computer Science, 50, AMS, 1999.
2. V. Auletta, S. K. Das, A. De Vivo, M. C. Pinotti, and V. Scarano. Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems. IEEE TPDS, 13:4, 399-412, 2002.
3. V. Auletta, A. De Vivo, V. Scarano. Multiple Template Access of Trees in Parallel Memory Systems. JPDC, 49:1, 22-39, 1998.
4. G. E. Blelloch, P. B. Gibbons, Y. Mattias, and M. Zagha. Accounting for Memory Bank Contentions and Delay in High-bandwidth Multiprocessors. IEEE TPDS, 8, 943-958, 1997.
5. R. L. Brooks. On Colouring the Nodes of a Network. Proc. Cambr. Phil. Soc., 37, 194-197, 1941.
6. P. Budnik and D. J. Kuck. The Organization and Use of Parallel Memories. IEEE Trans. on Computers, 20, 1566-1569, 1971.
7. T. Calamoneri and R. Petreschi. On the Radiocoloring Problem. Proc. 4th Work. on Distr., Mobile and Wireless Comp., LNCS 2571, 118-127, 2002.
8. I. Chlamtac and S. S. Pinter. Distributed Nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Trans. on Computers, 36, 728-737, 1987.
9. C. J. Colbourn and K. Heinrich. Conflict-Free Access to Parallel Memories. JPDC, 14, 193-200, 1992.
10. R. Creutzburg and L. Andrews. Recent Results on the Parallel Access to Tree-like Data Structures - The Isotropic Approach. Proc. Int. Conf. on Parallel Processing, vol. 1, 369-372, 1991.
11. S. K. Das and M. C. Pinotti. Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems. Proc. 3rd Int. Conf. Computing and Combinatorics, LNCS 1276, 1-10, 1997.
12. S. K. Das and M. C. Pinotti. Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates. JPDC, 60:8, 998-1027, 2000.
13. S. K. Das, M. C. Pinotti, F. Sarkar. Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes. IEEE TPDS, 7:6, 555-564, 1996.
14. S. K. Das, F. Sarkar. Conflict-Free Data Access of Arrays and Trees in Parallel Memory Systems. Proc. 6th IEEE Symp. on Par. and Distr. Processing, Dallas (Texas) USA, 377-383, 1994.
15. M. Gössel, and B. Rebel. Memories for Parallel Subtree Access. Proc. Int. Workshop on Parallel Algorithms and Architectures, LNCS 299, 122-130, 1987.
16. J. R. Griggs and R.K. Yeh. Labelling Graphs with a Condition at Distance 2. SIAM J. on Discrete Math., 5:586-595, 1992.
17. Ö. Johansson. Simple distributed Δ + 1-cobring of graphs. Information Processing Letters, 70:229-232, 1999.
18. D. Kaznachey, A. Jagota and S. K. Das. Neural Network-based Heuristic Algorithms for Hypergraph Coloring Problems with Applications. JPDC, 63:9, 786-800, 2003.
19. K. Kim and V. K. Prasanna Kumar. Latin Squares for Parallel Array Access. IEEE TPDS, 4:4, 361-370, 1993.
20. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan Kaufmann Publishers, 1992.
21. K. W. Lih. The Equitable Coloring of Graphs. In D.-Z. Du and P.M. Pardalos eds., Handbook of Combinatorial Optimization, 3:543-566, Kluwer, Boston, 1998.
22. M. Luby. Removing Randomness in Parallel without Processor Penalty. Journal of Comp. and Syst. Sciences, 47(2):250-286, 1993.
23. S. T. McCormick. Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem. Mathematical Programming, 26, 153-171, 1983.
24. H. Q. Ngo, D. Z. Du, and R. L. Graham. New Bounds on a Hypercube Coloring Problem. Information Processing Letters, 84:5, 265-269, 2002.
25. H. D. Shapiro. Theoretical Limitations on the Efficient Use of Parallel Memories. IEEE Trans. on Computers, 17, 421-428, 1978.
26. P. J. Wan. Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network. Journal of Combinatorial Optimization, 1, 179-186, 1997.
27. H. A. G. Wijshoff. Data Organization in Parallel Memories. Kluwer Academic Publishers, 1989.