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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

3,287 篇 工学
- 3,133 篇 计算机科学与技术...
- 1,641 篇 软件工程
- 413 篇 信息与通信工程
- 374 篇 电气工程
- 224 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 34 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
806 篇 理学
- 671 篇 数学
- 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...
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 篇 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 篇 toueg sam

语言

4,359 篇 英文
114 篇 其他
4 篇 中文

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

共 4477 条记录，以下是751-760 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Determining edge node real-time capabilities 21

Determining edge node real-time capabilities

引用

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

作者： Varun Gowtham Oliver Keil Aniket Yeole Florian Schreiner Simon Tschöke Alexander Willner Fraunhofer FOKUS Software-based Networks Berlin Germany German Edge Cloud Eschborn Germany Fraunhofer FOKUS / TU Berlin Software-based Networks Berlin Germany

ISBN: (纸本)9781665433266

The distributed Cloud computing paradigm is continuously being adopted within the industrial automation domain. The most distinguishing feature of these Edge Clouds relates to their ability to provide low-latency and even hard realtime services. As infrastructure deployments can be rather heterogeneous in their nature, service providers require precise means for estimating end-to-end application latency behavior, in order to know performance boundaries that can be met for defining certain Service Level Agreements (SLAs). Although network performance tools exist for many years, mechanisms for assessing hard real-time performance of applications in distributed Edge Cloud environments have not been considered extensively yet. Therefore, we use a built-in feature of the Linux Kernel, the extended Berkeley Packet Filter (eBPF), to measure delays between targeted endpoints in the kernel stack, that enable the user to gain deeper and more accurate measurements of events as compared to generalized approaches (as accurate as eBPF / the time-stamping facility from the kernel). As a result, the real-time behavior of particular Edge Cloud deployments, including its hosted applications, can be profiled in detail by end-users as well as service-providers. Within our evaluation we have monitored a cyclic transmission of packets with a scheduled delay of under 190 μs and measured a round trip time under 2 ms. Future work include profiling the real-time behavior of potentially hosted time-critical applications, such as virtual Programmable Logic Controllers (vPLCs), over real-time networks, such Time Sensitive Networking (TSN); the extension towards dynamically configured real-time networks; and finally its application to future organic, self-optimizing Ultra-Reliable Low-Latency Communication 6G core networks.

关键词： edge computing vPLC TSN Industry 4.0 eBPF IoT IIoT NFV PLC

来源：评论

学校读者我要写书评

暂无评论

From Classical to Blockchain Consensus: What Are the Exact Algorithms? 19

From Classical to Blockchain Consensus: What Are the Exact A...

引用

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

作者： Liu, Yanhong A. Stoller, Scott D. SUNY Stony Brook Stony Brook NY 11794 USA

ISBN: (纸本)9781450362177

This tutorial describes well-known algorithms for distributed consensus problems, from classical consensus to blockchain consensus, and discusses exact algorithms that are high-level as in pseudocode and directly executable at the same time. The tutorial consists of five parts: (1) A introduction to different distributed consensus problems, from classical consensus and Byzantine consensus to blockchain consensus. (2) An overview of well-known algorithms, from Paxos for classical consensus to the Bitcoin algorithm for blockchain consensus, including important variants such as Viewstamped Replication and Virtual Synchrony, as well as Proof-of-Stake vs. Proof-of-Work. (3) An overview of a method and language, DistAlgo, for expressing distributed algorithms precisely at a high-level as pseudocode and having them be directly executable at the same time. (4) A study of exact algorithms expressed at a high level for the most extensively studied algorithm variants, including Lamport's Paxos for classical consensus and Nakamoto's Bitcoin algorithm for blockchain consensus. (5) A demo of the direct execution of these exact algorithms by distributed processes.

关键词： distributed consensus blockchain consensus Paxos algorithm Bitcoin algorithm synchronization conditions high-level queries

来源：评论

学校读者我要写书评

暂无评论

Time-sensitive networking over metropolitan area networks for remote industrial control 21

Time-sensitive networking over metropolitan area networks fo...

引用

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

作者： Simon Tschöke Frederic Lynker Hauke Buhr Florian Schreiner Alexander Willner Axel Vick Moritz Chemnitz German Edge Cloud Eschborn Germany Software-based Networks Fraunhofer FOKUS Berlin Germany Automation & Robotics Fraunhofer IPK Berlin Germany

ISBN: (纸本)9781665433266

The benefits of the currently evolving IEEE Time-Sensitive Networking (TSN) standard have already been globally recognized. Whereas the application of TSN in a LAN is currently widely and globally tested, TSN in a Metropolitan Area Network (MAN) has not been a major focus until now. The possible benefits of utilizing co-located Edge Clouds in order to support multiple urban production sites with industrial realtime applications open a wide range of new business models. Therefore, we have analyzed the feasibility of transparently using PROFINET over TSN via a Dense Wavelength Division Multiplex (DWDM) link, where a machine park is controlled remotely by an Edge-based virtual Programmable Logic Controller (vPLC). As a result, we are able to setup a TSN connection over a MAN with a one-way delay of about 156.5 μs and a jitter of about 12 ns. This work can be extended to allow for dynamically provisioned TSN flows and multi-path Frame Replication and Elimination (FRER) for distributed hard real-time machine control and adoption to Ultra-Reliable Low-Latency Communication (URLLC) 5G campus networks.

关键词： gPTP IoT vPLC PTP 5G MAN URLLC TSN IIoT edge computing PLC Industry 4.0

来源：评论

学校读者我要写书评

暂无评论

On the Parallels between Paxos and Raft, and how to Port Optimizations 19

On the Parallels between Paxos and Raft, and how to Port Opt...

引用

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

作者： Wang, Zhaoguo Zhao, Changgeng Mu, Shuai Chen, Haibo Li, Jinyang Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Peoples R China NYU Dept Comp Sci New York NY 10003 USA SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

ISBN: (纸本)9781450362177

In recent years, Raft has surpassed Paxos to become the more popular consensus protocol in the industry. While many researchers have observed the similarities between the two protocols, no one has shown how Raft and Paxos are formally related to each other. In this paper, we present a formal mapping between Raft and Paxos, and use this knowledge to port a certain class of optimizations from Paxos to Raft. In particular, our porting method can automatically generate an optimized protocol specification with guaranteed correctness. As case studies, we port and evaluate two optimizations, Mencius and Paxos Quorum Lease to Raft.

关键词： Paxos Raft optimization porting

来源：评论

学校读者我要写书评

暂无评论

Parallel simulation of stochastic reward nets using theatre 21

Parallel simulation of stochastic reward nets using theatre

引用

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

作者： Franco Cicirelli Libero Nigro CNR - National Research Council of Italy Italy University of Calabria 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.

关键词： theatre Java stochastic reward nets actors high-performance computing performability analysis

来源：评论

学校读者我要写书评

暂无评论

Breaking Master-Slave Model between Host and FPGAs 20

Breaking Master-Slave Model between Host and FPGAs

引用

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

作者： Bosch, Jaume Vidal, Miquel Filgueras, Antonio Alvarez, Carlos Jimenez-Gonzalez, Daniel Martorell, Xavier Ayguade, Eduard Barcelona Supercomp Ctr Barcelona Spain Univ Politecn Cataluna Barcelona Spain

ISBN: (纸本)9781450368186

This paper proposes to enhance current task-based programming models by breaking their current master-slave approach between the main processor and its hardware accelerators. As a proof-of-concept, it presents an extension of the OmpSs@FPGA toolchain that allows the tasks offloaded into the FPGA to create and synchronize nested tasks on their own without involving the host. Those FPGA spawned tasks may target the host to execute code not suitable for the FPGA, like system calls or I/O operations;or target other kernel accelerators inside the same FPGA. In addition to the programmability benefits of this new feature, the proposed system presents significant performance improvements and a better productivity over the classical master-slave approach.

关键词： Task-Based Parallelism Heterogeneous computing FPGA Runtime OmpSs OpenMP

来源：评论

学校读者我要写书评

暂无评论

A distributed hypervisor for resource aggregation 24

A distributed hypervisor for resource aggregation

引用

24th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2019

作者： Chen, Yubin Ding, Zhuocheng Zhang, Jin Wang, Yun Qi, Zhengwei Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450362252

Scale-out has become the standard answer to data analysis, machine learning and many other fields. Contrary to common belief, scale-up machines can outperform scale-out clusters for a considerable portion of tasks. However, those scale-up machines are not economical and may not be affordable for small businesses. This paper presents GiantVM, a distributed hypervisor that aggregates resources from multiple physical machines, providing the guest OS with a uniform hardware abstraction. We propose techniques to deal with the challenges of CPU, Memory, and I/O virtualization in distributed environments. © 2019 Copyright held by the owner/author(s).

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

TiFL: A Tier-based Federated Learning System 20

TiFL: A Tier-based Federated Learning System

引用

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

作者： Chai, Zheng Ali, Ahsan Zawad, Syed Treux, Stacey Anwar, Ali Barcaldo, Nathalie Zhou, Yi Ludwig, Heiko Yan, Feng Cheng, Yue George Mason Univ Dept CS Fairfax VA 22030 USA Univ Nevada Dept CS Reno NV 89557 USA Georgia Inst Technol Dept CS Atlanta GA 30332 USA IBM Res Almaden San Jose CA 95120 USA

ISBN: (纸本)9781450370523

Federated Learning (FL) enables learning a shared model across many clients without violating the privacy requirements. One of the key attributes in FL is the heterogeneity that exists in both resource and data due to the differences in computation and communication capacity, as well as the quantity and content of data among different clients. We conduct a case study to show that heterogeneity in resource and data has a significant impact on training time and model accuracy in conventional FL systems. To this end, we propose TiFL, a Tier-based Federated Learning System, which divides clients into tiers based on their training performance and selects clients from the same tier in each training round to mitigate the straggler problem caused by heterogeneity in resource and data quantity. To further tame the heterogeneity caused by nonIID (Independent and Identical Distribution) data and resources, TiFL employs an adaptive tier selection approach to update the tiering on-the-fly based on the observed training performance and accuracy. We prototype TiFL in a FL testbed following Google's FL architecture and evaluate it using the state-of-the-art FL benchmarks. Experimental evaluation shows that TiFL outperforms the conventional FL in various heterogeneous conditions. With the proposed adaptive tier selection policy, we demonstrate that TiFL achieves much faster training performance while achieving the same or better test accuracy across the board.

关键词： federated learning stragglers resource heterogeneity data heterogeneity edge computing

来源：评论

学校读者我要写书评

暂无评论

A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence 20

A Unified Sparsification Approach for Matching Problems in G...

引用

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

作者： Milenkovic, Lazar Solomon, Shay Tel Aviv Univ Sch Elect Engn Tel Aviv Israel

ISBN: (纸本)9781450369350

The neighborhood independence number of a graph G, denoted by beta = beta(G), is the size of the largest independent set in the neighborhood of any vertex. Graphs with bounded neighborhood independence, already for constant beta, constitute a wide family of possibly dense graphs, including line graphs, unit-disk graphs, claw-free graphs and graphs of bounded growth, which has been well-studied in the area of distributed computing. In ICALP'19, Assadi and Solomon [8] showed that, for any n-vertex graph G, a maximal matching can be computed in O(n log n . beta) time in the classic sequential setting. This result shows that, surprisingly, for almost the entire regime of parameter beta, a maximal matching can be computed much faster than reading the entire input. The algorithm of [8], however, is inherently sequential and centralized. Moreover, a maximal matching provides a 2-approximate (maximum) matching, and the question of whether a better-than-2-approximate matching can be computed in sublinear time remained open. In this work we propose a unified and surprisingly simple approach for producing (1 + epsilon)-approximate matchings, for arbitrarily small epsilon > 0. Specifically, set Delta = O(beta/epsilon log 1/epsilon) and let G(Delta) be a random subgraph of G that includes, for each vertex v is an element of G, Delta random edges incident on it. We show that, with high probability, G(Delta) is a (1 + epsilon-matching sparsifier for G, i.e., the maximum matching size of G(Delta) is within a factor of 1 + epsilon from that of G. One can then work on the sparsifier G(Delta) rather than on the original graph G. Since G(Delta) can be implemented efficiently in various settings, this approach is of broad applicability;some concrete implications are: A (1 + epsilon)-approximate matching can be computed in the classic sequential setting in O(***/epsilon(2) . log 1/epsilon) time, shaving a log n factor from the runtime of [8] (for any constant c), and more importantly

关键词： distributed algorithm graph matching maximum matching neighborhood independence sublinear time sparsification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：