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

Author： Das S.K.   Pinotti M.C.  

Publisher： Academic Press

ISSN： 0743-7315

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

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

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

By Bertossi A.A.   Pinotti C.M.  

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

Academic Press

Access to resources Recommend Favorite

Multiple Templates Access of Trees in Parallel Memory Systems

By Auletta V.   de Vivo A.   Scarano V.  

Journal of Parallel and Distributed Computing, Vol. 49, Iss. 1, 1998-02 ,pp. : 22-39

Academic Press

Access to resources Recommend Favorite

A Fast and Efficient Processor Management Scheme for k-ary n-cubes

By Yoo B.S.   Das C.R.  

Journal of Parallel and Distributed Computing, Vol. 55, Iss. 2, 1998-12 ,pp. : 192-214

Academic Press

Access to resources Recommend Favorite

Minimal Free Resolutions of HomogenizedD-modules

By Oaku T.   Takayama N.  

Journal of Symbolic Computation, Vol. 32, Iss. 6, 2001-12 ,pp. : 575-595

Academic Press

Access to resources Recommend Favorite

On the Number of t-Ary Trees with a Given Path Length

By Seroussi Gadiel  

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 557-565

Springer Publishing Company

Access to resources Recommend Favorite