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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是21-30 订阅

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

详细简洁

排序：

Cooperative Task-Oriented computing 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Chryssis Georgiou Alexander A. Shvartsman

ISBN: (数字)9783031020056

ISBN: (纸本)9783031008771

Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

Principles of Transactional Memory 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Rachid Guerraoui Michat Kapatka

ISBN: (数字)9783031020025

ISBN: (纸本)9783031008740

Transactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads of an application communicate, and synchronize their actions, via in-memory transactions. Each transaction can perform any number of operations on shared data, and then either commit or abort. When the transaction commits, the effects of all its operations become immediately visible to other transactions; when it aborts, however, those effects are entirely discarded. Transactions are atomic: programmers get the illusion that every transaction executes all its operations instantaneously, at some single and unique point in time. Yet, a TM runs transactions concurrently to leverage the parallelism offered by modern processors. The aim of this book is to provide theoretical foundations for transactional memory. This includes defining a model of a TM, as well as answering precisely when a TM implementation is correct, what kind of properties it can ensure, what are the power and limitations of a TM, and what inherent trade-offs are involved in designing a TM algorithm. While the focus of this book is on the fundamental principles, its goal is to capture the common intuition behind the semantics of TMs and the properties of existing TM implementations. Table of Contents: Introduction / Shared Memory Systems / Transactional Memory: A Primer / TM Correctness Issues / Implementing a TM / Further Reading / Opacity / Proving Opacity: An Example / Opacity vs.\ Atomicity / Further Reading / The Liveness of a TM / Lock-Based TMs / Obstruction-Free TMs / General Liveness of TMs / Further Reading / Conclusions

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

Introduction to distributed Self-Stabilizing Algorithms 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Karine Altisen Stéphane Devismes Swan Dubois Franck Petit

ISBN: (数字)9783031020131

ISBN: (纸本)9783031008856

This book aims at being a comprehensive and pedagogical introduction to the concept of;, 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 an 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-stabilizing comm

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

Decidability of Parameterized Verification 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Roderick Bloem Ayrat Khalimov Swen Jacobs Igor Konnov Helmut Veith Josef Widder Sasha Rubin

ISBN: (数字)9783031020117

ISBN: (纸本)9783031008832

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 n ∈ ℕ, whether, for all n ∈ ℕ, 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. The literature in this area has studied a wealth of computational models based on a variety of synchronization and communication primitives, including token passing, broadcast, and guarded transitions. Often, different terminology is used in the literature, and results are based on implicit assumptions. In this book, we introduce a computational model that unites the central synchronization and communication primitives of many models, and unveils hidden assumptions from the literature. We survey existing decidability and undecidability results, and give a systematic view of the basic problems in this exciting research area.

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

Concurrent Crash-Prone Shared Memory Systems 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Michel Raynal

ISBN: (数字)9783031792137

ISBN: (纸本)9783031792014

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.

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

distributed computing Pearls 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Gadi Taubenfeld

来源：评论

学校读者我要写书评

暂无评论

Quorum Systems 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Marko Vukolić

ISBN: (数字)9783031020070

ISBN: (纸本)9783031008795

A quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Quorum systems are the key mathematical abstraction for ensuring consistency in fault-tolerant and highly available distributed computing. Critical for many applications since the early days of distributed computing, quorum systems have evolved from simple majorities of a set of processes to complex hierarchical collections of sets, tailored for general adversarial structures. The initial non-empty intersection property has been refined many times to account for, e.g., stronger (Byzantine) adversarial model, latency considerations or better availability. This monograph is an overview of the evolution and refinement of quorum systems, with emphasis on their role in two fundamental applications: distributed read/write storage and consensus. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

Recoverable Mutual Exclusion 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Sahil Dhoked Neeraj Mittal Wojciech Golab

ISBN: (数字)9783031200021

ISBN: (纸本)9783031200014;9783031200045

This book discusses the recent research work on designing efficient fault-tolerant synchronization mechanisms for concurrent processes using the relatively new persistent memory technology that combines the low latency benefits of DRAM with the persistence of magnetic disks. The authors include all of the major contributions published to date, and also convey some perspective regarding how the problem itself is evolving. The results are described at a high level to enable readers to gain a quick and thorough understanding of the RME problem and its nuances, as well as various solutions that have been designed to solve the problem under a variety of important conditions and how they compare to each other.

关键词： Computer Hardware Computer Applications Computer Science, general Software Engineering/Programming and Operating Systems Mathematical Applications in Computer Science Algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication and Agreement Abstractions for Fault-Tolerant Asynchronous distributed Systems 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Michel Raynal

ISBN: (数字)9783031020001

ISBN: (纸本)9783031008726

Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. Considering the uncertainty created by asynchrony and process crash failures in the context of message-passing systems, the book focuses on the main abstractions that one has to understand and master in order to be able to produce software with guaranteed properties. These fundamental abstractions are communication abstractions that allow the processes to communicate consistently (namely the register abstraction and the reliable broadcast abstraction), and the consensus agreement abstractions that allows them to cooperate despite failures. As they give a precise meaning to the words "communicate" and "agree" despite asynchrony and failures, these abstractions allow distributed programs to be designed with properties that can be stated and proved. Impossibility results are associated with these abstractions. Hence, in order to circumvent these impossibilities, the book relies on the failure detector approach, and, consequently, that approach to fault-tolerance is central to the book. Table of Contents: List of Figures / The Atomic Register Abstraction / Implementing an Atomic Register in a Crash-Prone Asynchronous System / The Uniform Reliable Broadcast Abstraction / Uniform Reliable Broadcast Abstraction Despite Unreliable Channels / The Consensus Abstraction / Consensus Algorithms for Asynchronous Systems Enriched with Various Failure Detectors / Constructing Failure Detectors

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

The Mobile Agent Rendezvous Problem in the Ring 1

引用

丛书名： synthesis lectures on distributed computing theory

1000年

作者： Evangelos Kranakis Danny Krizanc Euripides Markou

ISBN: (数字)9783031019999

ISBN: (纸本)9783031008719

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case oftwo agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments. Table of Contents: Models for Mobile Agent computing / Deterministic Rendezvous in a Ring / Multiple Agent Rendezvous in a Ring / Randomized Rendezvous in a Ring / Other Models / Other Topologies

关键词： Computer Science, general Coding and Information theory Data Structures and Information theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：