检索结果-内蒙古大学图书馆

40th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Goren, Guy Vargaftik, Shay Moses, Yoram Technion Haifa Israel VMware Res Herzliyya Israel

ISBN: (纸本)9781450385480

Current-day data centers and high-volume cloud services employ a broad set of heterogeneous servers. In such settings, client requests typically arrive at multiple entry points, and dispatching them to servers is an urgent distributed systems problem. This paper presents an efficient solution to the load balancing problem in such systems that improves on and overcomes problems of previous solutions. The load balancing problem is formulated as a stochastic optimization problem, and an efficient algorithmic solution is obtained based on a subtle mathematical analysis of the problem. Finally, extensive evaluation of the solution on simulated data shows that it outperforms previous solutions. Moreover, the resulting dispatching policy can be computed very efficiently, making the solution practically viable.

关键词： distributed load balancing Heterogeneous load balancing Stochastically coordinated dispatching Parallel server model

来源：评论

学校读者我要写书评

暂无评论

Actris: Session-type based reasoning in separation logic

Actris: Session-type based reasoning in separation logic

引用

Proceedings of the ACM on Programming Languages

作者： Hinrichsen, Jonas Kastberg Bengtson, Jesper Krebbers, Robbert IT University of Copenhagen Denmark Delft University of Technology Netherlands

Message passing is a useful abstraction to implement concurrent programs. For real-world systems, however, it is often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency, and locks. We present Actris: a logic for proving functional correctness of programs that use a combination of the aforementioned features. Actris combines the power of modern concurrent separation logics with a first-class protocol mechanism - based on session types - for reasoning about message passing in the presence of other concurrency paradigms. We show that Actris provides a suitable level of abstraction by proving functional correctness of a variety of examples, including a distributed merge sort, a distributed load-balancing mapper, and a variant of the map-reduce model, using relatively simple specifications. Soundness of Actris is proved using a model of its protocol mechanism in the Iris framework. We mechanised the theory of Actris, together with tactics for symbolic execution of programs, as well as all examples in the paper, in the Coq proof assistant. © 2020 Copyright held by the owner/author(s).

关键词： Message passing Abstracting Computer circuits Theorem proving Actor models Concurrency distributed load balancing Functional correctness Higher order functions Iris Level of abstraction Session types

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Approach for Homogenizing load Distribution In Cloud Data Center Based on Stable Marriage Matching 11

A Decentralized Approach for Homogenizing Load Distribution ...

引用

11th International Conference on Management of Digital EcoSystems (MEDES)

作者： Sangar, Disha Haugerud, Harek Yazidi, Anis Begnum, Kyrre Oslo Metropolitan Univ OsloMet Oslo Norway

ISBN: (纸本)9781450362382

Running a sheer virtualized data center with the help of Virtual Machines (VM) is the de facto-standard in modern data centers. Live migration offers immense flexibility opportunities as it endows the system administrators with tools to seamlessly move VMs across physical machines. Several studies have shown that the resource utilization within a data center is not homogeneous across the physical servers. load imbalance situations are observed where a significant portion of servers are either in overloaded or underloaded states. Apart from leading to inefficient usage of energy by underloaded servers, this might lead to serious QoS degradation issues in the overloaded servers. In this paper, we propose a lightweight decentralized solution for homogenizing the load across different machines in a data center. In search of better solutions, we have looked outside the field of computer science for inspiration. Inspired by Nobel Peace Prize winners Alvin Roth and Lloyd Shapley's work on Stable Matching [4], we borrow the concept of stable marriage matching problems where we pair pairs of underloaded servers and overloaded servers based on some notion of preferences for the purpose of homogenizing their load through exchange of VMs. Furthermore, our solution is distributed by accommodating this aspect in the original Stable Matching algorithm. We provide some real-life experimental results that demonstrate the efficiency of our approach.

关键词： Self-Organization cloud computing Stable Marriage distributed load balancing

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Approach for Homogenizing load Distribution: In Cloud Data Center Based on Stable Marriage Matching 19

A Decentralized Approach for Homogenizing Load Distribution:...

引用

Proceedings of the 11th International Conference on Management of Digital EcoSystems

作者： Disha Sangar Hårek Haugerud Anis Yazidi Kyrre Begnum Oslo Metropolitan University (OsloMet) Oslo Norway

ISBN: (纸本)9781450362382

Running a sheer virtualized data center with the help of Virtual Machines (VM) is the de facto-standard in modern data centers. Live migration offers immense flexibility opportunities as it endows the system administrators with tools to seamlessly move VMs across physical machines. Several studies have shown that the resource utilization within a data center is not homogeneous across the physical servers. load imbalance situations are observed where a significant portion of servers are either in overloaded or underloaded states. Apart from leading to inefficient usage of energy by underloaded servers, this might lead to serious QoS degradation issues in the overloaded *** this paper, we propose a lightweight decentralized solution for homogenizing the load across different machines in a data center. In search of better solutions, we have looked outside the field of computer science for inspiration. Inspired by Nobel Peace Prize winners Alvin Roth and Lloyd Shapley's work on Stable Matching [4], we borrow the concept of stable marriage matching problems where we pair pairs of underloaded servers and overloaded servers based on some notion of preferences for the purpose of homogenizing their load through exchange of VMs. Furthermore, our solution is distributed by accommodating this aspect in the original Stable Matching algorithm. We provide some real-life experimental results that demonstrate the efficiency of our approach.

关键词： distributed load balancing cloud computing Stable Marriage Self-Organization

来源：评论

学校读者我要写书评

暂无评论

Improved Power of Two Choices for Fat-Tree Routing

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2018年第4期15卷 1706-1719页

作者： Wang, Suzhen Luo, Jingjing Wong, Wing Shing Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China Huazhong Univ Sci & Technol Sch Elect Informat & Commun Wuhan 430074 Hubei Peoples R China

The fat-tree networking topology have gained prominence in various parallel and distributed systems such as high-performance computing clusters and data centers. To support high throughput and low latency applications, effective load-balancing schemes are in great demand. However, the commonly deployed scheme, equal-cost multipath, suffers from severe hash collisions that lead to poor performance. Recently, another realization of randomized load balancing, DRILL, has been proposed, which adopts the two-choice algorithm to achieve in-network local-to-switch load balancing. Although DRILL can well balance uplink traffic, it shows some limitations on alleviating downlink contentions. Motivated by this observation, we propose a thresholded two-choice (TTC) scheme, which modifies the two-choice algorithm such that it can balance both uplink and downlink traffic. To balance downlink traffic, TTC sets a default path for every source-destination pair using the D-mod-k scheme. The rationale for this is that D-mod-k minimizes the level of path collision over downlinks for any permutation in a fat-tree network. To balance uplink traffic, TTC makes dynamic path decisions using an algorithm that is based on the two-choice idea. To better leverage default paths in downlink load balancing, it is desirable that TTC routes the majority of traffic onto the default paths. To this end, we introduce a new thresholding mechanism to the two-choice algorithm, which contributes to a better overall performance. Our analysis shows that the introduced thresholding mechanism does not significantly affect the uplink load balancing performance. Moreover, our numerical study indicates that TTC can achieve a better system-wide performance than DRILL.

关键词： Fat-tree networks distributed load balancing thresholded two-choice algorithm

来源：评论

学校读者我要写书评

暂无评论

NEOFog: Nonvolatility-Exploiting Optimizations for Fog Computing 18

NEOFog: Nonvolatility-Exploiting Optimizations for Fog Compu...

引用

23rd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)

作者： Ma, Kaisheng Li, Xueqing Kandemir, Mahmut Taylan Sampson, Jack Narayanan, Vijaykrishnan Li, Jinyang Wu, Tongda Wang, Zhibo Liu, Yongpan Xie, Yuan Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Tsinghua Univ Dept Elect Engn Beijing Peoples R China Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)9781450349116

Nonvolatile processors have emerged as one of the promising solutions for energy harvesting scenarios, among which Wireless Sensor Networks (WSN) provide some of the most important applications. In a typical distributed sensing system, due to difference in location, energy harvester angles, power sources, etc. different nodes may have different amount of energy ready for use. While prior approaches have examined these challenges, they have not done so in the context of the features offered by nonvolatile computing approaches, which disrupt certain foundational assumptions. We propose a new set of nonvolatility-exploiting optimizations and embody them in the NEOFog system architecture. We discuss shifts in the tradeoffs in data and program distribution for nonvolatile processing-based WSNs, showing how nonvolatile processing and non-volatile RF support alter the benefits of computation and communication-centric approaches. We also propose a new algorithm specific to nonvolatile sensing systems for load balancing both computation and communication demands. Collectively, the NV-aware optimizations in NEOFog increase the ability to perform in-fog processing by 4.2X and can increase this to 8X if virtualized nodes are 3X multiplexed.

关键词： node virtualization distributed load balancing energy harvesting distributed fog computing wireless sensor network nonvolatile processor

来源：评论

学校读者我要写书评

暂无评论

On Communication Cost vs. load balancing in Content Delivery Networks

On Communication Cost vs. Load Balancing in Content Delivery...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Siavoshani, M. Jafari Shariatpanahi, S. P. Ghasemi, H. Pourmiri, A. Sharif Univ Technol Dept Comp Engn Tehran Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran Univ Isfahan Fac Comp Engn Dept Software Engn Esfahan Iran

ISBN: (纸本)9781538616291

It is well known that load balancing and low delivery communication cost are two critical issues in mapping requests to servers in Content Delivery Networks (CDNs). However, the trade-off between these two performance metrics has not been yet quantitatively investigated in designing efficient request mapping schemes. In this work, we formalize this trade-off through a stochastic optimization problem. While the solutions to the problem in the extreme cases of minimum communication cost and optimum load balancing can be derived in closed form, finding the general solution is hard to derive. Thus we propose three heuristic mapping schemes and compare the trade-off performance of them through extensive simulations. Our simulation results show that at the expense of high query cost, we can achieve a good trade-off curve. Moreover, by benefiting from the power of multiple choices phenomenon, we can achieve almost the same performance with much less query cost. Finally, we can handle requests with different delay requirements at the cost of degrading network performance.

关键词： Content delivery networks distributed load balancing power of multiple choices query cost

来源：评论

学校读者我要写书评

暂无评论

The Strategy of distributed load balancing Based on Hybrid Scheduling

The Strategy of Distributed Load Balancing Based on Hybrid S...

引用

The Fourth International Joint Conference on Computational Science and Optimization(第四届计算科学与优化国际大会 CSO 2011)

作者： Jianhui Shi Chunlei Meng Lingli Ma Department of Humanistic and Social Science Institute of Disaster Prevention Sanhe Hebei China Department of Urban Ecological Meteorology Institute of Urban Meteorology CMA Beijing China Surveying & Mapping Engineering Institute Sichuan Earthquake Administration Yaan Sichuan China

A strategy of distributed load balancing based on hybrid scheduling (LBHS) is proposed in this paper. This method is a hybrid scheduling strategy, which is based on the static allocation, and used dynamic scheduling system with the amply consideration of all the factors in the process of load balancing. This method can improve the utilization of the processor. The method is tested in the land surface disaster and ecology model. The result indicates that the strategy could improve the performance of parallel computing effectively, especially in the case that the size and data of the task is partially mastered beforehand.

关键词： Hybrid scheduling distributed load balancing Parallel computing

来源：评论

学校读者我要写书评

暂无评论

Seamless LTE connectivity in high-speed trains

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2016年第12期16卷 1478-1494页

作者： Parichehreh, Ali Savazzi, Stefano Goratti, Leonardo Spagnolini, Umberto Politecn Milan DEIB Milan Italy Natl Res Council Italy CNR IEIIT Inst Milan Italy CREATE NET Via Cascata 56-D I-38123 Trento Italy

High-speed train (HST) is revitalizing the train as a preferred mid-range transportation system. The provision of broadband Internet connectivity onboard trains is one of the key challenges in the competition among train operators. Unprecedented spectral efficiency and data rates (up to 100Mbps in high mobility) of the Universal Mobile Telecommunications System long-term evolution (LTE) are expected to offer the solution for high-speed Internet access onboard in HSTs. Massive wireless access and frequent handovers (HOs) of a large number of users might potentially cause service interruptions, and this, in turn, degrades intolerably the quality of experience (QoE) of users' onboard Internet access. In this paper, we propose a solution based on distributed antenna system that combines directional and omni-directional antennas as train-to-ground radio-access terminals (T-RATs) and LTE femtocells in each carriage. Directional antennas are deployed at both ends of the HST to provide multi-cell access by diversifying the HOs over multiple LTE cells. This mechanism virtually elongates the train size by connecting the front and rear carriages' T-RATs to the faraway eNodeBs and augmenting the number of cells the HST can be simultaneously connected to. An ad hoc distributed load-balancing mechanism that consists in offloading backlogged packets to the on-service T-RATs is mandatorily paired with multi-cell access scheme to tie up with the request of seamless onboard Internet service at high QoE level. Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： high-speed trains directional antenna distributed load balancing quality of service

来源：评论

学校读者我要写书评

暂无评论

On Communication Cost vs. load balancing in Content Delivery Networks

On Communication Cost vs. Load Balancing in Content Delivery...

引用

IEEE Symposium on Computers and Communications

作者： M. Jafari Siavoshani S. P. Shariatpanahi H. Ghasemi A. Pourmiri Department of Computer Engineering Sharif University of Technology Tehran Iran Institute for Research in Fundamental Sciences Tehran Tehran IR Department of Software Engineering University of Isfahan Isfahan Iran

关键词： Content delivery networks distributed load balancing Power of multiple choices Query cost

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：