中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

21 records (took 0.029 seconds)

    LOW RAM SPACE, HIGH-THROUGHPUT PERSISTENT KEY-VALUE STORE USING SECONDARY MEMORY
    12.
    发明申请
    LOW RAM SPACE, HIGH-THROUGHPUT PERSISTENT KEY-VALUE STORE USING SECONDARY MEMORY 审中-公开
    低RAM空间，高通量使用次级存储的主要价值存储

    公开(公告)号：WO2012054223A2

    公开(公告)日：2012-04-26

    申请号：PCT/US2011/054664

    申请日：2011-10-04

    Applicant: MICROSOFT CORPORATION

    Inventor： SENGUPTA, Sudipta ,  DEBNATH, Biplob Kumar ,  LI, Jin

    IPC: G06F12/02

    CPC classification number: G06F17/30949

    Abstract: Described is using flash memory (or other secondary storage), RAM-based data structures and mechanisms to access key-value pairs stored in the flash memory using only a low RAM space footprint. A mapping (e.g. hash) function maps key-value pairs to a slot in a RAM-based index. The slot includes a pointer that points to a bucket of records on flash memory that each had keys that mapped to the slot. The bucket of records is arranged as a linear-chained linked list, e.g., with pointers from the most-recently written record to the earliest written record. Also described are compacting non-contiguous records of a bucket onto a single flash page, and garbage collection. Still further described is load balancing to reduce variation in bucket sizes, using a bloom filter per slot to avoid unnecessary searching, and splitting a slot into sub-slots.

    Abstract translation: 描述的是使用闪速存储器（或其他辅助存储器），基于RAM的数据结构和机制来访问存储在闪存中的键值对，仅使用低的RAM空间。 映射（例如散列）功能将键值对映射到基于RAM的索引中的时隙。 插槽包括一个指向闪存中的一桶记录的指针，每个记录都具有映射到插槽的键。 记录的桶被布置为线性链接的链表，例如具有从最近写入的记录到最早的书面记录的指针。 还描述了将桶的不连续记录压缩到单个闪存页面上以及垃圾收集。 还进一步描述的是负载平衡以减少桶大小的变化，使用每时隙的布隆过滤器来避免不必要的搜索，并且将时隙分割成子时隙。

    CONGESTION CONTROL FOR DELAY SENSITIVE APPLICATIONS
    13.
    发明申请
    CONGESTION CONTROL FOR DELAY SENSITIVE APPLICATIONS 审中-公开
    延迟敏感应用的约束控制

    公开(公告)号：WO2011109568A2

    公开(公告)日：2011-09-09

    申请号：PCT/US2011/026934

    申请日：2011-03-02

    Applicant: MICROSOFT CORPORATION

    Inventor： MEHROTRA, Sanjeev ,  WYNN, Tong L. ,  LI, Jin ,  SENGUPTA, Sudipta

    CPC classification number: H04L47/25 ,  H04L47/22 ,  H04L47/2416 ,  H04L47/29 ,  H04L47/30

    Abstract: In various embodiments, methods and systems are disclosed for a hybrid rate plus window based congestion protocol that controls the rate of packet transmission into the network and provides low queuing delay, practically zero packet loss, fair allocation of network resources amongst multiple flows, and full link utilization. In one embodiment, a congestion window may be used to control the maximum number of outstanding bits, a transmission rate may be used to control the rate of packets entering the network (packet pacing), a queuing delay based rate update may be used to control queuing delay within tolerated bounds and minimize packet loss, and aggressive ramp-up/graceful back-off may be used to fully utilize the link capacity and additive-increase, multiplicative-decrease (AIMD) rate control may be used to provide fairness amongst multiple flows.

    Abstract translation: 在各种实施例中，公开了用于混合速率加上基于窗口的拥塞协议的方法和系统，其控制到网络的分组传输速率，并提供低排队延迟，实际上零分组丢失，多个流之间的网络资源的公平分配以及完全 链接利用率。 在一个实施例中，可以使用拥塞窗口来控制未完成比特的最大数量，可以使用传输速率来控制进入网络的分组的速率（分组起搏），基于排队延迟的速率更新可以用于控制 可以利用容忍范围内的排队延迟并尽可能减少分组丢失，并且可以使用积极的提升/优雅退避来充分利用链路容量，并且可以使用加法增加乘法减少（AIMD）速率控制来提供多个 流动。

    DATA CENTER WITHOUT STRUCTURAL BOTTLENECKS
    14.
    发明申请
    DATA CENTER WITHOUT STRUCTURAL BOTTLENECKS 审中-公开

    公开(公告)号：WO2009151993A3

    公开(公告)日：2009-12-17

    申请号：PCT/US2009/045877

    申请日：2009-06-01

    Applicant: MICROSOFT CORPORATION

    Inventor： MALTZ, David, A. ,  GREENBERG, Albert, G. ,  PATEL, Parveen, K. ,  SENGUPTA, Sudipta ,  LAHIRI, Parantap

    IPC: H04L12/28 ,  H04L12/56 ,  H04L29/02

    Abstract: A method of networking a plurality of servers together within a data center is disclosed. The method includes the step of addressing a data packet for delivery to a destination server by providing the destination server address as a flat address. The method further includes the steps of obtaining routing information required to route the packet to the destination server. This routing information may be obtained from a directory service servicing the plurality of servers. Once the routing information is obtained, the data packet may be routed to the destination server according to the flat address of the destination server and routing information obtained from the directory service.

    ADAPTIVE INDEX FOR DATA DEDUPLICATION
    16.
    发明公开
    ADAPTIVE INDEX FOR DATA DEDUPLICATION 审中-公开
    可自定义的列表数据的重复数据删除

    公开(公告)号：EP2659377A2

    公开(公告)日：2013-11-06

    申请号：EP11852446.1

    申请日：2011-12-28

    Applicant: Microsoft Corporation

    Inventor： LI, Jin ,  SENGUPTA, Sudipta

    IPC: G06F12/00

    CPC classification number: G06F17/30097 ,  G06F17/3007 ,  G06F17/30159

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index and/or indexing operations are adaptable to balance deduplication performance savings, throughput and resource consumption. The indexing service may employ hierarchical chunking using different levels of granularity corresponding to chunk size, a sampled compact index table that contains compact signatures for less than all of the hash index's (or subspace's) hash values, and/or selective subspace indexing based on similarity of a subspace's data to another subspace's data and/or to incoming data chunks.

    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION
    17.
    发明公开
    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION 审中-公开
    VERWENDUNG EINER INDEXPARTITIONIERUNG UND-ABSTIMMUNGFÜREINE DATENDEDUPLIZIERUNG

    公开(公告)号：EP2659376A2

    公开(公告)日：2013-11-06

    申请号：EP11852319.0

    申请日：2011-12-23

    Applicant: Microsoft Corporation

    Inventor： LI, Jin ,  SENGUPTA, Sudipta ,  KALACH, Ran ,  DESAI, Ronakkumar N. ,  OLTEAN, Paul Adrian ,  BENTON, James, Robert

    IPC: G06F12/00

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation, in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time, when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.

    Abstract translation: 本发明涉及一种数据重复数据删除技术，其中散列索引服务的索引被划分为子空间索引，其中小于整个散列索引服务的索引来缓存内存。 访问子空间索引以确定数据块是否已经存在或需要进行索引和存储。 索引可以根据与要索引的数据相关联的标准被划分为子空间，例如文件类型，数据类型，最后使用时间等等。 还描述了子空间协调，其中检测子空间中的重复条目，以便从重复数据删除系统中删除条目和块。 当更多的系统资源可用时，子空间协调可以在非高峰时间执行，并且如果需要资源，则可能被中断。 调和的子空间可以基于相似性，包括通过相似性的签名，每个紧密地表示子空间的散列。

    LOW RAM SPACE, HIGH-THROUGHPUT PERSISTENT KEY-VALUE STORE USING SECONDARY MEMORY
    18.
    发明公开
    LOW RAM SPACE, HIGH-THROUGHPUT PERSISTENT KEY-VALUE STORE USING SECONDARY MEMORY 审中-公开
    具有低高吞吐量和RAM的地方，与使用辅助内存中的持久密钥存储器

    公开(公告)号：EP2633413A2

    公开(公告)日：2013-09-04

    申请号：EP11834842.4

    申请日：2011-10-04

    Applicant: Microsoft Corporation

    Inventor： SENGUPTA, Sudipta ,  DEBNATH, Biplob Kumar ,  LI, Jin

    IPC: G06F12/02

    CPC classification number: G06F16/9014

    Abstract: Described is using flash memory (or other secondary storage), RAM-based data structures and mechanisms to access key-value pairs stored in the flash memory using only a low RAM space footprint. A mapping (e.g. hash) function maps key-value pairs to a slot in a RAM-based index. The slot includes a pointer that points to a bucket of records on flash memory that each had keys that mapped to the slot. The bucket of records is arranged as a linear-chained linked list, e.g., with pointers from the most-recently written record to the earliest written record. Also described are compacting non-contiguous records of a bucket onto a single flash page, and garbage collection. Still further described is load balancing to reduce variation in bucket sizes, using a bloom filter per slot to avoid unnecessary searching, and splitting a slot into sub-slots.

    Abstract translation: 使用闪速存储器（或其它辅助存储器），基于RAM的数据结构和机制，以访问存储在仅使用低RAM空间占用闪存键 - 值对所述。 的映射（例如，散列）函数键 - 值对映射到在基于RAM的索引的槽。 该槽包括一个指针没有指向记录在闪存上的铲斗做各自具有键并映射到时隙。 记录桶被设置为线性链链接列表，例如从最近写入记录的最早的文字记三分球。 如此描述被压缩水桶的非连续记录到一个单一的闪存页面，和垃圾收集。 仍然进一步地描述的是负载平衡，以减少在桶的大小的变化，使用每时隙一个布隆过滤器，以避免不必要的搜索，和分割的槽成子时隙。

Patent Agency Ranking