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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Dynamic scaling for low-precision learning 21

Dynamic scaling for low-precision learning

引用

proceedings of the 26th acm SIGPLAN symposium on principles and Practice of Parallel Programming

作者： Ruobing Han Min Si James Demmel Yang You Peking University Argonne National Laboratory UC Berkeley National University of Singapore

ISBN: (纸本)9781450382946

In recent years, distributed deep learning is becoming popular in industry and academia. Although researchers want to use distributed systems for training, it has been reported that the communication cost for synchronizing gradients can be a bottleneck. Using low-precision gradients is a promising technique for reducing the bandwidth requirement. In this work, we propose Auto Precision Scaling (APS), an algorithm that can improve the accuracy when we communicate gradients by low-precision floating-point values. APS can improve the accuracy for all precisions with a trivial communication cost. Our experimental results show that for both image classification and segmentation, applying APS can train the state-of-the-art models by 8-bit floating-point gradients with no or only a tiny accuracy loss (<0.05%). Furthermore, we can avoid any accuracy loss by designing a hybrid-precision technique. Finally, we propose a performance model to evaluate the proposed method. Our experimental results show that APS can get a significant speedup over the state-of-the-art method. To make it available to researchers and developers, we design and implement a high-performance system for customized precision Deep Learning(CPD), which can simulate the training process using an arbitrary low-precision customized floating-point format. We integrate CPD into PyTorch and make it open-source to the public1.

关键词： distributed training

来源：评论

学校读者我要写书评

暂无评论

The Virtuous Cycles of Determinism: Programming Groq's Tensor Streaming Processor 22

The Virtuous Cycles of Determinism: Programming Groq's Tenso...

引用

proceedings of the 2022 acm/SIGDA International symposium on Field-Programmable Gate Arrays

作者： Satnam Singh Groq Inc. Mountain View CA USA

ISBN: (纸本)9781450391498

FPGAs and other 2D and 3D spatial computing fabrics share several common characteristics e.g. a deterministic computing model with distributed memories, but also differ along important dimensions e.g. granularity and communication infrastructure. This talk will position Groq's Tensor Streaming Processing (TSP) chip relative to other spatial computing fabrics and highlight common aspects of programming models for such spatial computing engines as well as highlighting some of the unique characteristics of the TSP architecture and its programming model One common characteristic this talk will focus on is \em determinism and specifically the use of static scheduling to know at compile time exactly how many cycles a program will take to execute regardless of the specific values of the input data to the TSP chip. Groq's TSP architecture is based on a parallel collection of coarse grain processing units including matrix multiplication or convolution (MXM), vector operations (VXM), arbitrary vector transformations (SXM) and various numerical operations. Data originates from a memory reads (MEM) and is then chained through a tensor pipeline through one or more computing blocks and terminated by a memory write (MEM). The chip can operate on in-flight tensors as they are produced and consumed, aggressively exploiting data-flow locality. A variety of deterministic computing models will be surveyed as we seek abstractions that support rapid multiplexing between multiple workloads which can be co-resident on TSP chips, with scheduling and coordination facilitated by determinism.

关键词： machine learning acceleration spatial computing determinism

来源：评论

学校读者我要写书评

暂无评论

Plain SINR is Enough! 19

Plain SINR is Enough!

引用

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

作者： Halldorsson, Magnus M. Tonoyan, Tigran Reykjav Univ Dept Comp Sci ICE TCS Reykjavik Iceland

ISBN: (纸本)9781450362177

We develop randomized distributed algorithms for many of the most fundamental communication problems in the wireless SINR model, including (multi-message) broadcast, local broadcast, coloring, MIS, and aggregation. The complexity of the algorithms is optimal up to polylogarithmic preprocessing time. It shows - contrary to expectation - that the plain vanilla SINR model is just as powerful and fast (modulo the preprocessing) as various extensions studied, including power control, carrier sense, collision detection, free acknowledgements, and GPS location. A key component of the algorithms is an efficient simulation of Congest algorithms on a constant-density SINR backbone.

关键词： wireless network distributed algorithm plain SINR

来源：评论

学校读者我要写书评

暂无评论

The Randomized 𝑘-Server Conjecture Is False! 2023

The Randomized 𝑘-Server Conjecture Is False!

引用

proceedings of the 55th Annual acm symposium on Theory of computing

作者： Sébastien Bubeck Christian Coester Yuval Rabani Microsoft Research USA University of Oxford UK Hebrew University of Jerusalem Israel

ISBN: (纸本)9781450399135

We prove a few new lower bounds on the randomized competitive ratio for the k-server problem and other related problems, resolving some long-standing conjectures. In particular, for metrical task systems (MTS) we asympotically settle the competitive ratio and obtain the first improvement to an existential lower bound since the introduction of the model 35 years ago (in 1987). More concretely, we show: (1) There exist (k+1)-point metric spaces in which the randomized competitive ratio for the k-server problem is Ω(log2 k). This refutes the folklore conjecture (which is known to hold in some families of metrics) that in all metric spaces with at least k+1 points, the competitive ratio is Θ(logk). (2) Consequently, there exist n-point metric spaces in which the randomized competitive ratio for MTS is Ω(log2 n). This matches the upper bound that holds for all metrics. The previously best existential lower bound was Ω(logn) (which was known to be tight for some families of metrics). (3) For all kdistributed paging, and metric allocation. These lower bounds share a common thread, and other than the third bound, also a common construction.

关键词： randomized algorithms metrical task systems online computing competitive analysis $k$-server lower bounds

来源：评论

学校读者我要写书评

暂无评论

Cloud-scale VM Deflation for Running Interactive Applications On Transient Servers 20

Cloud-scale VM Deflation for Running Interactive Application...

引用

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

作者： Fuerst, Alexander Ali-Eldin, Ahmed Shenoy, Prashant Sharma, Prateek Indiana Univ Bloomington IN 47405 USA Univ Massachusetts Amherst Amherst MA USA Chalmers Univ Technol Stockholm Sweden

ISBN: (纸本)9781450370523

Transient computing has become popular in public cloud environments for running delay-insensitive batch and data processing applications at low cost. Since transient cloud servers can be revoked at any time by the cloud provider, they are considered unsuitable for running interactive application such as web services. In this paper, we present VM deflation as an alternative mechanism to server preemption for reclaiming resources from transient cloud servers under resource pressure. Using real traces from top-tier cloud providers, we show the feasibility of using VM deflation as a resource reclamation mechanism for interactive applications in public clouds. We show how current hypervisor mechanisms can be used to implement VM deflation and present cluster deflation policies for resource management of transient and on-demand cloud VMs. Experimental evaluation of our deflation system on a Linux cluster shows that microservice-based applications can be deflated by up to 50% with negligible performance overhead. Our cluster-level deflation policies allow overcommitment levels as high as 50%, with less than a 1% decrease in application throughput, and can enable cloud platforms to increase revenue by 30%.

关键词： deflation data center cloud computing transient computing

来源：评论

学校读者我要写书评

暂无评论

Session details: Theme: distributed systems: NET - Networking track 21

Session details: Theme: Distributed systems: NET - Networkin...

引用

proceedings of the 36th Annual acm symposium on Applied computing

作者： Mario M. Freire Marilia Curado Ivan Ganchev University of Beira Interior Portugal Universidade de Coimbra Portugal University of Limerick Ireland

No abstract available.

ISBN: (纸本)9781450381048

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Faster Deterministic All Pairs Shortest Paths in CONGEST Model 20

Faster Deterministic All Pairs Shortest Paths in CONGEST Mod...

引用

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

作者： Agarwal, Udit Ramachandran, Vijaya Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450369350

We present a new deterministic algorithm for distributed weighted all pairs shortest paths (APSP) in both undirected and directed graphs. Our algorithm runs in (O) over tilde (n(4/3)) rounds in the Congest models on graphs with arbitrary edge weights, and it improves on the previous (O) over tilde (n(3/2)) bound of Agarwal et al. [3]. The main components of our new algorithm are a new faster technique for constructing blocker set deterministically and a new pipelined method for deterministically propagating distance values from source nodes to the blocker set nodes in the network. Both of these techniques have potential applications to other distributed algorithms. Our new deterministic algorithm for computing blocker set adapts the NC approximate hypergraph set cover algorithm in [5] to the distributed construction of a blocker set. It follows the two-step process of first designing a randomized algorithm that uses only pairwise independence, and then derandomizes this algorithm using a sample space of linear size. This algorithm runs in almost the same number of rounds as the initial step in our APSP algorithm that computes h-hops shortest paths. This result significantly improves on the deterministic blocker set algorithms in [1, 3] by removing an additional n center dot vertical bar Q vertical bar term in the round bound, where Q is the blocker set. The other new component in our APSP algorithm is a deterministic pipelined approach to propagate distance values from source nodes to blocker nodes. We use a simple natural round-robin method for this step, and we show using a suitable progress measure that it achieve the (O) over tilde (n(4/3)) bound on the number of rounds. It appears that the standard deterministic methods for efficiently broadcasting multiple values, and for sending or receiving messages using the routing schedule in an undirected APSP algorithm [13, 16] do not apply to this setting.

关键词： distributed Algorithms Shortest Paths Blocker Set

来源：评论

学校读者我要写书评

暂无评论

Scalable Top-K Retrieval with Sparta 20

Scalable Top-K Retrieval with Sparta

引用

25th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Sheffi, Gali Basin, Dmitry Bortnikov, Edward Carmel, David Keidar, Idit Technion Haifa Israel Yahoo Res Haifa Israel Amazon Haifa Israel

ISBN: (纸本)9781450368186

Many big data processing applications rely on a top-k retrieval building block, which selects (or approximates) the k highest-scoring data items based on an aggregation of features. In web search, for instance, a document's score is the sum of its scores for all query terms. Top-k retrieval is often used to sift through massive data and identify a smaller subset of it for further analysis. Because it filters out the bulk of the data, it often constitutes the main performance bottleneck. Beyond the rise in data sizes, today's data processing scenarios also increase the number of features contributing to the overall score. In web search, for example, verbose queries are becoming mainstream, while state-of-the-art algorithms fail to process long queries in real-time. We present Sparta, a practical parallel algorithm that exploits multi-core hardware for fast (approximate) top-k retrieval. Thanks to lightweight coordination and judicious context sharing among threads, Sparta scales both in the number of features and in the searched index size. In our web search case study on 50M documents, Sparta processes 12-term queries more than twice as fast as the state-of-the-art. On a tenfold bigger index, Sparta processes queries at the same speed, whereas the average latency of existing algorithms soars to be an order-of-magnitude larger than Sparta's.

关键词： parallel computing multi-threading performance information retrieval web search top-k search

来源：评论

学校读者我要写书评

暂无评论

Creating web-based, meta-simulation environments for social dynamics in an interactive framework for public policy analysis and design 21

Creating web-based, meta-simulation environments for social ...

引用

proceedings of the 2021 IEEE/acm 25th International symposium on distributed Simulation and Real Time Applications

作者： Nikitas M. Sgouros Dimosthenis Kyriazis University of Piraeus Piraeus Greece

ISBN: (纸本)9781665433266

Simulations of Social Dynamics play an important role in public policy analysis and design as they help to estimate the effects that alternative policies can have on society. We argue for a tight integration of a novel generation of social dynamics meta-simulation tools in a policy development framework. Such tools provide a common, agent- based modeling and concurrent execution environment for creating and running such simulations. Furthermore, they enable reasoning about simulation outcomes by examining and ranking alternative policy objectives based on a set of criteria supplied by the designer. We describe our implementation of such an idea in Politika, our Elixir-based web framework for interactive, meta-simulation-based policy design and provide appropriate examples as part of the PolicyCLOUD EU research project.

关键词： design tools agent-based modeling systems simulation concurrent computing intelligent agents

来源：评论

学校读者我要写书评

暂无评论

The distributed Complexity of Locally Checkable Problems on Paths is Decidable 19

The Distributed Complexity of Locally Checkable Problems on ...

引用

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

作者： Balliu, Alkida Brandt, Sebastian Chang, Yi-Jun Olivetti, Dennis Rabie, Mikael Suomela, Jukka Aalto Univ Helsinki Finland Swiss Fed Inst Technol Zurich Switzerland Univ Michigan Ann Arbor MI 48109 USA Univ Paris IRIF Paris France

ISBN: (纸本)9781450362177

Consider a computer network that consists of a path with n nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints-more formally, we have an LCL (locally checkable labeling) problem. How many communication rounds are needed (in the standard LOCAL model of computing) to solve this problem? It is well known that the answer is always either O(1) rounds, or Theta(log* n) rounds, or Theta(n) rounds. In this work we show that this question is decidable (albeit PSPACE-hard): we present an algorithm that, given any LCL problem defined on a path, outputs the distributed computational complexity of this problem and the corresponding asymptotically optimal algorithm.

关键词： distributed computing complexity decidability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 69 70 71 72 73 74 75 76 77 78 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：