On coloring complete binary trees

zbMATH Open1420.05059MaRDI QIDQ5224736FDOQ5224736

Eddie Cheng, Maryam Khosravi, Zhizhang Shen, Ke Qiu

Publication date: 24 July 2019

Recommendations

• Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
• Load balancing by graph coloring, an algorithm
• Multiple templates access of trees in parallel memory systems
• Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
• scientific article; zbMATH DE number 1696651

zbMATH Keywords

parallel processingmapping schemes

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• Approximation and Online Algorithms

This page was built for publication: On coloring complete binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224736)