ACCELERATING STREAM PROCESSING BY DYNAMIC NETWORK AWARE TOPOLOGY RE-OPTIMIZATION
    1.
    发明申请
    ACCELERATING STREAM PROCESSING BY DYNAMIC NETWORK AWARE TOPOLOGY RE-OPTIMIZATION 审中-公开
    动态网络加速流程优化拓扑重新优化

    公开(公告)号:US20160269247A1

    公开(公告)日:2016-09-15

    申请号:US15069621

    申请日:2016-03-14

    CPC classification number: H04L67/12 H04L43/0894 H04L45/02 H04L45/12

    Abstract: Aspects of the present disclosure are directed to techniques that improve performance of streaming systems. Accordingly we disclose efficient techniques for dynamic topology re-optimization, through the use of a feedback-driven control loop that substantially solve a number of these performance-impacting problems affecting such streaming systems. More particularly, we disclose a novel technique for network-aware tuple routing using consistent hashing that improves stream flow throughput in the presence of large, run-time overhead. We also disclose methods for dynamic optimization of overlay topologies for group communication operations. To enable fast topology re-optimization with least system disruption, we present a lightweight, fault-tolerant protocol. All of the disclosed techniques were implemented in a real system and comprehensively validated on three real applications. We have demonstrated significant improvement in performance (20% to 200%), while overcoming various compute and network bottlenecks. We have shown that our performance improvements are robust to dynamic changes, as well as complex congestion patterns. Given the importance of stream processing systems and the ubiquity of dynamic network state in cloud environments, our results represent a significant and practical solution to these problems and deficiencies.

    Abstract translation: 本公开的方面针对提高流系统的性能的技术。 因此,通过使用反馈驱动的控制回路,我们公开了动态拓扑重新优化的高效技术,其基本上解决了影响这样的流系统的许多影响性能的问题。 更具体地说,我们公开了一种使用一致的散列来实现网络感知元组路由的新型技术,该方法在存在大的运行时间开销的情况下改善了流量吞吐量。 我们还公开了用于组通信操作的覆盖拓扑的动态优化方法。 为了实现快速拓扑重新优化,最少的系统中断,我们提出了一个轻量级的容错协议。 所有公开的技术都在实际系统中实现,并在三个实际应用中得到全面验证。 在克服各种计算和网络瓶颈的同时,我们已经表现出了显着的提升(20%到200%)。 我们已经表明,我们的性能改进对于动态变化以及复杂的拥塞模式是稳健的。 鉴于流处理系统的重要性和云环境中动态网络状态的普及,我们的结果代表了对这些问题和缺陷的重要而实际的解决方案。

    Accelerating distributed transactions on key-value stores through dynamic lock localization
    2.
    发明授权
    Accelerating distributed transactions on key-value stores through dynamic lock localization 有权
    通过动态锁定定位加速键值存储上的分布式事务

    公开(公告)号:US09367346B2

    公开(公告)日:2016-06-14

    申请号:US14162901

    申请日:2014-01-24

    CPC classification number: G06F9/466 G06F17/30362

    Abstract: Systems and methods for accelerating distributed transactions on key-value stores includes applying one or more policies of dynamic lock-localization, the policies including a lock migration stage that decreases nodes on which locks are present so that a transaction needs fewer number of network round trips to acquire locks, the policies including a lock ordering stage for pipelining during lock acquisition and wherein the order on locks to avoid deadlock is controlled by average contentions for the locks rather than static lexicographical ordering; and dynamically migrating and placing locks for distributed objects in distinct entity-groups in a datastore through the policies of dynamic lock-localization.

    Abstract translation: 用于加速键值存储上的分布式事务的系统和方法包括应用动态锁定位的一个或多个策略,该策略包括减少存在锁的节点的锁迁移阶段,使得事务需要更少数量的网络往返 获取锁,该策略包括在锁获取期间用于流水线的锁定订购阶段,并且其中锁的顺序以避免死锁由所述锁的平均争用控制而不是静态字典排序; 并通过动态锁定位策略动态地迁移和放置数据存储区中不同实体组中的分布式对象的锁。

    Accelerating Distributed Transactions on Key-Value Stores Through Dynamic Lock Localization
    3.
    发明申请
    Accelerating Distributed Transactions on Key-Value Stores Through Dynamic Lock Localization 有权
    通过动态锁定位加速关键价值存储分布式事务

    公开(公告)号:US20140236913A1

    公开(公告)日:2014-08-21

    申请号:US14162901

    申请日:2014-01-24

    CPC classification number: G06F9/466 G06F17/30362

    Abstract: Systems and methods for accelerating distributed transactions on key-value stores includes applying one or more policies of dynamic lock-localization, the policies including a lock migration stage that decreases nodes on which locks are present so that a transaction needs fewer number of network round trips to acquire locks, the policies including a lock ordering stage for pipelining during lock acquisition and wherein the order on locks to avoid deadlock is controlled by average contentions for the locks rather than static lexicographical ordering; and dynamically migrating and placing locks for distributed objects in distinct entity-groups in a datastore through the policies of dynamic lock-localization.

    Abstract translation: 用于加速键值存储上的分布式事务的系统和方法包括应用动态锁定位的一个或多个策略,该策略包括减少存在锁的节点的锁迁移阶段,使得事务需要更少数量的网络往返 获取锁,该策略包括在锁获取期间用于流水线的锁定订购阶段,并且其中锁的顺序以避免死锁由所述锁的平均争用控制而不是静态字典排序; 并通过动态锁定位策略动态地迁移和放置数据存储区中不同实体组中的分布式对象的锁。

Patent Agency Ranking