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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Portkey: Adaptive Key-Value Placement over Dynamic Edge Networks 12

Portkey: Adaptive Key-Value Placement over Dynamic Edge Netw...

引用

12th Annual acm symposium on Cloud computing (SoCC)

作者： Noor, Joseph Srivastava, Mani Netravali, Ravi Univ Calif Los Angeles Los Angeles CA 90095 USA Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450386388

Owing to a need for low latency data accesses, emerging IoT and mobile applications commonly require distributed data stores (e.g., key-value or KV stores) to operate entirely at the network's edge. Unfortunately, existing KV stores employ randomized data placement policies (e.g., consistent hashing) that ignore the client mobility and resulting variance in client-server latencies that are inherent to edge applications-the effect is largely suboptimal and inefficient data placement. We present Portkey, a distributed KV store that dynamically adapts data placement according to time-varying client mobility and data access patterns. The key insight with Portkey is to lean into the inherent mobility and prioritize rapid but approximate placement decisions over delayed optimal ones. Doing so enables the efficient tracking of client-server latencies despite edge resource constraints, and the use of greedy placement heuristics that are self-correcting over short time-scales. Results with a realistic autonomous vehicle dataset and two small-scale deployments reveal that Portkey reduces average and tail request latency by 21-82% and 26-77% compared to existing placement strategies.

关键词： distributed Data Edge computing Data Locality Mobility Data Migration Replica Assignment

来源：评论

学校读者我要写书评

暂无评论

Quasi-Linear Size PCPs with Small Soundness from HDX 25

Quasi-Linear Size PCPs with Small Soundness from HDX

引用

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

作者： Mitali Bafna Dor Minzer Nikhil Vyas Zhiwei Yun Massachusetts Institute of Technology Cambridge USA Harvard University Cambridge USA

ISBN: (纸本)9798400715105

We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with arbitrarily small constant soundness, improving upon Dinur’s 2-query quasi-linear size PCPs with soundness 1−Ω(1). As an immediate corollary, we get that under the exponential time hypothesis, for all >0 no approximation algorithm for 3-SAT can obtain an approximation ratio of 7/8+ in time 2n/logC n, where C is a constant depending on . Our result builds on a recent line of independent works by Bafna, Lifshitz and Minzer, and Dikstein, Dinur and Lubotzky, that showed the existence of linear size direct product testers with small *** main new ingredient in our proof is a technique that embeds a given 2-CSP into a 2-CSP on a prescribed graph, provided that the latter is a graph underlying a sufficiently good high-dimensional expander (HDX). We achieve this by establishing a novel connection between PCPs and fault-tolerant distributed computing, more precisely, to the almost-everywhere reliable transmission problem introduced by Dwork, Peleg, Pippenger and Upfal (1986). We instantiate this connection by showing that graphs underlying HDXs admit routing protocols that are tolerant to adversarial edge corruptions, also improving upon the state of the art constructions of sparse edge-fault-tolerant networks in the *** PCP construction requires variants of the aforementioned direct product testers with poly-logarithmic degree. The existence and constructability of these variants is shown in the full version.

关键词： Fault-tolerant distributed computing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up 25

Brief Announcement: Rise and Shine Efficiently! The Complexi...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Peter Robinson Ming Ming Tan Augusta University Augusta USA

ISBN: (纸本)9798400718854

We study the wake-up problem in distributed networks, where an adversary awakens a subset of nodes at arbitrary times, and the goal is to wake up all other nodes as quickly as possible by sending only few messages. We prove the following lower bounds:• We first consider the setting where each node receives advice from an oracle who can observe the entire network, but does not know which nodes are awake initially. More specifically, we consider the KT0 LOCAL model with advice, where the nodes have no prior knowledge of their neighbors. We prove that any randomized algorithm must send [EQUATION] messages if nodes receive only O (β) bits of advice on average.• For the KT1 assumption, where each node knows its neighbors' IDs from the start, we show that any (k + 1)-time algorithm requires Ω(n1+1/k) messages. Our result is the first super-linear (in n) lower bound, for a problem that does not require individual nodes to learn a large amount of information about the network topology, which may be of independent interest. This applies even to the synchronous KT1 LOCAL model, where the computation is structured into rounds and messages can be of unbounded *** complement our lower bound results, we present several new algorithms:• We give an asynchronous KT1 LOCAL algorithm that solves the wake-up problem with a time and message complexity of O (n log n) with high probability.• We introduce the notion of awake distance ρawk, which is upper-bounded by the network diameter, and present a synchronous KT1 LOCAL algorithm that takes O (ρawk) rounds and sends [EQUATION] messages with high probability.• We give deterministic advising schemes in the asynchronous KT0 CONGEST model (with advice). In particular, we obtain an O(ρawk log2 n)-time advising scheme that sends O(n log2 n) messages, while requiring O(log2 n) bits of advice per node.

关键词： distributed wake-up

来源：评论

学校读者我要写书评

暂无评论

Basil: Breaking up BFT with ACID (transactions) 21

Basil: Breaking up BFT with ACID (transactions)

引用

28th acm symposium on Operating Systems principles (SOSP)

作者： Suri-Payer, Florian Burke, Matthew Wang, Zheng Zhang, Yunhao Alvisi, Lorenzo Crooks, Natacha Cornell Univ Ithaca NY 14853 USA Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781450387095

This paper presents Basil, the first transactional, leaderless Byzantine Fault Tolerant key-value store. Basil leverages ACID transactions to scalably implement the abstraction of a trusted shared log in the presence of Byzantine actors. Unlike traditional BFT approaches, Basil executes non-conflicting operations in parallel and commits transactions in a single round-trip during fault-free executions. Basil improves throughput over traditional BFT systems by four to five times, and is only four times slower than TAPIR, a non-Byzantine replicated system. Basil's novel recovery mechanism further minimizes the impact of failures: with 30% Byzantine clients, throughput drops by less than 25% in the worst-case.

关键词： database systems Byzantine fault tolerance blockchains distributed systems

来源：评论

学校读者我要写书评

暂无评论

Determining Edge Node Real-Time Capabilities 25

Determining Edge Node Real-Time Capabilities

引用

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

作者： Gowtham, Varun Keil, Oliver Yeole, Aniket Schreiner, Florian Tschoeke, Simon Willner, Alexander Fraunhofer FOKUS Software Based Networks Berlin Germany German Edge Cloud Res Dept Eschborn Germany TU Berlin Fraunhofer FOKUS 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 real-time 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 (SLAB). 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 is 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.

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

来源：评论

学校读者我要写书评

暂无评论

AgileCtrl: A Self-Adaptive Framework for Configuration Tuning 2022

AgileCtrl: A Self-Adaptive Framework for Configuration Tunin...

引用

30th acm Joint European Software Engineering Conference / symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Wang, Shu Hoffmann, Henry Lu, Shan LinkedIn Sunnyvale CA 94085 USA Univ Chicago Chicago IL 60637 USA

ISBN: (纸本)9781450394130

Software systems increasingly expose performance-sensitive configuration parameters, or PerfConfs, to users. Unfortunately, the right settings of these PerfConfs are difficult to decide and often change at run time. To address this problem, prior research has proposed self-adaptive frameworks that automatically monitor the software's behavior and dynamically tune configurations to provide the desired performance despite dynamic changes. However, these frameworks often require configuration themselves;sometimes explicitly in the form of additional parameters, sometimes implicitly in the form of training. This paper proposes a new framework, AgileCtrl, that eliminates the need of configuration for a large family of control-based selfadaptive frameworks. AgileCtrl's key insight is to not just monitor the original software, but additionally to monitor its adaptations and reconfigure itself when its internal adaptation mechanisms are not meeting software requirements. We evaluate AgileCtrl by comparing against recent control-based approaches to self-adaptation that require user configuration. Across a number of case studies, we find AgileCtrl withstands model errors up to 10(6)x, saves the system from performance oscillation and crashes, and improves the performance up to 53%. It also auto-adjusts improper performance goals while improving the performance by 50%.

关键词： Software Configuration Performance distributed Systems Self-Adaptive Control

来源：评论

学校读者我要写书评

暂无评论

HiveMind: A Hardware-Software System Stack for Serverless Edge Swarms 22

HiveMind: A Hardware-Software System Stack for Serverless Ed...

引用

49th IEEE/acm Annual International symposium on Computer Architecture (ISCA)

作者： Patterson, Liam Pigorovsky, David Dempsey, Brian Lazarev, Nikita Shah, Aditya Steinhoff, Clara Bruno, Ariana Hu, Justin Delimitrou, Christina Cornell Univ Ithaca NY 14850 USA

ISBN: (纸本)9781450386104

Swarms of autonomous devices are increasing in ubiquity and size, making the need for rethinking their hardware-software system stack critical. We present HiveMind, the first swarm coordination platform that enables programmable execution of complex task workflows between cloud and edge resources in a performant and scalable manner. HiveMind is a software-hardware platform that includes a domain-specific language to simplify programmability of cloud-edge applications, a program synthesis tool to automatically explore task placement strategies, a centralized controller that leverages serverless computing to elastically scale cloud resources, and a reconfigurable hardware acceleration fabric for network and remote memory accesses. We design and build the full end-to-end HiveMind system on two real edge swarms comprised of drones and robotic cars. We quantify the opportunities and challenges serverless introduces to edge applications, as well as the trade-offs between centralized and distributed coordination. We show that HiveMind achieves significantly better performance predictability and battery efficiency compared to existing centralized and decentralized platforms, while also incurring lower network traffic. Using both real systems and a validated simulator we show that HiveMind can scale to thousands of edge devices without sacrificing performance or efficiency, demonstrating that centralized platforms can be both scalable and performant.

关键词： serverless edge swarms IoT cloud computing hardware acceleration domain specific language

来源：评论

学校读者我要写书评

暂无评论

On Scheduling Ring-All-Reduce Learning Jobs in Multi-Tenant GPU Clusters with Communication Contention 22

On Scheduling Ring-All-Reduce Learning Jobs in Multi-Tenant ...

引用

23rd International symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile computing (MobiHoc)

作者： Yu, Menglu Ji, Bo Rajan, Hridesh Liu, Jia Iowa State Univ Dept Comp Sci Ames IA 50011 USA Virginia Tech Dept Comp Sci Blacksburg VA USA Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA

ISBN: (纸本)9781450391658

Powered by advances in deep learning (DL) techniques, machine learning and artificial intelligence have achieved astonishing successes. However, the rapidly growing needs for DL also led to communication- and resource-intensive distributed training jobs for large-scale DL training, which are typically deployed over GPU clusters. To sustain the ever-increasing demand for DL training, the so-called "ring-all-reduce" (RAR) technologies have recently emerged as a favorable computing architecture to efficiently process network communication and computation load in GPU clusters. The most salient feature of RAR is that it removes the need for dedicated parameter servers, thus alleviating the potential communication bottleneck. However, when multiple RAR-based DL training jobs are deployed over GPU clusters, communication bottlenecks could still occur due to contentions between DL training jobs. So far, there remains a lack of theoretical understanding on how to design contention-aware resource scheduling algorithms for RAR-based DL training jobs, which motivates us to fill this gap in this work. Our main contributions are three-fold: i) We develop a new analytical model that characterizes both communication overhead related to the worker distribution of the job and communication contention related to the co-location of different jobs;ii) Based on the proposed analytical model, we formulate the problem as a non-convex integer program to minimize the makespan of all RAR-based DL training jobs. To address the unique structure in this problem that is not amenable for optimization algorithm design, we reformulate the problem into an integer linear program that enables provable approximation algorithm design called SJF-BCO (Smallest Job First with Balanced Contention and Overhead);and iii) We conduct extensive experiments to show the superiority of SJF-BCO over existing schedulers. Collectively, our results contribute to the state-of-the-art of distributed GPU system optimizatio

关键词： distributed machine learning systems communication contention resource scheduling algorithm design

来源：评论

学校读者我要写书评

暂无评论

HPDC 2021 - proceedings of the 30th International symposium on High-Performance Parallel and distributed computing

HPDC 2021 - Proceedings of the 30th International Symposium ...

引用

30th International symposium on High-Performance Parallel and distributed computing, HPDC 2021

ISBN: (纸本)9781450382175

The proceedings contain 25 papers. The topics discussed include: a serverless framework for distributed bulk metadata extraction;file system semantics requirements of HPC applications;DStore: a fast, tailless, and quiescent-free object store for PMEM;adaptive configuration of in situ lossy compression for cosmology simulations via fine-grained rate-quality modeling;ARC: an automated approach to resiliency for lossy compressed data via error correcting codes;MPI-CorrBench: towards an MPI correctness benchmark suite;cache-aware sparse patterns for the factorized sparse approximate inverse preconditioner;and AITurbo: unified compute allocation for partial predictable training in commodity clusters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed Weighted Min-Cut in Nearly-Optimal Time 2021

Distributed Weighted Min-Cut in Nearly-Optimal Time

引用

53rd Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Dory, Michal Efron, Yuval Mukhopadhyay, Sagnik Nanongkai, Danupon Swiss Fed Inst Technol Zurich Switzerland Univ Toronto Toronto ON Canada KTH Royal Inst Technol Stockholm Sweden Univ Copenhagen Copenhagen Denmark KTH Stockholm Sweden

ISBN: (纸本)9781450380539

Minimum-weight cut (min-cut) is a basic measure of a network's connectivity strength. While the min-cut can be computed efficiently in the sequential setting [Karger STOC'96], there was no efficient way for a distributed network to compute its own mincut without limiting the input structure or dropping the output quality: In the standard CONGEST model, existing algorithms with nearly-optimal time (e.g. [Ghaffari, Kuhn, DISC'13;Nanongkai, Su, DISC'14]) can guarantee a solution that is (1 + epsilon-approximation at best while the exact (O) over tilde (n(0.8)D(0.2 )+( )n(0.9))-time algorithm [Ghaffari, Nowicki, Thorup, SODA'20] works only on simple networks (no weights and no parallel edges). Here n and D denote the network's number of vertices and hop-diameter, respectively. For the weighted case, the best bound was (O) over tilde (n) [Daga, Henzinger, Nanongkai, Saranurak, STOC'19]. In this paper, we provide an exact (O) over tilde(root n. + D)-time algorithm for computing min-cut on weighted networks. Our result improves even the previous algorithm that works only on simple networks. Its time complexity matches the known lower bound up to polylogarithmic factors. At the heart of our algorithm are a routing trick and two structural lemmas regarding the structure of a minimum cut of a graph. These two structural lemmas considerably strengthen and generalize the framework of Mukhopadhyay-Nanongkai [STOC'20] and can be of independent interest.

关键词： CONGEST model Minimun-cut

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：