Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees-Reference-Cited by-同舟云学术

Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees

Published:2002-08 Issue:8 Volume:62 Page:1314-1333
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Bertossi Alan A.,Pinotti Cristina M.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference15 articles.

1. Toward a universal mapping algorithm for accessing trees in parallel memory systems;Auletta;Proceedings of IEEE International Parallel Processing Symposium,1998

2. Multiple template access of trees in parallel memory systems;Auletta;J. Parallel Distrib. Comput.,1998

3. On array storage for conflict-free memory access for parallel processors;Balakrishnan;Proceedings of the International Conference on Parallel Processing,1988

4. Assigning codes in wireless networks: bounds and scaling properties;Battiti;Wireless Networks,1999

5. Accounting for memory bank contention and delay in high-bandwidth multiprocessors;Blelloch;IEEE Trans. Parallel Distrib. Syst.,1997

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Template-driven rainbow coloring of proper interval graphs;Discrete Applied Mathematics;2023-03

2. Template-Driven Rainbow Coloring of Proper Interval Graphs;Algorithms and Discrete Applied Mathematics;2021

3. L(2,1)-Labeling of Kneser graphs and coloring squares of Kneser graphs;Discrete Applied Mathematics;2017-04

4. DISTANCE THREE LABELINGS FOR DIRECT PRODUCTS OF THREE COMPLETE GRAPHS;Taiwanese Journal of Mathematics;2013-01-01

5. Scheduling Activities in Wireless Sensor Networks;Computer Communications and Networks;2009