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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

84 篇 会议
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

67 篇 工学
- 62 篇 计算机科学与技术...
- 35 篇 软件工程
- 9 篇 信息与通信工程
- 6 篇 控制科学与工程
- 4 篇 电气工程
- 3 篇 网络空间安全
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
24 篇 理学
- 22 篇 数学
- 8 篇 统计学（可授理学、...
- 3 篇 物理学
- 2 篇 系统科学
- 1 篇 化学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学

主题

21 篇 distributed comp...
11 篇 distributed comp...
6 篇 computer science
5 篇 distributed algo...
4 篇 causal consisten...
4 篇 cloud computing
3 篇 algorithms
3 篇 computational mo...
3 篇 testing
3 篇 cryptography
2 篇 fault-tolerant d...
2 篇 automated verifi...
2 篇 partial synchron...
2 篇 reliability
2 篇 replication
2 篇 theorem proving
2 篇 approximation al...
2 篇 bandwidth
2 篇 consensus
2 篇 radio network

机构

2 篇 univ oxford oxfo...
2 篇 cispa helmholtz ...
2 篇 univ nova lisboa...
2 篇 mit cambridge ma...
2 篇 ist austria aust...
2 篇 imdea software i...
2 篇 mit comp sci & a...
2 篇 department of co...
2 篇 shanghai jiao to...
2 篇 university of fr...
2 篇 mit csail boston...
2 篇 univ paris 06 un...
2 篇 cnrs ens inria f...
1 篇 department of co...
1 篇 computer science...
1 篇 johns hopkins un...
1 篇 princeton univ d...
1 篇 icsi berkeley ca...
1 篇 univ neuchatel i...
1 篇 département d'in...

作者

4 篇 guerraoui rachid
3 篇 kuhn fabian
3 篇 fauconnier hugue...
3 篇 fraigniaud pierr...
2 篇 lesani mohsen
2 篇 todinca ioan
2 篇 kouznetsov petr
2 篇 dragoi cezara
2 篇 toueg sam
2 篇 ferreira carla
2 篇 delporte-gallet ...
2 篇 zufferey damien
2 篇 gotsman alexey
2 篇 wattenhofer roge...
2 篇 shapiro marc
2 篇 brian harvey
2 篇 chlipala adam
2 篇 luke segars
2 篇 henzinger thomas...
2 篇 tiffany barnes

语言

84 篇 英文
8 篇 其他

检索条件"任意字段=Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"

共 92 条记录，以下是71-80 订阅

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

详细简洁

排序：

Efficient synchronous snapshots 04

Efficient synchronous snapshots

引用

proceedings of the 23rd Annual acm symposium on principles of distributed computing

作者： Brodsky, Alex Fleh, Faith Ellen University of Toronto 10 King's College Road Toronto Canada

ISBN: (纸本)9781581138023

A snapshot is an important object in distributed computing whose implementation in asynchronous systems has been studied extensively. It consists of a collection of m > 1 components, each storing a value, and supports two atomic operations: an UPDATE of a specified component's value and a SCAN of all components to determine their values at some point in time. In this paper, we investigate implementations of a multiwriter snapshot object in a synchronous shared memory model. In this setting, we show that a snapshot object can be efficiently implemented and prove a tight tradeoff between the complexity of the SCAN and the UPDATE operations. First, we describe a wait-free implementation that performs UPDATE in O(1) time and SCAN in O(m) time, using only slightly more than twice the amount of space needed to simply store the m values. We also describe a variant that performs UPDATE in O(1) time and SCAN in O(n) time. Second, we describe a wait-free implementation that performs UPDATE in O(log m) time and SCAN in O(1) time, and a variant that performs UPDATE in O(log n) time and SCAN in O(1) time. Third, we show how to combine these implementations to realize two implementations that perform UPDATE in θ(log(m/c)) time and SCAN in θ(c) time, for 1 ≤ c ≤ m, or perform UPDATE in θ(log(n/c)) time and SCAN in Θ(c) time, for 1 ≤ c ≤ n. This implies that Time[UPDATE] Ε O( log(min{m, n}/Time[SCAN]) ). We also prove that Time[UPDATE] Ε Ω (log (min {m, n]/Time[SCAN])), which matches our upper bound.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Balanced binary trees for ID management and load balance in distributed hash tables 04

Balanced binary trees for ID management and load balance in ...

引用

proceedings of the 23rd Annual acm symposium on principles of distributed computing

作者： Manku, Gurmeet Singh Computer Science Department Stanford University United States

ISBN: (纸本)9781581138023

We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit interval [0, 1). At any time, the set of IDs splits the interval into disjoint partitions. Hosts do not possess global knowledge of other IDs in the system. The challenge then is to design an efficient decentralized algorithm that maintains roughly equi-sized partitions, in the face of arrivals, departures and changes in the average number of hosts. Our ID management algorithm is the first to enjoy all of the following properties: (a) both arrivals and departures of hosts are handled, (b) departure of a host causes at most one existing host to change its ID, (c) the ratio of the largest to the smallest partition is at most 4, with high probability, and (d) the expected cost per arrival/departure is ζ(R + log n) messages, where n denotes the current number of participants, and R denotes the cost of routing one message in the DHT. In fact, our algorithm is independent of the topology of the overlay network used for routing. Variations of our algorithm diminish the ratio between the largest and the smallest partition to (1 + Ε), for any Ε > 0, albeit at the cost of re-assigning the IDs of O(1/Ε) existing hosts per arrival/departure. Ours is the first algorithm that allows such fine-tuning. Finally, our ID management algorithm enables (a) estimation of the total number of hosts in the system by making only local measurements, and (b) emulation of a variety of deterministic and randomized families of routing topologies, in a straightforward fashion. Among these families are several networks that require O(log n/log k) routing hops in an n-node network with k links per node.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Communication-efficient leader election and consensus with limited link synchrony 04

Communication-efficient leader election and consensus with l...

引用

proceedings of the 23rd Annual acm symposium on principles of distributed computing

作者： Aguilera, Marcos K. Delporte-Gallett, Carole Fauconnier, Hugues Toueg, Sam HP Laboratories 1501 Page Mill Road Palo Alto CA 94304 United States LIAFA Université D. Diderot 2 Place Jussieu 75251 Paris Cedex 05 France Department of Computer Science University of Toronto Toronto Ont. Canada

ISBN: (纸本)9781581138023

We study the degree of synchrony required to implement the leader election failure detector Ω and to solve consensus in partially synchronous systems. We show that in a system with n processes and up to f process crashes, one can implement Ω and solve consensus provided there exists some (unknown) correct process with f outgoing links that are eventually timely. In the special case where f = 1, an important case in practice, this implies that to implement Ω and solve consensus it is sufficient to have just one eventually timely link -all the other links in the system, (n 2) of them, may be asynchronous. There is no need to know which link p → q is eventually timely, when it becomes timely, or what is its bound on message delay. Surprisingly, it is not even required that the source p or destination q of this link be correct: either p or q may actually crash, in which case the link p → q is eventually timely in a trivial way, and it is useless for sending messages. We show that these results are in a sense optimal: even if every process has f - 1 eventually timely links, neither Ω nor consensus can be solved. We also give an algorithm that implements Ω in systems where some correct process has f outgoing links that are eventually timely, such that eventually only f links carry messages, and we show that this is optimal. For f = 1, this algorithm ensures that all the links, except for one, eventually become quiescent.

关键词： distributed parameter networks

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for constructing (1+6, β)-spanners in the distributed and streaming models

Efficient algorithms for constructing (1+6, β)-spanners in ...

引用

proceedings of the 23rd Annual acm symposium on principles of distributed computing

作者： Elkin, Michael Zhang, Jian Computer Science Department Yale University P.O. Box 208285 New Haven CT 06520-8285 United States

For an unweighted undirected graph G = (V, E), and a pair of positive integers α ≥ 1, β ≥ 0, a subgraph G' = (V, H), H ⊆ E, is called an (α, β)-spanner of G if for every pair of vertices u, v ∈ V, distcG' (u, v) &le α · distcG(u,v) + β. It was shown in [20] that for any Ε > 0, K = 1, 2,., there exists an integer β= β(Ε, K) such that for every n-vertex graph G there exists a (1+ Ε, β)-spanner G' with O(n1+1/K) edges. An efficient distributed protocol for constructing (1 + Ε, β)-spanners was devised in [18]. The running time and the communication complexity of that protocol are O(n1+p) and O(\E\nρ), respectively, where p is an additional control parameter of the protocol that affects only the additive term β- In this paper we devise a protocol with a drastically improved running time (O(np) as opposed to O(n 1+p)) for constructing (1 + Ε, β)-spanners. Our protocol has the same communication complexity as the protocol of [18], and it constructs spanners with essentially the same properties as the spanners that are constructed by the protocol of [18], We also show that our protocol for constructing (1 + Ε, β)spanners can be adapted to the streaming model, and devise a streaming algorithm that uses a constant number of passes and O(n1+1/K · log n) bits of space for computing all-pairs-almost-shortest-paths of length at most by a multiplicative factor (1 + Ε) and an additive term of β greater than the shortest paths. Our algorithm processes each edge in time O(np), for an arbitrarily small p > 0. The only previously known algorithm for the problem [21] constructs paths of length K times greater than the shortest paths, has the same space requirements as our algorithm, but requires O(n1+l/K) time for processing each edge of the input graph. However, the algorithm of [21] uses just one pass over the input, as opposed to the constant number of passes in our algorithm. We also show that any streaming algorithm for o(n) -approximate distance computation requires Ω(

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

On the inherent weakness of conditional synchronization primitives 04

On the inherent weakness of conditional synchronization prim...

引用

proceedings of the 23rd Annual acm symposium on principles of distributed computing

作者： Fich, Faith Hendler, Danny Shavit, Nir Department of Computer Science University of Toronto Canada School of Computer Science Tel-Aviv University Tel Aviv 69978 Israel Tel-Aviv University Sun Microsystems Laboratories Israel

ISBN: (纸本)9781581138023

The "wait-free hierarchy" classifies multiprocessor synchronization primitives according to their power to solve consensus. The classification is based on assigning a number n to each synchronization primitive, where n is the maximal number of processes for which deterministic wait-free consensus can be solved using instances of the primitive and read write registers. Conditional synchronization primitives, such as Compare-and-Swap and Load-Linked/Store-Conditional, can implement deterministic wait-free consensus for any number of processes (they have consensus number ∞), and are thus considered to be among the strongest synchronization primitives;Compare-and-Swap and Load-Linked/Store-Conditional have consequently became the synchronization primitives of choice, and have been implemented in hardware in many multiprocessor architectures. This paper shows that, though they are strong in the context of consensus, conditional synchronization primitives are not efficient in terms of memory space for implementing many key objects. Our results hold for starvation-free implementations of mutual exclusion, and for wait-free implementations of a large class of concurrent objects, that we call Visible(n). Roughly, Visible(n) is a class that includes all objects that support some operation that must perform a "visible" write before it terminates. Visible(n) includes many useful objects;some examples are: counters, stacks, queues, swap, fetch-and-add, and single-writer snapshot objects. We show that at least n conditional registers are required by any such implementation, even if registers are of unbounded size. We also obtain tradeoffs between time and space for n-process wait-free implementations of any one-time object in Visible(n). All these results hold for both deterministic and randomized implementations. Starvation-free mutual exclusion and wait-free implementations of some objects in Visible(n) (e.g. counters, swap and fetch-and-add) can be implemented by O(1) non-cond

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Twenty-First Annual acm symposium on principles of distributed computing

Proceedings of the Twenty-First Annual ACM Symposium on Prin...

引用

proceedings of the Twenty - First Annual acm symposium on principles of distributed computing PODC 2002

The proceedings contains 43 papers. Topics discussed include distributed computing, scalable queue based spin locks, lexicographically optimal smoothing, replication costs, assignment based partitioning, optimal mobil... 详细信息

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups

Brief Announcement: Optimally work-competitive scheduling fo...

引用

proceedings of the Twenty - First Annual acm symposium on principles of distributed computing PODC 2002

作者： Georgiou, Chryssis Russell, Alexander Shvartsman, Alex A. Department of Computer Science University of Connecticut 191 Auditorium Rd. Unit 3155 Storrs CT 06269 United States

The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous processors start performing tasks in isolation and where an adversary can force an arbitrary pattern of merges. Following a merge, processors are able to share their knowledge about the computational progress prior to the merge.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Auctions with severely bounded communication

Auctions with severely bounded communication

引用

Annual IEEE symposium on Foundations of Computer Science

作者： L. Blumrosen N. Nisan School of Engineering and Computer Science Hebrew University of Jerusalem Israel

We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare-maximizing and revenue-maximizing auctions under this communication restriction. For both measures, we determine the optimal auction and show that the loss incurred relative to unconstrained auctions is mild. We prove unsurprising properties of these kinds of auctions, e.g. that discrete prices are informationally efficient, as well as some surprising properties, e.g. that asymmetric auctions are better than symmetric ones.

关键词： Computer science Resource management Internet distributed computing Bandwidth Loss measurement Humans Routing Electronic commerce Game theory

来源：评论

学校读者我要写书评

暂无评论

Global information from local observation

Global information from local observation

引用

Annual IEEE symposium on Foundations of Computer Science

作者： I. Benjamini L. Lovasz Microsoft Research Limited Redmond WA USA

We observe a certain random process on a graph "locally", i.e., in the neighborhood of a node, and would like to derive information about "global" properties of the graph. For example, what can we know about a graph based on observing the returns of a random walk to a given node? Our main result concerns a graph embedded in an orientable surface with genus g, and a process, consisting of random excitations of edges and random balancing around nodes and faces. It is shown how to obtain the genus of the surface in polynomial time from local observations of the process restricted to a connected subgraph whose size is (essentially) O(g/sup 2/).

关键词： Random processes Polynomials Birds Information retrieval Sampling methods Physics computing distributed algorithms Computer science Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

On-line confidence machines are well-calibrated

On-line confidence machines are well-calibrated

引用

Annual IEEE symposium on Foundations of Computer Science

作者： V. Vovk Computer Learning Research Centre Department of Computer Science Royal Holloway University of London Egham Surrey UK

Transductive Confidence Machine (TCM) and its computationally efficient modification, inductive confidence machine (ICM), are ways of complementing machine-learning algorithms with practically useful measures of confidence. We show that when TCM and ICM are used in the on-line mode, their confidence measures are well-calibrated, in the sense that predictive regions at confidence level 1-/spl delta/ will be wrong with relative frequency at most /spl delta/ (approaching /spl delta/ in the case of randomised TCM and ICM) in the long run. This is not just an asymptotic phenomenon: actually the error probability of randomised TCM and ICM is d at every trial and errors happen independently at different trials.

关键词： Prediction algorithms Error probability Computer science Machine learning Frequency measurement distributed computing Reliability theory Testing Packaging Computer errors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：