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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,334 篇 会议
55 篇 期刊文献
1 册 图书

馆藏范围

1,390 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,075 篇 工学
- 1,046 篇 计算机科学与技术...
- 460 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 77 篇 控制科学与工程
- 41 篇 网络空间安全
- 19 篇 电子科学与技术（可...
- 9 篇 农业工程
- 7 篇 建筑学
- 7 篇 化学工程与技术
- 6 篇 机械工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 仪器科学与技术
302 篇 理学
- 274 篇 数学
- 67 篇 统计学（可授理学、...
- 17 篇 物理学
- 11 篇 系统科学
- 9 篇 生物学
- 8 篇 化学
- 4 篇 大气科学
71 篇 管理学
- 39 篇 管理科学与工程(可...
- 33 篇 图书情报与档案管...
- 24 篇 工商管理
12 篇 经济学
- 12 篇 应用经济学
12 篇 教育学
- 12 篇 教育学
9 篇 法学
- 7 篇 社会学
9 篇 农学
- 9 篇 作物学
1 篇 医学

主题

243 篇 distributed comp...
92 篇 distributed algo...
82 篇 distributed comp...
33 篇 distributed algo...
31 篇 consensus
29 篇 distributed syst...
26 篇 cloud computing
25 篇 algorithms
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 fault tolerance
20 篇 local model
20 篇 distributed grap...
19 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 randomized algor...
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
15 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 tel aviv univ te...
10 篇 natl univ singap...
9 篇 ben gurion univ ...
9 篇 technion dept co...
9 篇 aalto univ espoo
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 carnegie mellon ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 cnrs
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...

作者

24 篇 kuhn fabian
20 篇 ghaffari mohsen
17 篇 raynal michel
17 篇 elkin michael
17 篇 censor-hillel ke...
16 篇 suomela jukka
16 篇 fraigniaud pierr...
15 篇 wattenhofer roge...
15 篇 pandurangan gopa...
14 篇 peleg david
14 篇 toueg sam
14 篇 rajsbaum sergio
14 篇 kutten shay
14 篇 brandt sebastian
13 篇 patt-shamir boaz
13 篇 guerraoui rachid
12 篇 chang yi-jun
12 篇 balliu alkida
12 篇 maus yannic
12 篇 olivetti dennis

语言

1,381 篇 英文
8 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2013 ACM symposium on Principles of distributed computing"

共 1390 条记录，以下是1281-1290 订阅

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

详细简洁

排序：

Understanding and verifying distributed algorithms using stratified decomposition 88

Understanding and verifying distributed algorithms using str...

引用

7th Annual acm symposium on principles of distributed computing, PODC 1988

作者： Chou, Ching-Tsun Gafni, Eli Computer Science Department University of California Los Angeles Los AngelesCA90024 United States

ISBN: (纸本)0897912772

Designers of autonomous distributed algorithms (i.e., algorithms whose complete input is available before the start of execution) customarily refer to temporal ordering in describing the behavior of their algorithms-statements like "after A, task B is performed." In the absence of an explicit termination detection for A built into the algorithm such a statement should be puzzling. However, the available proof methodologies do not seem to hinge on such statements. This paper provides firm theoretical ground for such assertions by pinpointing the essential difference between sequential and concurrent algorithms. Moreover we proposes a proof methodoloy along these lines. By being highly congruent with current designers intuition, our proof methodology is also suitable for design purposes. The paper illustrates the method on a variation of the celebrated distributed minimum spanning tree algorithm of Gallager, Humblet and Spira. © 1988 acm.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Viewstamped replication: A new primary copy method to support highly-available distributed systems 88

Viewstamped replication: A new primary copy method to suppor...

引用

7th Annual acm symposium on principles of distributed computing, PODC 1988

作者： Oki, Brian M. Liskov, Barbara H. Massachusetts Institute of Technology Laboratory for Computer Science CambridgeMA02139 United States

ISBN: (纸本)0897912772

One of the potential benefits of distributed systems is their use in providing highly-available services that are likely to be usable when needed. Availability is achieved through replication. By having more than one copy of information, a service continues to be usable even when some copies are inaccessible, for example, because of a crash of the computer where a copy was stored. This paper presents a new replication algorithm that has desirable performance properties. Our approach is based on the primary copy technique. Computations run at a primary, which notifies its backups of what it has done. If the primary crashes, the backups are reorganized, and one of the backups becomes the new primary. Cur method works in a general network with both node crashes and partitions. Replication causes little delay in user computations and tittle information is lost in a reorganization;we use a special kind of timestamp called a viewstamp to detect lost information. © 1988 acm.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor 7

A combinatorial characterization of the distributed tasks wh...

引用

7th Annual acm symposium on principles of distributed computing, PODC 1988

作者： Biran, Ofer Moran, Shlorno Zaks, Shmuel Department of Computer Science Technion Haifa32000 Israel

ISBN: (纸本)0897912772

Fischer, Lynch and Paterson showed in a fundamental paper that achieving a distributed agreement for N > 1 processors is impossible in the presence of one faulty processor. This result was later extended by Moran and Wolfstahl who showed that it holds for any task with a connected input graph and a disconnected decision graph (where a vertex in the input [decision] graph is an N-tuple of input [decision] values of the processors, and there is an edge connecting two vertices if and only if they differ in exactly one component). In this paper we extend that latter result, and in fact we set the exact borderline between solvable and unsolvable tasks, by giving a necessary and sufficient condition for a task to be solvable in the presence of a faulty processor. We present a universal protocol which solves any task which is found to be solvable by our condition. Using our characterization, we derive a novel technique to prove lower bounds on the number of messages that must be sent due to processor failure;specifically, we show that for each fixed N > 2 there exist distributed tasks for N processors that can be solved in the presence of a faulty processor, but any protocol that solves them must send arbitrarily many messages in the worst case. © 1988 acm.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms for distributed resource allocation 7

Improved algorithms for distributed resource allocation

引用

7th Annual acm symposium on principles of distributed computing, PODC 1988

作者： Styer, Eugene Peterson, Gary L. School of Information and Computer Science Georgia Institute of Technology AtlantaGA30332 United States

ISBN: (纸本)0897912772

The problem of assigning resources to processes in a distributed system using only local communication is considered. The problem is a generalized form of Dining Philosophers as given by Lynch [6] and also considered by Chandy and Misra [2]. Those solutions, however, allowed a process to wait for relatively distant processes, and also to wait many times for the same process. Our algorithms, based in part on Lynch's, have improved locality. That is, a process's waiting time is a small function of the number and speed of nearby processes. The first algorithm prevents a process from being delayed by processes that are far away in the network. A process may delay another if its distance away is at most logarithmic in the number of colors used to edge-color the graph representing the network. (The previous algorithms are linear in edge-color.) A second algorithm restricts the neighboring processes so that they cannot repeatedly acquire and release resources ahead of other processes, each time causing an additional delay. The maximum waiting time is polynomially bounded by the number of processes within a distance limited by the number of colors. (As opposed to an exponential bound for the previous solutions.) The algorithms can be combined to give an overall improved algorithm. Much of the analysis of the algorithms is non-trivial. © 1988 acm.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

A model for the design of high performance protocols for a networked computing environment 88

A model for the design of high performance protocols for a n...

引用

1988 acm SIGSMALL/PC symposium on ACTES, SIGSMALL 1988

作者： Law, Gary D. Spider Systems Limited 65 Bonnington Road EdinburghEH6 SJQ United Kingdom

ISBN: (纸本)0897912551

The advent of high bandwidth local area networks means that it is now possible to interconnect large numbers of devices with widely differing processing capabilities in such a manner that the various devices may closely interact. Before such a system may be realised, it is necessary to define a set of conventions to govern the way in which the network nodes interact with each other. The Triadic Network Model is introduced to describe the interactions between personal computers and high performance computers over a general purpose network by using a third classification of devices, whose purpose is to support the operation of the network as a distributed system. The model is not restricted to any particular network or operating system, but may form the interface between the two. Hence, the use of a protocol set based on this model enables the provision of a uniform interface to the applications software. Some of the principles of a protocol set developed from the Triadic Network Model are presented in the paper. © 1988 acm.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Secure and verifiable schemes for election and general distributed computing problems 88

Secure and verifiable schemes for election and general distr...

引用

proceedings of the seventh annual acm symposium on principles of distributed computing

作者： Ming-Deh A. Huang Shang-Hua Teng Department of Computer Science University of Southern California Los Angeles California

来源：评论

学校读者我要写书评

暂无评论