会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Mechanism for efficient data access and communication in parallel computations on an emulated spatial lattice
    • 在仿真空间格子上并行计算的高效数据访问和通信机制
    • US06205533B1
    • 2001-03-20
    • US09373394
    • 1999-08-12
    • Norman H. Margolus
    • Norman H. Margolus
    • G06F1500
    • G06F15/8023
    • A mechanism for performing parallel computations on an emulated spatial lattice by scheduling memory and communication operations on a static mesh-connected array of synchronized processing nodes. The lattice data are divided up among the array of processing nodes, each having a memory and a plurality of processing elements within each node. The memory is assumed to have a hierarchical granular structure that distinguishes groups of bits that are most efficiently accessed together, such as words or rows. The lattice data is organized in memory so that the sets of bits that interact during processing are always accessed together. Such an organization is based on mapping the lattice data into the granular structure of the memories in a manner that has simple spatial translation properties in the emulated space. The mapping permits data movement in the emulated lattice to be achieved by a combination of scheduled memory access and scheduled communication. Moreover, the same mapping spreads interprocessor communication demands evenly over time.
    • 一种用于通过在同步处理节点的静态网状连接阵列上调度存储器和通信操作来对仿真空间格架执行并行计算的机制。 在数组的处理节点之间划分格子数据,每个处理节点具有每个节点内的存储器和多个处理元件。 假设存储器具有分级粒度结构,以区分最有效地一起访问的位组,例如字或行。 网格数据被组织在存储器中,使得在处理期间交互的比特集合总是被一起访问。 这样一个组织是基于在仿真空间中具有简单的空间转换属性的方式将网格数据映射到存储器的粒度结构中。 映射允许仿真网格中的数据移动通过预定的存储器访问和调度的通信的组合来实现。 此外,相同的映射在一段时间内均匀地扩展了处理器之间的通信需求。
    • 7. 发明授权
    • Storage assignment technique for scalable and fault tolerant storage system
    • 可扩展和容错存储系统的存储分配技术
    • US08364891B2
    • 2013-01-29
    • US11696644
    • 2007-04-04
    • Norman H. MargolusJonathan Coburn
    • Norman H. MargolusJonathan Coburn
    • G06F12/00
    • G06F11/2094G06F11/1096G06F11/1662G06F2211/1023G06F2211/1028G06F2211/1057
    • A method for organizing a storage system that is scalable and fault tolerant, the method including grouping together a number D of storage elements to form the storage system, where D is more than one, constructing a storage assignment table that includes table entries, computing, for each of the storage elements, an available capacity that depends on constraints on the placement of redundant data within the storage system, summing the available capacities to form a total available capacity for the storage system; and assigning the table entries in the storage assignment table to each identify one of the storage elements, wherein the available capacity of each of the storage elements is its effective storage capacity when used as part of the storage system, wherein not all of the D storage elements that form the storage system have the same available capacity, and wherein the fraction of all table entries that identify a one of the storage elements depends upon its fraction of the total available capacity.
    • 一种用于组织可扩展和容错的存储系统的方法,所述方法包括将存储元件的数量D分组在一起以形成存储系统,其中D大于1,构建包括表条目,计算, 对于每个存储元件,可用容量取决于对存储系统内的冗余数据的放置的约束,对可用容量求和以形成用于存储系统的总可用容量; 以及将所述存储分配表中的表条目分配给每个识别所述存储元件之一,其中当用作所述存储系统的一部分时,每个所述存储元件的可用容量是其有效存储容量,其中并非全部所述D存储 形成存储系统的元件具有相同的可用容量,并且其中标识存储元件之一的所有表条目的部分取决于其总可用容量的分数。