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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

32 册 图书

馆藏范围

32 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

14 篇 工学
- 14 篇 计算机科学与技术...
- 1 篇 仪器科学与技术
- 1 篇 信息与通信工程
- 1 篇 软件工程
1 篇 哲学
- 1 篇 哲学
1 篇 理学
- 1 篇 数学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

18 篇 computer science...
17 篇 data structures ...
17 篇 coding and infor...
3 篇 computer science
2 篇 synthesis
2 篇 lectures
2 篇 computer \u0026 ...
1 篇 computer algorit...
1 篇 parallel process...
1 篇 software enginee...
1 篇 computer hardwar...
1 篇 electronic data ...
1 篇 algorithms
1 篇 science\/technol...
1 篇 distribu
1 篇 timed
1 篇 transactional
1 篇 computer applica...
1 篇 bisac category: ...
1 篇 networking

机构

3 篇 carleton univers...
2 篇 university of ot...
2 篇 university of pi...
2 篇 irisa université...
2 篇 ben-gurion unive...
2 篇 university of re...
2 篇 institute for re...
2 篇 university of to...
2 篇 boston college
1 篇 epfl
1 篇 university of wa...
1 篇 vienna universit...
1 篇 radboud universi...
1 篇 hong kong polyte...
1 篇 university of ce...
1 篇 graz university ...
1 篇 technion-israel ...
1 篇 saarland univers...
1 篇 university of co...
1 篇 technion - israe...

作者

4 篇 michel raynal
2 篇 nancy lynch
1 篇 rachid guerraoui
1 篇 sasha rubin
1 篇 santoro nicola
1 篇 euripides markou
1 篇 lewis tseng
1 篇 giuseppe prencip...
1 篇 taubenfeld gadi
1 篇 paola flocchini
1 篇 ayrat khalimov
1 篇 walter jennifer
1 篇 segala roberto
1 篇 faith ellen
1 篇 igor konnov
1 篇 raynal michel
1 篇 sakavalas dimitr...
1 篇 franck petit
1 篇 elkin michael
1 篇 ioannis chatzigi...

语言

29 篇 英文
3 篇 中文

检索条件"丛书名=Synthesis Lectures on Distributed Computing Theory"

共 32 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions

Concurrent Crash-Prone Shared Memory Systems: A Few Theoreti...

引用

丛书名： synthesis lectures on distributed computing theory

2022年

作者： Michel Raynal

ISBN: (数字)9781636393308

ISBN: (纸本)9781636393292;9781636393315

theory is what remains true when technology is changing. So, it is important to know and master the basic concepts and the theoretical tools that underlie the design of the systems we are using today and the systems we will use tomorrow. This means that, given a computing model, we need to know what can be done and what cannot be done in that model. Considering systems built on top of an asynchronous read/write shared memory prone to process crashes, this monograph presents and develops the fundamental notions that are universal constructions, consensus numbers, distributed recursivity, power of the BG simulation, and what can be done when one has to cope with process anonymity and/or memory anonymity. Numerous distributed algorithms are presented, the aim of which is being to help the reader better understand the power and the subtleties of the notions that are presented. In addition, the reader can appreciate the simplicity and beauty of some of these algorithms.

关键词： Bisac category: computers distributed systems general computers networking general computers computer science

来源：评论

学校读者我要写书评

暂无评论

Consistent distributed Storage

引用

丛书名： synthesis lectures on distributed computing theory

2021年

作者： Vincent Gramoli Nicolas Nicolaou Alexander A. Schwarzmann

ISBN: (数字)9781636390635

ISBN: (纸本)9781636390642;9781636390628

Providing a shared memory abstraction in distributed systems is a powerful tool that can simplify the design and implementation of software systems for networked platforms. This enables the system designers to work with abstract readable and writable objects without the need to deal with the complexity and dynamism of the underlying platform. The key property of shared memory implementations is the consistency guarantee that it provides under concurrent access to the shared objects. The most intuitive memory consistency model is atomicity because of its equivalence with a memory system where accesses occur serially, one at a time. Emulations of shared atomic memory in distributed systems is an active area of research and development. The problem proves to be challenging, and especially so in distributed message passing settings with unreliable components, as is often the case in networked systems. We present several approaches to implementing shared memory services with the help of replication on top of message-passing distributed platforms subject to a variety of perturbations in the computing medium.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Introduction to distributed Self-Stabilizing Algorithms

引用

丛书名： synthesis lectures on distributed computing theory

2019年

作者： Altisen, Karine Devismes, Stéphane Dubois, Swan

ISBN: (数字)9781681735375

ISBN: (纸本)9781681735368

This book aims at being a comprehensive and pedagogical introduction to the concept of self-stabilization, introduced by Edsger Wybe Dijkstra in 1973. Self-stabilization characterizes the ability of a distributed algorithm to converge within finite time to a configuration from which its behavior is correct (i.e., satisfies a given specification), regardless the arbitrary initial configuration of the system. This arbitrary initial configuration may be the result of the occurrence of a finite number of transient faults. Hence, self-stabilization is actually considered as a versatile non-masking fault tolerance approach, since it recovers from the effect of any finite number of such faults in a unified manner. Another major interest of such an automatic recovery method comes from the difficulty of resetting malfunctioning devices in a large-scale (and so, geographically spread) distributed system (the Internet, Pair-to-Pair networks, and Delay Tolerant Networks are examples of such distributed systems). Furthermore, self-stabilization is usually recognized as a lightweight property to achieve fault tolerance as compared to other classical fault tolerance approaches. Indeed, the overhead, both in terms of time and space, of state-of-the-art self-stabilizing algorithms is commonly small. This makes self-stabilization very attractive for distributed systems equipped of processes with low computational and memory capabilities, such as wireless sensor networks. After more than 40 years of existence, self-stabilization is now sufficiently established as an important field of research in theoretical distributed computing to justify its teaching in advanced research-oriented graduate courses. This book is an initiation course, which consists of the formal definition of self-stabilization and its related concepts, followed by a deep review and study of classical (simple) algorithms, commonly used proof schemes and design patterns, as well as premium results issued from the self

关键词： bisac category: computers \/ systems architecture \/ distributed systems \u0026 computing \/ computers \/ programming \/ algorithms \/ computers \/ networking \/ general

来源：评论

学校读者我要写书评

暂无评论

Network Topology and Fault-Tolerant Consensus

引用

丛书名： synthesis lectures on distributed computing theory

2019年

作者： Sakavalas, Dimitris Tseng, Lewis

ISBN: (数字)9781681735672

ISBN: (纸本)9781681735665

As the structure of contemporary communication networks grows more complex, practical networked distributed systems become prone to component failures. Fault-tolerant consensus in message-passing systems allows participants in the system to agree on a common value despite the malfunction or misbehavior of some components. It is a task of fundamental importance for distributed computing, due to its numerous applications. We summarize studies on the topological conditions that determine the feasibility of consensus, mainly focusing on directed networks and the case of restricted topology knowledge at each participant. Recently, significant efforts have been devoted to fully characterize the underlying communication networks in which variations of fault-tolerant consensus can be achieved. Although the deduction of analogous topological conditions for undirected networks of known topology had shortly followed the introduction of the problem, their extension to the directed network case has been proven a highly non-trivial task. Moreover, global knowledge restrictions, inherent in modern large-scale networks, require more elaborate arguments concerning the locality of distributed computations. In this work, we present the techniques and ideas used to resolve these issues. Recent studies indicate a number of parameters that affect the topological conditions under which consensus can be achieved, namely, the fault model, the degree of system synchrony (synchronous vs. asynchronous), the type of agreement (exact vs. approximate), the level of topology knowledge, and the algorithm class used (general vs. iterative). We outline the feasibility and impossibility results for various combinations of the above parameters, extensively illustrating the relation between network topology and consensus.

关键词： Fault-tolerant computing. Computer algorithms. Electronic data processing Computer networks. distributed processing.

来源：评论

学校读者我要写书评

暂无评论

distributed computing Pearls 1

引用

丛书名： synthesis lectures on distributed computing theory

2018年

作者： Taubenfeld, Gadi

ISBN: (数字)9781681733494

ISBN: (纸本)9781681733487

Computers and computer networks are one of the most incredible inventions of the 20th century, having an ever-expanding role in our daily lives by enabling complex human activities in areas such as entertainment, education, and commerce. One of the most challenging problems in computer science for the 21st century is to improve the design of distributed systems where computing devices have to work together as a team to achieve common goals. In this book, I have tried to gently introduce the general reader to some of the most fundamental issues and classical results of computer science underlying the design of algorithms for distributed systems, so that the reader can get a feel of the nature of this exciting and fascinating field called distributed computing. The book will appeal to the educated layperson and requires no computer-related background. I strongly suspect that also most computer knowledgeable readers will be able to learn something new.

关键词： Science\/Technology\/Mathematics\/Physics\/Military\/Environmental Protection

来源：评论

学校读者我要写书评

暂无评论

Decidability of Parameterized Verification

引用

丛书名： synthesis lectures on distributed computing theory

2015年

作者： Bloem, Roderick Jacobs, Swen Khalimov, Ayrat

ISBN: (数字)9781627057448

ISBN: (纸本)9781627057431

While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems ??(n) parameterized by whether, for all the system ??(n) satisfies a specification. In this book we consider the important case of ??(n) being a concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherence protocols, networks of finite-state agents, and systems that solve mutual exclusion or scheduling problems. Further examples are abstractions of systems, where the processes of the original systems actually depend on the parameter.

关键词： Parallel Processing

来源：评论

学校读者我要写书评

暂无评论

Impossibility Results for distributed computing

引用

丛书名： synthesis lectures on distributed computing theory

2014年

作者： Attiya, Hagit Ellen, Faith

ISBN: (数字)9781627051712

ISBN: (纸本)9781627051705

To understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space). This book presents key techniques for proving such impossibility results and applies them to a variety of different problems in a variety of different system models. Insights gained from these results are highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make it inadequate for solving certain problems efficiently are identified, and different system models are compared. Table of Contents: Acknowledgments / Introduction / Indistinguishability / Shifting and Scaling / Scenario Arguments / Information theory Arguments / Covering Arguments / Valency Arguments / Combinatorial Arguments / Reductions and Simulations / Bibliography / Authors' Biographies

关键词： Computer Science

来源：评论

学校读者我要写书评

暂无评论

distributed Graph Coloring: Fundamentals and Recent Developments

引用

丛书名： synthesis lectures on distributed computing theory

2013年

作者： Barenboim, Leonid Elkin, Michael

The objective of our monograph is to cover the developments on the theoretical foundations of distributed symmetry breaking in the message-passing model. We hope that our monograph will stimulate further progress in t... 详细信息

ISBN: (数字)9781627050197

ISBN: (纸本)9781627050180

关键词： Computer Science

来源：评论

学校读者我要写书评

暂无评论

distributed computing by Oblivious Mobile Robots

引用

丛书名： synthesis lectures on distributed computing theory

2012年

作者： Flocchini, Paola Prencipe, Giuseppe Santoro, Nicola

ISBN: (数字)9781608456871

ISBN: (纸本)9781608456864

The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other Directions

关键词：

来源：评论

学校读者我要写书评

暂无评论

Link Reversal Algorithms

引用

丛书名： synthesis lectures on distributed computing theory

2011年

作者： Welch, Jennifer Walter, Jennifer

ISBN: (数字)9781608450428

ISBN: (纸本)9781608450411

Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are y

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共4页 << < 1 2 3 4 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：