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

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.62, Iss.8, 2002-08, pp. : 1314-1333

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates

By Das S.K. Pinotti M.C.

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 8, 2000-08 ,pp. : 998-1027

Academic Press

Access to resources Recommend Favorite

Optimal binary search trees with costs depending on the access paths

By Szwarcfiter J.L. Navarro G. Baeza-Yates R. Oliveira J.d.S. Cunto W. Ziviani N.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1799-1814

Elsevier

Access to resources Recommend Favorite

A decentralized approach for the conflict-free motion of multiple mobile robots

By Azarm Kianoush Schmidt GÜNTHER

Advanced Robotics, Vol. 11, Iss. 4, 1996-01 ,pp. : 323-340

Taylor & Francis Ltd

Access to resources Recommend Favorite

Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs

By Wan P.-J.

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 193-201

Elsevier

Access to resources Recommend Favorite

The Formal Design Model of Doubly-Linked-Circular Lists (DLC-Lists)

International Journal of Software Science and Computational Intelligence (IJSSCI), Vol. 3, Iss. 2, 2011-04 ,pp. : 83-102

IGI Global_journal

Access to resources Recommend Favorite