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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Early-deciding consensus is expensive 13

Early-deciding consensus is expensive

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Dolev, Danny Lenzen, Christoph Hebrew University of Jerusalem Edmond Safra Campus 91904 Jerusalem Israel Massachusetts Institute of Technology 32 Vassar Street Cambridge 02139 United States

ISBN: (纸本)9781450320658

In consensus, the n nodes of a distributed system seek to take a consistent decision on some output, despite up to t of them crashing or even failing maliciously, i.e., behaving "Byzantine". It is known that it is impossible to guarantee that synchronous, deterministic algorithms consistently decide on an output in fewer than f + 1 rounds in executions in which the actual number of faults is f ≤ t. This even holds if faults are crash-only, and in this case the bound can be matched precisely. However, the question of whether this can be done efficiently, i.e., with little communication, so far has not been addressed. In this work, we show that algorithms tolerating Byzantine faults and deciding within f + 2 rounds must send ω(nt + t2f) messages;as a byproduct, our analysis shows that decision within f +1 rounds is impossible in this setting (unless f = t). Moreover, we prove that any crash-resilient algorithm deciding in f + 1 rounds has worst-case message complexity ω(n2f). Interestingly, this changes drastically if we restrict the fault model further. If crashes are orderly, i.e., in each round, each node picks an order in which its messages are sent, and crashing nodes successfully transmit a prefix of their sequence, deciding in f + 1 rounds can be guaranteed with O(nt) messages. Copyright 2013 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

User-level Remote Memory Paging for Multithreaded Applications 13

User-level Remote Memory Paging for Multithreaded Applicatio...

引用

13th IEEE/acm International symposium on Cluster, Cloud, and Grid computing (CCGrid)

作者： Midorikawa, Hiroko Suzuki, Yuichiro Iwaida, Masatoshi Seikei Univ Grad Sch Sci & Technol Tokyo Japan JST CREST Tokyo Japan

The new page swap mechanism is introduced to resolve an inconsistent page problem for multithreaded applications in user-level remote paging systems. According to the evaluations, its overhead is limited and it can be... 详细信息

ISBN: (纸本)9780769549965;9781467364652

关键词： memory server distributed shared memory memory paging page swap remote memory virtual memory

来源：评论

学校读者我要写书评

暂无评论

Building an Elastic Cloud out of Small Datacenters 13

Building an Elastic Cloud out of Small Datacenters

引用

13th IEEE/acm International symposium on Cluster, Cloud, and Grid computing (CCGrid)

作者： Widjaja, Indra Borst, Sem Saniee, Iraj Alcatel Lucent Bell Labs Murray Hill NJ 07974 USA

ISBN: (纸本)9780769549965;9781467364652

Cloud providers may operate large-scale datacenters in a few locations. We argue that deploying many small-scale datacenters at network edge can significantly improve user experience in terms of latency. Small-scale datacenters, however, may not be able to provide elastic services. In this paper, we investigate distributed small-scale datacenters with load reallocation where jobs that cannot be suitably processed locally will be reallocated to remote datacenters. We formulate an optimization problem for load reallocation in distributed datacenters, provide performance comparisons among different alternatives and offer insights on handling multiple job types. We develop online optimization algorithms that can be operated in a decentralized and measurement-based fashion to dynamically reallocate load in response to sudden load surges. The experimental results demonstrate that elasticity can be practically provided by small-scale datacenters enhanced with effective load reallocation techniques.

关键词： Elastic cloud distributed datacenters

来源：评论

学校读者我要写书评

暂无评论

Scheduling Transactions in Replicated distributed Software Transactional Memory 13

Scheduling Transactions in Replicated Distributed Software T...

引用

13th IEEE/acm International symposium on Cluster, Cloud, and Grid computing (CCGrid)

作者： Kim, Junwhan Ravindran, Binoy Virginia Tech ECE Dept Blacksburg VA 24061 USA

ISBN: (纸本)9780769549965;9781467364652

distributed software transactional memory (DTM) is an emerging, alternative concurrency control model for distributed systems that promises to alleviate the difficulties of lock-based distributed synchronization. Object replication can improve concurrency and achieve fault-tolerance in DTM, but may incur high communication overhead (in metric-space networks) to ensure one-copy serializability. We consider metric-space networks and develop a cluster-based object replication model for DTM. In this model, object replicas are distributed to clusters of nodes, where clusters are determined based on distance between nodes, to maximize locality and fault-tolerance and to minimize communication overhead. We develop a transactional scheduler for this model, called CTS. CTS enqueues live transactions and identifies some of the transactions that must be aborted in advance to enhance concurrency of the other transactions over clusters, reducing a significant number of future conflicts. Our implementation and experimental evaluation reveals that CTS improves transactional throughput over state-of-the-art replicated DTM solutions by as much as (average) 1.55x and 1.73x under low and high contention, respectively.

关键词： distributed Systems Software Transactional Memory Transactional Scheduling Replicated Model

来源：评论

学校读者我要写书评

暂无评论

Massivizing Multi-Player Online Games on Clouds 13

Massivizing Multi-Player Online Games on Clouds

引用

13th IEEE/acm International symposium on Cluster, Cloud, and Grid computing (CCGrid)

作者： Shen, Siqi Iosup, Alexandru Epema, Dick Delft Univ Technol Parallel Distributed Syst Grp Delft Netherlands

ISBN: (纸本)9780769549965;9781467364652

Massively Multiplayer Online Games (MMOGs) are an important type of distributed applications and have millions of users. Traditionally, MMOGs are hosted on dedicated clusters, distributed globally. With the advent of cloud computing, MMOGs such as Zynga's are increasingly run on cloud resources, through the use of cloud technology and innovation. Massivizing MMOGs on clouds is the focus of my PhD research. My main contributions are: 1) analyzing and modeling various MMOG workloads, including those of social and traditional real-time games, 2) designing and implementing a cost-efficient and reliable cloud-based MMOG platform, 3) designing and implementing a scalable MMOG system which employs domain-specific scaling techniques to support the real-time strategy games of the future, 4) experimental prototypes and tools to evaluate our proposed research via real-world experimentation and simulation, and applying our proposed research to a popular real-world application. In this article, I introduce my research progress and my future plans.

关键词： Clouds Research Proposal Game theory CLOUDS

来源：评论

学校读者我要写书评

暂无评论

Tango: distributed Data Structures over a Shared Log 13

Tango: Distributed Data Structures over a Shared Log

引用

24th acm symposium on Operating Systems principles (SOSP)

作者： Balakrishnan, Mahesh Malkhi, Dahlia Wobber, Ted Wu, Ming Prabhakaran, Vijayan Wei, Michael Davis, John D. Rao, Sriram Zou, Tao Zuck, Aviad Microsoft Res Silicon Valley Mountain View CA 94043 USA Microsoft Res Asia Beijing Peoples R China Microsoft Redmond WA USA Univ Calif San Diego San Diego CA 92103 USA Cornell Univ Ithaca NY 14853 USA Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450323888

distributed systems are easier to build than ever with the emergence of new, data-centric abstractions for storing and computing over massive datasets. However, similar abstractions do not exist for storing and accessing meta-data. To fill this gap, Tango provides developers with the abstraction of a replicated, in-memory data structure (such as a map or a tree) backed by a shared log. Tango objects are easy to build and use, replicating state via simple append and read operations on the shared log instead of complex distributed protocols;in the process, they obtain properties such as linearizability, persistence and high availability from the shared log. Tango also leverages the shared log to enable fast transactions across different objects, allowing applications to partition state across machines and scale to the limits of the underlying log without sacrificing consistency.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed source detection with limited bandwidth 13

Efficient distributed source detection with limited bandwidt...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Lenzen, Christoph Peleg, David Massachusetts Institute of Technology 32 Vassar Street Cambridge 02139 United States Dept. of Computer Science and Applied Math. Weizmann Institute of Science 76100 Rehovot Israel

ISBN: (纸本)9781450320658

Given a simple graph G = (V, E) and a set of sources SCV, denote for each node v Ε V by L(∞) the lexicographically ordered list of distance/source pairs (d(s, v), s), where s Ε S. For integers d, k Ε NU{∞}, we consider the source detection, or (S, d, k)-detection task, requiring each node v to learn the first k entries of L(∞) (if for all of them d(s, v) ≤ d) or all entries (d(s, v),s) Ε L (∞), satisfying that d(s, v) ≤ d (otherwise). Solutions to this problem provide natural generalizations of concurrent breadth-first search (BFS) tree constructions. For example, the special case of k = ∞ requires each source s Ε S to build a complete BFS tree rooted at s, whereas the special case of d = ∞ and S = V requires constructing a partial BFS tree comprising at least k nodes from every node in V. In this work, we give a simple, near-optimal solution for the source detection task in the CONGEST model, where messages contain at most C(logn) bits, running in d + k rounds. We demonstrate its utility for various routing problems, exact and approximate diameter computation, and spanner construction. For those problems, we obtain algorithms in the CONGEST model that are faster and in some cases much simpler than previous solutions. Copyright 2013 acm.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

High-Performance Quantum computing Simulation for the Quantum Geometric Machine Model 13

High-Performance Quantum Computing Simulation for the Quantu...

引用

13th IEEE/acm International symposium on Cluster, Cloud, and Grid computing (CCGrid)

作者： Maron, Adriano Reiser, Renata Pilla, Mauricio Univ Fed Pelotas Technol Dev Ctr Grad Program Comp Sci Pelotas Brazil

ISBN: (纸本)9780769549965;9781467364652

Due to the unavailability of quantum computers, simulation of quantum algorithms using classical computers is still the most affordable option for research of algorithms and models for quantum computing. As such simulation requires high computing power and memory resources, and computations are regular and data-intensive, GPUs become a suitable solution for accelerating the simulation of quantum algorithms. This work introduces an extension of the execution library for the VPE-qGM environment to support GPU acceleration. Hadamard gates with up to 20 quantum bits were simulated, and speedups of up to approximately 540x over a sequential simulation and of approximately 85x over a 8-core distributed simulation in the VirD-GM environment were achieved.

关键词： Quantum Simulation GPU computing Quantum Process.

来源：评论

学校读者我要写书评

暂无评论

Towards privacy-preserving computing on distributed electronic health record data

Towards privacy-preserving computing on distributed electron...

引用

2013 Middleware Doctoral symposium, MDS 2013 - Co-located with acm/IFIP/USENIX International Middleware Conference, Middleware 2013

作者： Yigzaw, Kassaye Yitbarek Bellika, Johan Gustav Andersen, Anders Hartvigsen, Gunnar Fernandez-Llatas, Carlos Department of Computer Science University of Tromsø Norway Norwegian Centre for Integrated Care and Telemedicine University Hospital of North Norway Norway ITACA-TSB Polytechnic University of Valencia Spain

ISBN: (纸本)9781450325486

The paper reports on work in progress towards construction of a peer-to-peer framework for privacy preserving computing on distributed electronic health data. The framework supports three different types of federated queries. For privacy-preserving computing, we proposed distributed secure multi-party computation (SMC), where each peer is only involved in secure computations with some of the peers. We hypothesize distributed SMC could enable to achieve more efficient and scalable computing solutions. The architecture of the framework is also described. © 2013 acm.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Sparrow: distributed, Low Latency Scheduling 13

Sparrow: Distributed, Low Latency Scheduling

引用

24th acm symposium on Operating Systems principles (SOSP)

作者： Ousterhout, Kay Wendell, Patrick Zaharia, Matei Stoica, Ion Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9781450323888

Large-scale data analytics frameworks are shifting towards shorter task durations and larger degrees of parallelism to provide low latency. Scheduling highly parallel jobs that complete in hundreds of milliseconds poses a major challenge for task schedulers, which will need to schedulemillions of tasks per second on appropriate machines while offering millisecond-level latency and high availability. We demonstrate that a decentralized, randomized sampling approach provides near-optimal performance while avoiding the throughput and availability limitations of a centralized design. We implement and deploy our scheduler, Sparrow, on a 110-machine cluster and demonstrate that Sparrow performs within 12% of an ideal scheduler.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：