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

ISSN： 0743-7315

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

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

Fast Constructive Recognition of a Black Box Group Isomorphic toS_norA_nusing Goldbach’s Conjecture

By Bratus S. Pak I.

Journal of Symbolic Computation, Vol. 29, Iss. 1, 2000-01 ,pp. : 33-57

Academic Press

Access to resources Recommend Favorite

An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes

By Gu Q-P. Peng S.

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 6, 2000-06 ,pp. : 764-774

Academic Press

Access to resources Recommend Favorite

Finding All Isolated Zeros of Polynomial Systems inCⁿvi a Stable Mixed Volumes

By Gao T. Li T.Y. Wang X.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 187-211

Academic Press

Access to resources Recommend Favorite

Weak Wu Stratification in Rⁿ

By Richardson D.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 213-223

Academic Press

Access to resources Recommend Favorite

Curves of Genus 2 with (N, N) Decomposable Jacobians

By Shaska T.

Journal of Symbolic Computation, Vol. 31, Iss. 5, 2001-05 ,pp. : 603-617

Academic Press

Access to resources Recommend Favorite