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

34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

作者： Bezdrighin, Marcel Elkin, Michael Ghaffari, Mohsen Grunau, Christoph Haeupler, Bernhard Ilchi, Saeed Rozhon, Vaclav Swiss Fed Inst Technol Zurich Switzerland Ben Gurion Univ Negev Beer Sheva Israel Carnegie Mellon Univ Pittsburgh PA USA

ISBN: (纸本)9781450391467

This paper presents efficient distributed algorithms for a number of fundamental problems in the area of graph sparsification: circle We provide the first deterministic distributed algorithm that computes an ultra-sparse spanner in polylog(n) rounds in weighted graphs. Concretely, our algorithm outputs a spanning subgraph with only n +o (n) edges in which the pairwise distances are stretched by a factor of at most O ( log n center dot 2(O (log*n))). circle We provide a polylog(n)-round deterministic distributed algorithm that computes a spanner with stretch (2k - 1) and O (nk +n(1+1/k) logk) edges in unweighted graphs and with O(n(1+1/k)k) edges in weighted graphs. circle We present the first polylog(n) round randomized distributed algorithm that computes a sparse connectivity certificate. For an n-node graph G, a certificate for connectivity kappa is a spanning subgraph H that is kappa-edge-connected if and only if G is kappa-edge-connected, and this subgraph.. is called sparse if it has O(nk) edges. Our algorithm achieves a sparsity of (1 +o (1))nk edges, which is within a 2(1 +o(1)) factor of the best possible.

关键词： distributed computing Spanners Ultra-Sparse Spanners LowDiameter Clustering Connectivity Certificates

来源：评论

学校读者我要写书评

暂无评论

OsirisBFT: Say No to Task Replication for Scalable Byzantine Fault Tolerant Analytics 24

OsirisBFT: Say No to Task Replication for Scalable Byzantine...

引用

29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Jamshidi, Kasra Vora, Keval Simon Fraser Univ Sch Comp Sci Burnaby BC Canada

ISBN: (纸本)9798400704352

We present a verification-based Byzantine Fault Tolerant processing system, called OsirisBFT, for distributed taskparallel applications. OsirisBFT treats computation tasks differently from state update tasks, allowing the application to scale independently from number of expected failures. OsirisBFT captures application-specific verification semantics via generic verification operators and employs lightweight verification strategies with little coordination during graceful execution. Evaluation across multiple applications and workloads shows that OsirisBFT delivers high processing throughput and scalability compared to replicated processing. Importantly, the scalable nature of OsirisBFT enables it to reduce the performance gap compared to baseline with no fault tolerance by simply scaling out.

关键词： distributed computing Byzantine Fault Tolerance Data Processing Systems Resilient Systems.

来源：评论

学校读者我要写书评

暂无评论

Energy performance of Internet of Things (IoT) networks for pipeline monitoring 20

Energy performance of Internet of Things (IoT) networks for ...

引用

20th IEEE International Wireless Communications and Mobile computing (IEEE IWCMC) - Green and Intelligent Communications

作者： Kuaban, Godlove Suila Czachorski, Tadeusz Gelenbe, Erol Pecka, Piotr Nkemeni, Valery Czekalski, Piotr Polish Acad Sci IITiS PAN Inst Theoret & Appl Informat Gliwice Poland Univ Buea Fac Engn & Technol Lab Elect Engn & Comp Buea Cameroon Silesian Tech Univ Fac Automat Control Elect & Informat Gliwice Poland

ISBN: (纸本)9798350361261;9798350361278

Pipelines are the most convenient ways to transport fluids (e.g., water, oil, and gas). However, leakage of fluids into the environment results in resource wastage (primarily water, which is becoming a scarce resource) and environmental pollution (in the case of leakage of toxic fluids like oil and gas). Emerging technologies like the Internet of Things (IoT), Wireless Sensor Networks (WSNs), Artificial Intelligence (AI), distributed computing, and cloud computing enable continuous monitoring of pipelines to detect leakages and corrosion on the pipeline. The main challenge with using battery-powered sensor nodes to monitor pipelines is the energy constraint, necessitating frequent battery replacement. Thus, there is a need to develop energy-saving mechanisms to prolong the lifetime of these sensor nodes. In this paper, we use the diffusion approximation modelling framework in which the data from the experimental testbed are used to model the dynamics of the battery's energy content and to estimate the mean and variance of the device's lifetime. The novelty in the proposed diffusion model of the battery of an IoT node is the introduction of multiple energy thresholds that split the energy state-space of the battery into multiple energysaving regimes. As the battery discharges, the node gradually transitions into energy-saving regimes by reconfiguring some of its parameters to reduce energy consumption (sometimes at the cost of trading off some performance metrics). We investigate the impact of energy-saving regimes or the number of thresholds on the node's lifetime.

关键词： Green Internet of Things (IoT) energy performance diffusion models adaptive sensing distributed computing duty cycling

来源：评论

学校读者我要写书评

暂无评论

Efficient AI Applications in Edge-Cloud Environments

引用

JOURNAL OF WEB ENGINEERING 2023年第6期22卷 V-VII页

作者： Ko, In-Young Mrissa, Michael Murillo, Juan Manuel Srivastava, Abhishek Korea Adv Inst Sci & Technol Daejeon South Korea InnoRenew CoE Izola Slovenia Univ Primorska Koper Slovenia Univ Extremadura Badajoz Spain COMPUTAEX Fdn Caceres Spain Indian Inst Technol Indore Indore India

The international workshop on Big Data-Driven Edge Cloud Services (BECS) provides a venue for scholars and practitioners to share their experiences and present their ongoing work in the development of data-driven AI applications and services in a distributed computing environment known as the edge cloud. The third edition of the workshop (BECS 2023) 1 1 https://***/iwbecs2023/ was held in conjunction with the 23rd International Conference on Web Engineering (ICWE 2023), 2 2 https://***/ which was held in Alicante, Spain on June 6-9, 2023.

关键词： Conferences Artificial intelligence distributed computing

来源：评论

学校读者我要写书评

暂无评论

Byzantine Attack Identification in distributed Matrix Multiplication via locally testable codes

Byzantine Attack Identification in Distributed Matrix Multip...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Hong, Sangwoo Yang, Heecheol Lee, Jungwoo Seoul Natl Univ Dept Elect & Comp Engn Seoul South Korea Chungnam Natl Univ Div Comp Convergence Daejeon South Korea

ISBN: (纸本)9781665421607;9781665421591

Coded computing has proved its efficiency in handling a straggler issue in distributed computing framework. However, in a coded distributed computing framework, there may exist Byzantine workers who send the wrong computation results to a master to contaminate the overall computation output. Therefore, it is essential to identify Byzantine workers from their computation results in coded computing. In this paper, we consider Byzantine attack identification problem in coded computing for distributed matrix multiplication tasks. We propose locally testable codes which facilitate the efficient Byzantine attack identification, and suggest a hierarchical group testing method for Byzantine attack identification. We show that our scheme requires smaller number of tests than the conventional group testing methods for the existing coded computing schemes.

关键词： distributed computing Byzantine attack coded computation matrix multiplication group testing

来源：评论

学校读者我要写书评

暂无评论

Identifying Reliable Machines for distributed Matrix-Vector Multiplication

Identifying Reliable Machines for Distributed Matrix-Vector ...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Jain, Sarthak Cardone, Martina Mohajer, Soheil Univ Minnesota Minneapolis MN 55455 USA

ISBN: (纸本)9781665421607;9781665421591

This paper considers a distributed computing framework, where the task of T matrix-vector products is distributed among n worker machines. External adversaries have access to a subset L (the cardinality of which is |L|) of these machines, and can maliciously perturb the result of each of their computations with probability alpha. To correctly recover each matrix-vector product, the master has to identify a set (of a fixed cardinality) of 'unattacked' worker machines. Towards this end, this work proposes four schemes that aim at performing such an identification. These schemes are analyzed and compared under different regimes of (|L|;alpha) for the two cases when |L| is (1) known or (2) unknown at the master.

关键词： Reliability theory Task analysis distributed computing Information theory

来源：评论

学校读者我要写书评

暂无评论

Cliffhanger: An Experimental Evaluation of Stateful Serverless at the Edge 19

Cliffhanger: An Experimental Evaluation of Stateful Serverle...

引用

19th Wireless On-Demand Network Systems and Services Conference (WONS)

作者： Hasselberg, Adam Timoudas, Thomas Ohlson Carbone, Paris Dan, Gyorgy RISE Gothenburg Sweden KTH Stockholm Sweden

ISBN: (纸本)9783903176614

The serverless computing paradigm has transformed cloud service deployment by enabling automatic scaling of resources in response to varying demand. Building on this, stateful serverless computing introduces critical capabilities for data management, fault tolerance, and consistency, which are particularly relevant in the context of distributed deployments, notably in edge computing environments. In this work, we explore the feasibility of stateful serverless computing in resource-limited edge environments through an empirical study utilizing a multi-view object tracking application. Our results show that while these systems perform well in cloud environments, their effectiveness is severely affected at the edge due to state, application, and resource management solutions optimized for cloud environments. Existing solutions are most detrimental to applications with intermittent workloads, as typical combinations of concurrency handling and resource reservation can lead to minutes of unstable system behavior due to cold starts. Our results highlight the need for a tailored approach in stateful serverless systems for edge computing scenarios.

关键词： distributed computing Edge computing Fog computing

来源：评论

学校读者我要写书评

暂无评论

HERP: Hierarchical and distributed clouds oriented efficient resource scheduling algorithm with stochastic requirements

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 258卷

作者： Wei, Wei Li, Haoyi Zhang, Qinghui Henan Univ Technol KeyLab Grain Informat Proc & Control Minist Educ Zhengzhou 450001 Peoples R China Henan Univ Technol Henan Key Lab Grain Storage Informat Intelligent P Zhengzhou 450001 Peoples R China Henan Univ Technol Henan Grain Big Data Anal & Applicat Engn Res Ctr Zhengzhou 450001 Peoples R China

With the development of cloud technology, hierarchical and distributed cross-cloud architecture is gradually replacing traditional centralized architecture, for example, used in edge (or fog) computing. Due to the fluctuation of resource requirements, if a node does not have sufficient resources to process requests, the same or higher-level nodes can share their resources by offloading or redirecting requests to themselves, at the possible cost of reduced service quality. However, it is difficult to effectively optimize the sharing effect based on mean requirements. We formulate the multilevel problem with horizontal and vertical resource sharing using stochastic models, identify the optimal structures with embedded subproblems, and obtain the approximation solution in an efficient dynamic programming manner. In the problem setting with a wide range of different parameters, the proposed algorithm can outperform existing mean and heuristic algorithms in all scenarios to improve the total satisfied requirements by up to 26%, and can be hundreds of times faster than these heuristic algorithms.

关键词： Hierarchical and distributed clouds Resource scheduling Stochasticity Edge computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

IPU-EpiDet: Identifying Gene Interactions on Massively Parallel Graph-Based AI Accelerators 38

IPU-EpiDet: Identifying Gene Interactions on Massively Paral...

引用

International Parallel and distributed Processing Symposium (IPDPS)

作者： Nobre, Ricardo Ilic, Aleksandar Santander-Jimenez, Sergio Sousa, Leonel Univ Lisbon INESC ID Inst Super Tecn Lisbon Portugal Univ Extremadura UNEX Caceres Spain

ISBN: (纸本)9798350387117;9798350387124

Epistasis detection is a bioinformatics application that searches for associations between sets of single nucleotide polymorphisms (SNPs) and a given trait of a population. Epistasis detection is a computationally complex problem, especially when tackling interaction orders above two. This paper presents a pioneering approach for performing third-order epistasis searches that has been devised around the bulk-synchronous parallel (BSP) model of execution, which is used in processor designs that target artificial intelligence (AI) workloads, such as Graphcore's Intelligence Processing Unit (IPU). We propose a parallelization approach and a set of optimizations to efficiently exploit the computation and communication resources of these novel AI processors to perform precise bioinformatics searches. The proposed approach achieves a performance of 3.9 Tera SNP combinations evaluated per second, scaled to sample size, on an IPU-M2000 AI accelerator, while close to a linear speedup (up to 15.01x) is achieved with 16 IPU-M2000 accelerators.

关键词： bioinformatics epistasis detection distributed computing IPU

来源：评论

学校读者我要写书评

暂无评论

DYNAMOS: dynamic microservice composition for data-exchange systems, lessons learned 21

DYNAMOS: dynamic microservice composition for data-exchange ...

引用

21st International Conference on Software Architecture (ICSA)

作者： Stutterheim, Jorrit Mifsud, Aleandro Oprescu, Ana Univ Amsterdam Complex Cyber Infrastruct Amsterdam Netherlands

ISBN: (纸本)9798350366266;9798350366259

Data exchange has become increasingly important in modern business and research. Consequently, many initiatives are being developed worldwide to facilitate open data exchange in secure distributed marketplaces. Ideally, each party maintains control over their data and implements access through legal contracts, in the form of programmable policy. Such policy would express where the data exchange takes place, and who has access to the data. Inspired by how traditional Operating Systems abstract the complexities of computer architectures into standardized core functions, this research focuses on abstracting different data exchange patterns into a unified set of core data exchange microservices that adhere to agreed-upon data exchange policies. DYNAMOS implements a distributed data exchange platform and recreates real-life data exchange use cases. It is designed to be self-adaptive, utilizing extendable algorithms to generate dynamic microservice compositions and dynamically choose archetype patterns, influenced by policy, user input, or system events. In our study, we highlight key insights from our experience with a dynamic microservice platform. Employing sidecars for communication abstraction, protocol buffers for strict interface definition, and ephemeral single-use jobs for improved security emerged as pivotal strategies. However, these approaches do introduce a trade-off between operational speed and especially system complexity.

关键词： Microservices distributed computing Data Exchange Self-Adaptivity MAPE-K

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：