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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,316 篇 会议
151 篇 期刊文献
6 册 图书

馆藏范围

4,472 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,283 篇 工学
- 3,129 篇 计算机科学与技术...
- 1,640 篇 软件工程
- 413 篇 信息与通信工程
- 374 篇 电气工程
- 224 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 34 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
807 篇 理学
- 672 篇 数学
- 129 篇 统计学（可授理学、...
- 66 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 171 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

377 篇 distributed comp...
259 篇 distributed comp...
134 篇 distributed algo...
107 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
61 篇 concurrent compu...
61 篇 computer network...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
49 篇 application soft...
48 篇 algorithms
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
41 篇 high performance...

机构

47 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
13 篇 georgia inst tec...
12 篇 univ toronto on
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 rui oliveira
17 篇 raynal michel
17 篇 wattenhofer roge...
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,388 篇 英文
81 篇 其他
4 篇 中文

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

共 4473 条记录，以下是741-750 订阅

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

详细简洁

排序：

Sublinear Algorithms in T-interval Dynamic Networks 20

Sublinear Algorithms in T-interval Dynamic Networks

引用

32nd acm symposium on Parallelism in Algorithms and Architectures (SPAA)

作者： Jahja, Irvan Yu, Haifeng Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9781450369350

We consider standard T-interval dynamic networks, under the synchronous timing model and the broadcast CONGEST model. In a T-interval dynamic network, the set of nodes is always fixed and there are no node failures. The edges in the network are always undirected, but the set of edges in the topology may change arbitrarily from round to round, as determined by some adversary and subject to the following constraint: For every T consecutive rounds, the topologies in those rounds must contain a common connected spanning subgraph. Let H-r to be the maximum (in terms of number of edges) such subgraph for round r through r + T - 1. We define the backbone diameter d of a T-interval dynamic network to be the maximum diameter of all such H-r's, for r >= 1. We use n to denote the number of nodes in the network. Within such a context, we consider a range of fundamental distributed computing problems including CouNT/MAx/MEDIAN/Sum/LEADERELECT/CONSENSUS/CONFIRMEDFLOOD. Existing algorithms for these problems all have time complexity of Omega(n) rounds, even for T = infinity and even when d is as small as O(1). This paper presents a novel O (d(3) log(2) n) deterministic algorithm for computing COUNT, for T-interval dynamic networks with T >= c . d(2) log(2) n. Here c is a (sufficiently large) constant independent of d, n, and T. To our knowledge, our algorithm is the very first such algorithm whose complexity does not contain a Theta(n) term. For d = O(n(a)) with constant a < 1/3, our deterministic algorithm has o(n) complexity, which is better than all (both randomized and deterministic) existing COUNT algorithms in this setting. For d = O(polylog(n)), our algorithm is exponentially faster. Following the framework of our COUNT algorithm, this paper further develops novel algorithms for solving MAX/MEDIAN/SUM/LEADERELECT/CONSENSUS/CONFIRMEDFLOOD, while incurring either O (d(3) log(2) n) or O(d(3) log(3) n) complexity. Again, for all these problems, our algorithms are the first ones

关键词： distributed algorithms T-interval dynamic networks sublinear algorithms

来源：评论

学校读者我要写书评

暂无评论

Deterministic distributed Dominating Set Approximation in the CONGEST Model 19

Deterministic Distributed Dominating Set Approximation in th...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Deurer, Janosch Kuhn, Fabian Maus, Yannic Univ Freiburg Freiburg Germany Technion Haifa Israel

ISBN: (纸本)9781450362177

We develop deterministic approximation algorithms for the minimum dominating set problem in the CONGEST model with an almost optimal approximation guarantee. For epsilon > 1/ poly log Delta we obtain two algorithms with approximation factor (1 + epsilon) (1 + ln(Delta + 1)) and with runtimes 2(O(root log n log log n)) and O(Delta poly log Delta + poly log Delta log* n), respectively. Further we show how dominating set approximations can be deterministically transformed into a connected dominating set in the CONGEST model while only increasing the approximation guarantee by a constant factor. This results in a deterministicO(log Delta)-approximation algorithm for the minimum connected dominating set with time complexity 2(O(root log n log log n)).

关键词： dominating set approximation CONGEST model

来源：评论

学校读者我要写书评

暂无评论

Implementing Mediators with Asynchronous Cheap Talk 19

Implementing Mediators with Asynchronous Cheap Talk

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Abraham, Ittai Dolev, Danny Geffner, Ivan Halpern, Joseph Y. VMWARE Palo Alto CA 94304 USA Hebrew Univ Jerusalem Jerusalem Israel Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450362177

A mediator can help non-cooperative agents obtain an equilibrium that may otherwise not be possible. We study the ability of players to obtain the same equilibrium without a mediator, using only cheap talk, that is, nonbinding pre-play communication. Previous work has considered this problem in a synchronous setting. Here we consider the effect of asynchrony on the problem, and provide upper bounds for implementing mediators. Considering asynchronous environments introduces new subtleties, including exactly what solution concept is most appropriate and determining what move is played if the cheap talk goes on forever. Different results are obtained depending on whether the move after such "infinite play" is under the control of the players or part of the description of the game.

关键词： distributed computing game theory security

来源：评论

学校读者我要写书评

暂无评论

Assessment of distributed Multi-User MIMO Transmission in 5G Networks 18

Assessment of Distributed Multi-User MIMO Transmission in 5G...

引用

18th International symposium on Mobility Management and Wireless Access

作者： Braam, Sjors Litjens, Remco Smulders, Peter IJntema, Wieger TNO Dept Networks The Hague Netherlands Delft Univ Technol Dept EEMCS Delft Netherlands TU Eindhoven Dept Elect Engn Eindhoven Netherlands IAV GmbH Dept TT A12 Gifhorn Germany TNO The Hague Netherlands

ISBN: (纸本)9781450381192

We present a simulation-based assessment of the performance potential of distributed MIMO (D-MIMO), multi-user MIMO (MU-MIMO) and particularly the combined D/MU-MIMO operation, for which we extend previously published scheduling and beamforming principles. The assessment study reveals that, when optimizing average user throughput performance, DMIMO, while fruitless when used in isolation, is very effective when intelligently combined with MU-MIMO. Alternatively, when optimizing the cell edge performance, MU-MIMO, while also shown to be ineffective when used in isolation, is in fact very valuable when accompanied by a suitable configuration of D-MIMO. As an illustrative example, when using a jointly optimised configuration of D/MU-MIMO in a highly loaded urban deployment scenario, a 121% cell edge performance gain can be attained over a scenario using only D-MIMO, and even a demonstrated 153% gain over a scenario where only the MU-MIMO feature is available.

关键词： Mobile networks 5G MIMO distributed MIMO multi-user MIMO beamforming scheduling performance assessment

来源：评论

学校读者我要写书评

暂无评论

DCDB Wintermute: Enabling Online and Holistic Operational Data Analytics on HPC Systems 20

DCDB Wintermute: Enabling Online and Holistic Operational Da...

引用

29th International Conference on High-Performance Parallel and distributed computing (HPDC)

作者： Netti, Alessio Mueller, Micha Guillen, Carla Ott, Michael Tafani, Daniele Ozer, Gence Schulz, Martin Tech Univ Munich Leibniz Supercomp Ctr Munich Germany Leibniz Supercomp Ctr Munich Germany Tech Univ Munich Munich Germany

ISBN: (纸本)9781450370523

As we approach the exascale era, the size and complexity of HPC systems continues to increase, raising concerns about their manageability and sustainability. For this reason, more and more HPC centers are experimenting with fine-grained monitoring coupled with Operational Data Analytics (ODA) to optimize efficiency and effectiveness of system operations. However, while monitoring is a common reality in HPC, there is no well-stated and comprehensive list of requirements, nor matching frameworks, to support holistic and online ODA. This leads to insular ad-hoc solutions, each addressing only specific aspects of the problem. In this paper we propose Wintermute, a novel generic framework to enable online ODA on large-scale HPC installations. Its design is based on the results of a literature survey of common operational requirements. We implement Wintermute on top of the holistic DCDB monitoring system, offering a large variety of configuration options to accommodate the varying requirements of ODA applications. Moreover, Wintermute is based on a set of logical abstractions to ease the configuration of models at a large scale and maximize code re-use. We highlight Wintermute's flexibility through a series of practical case studies, each targeting a different aspect of the management of HPC systems, and then demonstrate the small resource footprint of our implementation.

关键词： High-Performance computing Monitoring Operational Data Analytics System Management Online Analysis

来源：评论

学校读者我要写书评

暂无评论

Significantly Improving Lossy Compression for HPC Datasets with Second-Order Prediction and Parameter Optimization 20

Significantly Improving Lossy Compression for HPC Datasets w...

引用

29th International Conference on High-Performance Parallel and distributed computing (HPDC)

作者： Zhao, Kai Di, Sheng Liang, Xin Li, Sihuan Tao, Dingwen Chen, Zizhong Cappello, Franck Univ Calif Riverside Riverside CA 92521 USA Argonne Natl Lab Lemont IL 60439 USA Washington State Univ Pullman WA 99164 USA

ISBN: (纸本)9781450370523

Today's extreme-scale high-performance computing (HPC) applications are producing volumes of data too large to save or transfer because of limited storage space and I/O bandwidth. Error-bounded lossy compression has been commonly known as one of the best solutions to the big science data issue, because it can significantly reduce the data volume with strictly controlled data distortion based on user requirements. In this work, we develop an adaptive parameter optimization algorithm integrated with a series of optimization strategies for SZ, a state-of-the-art prediction-based compression model. Our contribution is threefold. (1) We exploit effective strategies by using 2nd-order regression and 2nd-order Lorenzo predictors to improve the prediction accuracy significantly for SZ, thus substantially improving the overall compression quality. (2) We design an efficient approach selecting the best-fit parameter setting, by conducting a comprehensive priori compression quality analysis and exploiting an efficient online controlling mechanism. (3) We evaluate the compression quality and performance on a supercomputer with 4,096 cores, as compared with other state-of-the-art error-bounded lossy compressors. Experiments with multiple real-world HPC simulations datasets show that our solution can improve the compression ratio up to 46% compared with the second-best compressor. Moreover, the parallel I/O performance is improved by up to 40% thanks to the significant reduction of data size.

关键词： Lossy Compression Science Data Parameter Optimization Rate Distortion High-Performance computing

来源：评论

学校读者我要写书评

暂无评论

Vorpal: Vector Clock Ordering For Large Persistent Memory Systems 19

Vorpal: Vector Clock Ordering For Large Persistent Memory Sy...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Korgaonkar, Kunal Izraelevitz, Joseph Zhao, Jishen Swanson, Steven Univ Calif San Diego La Jolla CA 92093 USA

ISBN: (纸本)9781450362177

In systems with non-volatile main memories (NVMMs), programmers must carefully control the order in which writes become persistent. Otherwise, what will remain in persistence after a crash may be unusable upon recovery. Prior art has already explored semantic models for specifying this persist order, but most enforcement algorithms for the order are not scalable to large server machines because they assume that the machine contains only one or two memory controllers. In this paper, we describe a collection of provably-correct algorithms for enforcing the persist-order across writes, generated at many different cores, and persisted across numerous different memory controllers. Relative to existing solutions, our algorithms improve performance by 48% by reducing both traffic and serialization overheads.

关键词： scale-up architectures vector clocks parallel architectures distributed systems clocks persistent memories storage architectures non-volatile memories computer architecture non-volatile main memories

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Fast Concurrent Data Sketches 38

Brief Announcement: Fast Concurrent Data Sketches

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Rinberg, Arik Spiegelman, Alexander Bortnikov, Edward Hillel, Eshcar Keidar, Idit Serviansky, Hadar Technion Haifa Israel VMware Res Palo Alto CA USA Yahoo Res Sunnyvale CA USA Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9781450362177

Data sketches are approximate succinct summaries of long data streams. They are widely used for processing massive amounts of data and answering statistical queries about it. Existing libraries producing sketches are very fast, but do not allow parallelism for creating sketches using multiple threads or querying them while they are being built. We present a generic approach to parallelising data sketches efficiently and allowing them to be queried in real time, while bounding the error that such parallelism introduces. Utilising relaxed semantics and the notion of strong linearisability we prove our algorithm's correctness and analyse the error it induces in two specific sketches. Our implementation achieves high scalability while keeping the error small. We have contributed one of our concurrent sketches to the open-source data sketches library.

关键词： concurrency synchronization persistence design analysis of distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed double auctions for large-scale device-to-device resource trading 20

Distributed double auctions for large-scale device-to-device...

引用

21st acm International symposium on Mobile Ad Hoc Networking and computing, MobiHoc 2020

作者： Gao, Shuqin Courcoubetis, Costas Duan, Lingjie Singapore University of Technology and Design Singapore

ISBN: (纸本)9781450380157

Mobile users in future wireless networks face limited wireless resources such as data plan, computation capacity and energy storage. Given that some of these users may not be utilizing fully their wireless resources, device-to-device (D2D) resource sharing is a promising approach to exploit users' diversity in resource use and for pooling their resources locally. In this paper, we propose a novel two-sided D2D trading market model that enables a large number of locally connected users to trade resources. Traditional resource allocation solutions are mostly centralized without considering users' local D2D connectivity constraints, becoming unscalable for large-scale trading. In addition, there may be market failure since selfish users will not truthfully report their actual valuations and quantities for buying or selling resources. To address these two key challenges, we first investigate the distributed resource allocation problem with D2D assignment constraints. Based on the greedy idea of maximum weighted matching, we propose a fast algorithm to achieve near-optimal average allocative efficiency. Then, we combine it with a new pricing mechanism that adjusts the final trading prices for buying and selling resources in a way that buyers and sellers are incentivized to truthfully report their valuations and available resource quantities. Unlike traditional double auctions with a central controller, this pricing mechanism is fully distributed in the sense that the final trading prices between each matched pair of users only depend on their own declarations and hence can be calculated locally. Finally, we analyze the repeated execution of the proposed D2D trading mechanism in multiple rounds and determine the best trading frequency. © 2020 acm.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

PAC: Paged Adaptive Coalescer for 3D-Stacked Memory 20

PAC: Paged Adaptive Coalescer for 3D-Stacked Memory

引用

29th International Conference on High-Performance Parallel and distributed computing (HPDC)

作者： Wang, Xi Leidel, John D. Williams, Brody Chen, Yong Texas Tech Univ Lubbock TX 79409 USA Tactical Comp Labs Muenster TX 76252 USA

ISBN: (纸本)9781450370523

Many contemporary data-intensive applications exhibit irregular and highly concurrent memory access patterns and thus challenge the performance of conventional memory systems. Driven by an expanding need for high-bandwidth memory featuring low access latency, 3D-stacked memory devices, such as the Hybrid Memory Cube (HMC) and High Bandwidth Memory (HBM), were designed to provide significantly higher throughput as compared to standard JEDEC DDR devices. However, existing memory interfaces and coalescing models, designed for conventional DDR devices, are unable to fully exploit the bandwidth potential inherent in these new 3D-stacked memory devices. In order to remedy this disparity, we introduce in this work a novel paged adaptive coalescer (PAC) infrastructure with a scalable coalescing network for 3D-stacked memory. We present the design and simulated implementation of this approach on RISC-V embedded cores with attached HMC devices. We have carried out extensive evaluations and the results show that the proposed PAC methodology yields an average coalescing efficiency of 56.01%. Further, our evaluation results also show that the PAC reduces bank conflicts and the power consumption by 85.16% and 59.21%, respectively. Overall, PAC achieves an average performance gain of 14.35% (and up to 26.06%) across 14 test suites. These results showcase the potential of the PAC methodology as applied to architecture design for increasingly critical data-intensive algorithms and applications.

关键词： 3D-stacked memory Memory coalescing Data-intensive computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 71 72 73 74 75 76 77 78 79 80 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：