arXiv 0810.38362008-10cs.DC

Best-effort Group Service in Dynamic Networks

Bertrand Ducourthial, Sofiane Khalfallah, Franck Petit

英文摘要：

We propose a group membership service for dynamic ad hoc networks. It maintains as long as possible the existing groups and ensures that each group diameter is always smaller than a constant, fixed according to the application using the groups. The proposed protocol is self-stabilizing and works in dynamic distributed systems. Moreover, it ensures a kind of continuity in the service offer to the application while the system is converging, except if too strong topology changes happen. Such a best effort behavior allows applications to rely on the groups while the stabilization has not been reached, which is very useful in dynamic ad hoc networks.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

尽力而为通信可提升性能并在传统硬件上实现稳健扩展

Best-Effort Communication Improves Performance and Scales Robustly on Conventional Hardware

该研究在商用HPC硬件上测试全异步尽力而为通信的性能与扩展性，设计多类服务质量指标验证其在不同通信强度下的扩展稳定性，且故障节点不会影响整体中位性能。

2023-10-06cs.DC

Effort-Oriented Classification Matrix of Web Service Composition

Within the service-oriented computing domain, Web service composition is an effective realization to satisfy the rapidly changing requirements of business. Therefore, the research into Web service composition has unfolded broadly. Since examining all of the related work in this area becomes a mission next to impossible, the classification of composition approaches can be used to facilitate multiple research tasks. However, the current attempts to classify Web service composition do not have clear objectives. Furthermore, the contexts and technologies of composition approaches are confused in t…

2013-02-09cs.DCcs.SE

Conduit: A C++ Library for Best-effort High Performance Computing

Developing software to effectively take advantage of growth in parallel and distributed processing capacity poses significant challenges. Traditional programming techniques allow a user to assume that execution, message passing, and memory are always kept synchronized. However, maintaining this consistency becomes increasingly costly at scale. One proposed strategy is "best-effort computing", which relaxes synchronization and hardware reliability requirements, accepting nondeterminism in exchange for efficiency. Although many programming languages and frameworks aim to facilitate software deve…

2021-05-21cs.DC

Change Impact Analysis Based Regression Testing of Web Services

PDPM Indian Institute of Information Technology, Design and Manufacturing Jabalpur（PDPM印度信息技术设计与制造学院贾巴尔普尔）

Reducing the effort required to make changes in web services is one of the primary goals in web service projects maintenance and evolution. Normally, functional and non-functional testing of a web service is performed by testing the operations specified in its WSDL. The regression testing is performed by identifying the changes made thereafter to the web service code and the WSDL. In this thesis, we present a tool-supported approach to perform efficient regression testing of web services. By representing a web service as a directed graph of WSDL elements, we identify and gathers the changed po…

2014-08-07cs.AIcs.DCcs.SE

An Approach for Selecting Cloud Service Adequate to Big Data Case Study: E-health Context

The expanding Cloud computing's services offers great opportunities for consumers to find the best service and best cost. It offers a computing power and a storage space adapted especially for Big Data processing. However, it raises new challenges on how to select the best service out of the huge pool. It is time-consuming for consumers to collect the necessary information and analyze all service providers to make the right decision. Moreover, it'is a highly demanding task from a computational perspective, because the same computations may be conducted repeatedly by multiple consumers who have…

2020-03-31cs.DC

Choosing the best resource by method of mamdani

A method for selecting the best service for the storage of information by Mamdani.

2011-11-06cs.DC

更多相关论文收起更多论文

FAIR计算工作流的服务生态系统

An Ecosystem of Services for FAIR Computational Workflows

Oak Ridge National Laboratory（橡树岭国家实验室）；University of Melbourne（墨尔本大学）；Australian BioCommons（澳大利亚生物公共平台）；The University of Manchester（曼彻斯特大学）；University Paris-Dauphine（巴黎第九大学）；Barcelona Supercomputing Center（巴塞罗那超级计算中心）；North Carolina State University（北卡罗来纳州立大学）；German Cancer Research Center（德国癌症研究中心）；Universidad Politécnica de Madrid（马德里理工大学）；Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）；University of Freiburg（弗赖堡大学）；Collaborative Centre for Genomics Cancer Medicine（基因组癌症医学合作中心）；CRS4

本文提出FAIR原则应用于计算工作流，并通过EOSC-Life协作实验室等实例，介绍支持工作流可发现、可访问、可互操作和可重用的服务生态系统。

2026-05-22cs.DC

信任，但要验证：严格剖析面向数字演化的尽力而为高性能计算

Trust, but Verify: Rigorously Profiling Best-Effort High-Performance Computing for Digital Evolution

University of Michigan, Ann Arbor, MI, USA（密歇根大学）；Michigan State University, East Lansing, MI, USA（密歇根州立大学）

该研究开发了测量尽力而为代码运行时行为的框架，通过两个案例验证了面向数字演化的尽力而为高性能计算的可行性，为后确定性HPC范式发展提供了支撑。

2026-09-04cs.DCcs.NE

利用线性老虎机中的分布式最佳臂识别在小型基站网络中进行服务部署

Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Bandits

University of Tübingen（蒂宾根大学）；Ruhr-University Bochum（波鸿鲁尔大学）

本文研究了在小型基站网络中如何通过分布式最佳臂识别算法优化服务部署，以减少用户延迟。

2026-04-07cs.DCcs.LGcs.NI

Software Cost Estimation Framework for Service-Oriented Architecture Systems using Divide-and-Conquer Approach

Due to the complexity of Service-Oriented Architecture (SOA), cost and effort estimation for SOA-based software development is more difficult than that for traditional software development. Unfortunately, there is a lack of published work about cost and effort estimation for SOA-based software. Existing cost estimation approaches are inadequate to address the complex service-oriented systems. This paper proposes a novel framework based on Divide-and-Conquer (D&C) for cost estimation for building SOA-based software. By dealing with separately development parts, the D&C framework can help organi…

2013-02-09cs.DCcs.SE

Learned Best-Effort LLM Serving（基于学习的尽力而为大语言模型服务）

Learned Best-Effort LLM Serving

UC Berkeley（加州大学伯克利分校）

针对LLM服务低延迟需求与资源过度配置成本过高的矛盾，提出采用深度强化学习的尽力而为服务系统，可根据负载调整服务质量，大幅提升请求承载能力与硬件利用率。

2024-07-15cs.AIcs.CLcs.DC

Research Agenda in Cloud Technologies

Cloud computing is the latest effort in delivering computing resources as a service. It represents a shift away from computing as a product that is purchased, to computing as a service that is delivered to consumers over the internet from large-scale data centres - or "clouds". Whilst cloud computing is gaining growing popularity in the IT industry, academia appeared to be lagging behind the rapid developments in this field. This paper is the first systematic review of peer-reviewed academic research published in this field, and aims to provide an overview of the swiftly developing advances in…

2010-01-19cs.DC

Best-Effort FPGA Programming: A Few Steps Can Go a Long Way

FPGA-based heterogeneous architectures provide programmers with the ability to customize their hardware accelerators for flexible acceleration of many workloads. Nonetheless, such advantages come at the cost of sacrificing programmability. FPGA vendors and researchers attempt to improve the programmability through high-level synthesis (HLS) technologies that can directly generate hardware circuits from high-level language descriptions. However, reading through recent publications on FPGA designs using HLS, one often gets the impression that FPGA programming is still hard in that it leaves prog…

2018-07-03cs.ARcs.DCcs.PF

Top-k Dynamic Service Composition in Skyway Networks

We propose a novel top-k service composition framework for drone services under a dynamic environment. We develop a system model for formal modelling of drone services in a skyway network. The composition process is accomplished in two phases, i.e., computing top-k compositions and extending and ranking top-k compositions using probabilistic wait and recharge times under congestion conditions. We propose a top-k composition algorithm to compute the best service composition plan meeting user's requirements. A set of experiments with a real dataset is conducted to demonstrate the effectiveness o…

2021-10-30cs.DCcs.MA

Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions

A current trend in networking and cloud computing is to provide compute resources at widely dispersed places; this is exemplified by developments such as Network Function Virtualisation. This paves the way for wide-area service deployments with improved service quality: e.g, a nearby server can reduce the user-perceived response times. But always using the nearest server can be a bad decision if that server is already highly utilised. This paper formalises the two related problems of allocating resources at different locations and assigning users to them with the goal of minimising the respons…

2016-08-30cs.DCcs.NI

BEV-SGD: Best Effort Voting SGD for Analog Aggregation Based Federated Learning against Byzantine Attackers

Beijing Jiaotong University（北京交通大学）；George Mason University（乔治梅森大学）

As a promising distributed learning technology, analog aggregation based federated learning over the air (FLOA) provides high communication efficiency and privacy provisioning under the edge computing paradigm. When all edge devices (workers) simultaneously upload their local updates to the parameter server (PS) through commonly shared time-frequency resources, the PS obtains the averaged update only rather than the individual local ones. While such a concurrent transmission and aggregation scheme reduces the latency and communication costs, it unfortunately renders FLOA vulnerable to Byzantin…

2022-02-10cs.CRcs.DCcs.IT