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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,314 篇 会议
152 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

48 篇 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...
12 篇 univ toronto on
12 篇 georgia inst tec...
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 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,414 篇 英文
54 篇 其他
4 篇 中文

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

共 4472 条记录，以下是501-510 订阅

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

详细简洁

排序：

Clamor: Extending Functional Cluster computing Frameworks with Fine-Grained Remote Memory Access 12

Clamor: Extending Functional Cluster Computing Frameworks wi...

引用

12th Annual acm symposium on Cloud computing (SoCC)

作者： Thaker, Pratiksha Ayers, Hudson Raghavan, Deepti Niu, Ning Levis, Philip Zaharia, Matei Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450386388

We propose Clamor, a functional cluster computing framework that adds support for fine-grained, transparent access to global variables for distributed, data-parallel tasks. Clamor targets workloads that perform sparse accesses and updates within the bulk synchronous parallel execution model, a setting where the standard technique of broadcasting global variables is highly inefficient. Clamor implements a novel dynamic replication mechanism in order to enable efficient access to popular data regions on the fly, and tracks fine-grained dependencies in order to retain the lineage-based fault tolerance model of systems like Spark. Clamor can integrate with existing Rust and C++ libraries to transparently distribute programs on the cluster. We show that Clamor is competitive with Spark in simple functional workloads and can improve performance significantly compared to custom systems on workloads that sparsely access large global variables: from 5x for sparse logistic regression to over 100x on distributed geospatial queries.

关键词： data analytics remote memory fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Almost Universally Optimal distributed Laplacian Solvers via Low-Congestion Shortcuts 36

Almost Universally Optimal Distributed Laplacian Solvers via...

引用

36th International symposium on distributed computing, DISC 2022

作者： Anagnostides, Ioannis Lenzen, Christoph Haeupler, Bernhard Zuzic, Goran Gouleakis, Themis Carnegie Mellon University PittsburghPA United States CISPA Helmholtz Center for Information Security Saarbrücken Germany ETH Zürich Switzerland National University of Singapore Singapore

ISBN: (纸本)9783959772556

In this paper, we refine the (almost) existentially optimal distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21) into an (almost) universally optimal distributed Laplacian solver. Specifically, when the topology is known (i.e., the Supported-CONGEST model), we show that any Laplacian system on an n-node graph with shortcut quality SQ(G) can be solved after no(1)SQ(G) log(1/Ε) rounds, where Ε is the required accuracy. This almost matches our lower bound that guarantees that any correct algorithm on G requires (Equation presented)(SQ(G)) rounds, even for a crude solution with Ε ≤ 1/2. Several important implications hold in the unknown-topology (i.e., standard CONGEST) case: for excluded-minor graphs we get an almost universally optimal algorithm that terminates in D · no(1) log(1/Ε) rounds, where D is the hop-diameter of the network;as well as no(1) log(1/Ε)-round algorithms for the case of SQ(G) ≤ no(1), which holds for most networks of interest. Conditioned on improvements in state-of-the-art constructions of low-congestion shortcuts, the CONGEST results will match the Supported-CONGEST ones. Moreover, following a recent line of work in distributed algorithms, we consider a hybrid communication model which enhances CONGEST with limited global power in the form of the node-capacitated clique (NCC) model. In this model, we show the existence of a Laplacian solver with round complexity no(1) log(1/Ε). The unifying thread of these results, and our main technical contribution, is the study of a novel ρ-congested generalization of the standard part-wise aggregation problem. We develop near-optimal algorithms for this primitive in the Supported-CONGEST model, almost-optimal algorithms in (standard) CONGEST (with the additional overhead due to standard barriers), as well as a simple algorithm for bounded-treewidth graphs with a quadratic dependence on the congestion ρ. This primitive can be readily used to accelerate the Lap

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Angelic and Demonic Visitation: School Memories

Angelic and Demonic Visitation: School Memories

引用

International symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!)

作者： Salem, Leila Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450391108

The whole activity of programming can be thought of as a process of time reusability. This essay considers how computing education can transform these errors into shared learning journeys by refining the relationship between programmer and user. It is also an interpretation of Ralph-Johan Back's Changing data representation in the refinement calculus.

关键词： program derivation distributed systems networks harmonious cooperation multiprocess communication fuzzy logic algebraic semantics eisegesis

来源：评论

学校读者我要写书评

暂无评论

DFOGraph: An I/O- And communication-efficient system for distributed fully-out-of-core graph processing 21

DFOGraph: An I/O- And communication-efficient system for dis...

引用

26th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2021

作者： Yu, Jiping Qin, Wei Zhu, Xiaowei Sun, Zhenbo Huang, Jianqiang Li, Xiaohan Chen, Wenguang Tsinghua University Beijing China

ISBN: (纸本)9781450382946

With the magnitude of graph-structured data continually increasing, graph processing systems that can scale-out and scale-up are needed to handle extreme-scale datasets. While existing distributed out-of-core solutions have made it possible, they suffer from limited performance due to excessive I/O and communication costs. We present DFOGraph, a distributed fully-out-of-core graph processing system that applies and assembles multiple techniques to enable I/O- and communication-efficient processing. DFOGraph builds upon two-level partitions with adaptive compressed representations to allow fine-grained selective computation and communication. Our evaluation shows DFOGraph outperforms Chaos and HybridGraph significantly (12.94× and 10.82×) when scaling out to eight nodes. © 2021 Owner/Author.

关键词： distributed systems

来源：评论

学校读者我要写书评

暂无评论

tprof: Performance profiling via structural aggregation and automated analysis of distributed systems traces 12

tprof: Performance profiling via structural aggregation and ...

引用

12th Annual acm symposium on Cloud computing (SoCC)

作者： Huang, Lexiang Zhu, Timothy Penn State Univ University Pk PA 16802 USA

ISBN: (纸本)9781450386388

The traditional approach for performance debugging relies upon performance profilers (e.g., gprof, VTune) that provide average function runtime information. These aggregate statistics help identify slow regions affecting the entire workload, but they are ill-suited for identifying slow regions that only impact a fraction of the workload, such as tail latency effects. This paper takes a new approach to performance profiling by utilizing distributed tracing systems (e.g., Dapper, Zipkin, Jaeger). Since traces provide detailed timing information on a per-request basis, it is possible to group and aggregate tracing data in many different ways to identify the slow parts of the system. Our new approach to trace aggregation uses the structure embedded within traces to hierarchically group similar traces and calculate increasingly detailed aggregate statistics based on how the traces are grouped. We also develop an automated tool for analyzing the hierarchy of statistics to identify the most likely performance issues. Our case study across two complex distributed systems illustrates how our tool is able to find multiple performance issues that lead to 10x and 28x performance improvements in terms of average and tail latency, respectively. Our comparison with a state-of-the-art industry tool shows that our tool can pinpoint performance slowdowns more accurately than current approaches.

关键词： performance debugging distributed systems tracing

来源：评论

学校读者我要写书评

暂无评论

Online Locality Meets distributed Quantum computing 25

Online Locality Meets Distributed Quantum Computing

引用

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

作者： Amirreza Akbari Xavier Coiteux-Roy Francesco d'Amore François Le Gall Henrik Lievonen Darya Melnyk Augusto Modanese Shreyas Pai Marc-Olivier Renou Václav Rozhoň Jukka Suomela Aalto University Espoo Finland University of Calgary Calgary Canada TU Munich Garching Germany MCQST Munich Germany Bocconi University Milan Italy Gran Sasso Science Institute L'Aquila Italy Nagoya University Nagoya Japan TU Berlin Berlin Germany IIT Madras Chennai India Inria - Université Paris-Saclay Palaiseau France Ecole Polytechnique Palaiseau France INSAIT Sofia Bulgaria

ISBN: (纸本)9798400715105

We connect three distinct lines of research that have recently explored extensions of the classical LOCAL model of distributed computing: A. distributed quantum computing and non-signaling distributions [e.g. STOC 2024], B. finitely-dependent processes [e.g. Forum Math. Pi 2016], and C. locality in online graph algorithms and dynamic graph algorithms [e.g. ICALP 2023].We prove new results on the capabilities and limitations of all of these models of computing, for locally checkable labeling problems (LCLs). We show that all these settings can be sandwiched between the classical LOCAL model and what we call the randomized online-LOCAL model. Our work implies limitations on the quantum advantage in the distributed setting, and we also exhibit a new barrier for proving tighter bounds. Our main technical results are these: (1) All LCL problems solvable with locality O(log⋆n) in the classical deterministic LOCAL model admit a finitely-dependent distribution with locality O(1). This answers an open question by Holroyd [2024], and also presents a new barrier for proving bounds on distributed quantum advantage using causality-based arguments. (2) In rooted trees, if we can solve an LCL problem with locality o(logloglogn) in the randomized online-LOCAL model (or any of the weaker models, such as quantum-LOCAL), we can solve it with locality O(log⋆n) in the classical deterministic LOCAL model. One of many implications is that in rooted trees, O(log⋆n) locality in quantum-LOCAL is not stronger than O(log⋆n) locality in classical LOCAL.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

Frontier-guided Graph Reordering 25

Frontier-guided Graph Reordering

引用

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

作者： Xinmiao Zhang Cheng Liu Shengwen Liang Chenwei Xiong Yu Zhang Lei Zhang Huawei Li Xiaowei Li SKLP Institute of Computing Technology CAS Beijing China and University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan Hubei China

ISBN: (纸本)9798400714436

Graph reordering is an effective technique for improving the access locality of graph processing. However, existing methods often overlook the data access locality among concurrently activated vertices (a.k.a. frontiers). These vertices, while lacking direct connections or shared neighbors, can exhibit significant locality attributed to their overlapped k-order in-neighbors. However, calculating such overlaps directly is computationally prohibitive. We propose to estimate the overlapped k-order in-neighbors through frontier distribution analysis based on a few BFS samples. Our proposed graph reordering method, FrontOrder, constructs feature vectors from the frontier distribution of BFS samples, and employs K-means clustering with a custom distance metric to group vertices with high locality. Additionally, the learned clusters can predict runtime computing intensity, enabling load balancing through vertex reordering. FrontOrder achieves average speedups of 2.65× on Ligra and 1.73× on GPOP, outperforming state-of-the-art methods.

关键词： Graph Processing

来源：评论

学校读者我要写书评

暂无评论

Faster distributed Δ-Coloring via Ruling Subgraphs 25

Faster Distributed Δ-Coloring via Ruling Subgraphs

引用

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

作者： Yann Bourreau Sebastian Brandt Alexandre Nolin CISPA Helmholtz Center for Information Security Saarbrücken Germany

ISBN: (纸本)9798400715105

Brooks’ theorem states that all connected graphs but odd cycles and cliques can be colored with Δ colors, where Δ is the maximum degree of the graph. Such colorings have been shown to admit non-trivial distributed algorithms [Panconesi and Srinivasan, Combinatorica 1995] and have been studied intensively in the distributed literature. In particular, it is known that any deterministic algorithm computing a Δ-coloring requires Ω(logn) rounds in the LOCAL model [Chang, Kopelowitz, and Pettie, FOCS 2016], and that this lower bound holds already on constant-degree graphs. In contrast, the best upper bound in this setting is given by an O(log2 n)-round deterministic algorithm that can be inferred already from the works of [Awerbuch, Goldberg, Luby, and Plotkin, FOCS 1989] and [Panconesi and Srinivasan, Combinatorica 1995] roughly three decades ago, raising the fundamental question about the true complexity of Δ-coloring in the constant-degree *** answer this long-standing question almost completely by providing an almost-optimal deterministic O(logn log* n)-round algorithm for Δ-coloring, matching the lower bound up to a log* n-factor. Similarly, in the randomized LOCAL model, we provide an O(loglogn log* n)-round algorithm, improving over the state-of-the-art upper bound of O(log2 logn) [Ghaffari, Hirvonen, Kuhn, and Maus, distributed computing 2021] and almost matching the Ω(loglogn)-round lower bound by [BFHKLRSU, STOC 2016].Our results make progress on several important open problems and conjectures. One key ingredient for obtaining our results is the introduction of ruling subgraph families as a novel tool for breaking symmetry between substructures of a graph, which we expect to be of independent interest.

关键词： Brooks' theorem

来源：评论

学校读者我要写书评

暂无评论

Parallel Simulation of Stochastic Reward Nets using Theatre 25

Parallel Simulation of Stochastic Reward Nets using Theatre

引用

25th IEEE/acm International symposium on distributed Simulation and Real Time Applications (DS-RT)

作者： Cicirelli, Franco Nigro, Libero CNR Inst High Performance Comp & Networking ICAR Natl Res Council Italy I-87036 Arcavacata Di Rende CS Italy Univ Calabria DIMES Dept Informat Modelling Elect & Syst Sci I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9781665433266

This work aims at the development of tools for supporting modelling and analysis of timed systems by Stochastic Reward Nets (SRN). In a first approach it was proposed and experimented a formal reduction of SRN over Timed Automata (TA) in the context of the Uppaal popular toolbox. The reduction has the merit to allow both exhaustive model checking of an SRN model, useful for the assessment of qualitative properties (e.g., absence of deadlocks, occurrence of particular event sequences etc.), and quantitative analysis through the statistical model checker, which is based on simulations. However, although Uppaal enabled formal reasoning on the semantics of SRN, its practical usage suffers of scalability problems, that is it can introduce severe limitations in time and space when studying complex models. To cope with this problem, this paper describes a Java implementation of the SRN operational core engine, using the lock-free and efficient Theatre actor system which permits the parallel simulation of large models. The realization can be used for functional property checking on an untimed version of a source SRN model, and quantitative estimation of measurables through simulations. The paper discusses the design and implementation of the core engine of SRN on top of Theatre, together with supported intuitive configuration process of an SRN model, and reports some experimental results using a scalable grid computing model. The experiments confirm Theatre/SRN are capable of exploiting the potential of modern multi-core machines and can deliver good execution performances on large models.

关键词： Stochastic Reward Nets performability analysis actors high-performance computing Theatre Java

来源：评论

学校读者我要写书评

暂无评论

Xenic: SmartNIC-Accelerated distributed Transactions 21

Xenic: SmartNIC-Accelerated Distributed Transactions

引用

28th acm symposium on Operating Systems principles (SOSP)

作者： Schuh, Henry N. Liang, Weihao Liu, Ming Nelson, Jacob Krishnamurthy, Arvind Univ Washington Seattle WA 98195 USA Univ Wisconsin Madison WI USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450387095

High-performance distributed transactions require efficient remote operations on database memory and protocol metadata. The high communication cost of this workload calls for hardware acceleration. Recent research has applied RDMA to this end, leveraging the network controller to manipulate host memory without consuming CPU cycles on the target server. However, the basic read/write RDMA primitives demand trade-offs in data structure and protocol design, limiting their benefits. SmartNICs are a flexible alternative for fast distributed transactions, adding programmable compute cores and on-board memory to the network interface. Applying measured performance characteristics, we design Xenic, a SmartNIC-optimized transaction processing system. Xenic applies an asynchronous, aggregated execution model to maximize network and core efficiency. Xenic's co-designed data store achieves low-overhead remote object accesses. Additionally, Xenic uses flexible, point-to-point communication patterns between SmartNICs to minimize transaction commit latency. We compare Xenic against prior RDMA- and RPC-based transaction systems with the TPC-C, Retwis, and Smallbank benchmarks. Our results for the three benchmarks show 2.42x, 2.07x, and 2.21x throughput improvement, 59%, 42%, and 22% latency reduction, while saving 2.3, 8.1, and 10.1 threads per server.

关键词： distributed Transactions SmartNICs RDMA

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：