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

30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Robinson, Wilfredo J. M. Esposito, Flavio Zuluaga, Maria A. St Louis Univ Dept Comp Sci St Louis MO 63103 USA Eurecom Data Sci Dept Biot France

ISBN: (纸本)9781665455800

Deep Neural Networks (DNNs) process big datasets achieving high accuracy on incredibly complex tasks. However, this progress has led to a scalability impasse, as DNNs require massive amounts of processing power and local memory to be trained, making them impossible or impractical to be used on a single device. This situation has led to the design of distributed training architectures, where the DNN and the training data can be split among multiple processors. How to choose the appropriate distributed training architecture, however, remains an open question. To help bring insights into this debate, in this work we design a distributed Training Simulator (DTS) that estimates the training time of a DNN in a distributed architecture through a mathematical model of the distributed architecture and resource-allocation heuristics. We illustrate the power of the proposed DTS through the implementation of five different distributed architectures, Pipeline Learning, Federated Learning, Split Learning, Parallel Split Learning, and Federated Split Learning, and we validate the accuracy of the training estimates using three different datasets of varying complexity and two different DNNs. Finally, we present a trade-off analysis to demonstrate the coherence of DTS estimates for diverse high-performance computing scenarios by comparing these estimates with the behaviors of a real computer cluster.

关键词： big data distributed computing deep learning simulator

来源：评论

学校读者我要写书评

暂无评论

A Federated Learning Approach for distributed Human Activity Recognition 8

A Federated Learning Approach for Distributed Human Activity...

引用

8th IEEE International Conference on Smart computing (SMARTCOMP)

作者： Concone, Federico Ferdico, Cedric Lo Re, Giuseppe Morana, Marco Univ Palermo Dipartimento Ingn Viale SciEd 6 I-90128 Palermo Italy

ISBN: (纸本)9781665481526

In recent years, the widespread diffusion of smart pervasive devices able to provide AI-based services has encouraged research in the definition of new distributed learning paradigms. Federated Learning (FL) is one of the most recent approaches which allows devices to collaborate to train AI-based models, whereas guarantying privacy and lower communication costs. Although different studies on FL have been conducted, a general and modular architecture capable of performing well in different scenarios is still missing. Following this direction, this paper proposes a general FL framework whose validity is assessed by considering a distributed activity recognition scenario in which users' personal devices are employed as the basis of the sensing infrastructure. Experimental analysis was performed to evaluate the effectiveness of the architecture as compared with a centralized approach, under different settings. Results demonstrate the versatility and functionality of the proposed solution.

关键词： Federated Learning distributed computing Machine Learning Human Activity Recognition

来源：评论

学校读者我要写书评

暂无评论

A Serverless Engine for High Energy Physics distributed Analysis 22

A Serverless Engine for High Energy Physics Distributed Anal...

引用

22nd IEEE/ACM International Symposium on Cluster, Cloud and Internet computing (CCGrid)

作者： Kugnierz, Jacek Padulano, Vincenzo E. Malawski, Maciej Burkiewicz, Kamil Saavedra, Enric Tejedor Alonso-Jorda, Pedro Pitt, Michael Avati, Valentina AGH Univ Sci & Technol Inst Comp Sci Krakow Poland TUM Dept Informat Munich Germany CERN EP SFT Geneva Switzerland Univ Politecn Valencia DSIC Valencia Spain CERN EP CMG Os Geneva Switzerland CERN EP UHC Geneva Switzerland

ISBN: (纸本)9781665499569

The Large Hadron Collider (LHC) at CERN has generated in the last decade an unprecedented volume of data for the High-Energy Physics (HEP) field. Scientific collaborations interested in analysing such data very often require computing power beyond a single machine. This issue has been tackled traditionally by running analyses in distributed environments using stateful, managed batch computing systems. While this approach has been effective so far, current estimates for future computing needs of the field present large scaling challenges. Such a managed approach may not be the only viable way to tackle them and an interesting alternative could be provided by serverless architectures, to enable an even larger scaling potential. This work describes a novel approach to running real HEP scientific applications through a distributed serverless computing engine. The engine is built upon ROOT, a well-established HEP data analysis software, and distributes its computations to a large pool of concurrent executions on Amazon Web Services Lambda Serverless Platform. Thanks to the developed tool, physicists are able to access datasets stored at CERN (also those that are under restricted access policies) and process it on remote infrastructures outside of their typical environment. The analysis of the serverless functions is monitored at runtime to gather performance metrics, both for data- and computation-intensive workloads.

关键词： Serverless distributed computing CERN ROOT HEP MapReduce AWS Lambda

来源：评论

学校读者我要写书评

暂无评论

Simplicial models for the epistemic logic of faulty agents

引用

BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA 2024年第3期30卷 1-44页

作者： Goubault, Eric Kniazev, Roman Ledent, Jeremy Rajsbaum, Sergio Ecole Polytech LIX CNRS F-91128 Palaiseau France IP Paris F-91128 Palaiseau France Univ Paris Saclay CNRS LSV F-91190 Gif Sur Yvette France Univ Paris CNRS IRIF F-75013 Paris France Univ Nacl Autonoma Mexico Inst Matemat Mexico City 04510 Mexico

In recent years, several authors have been investigating simplicial models, a model of epistemic logic based on higher dimensional structures called simplicial complexes. In the original formulation of Goubault et al. (Inf Comput 278:104597, 2021. https://***/10.1016/***.2020.104597), simplicial models are always assumed to be pure, meaning that all worlds have the same dimension. This is equivalent to the standard S5n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {S5_n}$$\end{document} semantics of epistemic logic, based on Kripke models. By removing the assumption that models must be pure, we can go beyond the usual Kripke semantics and study epistemic logics where the number of agents participating in a world can vary. This approach has been developed in a number of papers (van Ditmarsch, WoLLIC 2021, pp 31-46, 2021. https://***/10.1007/978-3-030-88853-4_3;Goubault et al. STACS 2022, pp 33:1-33:20, 2022. https://***/10.4230/***.2022.33;Goubault et al. LICS, pp 1-13, 2023. https://***/10.1109/LICS56636.2023.10175737), with applications in fault-tolerant distributed computing where processes may crash during the execution of a system. A difficulty that arises is that subtle design choices in the definition of impure simplicial models can result in different axioms of the resulting logic. In this paper, we classify those design choices systematically, and axiomatize the corresponding logics. We illustrate them via distributed computing examples of synchronous systems where processes may crash.

关键词： Epistemic logic Simplicial complexes distributed computing Theory of computation Modal and temporal logics

来源：评论

学校读者我要写书评

暂无评论

DESIGNING (NOT ONLY) LUNAR SPACE DATA CENTERS

DESIGNING (NOT ONLY) LUNAR SPACE DATA CENTERS

引用

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)

作者： Wijata, Agata M. Musiael, Alicja Lazaj, Dawid Gumiela, Michal Przeliorz, Mateusz Weiss, Jonas Sagmeister, Patricia Morf, Thomas Schmatz, Martin Longepe, Nicolas Mathieu, Pierre-Philippe Nalepa, Jakub KP Labs Bojkowska 37J PL-44100 Gliwice Poland Silesian Tech Univ Akad 2A PL-44100 Gliwice Poland IBM Res Europe Zurich Saumerstr 4 CH-8803 Ruschlikon Switzerland European Space Agcy Largo Galileo Galilei 1 I-00044 Frascati Italy

ISBN: (纸本)9798350360332;9798350360325

An unprecedented amount of data generated in space missions triggers lots of practical challenges and concerns with its transfer, storage, and analysis. As Lunar and deep space missions emerge, we need to also face the challenges of distributed computing and big data analytics. In this paper, we outline these issues and discuss how to design and analyze Lunar data centers, being space data centers designed for distributed computing, and data analysis for (not only) Lunar missions. We investigate the opportunities and chances of such space architectures to lay the foundations for practical space data centers and real-life use cases.

关键词： Lunar exploration big data distributed computing on-board processing space data center.

来源：评论

学校读者我要写书评

暂无评论

COPA Use Case: distributed Secure Joint Computation 30

COPA Use Case: Distributed Secure Joint Computation

引用

IEEE 30th International Symposium on Field-Programmable Custom computing Machines (FCCM)

作者： Patel, Rushi Haghi, Pouya Jain, Shweta Kot, Andriy Krishnan, Venkata Varia, Mayank Herbordt, Martin Boston Univ Coll Engn Boston MA 02215 USA Boston Univ Comp & Data Sci Boston MA 02215 USA Intel Corp Hudson MA USA

ISBN: (纸本)9781665483322

Data centers provide good environments for distributed computing as they are easily accessible and may have low-latency communication between nodes [1] ; often, however, performance is limited by network bandwidth. These network bottlenecks drive the need for alternative communication resources to improve performance of large-scale applications. SmartNICs [2] – [4] have been introduced to perform the same tasks of standard NICs, but contain additional resources to allow for network function optimization with additional hardware. Adoption of SmartNICs continues to increase as a means to accelerate network functions and offload packet processing tasks away from CPU resources [5] – [13] .

关键词： Data centers Bandwidth Hardware Task analysis Low latency communication distributed computing Standards

来源：评论

学校读者我要写书评

暂无评论

On Parallel or distributed Asynchronous Iterations with Unbounded Delays and Possible Out of Order Messages or Flexible Communication for Convex Optimization Problems and Machine Learning 36

On Parallel or Distributed Asynchronous Iterations with Unbo...

引用

36th IEEE International Parallel and distributed Processing Symposium (IEEE IPDPS)

作者： El-Baz, Didier Univ Toulouse CNRS LAAS Toulouse France

ISBN: (纸本)9781665497473

We describe several features of parallel or distributed asynchronous iterative algorithms such as unbounded delays, possible out of order messages or flexible communication. We concentrate on the concept of macro-iteration sequence which was introduced in order to study the convergence or termination of asynchronous iterations. A survey of asynchronous iterations for convex optimization problems is also presented. Finally, a new result of convergence for parallel or distributed asynchronous iterative algorithms with flexible communication for convex optimization problems and machine learning is proposed.

关键词： asynchronous iterative algorithms unbounded delays out of order messages flexible communication parallel computing distributed computing convey optimization machine learning

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal distributed Dominating Set in Bounded Arboricity Graphs 22

Near-Optimal Distributed Dominating Set in Bounded Arboricit...

引用

ACM Symposium on Principles of distributed computing (PODC)

作者： Dory, Michal Ghaffari, Mohsen Ilchi, Saeed Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450392624

We describe a simple deterministic O(epsilon(-1) log Delta) round distributed algorithm for (2 alpha+ 1) (1 + epsilon) approximation of minimum weighted dominating set on graphs with arboricity at most alpha. Here Delta denotes the maximum degree. We also show a lower bound proving that this round complexity is nearly optimal even for the unweighted case, via a reduction from the celebrated KMW lower bound on distributed vertex cover approximation [Kuhn, Moscibroda, and Wattenhofer JACM'16]. Our algorithm improves on all the previous results (that work only for unweighted graphs) including a randomized O(alpha(2)) approximation in O(log n) rounds [Lenzen and Wattenhofer DISC'10], a deterministic O(alpha log Delta) approximation in O(log Delta) rounds [Lenzen and Wattenhofer DISC'10], a deterministic O(alpha) approximation in O(log(2) Delta) rounds [implicit in Bansal and Umboh IPL'17 and Kuhn, Moscibroda, and Wattenhofer SODA'06], and a randomized O(alpha) approximation in O(alpha log n) rounds [Morgan, Solomon and Wein DISC'21]. We also provide a randomized O(alpha log Delta) round distributed algorithm that sharpens the approximation factor to alpha (1 + o(1)). If each node is restricted to do polynomial-time computations, our approximation factor is tight in the first order as it is NP-hard to achieve alpha - 1 - epsilon approximation [Bansal and Umboh IPL'17].

关键词： distributed computing Dominating Set Arboricity Approximation Algorithms

来源：评论

学校读者我要写书评

暂无评论

A distributed Approach for the Implementation of Geometric Reconstruction-Based Visual SLAM Systems

引用

ROBOTICA 2021年第5期39卷 749-771页

作者： Ramos Neto, Otacilio de Araujo Lima Filho, Abel Cavalcante Nascimento, Tiago P. Inst Fed Educ Ciencia & Tecnol Paraiba Embedded & Distributed Comp Lab LACED Guarabira Brazil Univ Fed Paraiba Dept Mech Engn Joao Pessoa Paraiba Brazil Univ Fed Paraiba Dept Comp Syst Lab Syst Engn & Robot LaSER Joao Pessoa Paraiba Brazil

Visual simultaneous localization and mapping (VSLAM) is a relevant solution for vehicle localization and mapping environments. However, it is computationally expensive because it demands large computational effort, making it a non-real-time solution. The VSLAM systems that employ geometric reconstructions are based on the parallel processing paradigm developed in the Parallel Tracking and Mapping (PTAM) algorithm. This type of system was created for processors that have exactly two cores. The various SLAM methods based on the PTAM were also not designed to scale to all the cores of modern processors nor to function as a distributed system. Therefore, we propose a modification to the pipeline for the execution of well-known VSLAM systems so that they can be scaled to all available processors during execution, thereby increasing their performance in terms of processing time. We explain the principles behind this modification via a study of the threads in the SLAM systems based on PTAM. We validate our results with experiments describing the behavior of the original ORB-SLAM system and the modified version.

关键词： Visual SLAM distributed computing Mobile robotics

来源：评论

学校读者我要写书评

暂无评论

Awake-Efficient distributed Algorithms for Maximal Independent Set 42

Awake-Efficient Distributed Algorithms for Maximal Independe...

引用

42nd IEEE International Conference on distributed computing Systems (ICDCS)

作者： Hourani, Khalid Pandurangan, Gopal Robinson, Peter Univ Houston Dept Comp Sci Houston TX 77004 USA Augusta Univ Sch Comp & Cyber Sci Augusta GA USA

ISBN: (数字)9781665471770

ISBN: (纸本)9781665471770

We present a simple algorithmic framework for designing efficient distributed algorithms for the fundamental symmetry breaking problem of Maximal Independent Set (MIS) in the sleeping model [Chatterjee et al, PODC 2020]. In the sleeping model, only the rounds in which a node is awake are counted for the awake complexity, while sleeping rounds are ignored. This is motivated by the fact that a node spends resources only in its awake rounds and hence the goal is to minimize the awake complexity. Our framework allows us to design distributed MIS algorithms that have O (polyloglog(n)) (worst-case) awake complexity in certain important graph classes which satisfy the so-called adjacency property. Informally, the adjacency property guarantees that the graph can be partitioned into an appropriate number of classes so that each node has at least one neighbor belonging to every class. Graphs that can satisfy the adjacency property are random graphs with large clustering coefficient such as random geometric graphs as well as line graphs of regular (or near regular) graphs. We first apply our framework to design two randomized distributed MIS algorithms for random geometric graphs of arbitrary dimension d (even non-constant). The first algorithm has O(polyloglog n) (worst-case) awake complexity with high probability, where n is the number of nodes in the graph.' This means that any node in the network spends only O(polyloglog n) awake rounds;this is almost exponentially better than the (traditional) time complexity of O(log n) rounds (where there is no distinction between awake and sleeping rounds) known for distributed MIS algorithms on general graphs or even the faster O(root log n/log log n ) rounds known for Erdos-Renyi random graphs. log log n However, the (traditional) time complexity of our first algorithm is quite large-essentially proportional to the degree of the graph. Our second algorithm has a slightly worse awake complexity of O(d polyloglog n), but achieves a sig

关键词： Clustering algorithms Complexity theory Partitioning algorithms Time complexity distributed algorithms distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：