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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

740 篇 会议
41 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

607 篇 工学
- 593 篇 计算机科学与技术...
- 344 篇 软件工程
- 93 篇 信息与通信工程
- 67 篇 控制科学与工程
- 64 篇 电气工程
- 40 篇 网络空间安全
- 12 篇 电子科学与技术（可...
- 4 篇 机械工程
- 4 篇 仪器科学与技术
- 4 篇 化学工程与技术
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 3 篇 农业工程
- 2 篇 建筑学
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
234 篇 理学
- 218 篇 数学
- 61 篇 统计学（可授理学、...
- 12 篇 物理学
- 6 篇 系统科学
- 4 篇 化学
- 3 篇 大气科学
- 3 篇 生物学
48 篇 管理学
- 28 篇 管理科学与工程(可...
- 22 篇 图书情报与档案管...
- 18 篇 工商管理
10 篇 经济学
- 10 篇 应用经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

224 篇 distributed comp...
35 篇 distributed algo...
26 篇 distributed comp...
25 篇 computer systems...
17 篇 algorithms
15 篇 consensus
15 篇 distributed syst...
14 篇 fault tolerance
12 篇 distributed algo...
11 篇 computer network...
10 篇 message passing
10 篇 approximation al...
9 篇 self-stabilizati...
9 篇 shared memory
8 篇 cloud computing
8 篇 randomized algor...
6 篇 parallel algorit...
6 篇 computation theo...
6 篇 coloring
6 篇 sensor networks

机构

7 篇 ben gurion univ ...
5 篇 technion
5 篇 department of co...
4 篇 technion haifa
4 篇 college of compu...
4 篇 department of co...
4 篇 eth comp engn & ...
4 篇 yale univ dept c...
3 篇 univ of californ...
3 篇 univ of toronto ...
3 篇 computer enginee...
3 篇 cispa helmholtz ...
3 篇 yale university
3 篇 university of fr...
3 篇 technion israel ...
3 篇 hebrew univ jeru...
3 篇 mit cambridge ma...
3 篇 irisa rennes
3 篇 eth zurich
3 篇 cnrs university ...

作者

13 篇 kuhn fabian
13 篇 awerbuch baruch
13 篇 raynal michel
12 篇 peleg david
12 篇 kutten shay
11 篇 toueg sam
11 篇 patt-shamir boaz
11 篇 wattenhofer roge...
10 篇 guerraoui rachid
10 篇 gafni eli
10 篇 dolev danny
9 篇 elkin michael
9 篇 rajsbaum sergio
9 篇 attiya hagit
8 篇 khandekar rohit
8 篇 pandurangan gopa...
8 篇 aspnes james
8 篇 fraigniaud pierr...
7 篇 korman amos
7 篇 herlihy maurice

语言

774 篇 英文
6 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"

共 781 条记录，以下是321-330 订阅

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

详细简洁

排序：

proceedings of the 24th annual acm symposium on principles of distributed computing, PODC 2005

Proceedings of the 24th Annual ACM Symposium on Principles o...

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

The proceedings contain 44 papers. The topics discussed include: a topological characterization of weakness;efficient dependency tracking for relevant events in shared-memory systems;building scalable and robust peer-to-peer overlay networks for broadcasting using network coding;skip webs: efficient distributed data structures for multi-dimensional data sets;brief announcement: an incentive-compatible capacity assignment algorithm for bulk data distribution using P2P;brief announcement: broadcast in radio networks in the presence of Byzantine adversaries;feedback control for router congestion resolution;toward a theory of transactional contention managers;and adaptive routing with stale information.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Facility location: distributed approximation 05

Facility location: Distributed approximation

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Moscibroda, Thomas Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland

ISBN: (纸本)9781581139945

In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, achieves an O(√k(mp)1/√klog (m + n)) approximation in O(k] communication rounds where message size is bounded to O(log n) bits. The number of facilities and clients are m and n, respectively, and ρ is a coefficient that depends on the cost values of the instance. Our technique is based on a distributed primal-dual approach for approximating a linear program, that does not form a covering or packing program. Copyright 2005 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A scheme for load balancing in heterogenous distributed hash tables 05

A scheme for load balancing in heterogenous distributed hash...

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Giakkoupis, George Hadzilacos, Vassos Department of Computer Science University of Toronto Toronto Canada

ISBN: (纸本)9781581139945

We present a scheme for evenly partitioning the key space in distributed hash tables among the participating nodes. The scheme is based on the multiple random choices paradigm [3, 19], and handles both node joins and leaves. It achieves, with high probability, a ratio of at most 4 between the loads of the most and least burdened nodes, in the face or arbitrary node arrivals and departures. Each join or leave operation incurs message cost that is, with high probability, O(log2 n), where n is the number of nodes, and causes the relocation of keys from at most one node (for joins) or three nodes (for leaves). A version of our scheme is suitable for heterogeneous systems, where the capacities of nodes to serve keys can vary widely. Copyright 2005 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scalable and dynamic quorum systems 03

Scalable and dynamic quorum systems

引用

22nd acm symposium on principles of distributed computing (PODC 03)

作者： Naor, M Wieder, U Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel

ISBN: (纸本)9781581137088

We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algorithmic complexity of finding a quorum in case of random failures. We show a tradeoff between the load of a quorum system and its probe complexity for non adaptive algorithms. We analyze the algorithmic probe complexity of the Paths quorum system suggested by Naor and Wool in [29], and present two optimal algorithms. The first is a non adaptive algorithm that matches our lower bound. The second is an adaptive algorithm with a probe complexity that is linear in the cardinality of the smallest quorum set. We supply a constant degree network in which these algorithms could be executed efficiently. Thus the Paths quorum system is shown to have good balance between many measures of quality. Our second contribution is presenting Dynamic Paths-a suggestion for a dynamic and scalable quorum system, which can operate in an environment where elements join and leave the system. The quorum system could be viewed as a dynamic adaptation of the Paths system, and therefore has low load high availability and good probe complexity. We show that it scales gracefully as the number of elements grows.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A topological characterization of weakness 05

A topological characterization of weakness

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Eisner, Cindy Fisman, Dana Havlicek, John Formal Methods Group IBM Haifa Research Lab. Haifa 31905 Israel IBM Haifa Research Lab. Weizmann Institute of Science Rehovot 76100 Israel Functional Design Verification Freescale Semiconductor Inc. Austin TX 78729 United States

ISBN: (纸本)9781581139945

We are interested in the relation between weak and strong temporal operators. We would like to find a characterization that shows what it means for an operator to be the weak or strong version of another operator, or more generally for a formula to be a weak or strong version of another formula. We show that the weak version of a formula is not the same as Alpern and Schneider's safety component. By working over an extended alphabet, we show that their topological characterization of safety can be adapted to obtain a topological characterization of weakness. We study the resulting topology and the relations between weak and strong formulas. Finally, we apply the method to show the internal consistency of a logic containing both weak and strong versions of regular expressions. Copyright 2005 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

On the locality of bounded growth 05

On the locality of bounded growth

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Kuhn, Fabian Moscibroda, Thomas Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland

ISBN: (纸本)9781581139945

Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrarily when looking at neighborhoods of increasing size. Due to this bounded "volume growth," one could expect that distributed algorithms are able to solve many problems more efficiently than on general graphs. The goal of this paper is to help understanding the distributed complexity of problems on "bounded growth" graphs. We show that on the widely used unit disk graph, covering and packing linear programs can be approximated by constant factors in constant time. For a more general network model which is based on the assumption that nodes are in a metric space of constant doubling dimension, we show that in o(log*n) rounds it is possible to construct a (O(1), O(1))-network decomposition. This results in asymptotically optimal O(log*n) time algorithms for many important problems. Copyright 2005 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Stochastic analysis of distributed deadlock scheduling 05

Stochastic analysis of distributed deadlock scheduling

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Chen, Shigang Ling, Yibei Department of Computer and Information Science and Engineering University of Florida United States Applied Research Laboratories Telcordia Technologies United States

ISBN: (纸本)1581139942

Deadlock detection scheduling is an important, yet oftoverlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of deadlock detection increases overall message usage, resulting in degraded system performance in the absence of deadlocks;while a deficient initiation of deadlock detection increases the deadlock persistence time, resulting in an increased deadlock resolution cost in the presence of dead-locks. Such a performance tradeoff, however, is generally missing in literature. In this paper we study the impact of deadlock detection scheduling on the system performance, and show that there exists an optimal deadlock detection frequency that yields the minimum long-run mean average cost associated with the message complexity of deadlock detection and resolution algorithms, and the rate of deadlock formation, λ. Based on the up-to-date deadlock detection and resolution algorithms, we show that the asymptotically optimal frequency of deadlock detection scheduling that minimizes the message overhead is O((λn)1/3), when the total number of processes n is sufficiently large. Furthermore, we show that in general fully distributed (uncoordinated) deadlock detection scheduling can not be performed as efficiently as centralized (coordinated) deadlock detection scheduling. Copyright 2005 acm.

关键词： Computer system recovery

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: An incentive-compatible capacity assignment algorithm for bulk data distribution using P2P 05

Brief announcement: An incentive-compatible capacity assignm...

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Koo, Simon G. M. Lee, C.S. George Kannan, Karthik Electrical and Computer Engineering Purdue University West Lafayette IN 47907 Krannet School of Management Purdue University West Lafayette IN 47907

ISBN: (纸本)9781581139945

In recent years, the rapid growth of peer-to-peer (P2P) networks has provided a new paradigm for content distribution. To improve the efficiency of a P2P system, it is important to provide incentives for the peers to participate and contribute their resources. In this work, we address the incentive provisioning problem for distribution of large-volume content in P2P networks, and present a "seeing-is-believing" incentive-compatible mechanism in which a peer will decide how much resources will be assigned to which neighbors based on what it has experienced. The protocol applies a utility-based resource-trading concept where peers will maximize their contributions for a fair or better return, and we show that by adopting this protocol, the system will achieve Cournot Equlibrium. Our protocol is light-weight, completely decentralized, and cheat-proof.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient dependency tracking for relevant events in shared-memory systems 05

Efficient dependency tracking for relevant events in shared-...

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Agarwal, Anurag Garg, Vijay K. Dept. of Computer Sciences University of Texas at Austin Austin TX 78712-0233 United States Dept. of Electrical and Computer Engg University of Texas at Austin Austin TX 78712-1084 United States

ISBN: (纸本)9781581139945

In a concurrent system with N processes, vector clocks of size N are used for tracking dependencies between the events. Using vectors of size N leads to scalability problems. Moreover, association of components with processes makes vector clocks cumbersome and inefficient for systems with a dynamic number of processes. We present a class of logical clock algorithms, called chain clock, for tracking dependencies between relevant events based on generalizing a process to any chain in the computation poset. Chain clocks are generally able to track dependencies using fewer than N components and also adapt automatically to systems with dynamic number of processes. We compared the performance of Dynamic Chain Clock (DCC) with vector clock for multithreaded programs in Java. With 1% of total events being relevant events, DCC requires 10 times fewer components than vector clock and the times-tamp traces are smaller by a factor of 100. Although DCC requires shared data structures, it is still 10 times faster than vector clock in our experiments. Copyright 2005 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Proof labeling schemes 05

Proof labeling schemes

引用

24th annual acm symposium on principles of distributed computing, PODC 2005

作者： Korman, Amos Kutten, Shay Peleg, David Dept. of Computer Science Weizmann Institute Rehovot 76100 Israel Information Systems Group Fac. of IEandM The Technion Haifa 32000 Israel

ISBN: (纸本)9781581139945

This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as "how expensive is local verification?" and more specifically "how expensive is local verification compared to computation?" A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In particular, it is shown that the cost of verification is sometimes rather high, even higher than the number of bits needed for a computation. On the other hand, approaches are presented for the efficient construction of schemes, and upper and lower bounds are established on the cost of schemes for multiple basic problems. The paper also studies the role and cost of unique identities in terms of impossibility and complexity. Previous studies on related questions deal with distributed algorithms that simultaneously compute a configuration and verify that this configuration has a certain desired property. It turns out that this combined approach enables verification to be less costly, since the configuration is typically generated so as to be easily verifiable. In contrast, our approach separates the configuration design from the verification. That is, it first generates the desired configuration without bothering with the need to verify, and then handles the task of constructing a suitable verification scheme. Our approach thus allows for a more modular design of algorithms, and has the potential to aid in verifying properties even when the original design of the structures for maintaining them was done without verification in mind. Copyright 2005 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：