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

SIAM JOURNAL ON computing 1999年第5期28卷 1848-1874页

作者： Dwork, C Herlihy, M Plotkin, S Waarts, O IBM Corp Almaden Res Ctr San Jose CA 95120 USA Brown Univ Dept Comp Sci Providence RI 02912 USA DEC Cambridge Res Lab Cambridge England Stanford Univ Dept Comp Sci Stanford CA 94305 USA Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA

A snapshot scan algorithm produces an "instantaneous" picture of a region of shared memory that may be updated by concurrent processes. Many complex shared memory algorithms can be greatly simplified by structuring them around the snapshot scan abstraction. Unfortunately, the substantial decrease in conceptual complexity quite often is counterbalanced by an increase in computational complexity. In this paper, we introduce the notion of a weak snapshot scan, a slightly weaker primitive that has a more efficient implementation. We propose the following methodology for using this abstraction: first, design and verify an algorithm using the more powerful snapshot scan;second, replace the more powerful but less efficient snapshot with the weaker but more efficient snapshot, and show that the weaker abstraction nevertheless suffices to ensure the correctness of the enclosing algorithm. We give two examples of algorithms whose performance is enhanced while retaining a simple modular structure: bounded concurrent timestamping and bounded randomized consensus. The resulting timestamping protocol dominates all other currently known timestamping protocols: it matches the speed of the fastest known bounded concurrent timestamping protocol while actually reducing the register size by a logarithmic factor. The resulting randomized consensus protocol matches the computational complexity of the best known protocol that uses only bounded values.

关键词： distributed computing distributed algorithms shared-memory algorithms asynchronous PRAMS atomic snapshots timestamping time-lapse snapshots

来源：评论

学校读者我要写书评

暂无评论

Network-assisted processing of advanced IoT applications: challenges and proof-of-concept application

引用

CLUSTER computing-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2024年第2期27卷 1849-1865页

作者： Mora, Higinio Pujol, Francisco A. Ramirez, Tamai Jimeno-Morenilla, Antonio Szymanski, Julian Univ Alicante Dept Comp Technol & Computat Carretera San Vicente S-N Alicante 03690 Spain Gdansk Univ Technol Fac Elect Telecommun & Informat Dept Comp Architecture Gabriela Narutowicza 11-12 PL-80233 Gdansk Poland

Recent advances in the area of the Internet of Things shows that devices are usually resource-constrained. To enable advanced applications on these devices, it is necessary to enhance their performance by leveraging external computing resources available in the network. This work presents a study of computational platforms to increase the performance of these devices based on the Mobile Cloud computing (MCC) paradigm. The main contribution of this paper is to research the advantages and possibilities of architectures with multiple offloading options. To this end, a review of architectures that use a combination of the computing layers in the available infrastructure to perform this paradigm and outsource processing load is presented. In addition, a proof-of-concept application is introduced to demonstrate its realization along all the network layers. The results of the simulations confirm the high flexibility to offload numerous tasks using different layers and the ability to overcome unfavorable scenarios.

关键词： Internet of Things Mobile computing Computer networks distributed computing Quality of service Cloud computing

来源：评论

学校读者我要写书评

暂无评论

MODELS OF COMPUTATION SYSTEMS-CYCLIC TO ACYCLIC GRAPH TRANSFORMATIONS

引用

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS 1967年第1期EC16卷 70-&页

作者： MARTIN, DE ESTRIN, G Department of Electrical Engineering Massachusetts Institute of Technology Cambridge MA USA Department of Engineering University of California Los Angeles USA Department of Engineering University of California Los Angeles CA USA

This paper discusses cyclic to acyclic transformations performed on graphs representing computational sequences. Such transformations are critical to the development of models of computations and computer systems for performance prediction. The nature of cycles in computer programs for parallel processors is discussed. Transformations are then developed which replace cyclic graph structures by mean-value equivalent acyclic structures. The acyclic equivalents retain the noncyclic part of the structure in the original graph by evaluating a multiplicative factor associated with the mean time required for each vertex execution in the original graph. Bias introduced in the acyclic approximation is explored.

关键词： Computational modeling Predictive models Concurrent computing Circuit simulation Computer aided instruction distributed computing Statistics Utility programs Sequential circuits

来源：评论

学校读者我要写书评

暂无评论

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative

引用

distributed computing 2018年第2期31卷 139-166页

作者： Blin, Lelia Tixeuil, Sebastien Univ Evry Val Essonne F-91000 Evry France UPMC Sorbonne Univ Paris France CNRS LIP6 UMR 7606 Paris France Inst Univ France Paris France

This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the solution is required to be silent (i.e., when the state of each process remains fixed from some point in time during any execution), there exists a lower bound of bits of memory per participating node , where n denotes the number of nodes in the system. This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only memory bits per node, and stabilizes in rounds. Our protocol has several attractive features that make it suitable for practical purposes. First, it assumes an execution model that is used by existing compilers for real networks. Second, the size of the ring (or any upper bound on this size) does not need to be known by any node. Third, the node identifiers can be of various sizes. Finally, no synchrony assumption, besides weak fairness, is assumed. Our result shows that, perhaps surprisingly, silence can be traded for an exponential decrease in memory space without significantly increasing stabilization time or introducing restrictive assumptions.

关键词： STABILITY theory WIRELESS localization distributed computing GEOGRAPHICAL positions ELECTRONIC data processing

来源：评论

学校读者我要写书评

暂无评论

An introduction to algebraic multigrid

引用

computing IN SCIENCE & ENGINEERING 2006年第6期8卷 24-33页

作者： Falgout, Robert D. Lawrence Livermore Natl Lab CASC Livermore CA USA Lawrence Livermore Natl Lab Scalable Linear Solvers Project Livermore CA USA

Algebraic multigrid ( AMG) solves linear systems based on multigrid principles, but in a way that depends only on the coefficients in the underlying matrix.

关键词： Differential Equations Matrix Algebra Algebraic Multigrid Linear Systems Matrix Algebra Interpolation Equations Linear Systems Smoothing Methods Multigrid Methods Error Correction Parallel Machines Concurrent computing distributed computing Large Scale Systems Multigrid Solvers Linear Systems AMG Multigrid Principles

来源：评论

学校读者我要写书评

暂无评论

Mobile search for a black hole in an anonymous ring

引用

ALGORITHMICA 2007年第1期48卷 67-90页

作者： Dobrev, Stefan Flocchini, Paola Prencipe, Giuseppe Santoro, Nicola Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada Univ Pisa Dipartimento Informat I-56100 Pisa Italy Carleton Univ Dept Comp Sci Ottawa ON K1S 5B6 Canada

In this paper we address the problem of mobile agents searching for a highly harmful item (called a black hole) in a ring network. The black hole is a stationary process that destroys visiting agents upon their arrival without leaving any observable trace of such a destruction. The task is to have at least one surviving agent able to unambiguously report the location of the black hole. We consider different scenarios and in each situation we answer some computational as well as complexity questions. We first consider agents that start from the same home base (co-located). We prove that two such agents are necessary and sufficient to locate the black hole;in our algorithm the agents perform O (n log n) moves (where n is the size of the ring) and we show that such a bound is optimal. We also consider time complexity and show how to achieve the optimal bound of 2n - 4 units of time using n - I agents. We generalize our technique to establish a trade-off between time and number of agents. We then consider the case of agents that start from different home bases (dispersed) and we show that if the ring is oriented, two dispersed agents are still necessary and sufficient. Also in this case our algorithm is optimal in terms of number of moves (Theta (n log n)). We finally show that if the ring is unoriented, three agents are necessary and sufficient;an optimal algorithm follows from the oriented case.

关键词： mobile agents distributed computing ring network hazardous search

来源：评论

学校读者我要写书评

暂无评论

Managing redundancy in CAN-based networks supporting N-Version Programming

引用

COMPUTER STANDARDS & INTERFACES 2009年第1期31卷 120-127页

作者： Proenza, Julian Miro-Julia, Jose Hansson, Hans Univ Illes Balears Dept Matemat & Informat Palma de Mallorca 07122 Spain Malardalen Univ Malardalen Real Time Res Ctr S-72123 Vasteras Sweden

Software is a major source of reliability degradation in dependable systems. One of the classical remedies is to provide software fault tolerance by using N-Version Programming (NVP). However, due to requirements on non-standard hardware and the need for changes and additions at all levels of the system, NVP solutions are costly, and have only been used in special cases. In a previous work, a low-cost architecture for NVP execution was developed. The key features of this architecture are the use of off-the-shelf components including communication standards and that the fault tolerance functionality, including voting, error detection, fault-masking, consistency management, and recovery, is moved into a separate redundancy management circuitry (one for each redundant computing node). In this article we present an improved design of that architecture, specifically resolving some potential inconsistencies that were not treated in detail in the original design. In particular, we present novel techniques for enforcing replica determinism. Our improved architecture is based on using the Controller Area Network (CAN). This choice goes beyond the obvious interest of using standards in order to reduce the cost, since all the rest of the architecture is designed to take full advantage of the CAN standard features, such as data consistency, in order to significantly reduce the complexity, the efficiency and the cost of the resultant system. Although initially developed for NVP, our redundancy management circuitry also supports other software replication techniques, such as active replication. (C) 2007 Elsevier B.V. All fights reserved.

关键词： Software fault tolerance distributed computing Replica determinism CAN protocol N-Version Programming

来源：评论

学校读者我要写书评

暂无评论

PARALLEL computing IN THE UNDERGRADUATE CURRICULUM

引用

COMPUTER 1995年第12期28卷 51-&页

作者： NEVISON, CH Colgate University

The author describes how parallel computing can be integrated into courses throughout the computer science undergraduate curriculum. First, he explains why parallel computing is important, observing that many large, computationally intensive problems are solved with parallel programs. He reasons that as the related areas of symmetric multiprocessing and distributed computing also become more important, practitioners will need to fully understand parallel computing. Next, he describes the current situation at most colleges and universities, noting that parallel computing is offered only as an upper-level elective. The author then describes how parallel computing can be integrated into each course. He begins with the introductory courses and continues with those on computer organization and computer architecture, operating systems, programming languages, theory of computation, standard algorithms, discrete event simulation, and numerical analysis. Finally, the author explains the requirements for successfully implementing this integrated approach.

关键词： Parallel processing Concurrent computing Computer science Computer architecture Educational institutions Random access memory distributed computing Parallel programming Iterative methods Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Capacity Optimization of Large Intelligent Surface With Hardware Impairment Based on Meta-Deep Learning

引用

IEEE ACCESS 2024年 12卷 69359-69370页

作者： Mao, Yifan Xiao, Xiaoyu Hu, Zhirun Univ Manchester Dept Elect & Elect Engn Manchester M13 9PL Lancs England

This work proposes a sub-optimal method based on a two-layer structured meta-deep reinforcement learning (MDRL) approach to address the hardware impairment (HWI) optimization issue in large intelligent surface (LIS) systems. This method, designed for distributed LIS systems with reflection matrices, effectively enhances the system capacity and performance despite HWIs. Building upon existing techniques of dividing large-area LIS systems into multiple small-area subsystems, the simulated results demonstrate that sub-optimal LIS performance can be achieved with fewer samples in diverse dynamic wireless environments. This innovative approach enhances the adaptability of distributed LIS systems and offers an effective HWI management strategy, paving the way for future LIS system optimization.

关键词： Reflection Vectors Array signal processing Optimization Wireless communication Training distributed computing Reinforcement learning Hardware Large intelligent surface distributed system hardware impairment reflection matrix design fewer samples meta-deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Cloud-Based Framework for Machine Learning Workloads and Applications

引用

IEEE ACCESS 2020年 8卷 18681-18692页

作者： Lopez Garcia, Alvaro Marco De Lucas, Jesus Antonacci, Marica Zu Castell, Wolfgang David, Mario Hardt, Marcus Lloret Iglesias, Lara Molto, German Plociennik, Marcin Viet Tran Alic, Andy S. Caballer, Miguel Campos Plasencia, Isabel Costantini, Alessandro Dlugolinsky, Stefan Duma, Doina Cristina Donvito, Giacinto Gomes, Jorge Heredia Cacha, Ignacio Ito, Keiichi Kozlov, Valentin Y. Giang Nguyen Orviz Fernandez, Pablo SUstr, Zdenek Wolniewicz, Pawel UC CSIC IFCA Santander 39005 Spain Lab Instrumentat & Expt Particle Phys P-1600078 Lisbon Portugal INFN Bari I-70126 Bari Italy CNAF INFN I-40127 Bologna Italy PAS IBCh Poznan Supercomp & Networking Ctr PL-61704 Poznan Poland Karlsruhe Inst Technol D-76131 Karlsruhe Germany Univ Politecn Valencia CSIC I3M E-46022 Valencia Spain Slovak Acad Sci IISAS Inst Informat Bratislava 84507 Slovakia Deutsch Forschungszentrum Gesundheit Helmholtz Zentrum Munchen D-85764 Oberschleissheim Germany Tech Univ Munich Dept Math D-85748 Munich Germany CESNET Prague 16000 Czech Republic

In this paper we propose a distributed architecture to provide machine learning practitioners with a set of tools and cloud services that cover the whole machine learning development cycle: ranging from the models creation, training, validation and testing to the models serving as a service, sharing and publication. In such respect, the DEEP-Hybrid-DataCloud framework allows transparent access to existing e-Infrastructures, effectively exploiting distributed resources for the most compute-intensive tasks coming from the machine learning development cycle. Moreover, it provides scientists with a set of Cloud-oriented services to make their models publicly available, by adopting a serverless architecture and a DevOps approach, allowing an easy share, publish and deploy of the developed models.

关键词： Cloud computing computers and information processing deep learning distributed computing machine learning serverless architectures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：