首页> 外国专利> Fast, low memory consistent hashes using initial variance

Fast, low memory consistent hashes using initial variance

机译:快速,低内存一致哈希使用初始方差

摘要

Embodiments of the system and method can provide a conforming hash function that reduces memory usage and complexity compared to current techniques, suppresses computational complexity, and has a relatively small number of keys that must be reshuffled.For example:In one embodimentA computer implementation method for controlling computational resourcesMultiple labels of working resources allocated to real resourcesStoring a set of labels of potential resources that contain multiple labels of available resource resources to be allocated, andGenerating an initial assignment to the label of one of the sets of potential resource labels andAssignments to one label of a set of potential resources labelAn assignment to a label of one of the labels of the reserved resourceRequestTo reassign the label of the potential resource to another label of the selected resource from the subset of the labelUntil the request is assigned to the label of the working resourceIt may include repeating repeating.
机译:系统和方法的实施例可以提供符合哈希函数,其与当前技术相比减少了内存使用和复杂性,抑制了计算复杂度,并且具有必须重新装载的相对少量的键。例如:在一个实施例中: 控制分配给Real Resourcesstoring的工作资源的计算资源Dultiple标签,该潜在资源包含多个可用资源资源标签的标签,并向其中一个潜在资源标签和Assassign的标签进行初始分配给一个标签 一组潜在的资源LabelAn分配给保留resourceRequestTo一个标签的标签,将潜在资源的标签重新分配给从LabelUnt的子集到所选资源的另一个标签,该请求将请求分配给工作标签 资源旨可以包括重复重复。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号