Distributing resources in hypercube computers
Distributing resources in hypercube computers
复制标题
在超立方体计算机中分配资源
DOI：
--
复制
发表时间：
1988
期刊：
影响因子：
--
通讯作者：
Q. Stout
中科院分区：
文献类型：
--
作者：
M. Livingston;Q. Stout
给定一种类型的资源，如磁盘单元，额外的内存模块，连接到主机处理器，或软件模块，我们考虑的问题，在超立方体计算机的处理器分配的资源单元，使某些性能要求以最小的成本得到满足。典型的要求包括每个处理器都在资源单元的给定距离内，每个处理器都在几个资源中的每一个的给定距离内，以及每个m维子立方体都包含一个资源单元。后者在多用户系统中尤其重要，在该系统中，不同的用户被赋予他们自己的子立方体。在这种情况下，我们还考虑了子立方体分配系统不能分配所有可能的子立方体和要求仅适用于可分配的子立方体时，以最小的成本满足性能要求的问题。我们还分析了分区处理器的问题与资源成不同的类，要求每个处理器是在一个给定的距离内，或在一个子立方体的给定尺寸，每个类的成员。有效的建设性技术分配或分区的资源给出了几个性能要求，沿着上，所需的资源单元的总数的上限和下限。
Given a type of resource such as disk units, extra memory modules, connections to the host processor, or software modules, we consider the problem of distributing the resource units to processors in a hypercube computer so that certain performance requirements are met at minimal cost. Typical requirements include the condition that every processor is within a given distance of a resource unit, that every processor is within a given distance of each of several resources, and that every m-dimensional subcube contains a resource unit. The latter is particularly important in a multiuser system in which different users are given their own subcubes. In this setting, we also consider the problem of meeting the performance requirements at minimal cost when the subcube allocation system cannot allocate all possible subcubes and the requirements apply only to allocable subcubes. We also analyze the problem of partitioning processors with resources into different classes, requiring that every processor is within a given distance of, or in a subcube of given dimension with, a member of each class. Efficient constructive techniques for distributing or partitioning a resource are given for several performance requirements, along with upper and lower bounds on the total number of resource units required.