On k-Partitioning the n-Cube
نویسنده
چکیده
Let an edge cut partition the vertex set of the n-cube into k subsets A1, ..., Ak with ||Ai| − |Aj || ≤ 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as n, k → ∞ and also as n → ∞ and k is a constant of the form k = 2a ± 2b with a ≥ b ≥ 0.
منابع مشابه
Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems
Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partiti...
متن کاملIsomorphic Allocation in k-ary n-cube Systems
Due to its topological generality and exibility, the k-ary n-cube architecture is actively researched exploring network design tradeoos as well as characterizing the topology. Processor allocation problem, which has been extensively attempted for hypercubes and meshes, however, has not been addressed for the k-ary n-cube parallel computers. 22]]23] are the only reported works but their schemes ...
متن کاملOn the Diophantine Equation x^6+ky^3=z^6+kw^3
Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...
متن کاملCombinatorics of k-ary n-cubes with Applications to Partitioning
Many communication networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes, and toruses. This paper explores combinatorial properties of such graphs—in particular, the characterization of the subgraph of a given number of nodes with maximum edge count. Applications of these properties to partitioning parallel computations will also be discussed.
متن کاملScalable Data Space Partitioning In High Dimension
A fundamental process in data mining is to approximate the joint distribution of a multivari-ate data set. A typical approach is to use histograms. However, conventional histograms (with dimension-normal data partitions) create an exponential number of partitions as the number of dimensions increases. In previous work, we presented the DataSphere method for data space partitioning and used it f...
متن کامل