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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

372 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
106 篇 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...
42 篇 edge computing

机构

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,425 篇 英文
44 篇 其他
4 篇 中文

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

共 4473 条记录，以下是101-110 订阅

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

详细简洁

排序：

SGDRC: Software-Defined Dynamic Resource Control for Concurrent DNN Inference on NVIDIA GPUs 25

SGDRC: Software-Defined Dynamic Resource Control for Concurr...

引用

30th symposium on principles and Practice of Parallel Programming

作者： Zhang, Yongkang Yu, Haoxuan Han, Chenxia Wang, Cheng Lu, Baotong Li, Yunzhe Jiang, Zhifeng Li, Yang Chu, Xiaowen Li, Huaicheng HKUST Hong Kong Peoples R China CUHK Hong Kong Peoples R China Alibaba Grp Shenzhen Peoples R China Microsoft Res Beijing Peoples R China Shanghai Jiao Tong Univ Shanghai Peoples R China China Univ Geosci Wuhan Peoples R China HKUST Guangzhou Guangzhou Peoples R China Virginia Tech Blacksburg VA USA

ISBN: (纸本)9798400714436

Cloud service providers heavily colocate high-priority, latency-sensitive (LS), and low-priority, best-effort (BE) DNN inference services on the same GPU to improve resource utilization in data centers. Among the critical shared GPU resources, there has been very limited analysis on the dynamic allocation of compute units and VRAM bandwidth, mainly for two reasons: (1) The native GPU resource management solutions are either hardware-specific, or unable to dynamically allocate resources to different tenants, or both;(2) NVIDIA doesn't expose interfaces for VRAM bandwidth allocation, and the software stack and VRAM channel architectures are black-box, both of which limit the software-level resource management. These drive prior work to design either conservative sharing policies detrimental to throughput, or static resource partitioning only applicable to a few GPU models. To bridge this gap, this paper proposes SGDRC, a fully software-defined dynamic VRAM bandwidth and compute unit management solution for concurrent DNN inference services. SGDRC aims at guaranteeing service quality, maximizing the overall throughput, and providing general applicability to NVIDIA GPUs. SGDRC first reveals a general VRAM channel hash mapping architecture of NVIDIA GPUs through comprehensive reverse engineering and eliminates VRAM channel conflicts using software-level cache coloring. SGDRC applies bimodal tensors and tidal SM masking to dynamically allocate VRAM bandwidth and compute units, and guides the allocation of resources based on offline profiling. We evaluate 11 mainstream DNNs with real-world workloads on two NVIDIA GPUs. The results show that compared with the state-of-the-art GPU sharing solutions, SGDRC achieves the highest SLO attainment rates (99.0% on average), and improves overall throughput by up to 1.47x and BE job throughput by up to 2.36x.

关键词： Cloud computing GPU Virtualization

来源：评论

学校读者我要写书评

暂无评论

Improving the Bit Complexity of Communication for distributed Convex Optimization 2024

Improving the Bit Complexity of Communication for Distribute...

引用

56th Annual acm symposium on Theory of computing (STOC)

作者： Ghadiri, Mehrdad Lee, Yin Tat Padmanabhan, Swati Swartworth, William Woodru, David P. Ye, Guanghao MIT Cambridge MA 02139 USA Univ Washington Seattle WA USA Microsoft Res Redmond WA USA Carnegie Mellon Univ Pittsburgh PA USA

ISBN: (纸本)9798400703836

We consider the communication complexity of some fundamental convex optimization problems in the point-to-point (coordinator) and blackboard communication models. We strengthen known bounds for approximately solving linear regression, p -norm regression (for 1 <= p <= 2), linear programming, minimizing the sum of finitely many convex nonsmooth functions with varying supports, and low rank approximation;for a number of these fundamental problems our bounds are optimal, as proven by our lower bounds. For example, for solving least squares regression in the coordinator model with B servers, n examples, d dimensions, and coefficients specified using at most L bits, we improve the prior communication bound of Vempala, Wang, and Woodruff (SODA, 2020) from (O) over tilde (sd(2)L) to (O) over tilde (sdL + d(2)epsilon L-1), which is optimal up to logarithmic factors. We also study the problem of solving least squares regression in the coordinator model to high accuracy, for which we provide an algorithm with a communication complexity of (O) over tilde (sd(L + log k) log (epsilon(-1)) + d(2)L), matching our improved lower bound for well-conditioned matrices up to a log (epsilon(-1)) factor. Among our techniques, we use the notion of block leverage scores, which have been relatively unexplored in this context, as well as dropping all but the "middle" bits in Richardson-style algorithms. We also introduce a new communication problem for accurately approximating inner products and establish a lower bound using the spherical Radon transform. Our lower bound can be used to show the first separation of linear programming and linear systems in the distributed model when the number of constraints is polynomial, addressing an open question in prior work.

关键词： bit complexity communication complexity distributed optimization convex optimization

来源：评论

学校读者我要写书评

暂无评论

distributed CONGEST Algorithms against Mobile Adversaries 23

Distributed CONGEST Algorithms against Mobile Adversaries

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Fischer, Orr Parter, Merav Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9798400701214

In their seminal PODC 1991 paper, Ostrovsky and Yung introduced the study of distributed computation in the presence of mobile adversaries which can dynamically appear throughout the network, analogous to a spread of a virus. Over the years, this setting has been studied mostly under the assumption that the communication graph is fully-connected. Resilient CONGEST algorithms for general graphs, on the other hand, are currently known only for the classical static setting, i.e., where the set of corrupted edges (or nodes) is fixed throughout the entire computation. We fill this missing gap by providing round-efficient simulations that translate given CONGEST algorithms into equivalent algorithms that are resilient against f-mobile edge adversaries, i.e., where the adversary controls a (possibly distinct) subset of f edges F-i in each round i. Our main results are: center dot Perfect-Security with Mobile Eavesdroppers. A translation of any r-round f-static-secure algorithm into an equivalent Theta(f)-mobile-secure algorithm with Theta(y) rounds. We also show that the f-static-secure algorithms of [Hitron, Parter and Yogev, DISC 2022 & ITCS 2023] can be modified into f-mobile-secure algorithms with the same number of rounds. center dot Resilience with Mobile Byzantine Adversaries. An f-mobile-byzantine simulation which is based on a decomposition of the graph into low-diameter edge-disjoint spanning trees. This provides us with near-optimal CONGEST compilers for expander graphs. It also leads to near-optimal compilers in the congested-clique model against Theta(n)-mobile adversaries. For general (2f + 1) edge-connected graphs with f-mobile adversary, we almost match the bounds known for the f-static setting, when provided a trusted pre-processing phase. Our results are based on a collection of tools borrowed from the area of interactive coding [Gelles, Found. Trends Theor. Comput. Sci. 2017], linear sketches and low-congestion graph decomposition. The introduced toolkit

关键词： CONGEST Fault Tolerance Interactive Coding

来源：评论

学校读者我要写书评

暂无评论

TEACHING Platform for Human-Centric Autonomous Applications: Design and Overview 24

TEACHING Platform for Human-Centric Autonomous Applications:...

引用

33rd International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： De Caro, Valerio Chronis, Christos Coppola, Massimo Lomonaco, Vincenzo Gallicchio, Claudio Tserpes, Konstantinos Bacciu, Davide Univ Pisa Dept Comp Sci Pisa Italy Harokopio Univ Athens Dept Informat & Telemat Athens Greece CNR Informat Sci & Technol Inst Pisa Italy

ISBN: (纸本)9798400704130

The TEACHING project enhances AI applications in pervasive environments via Humanistic Intelligence, fostering synergy between humans and Cyber-Physical Systems of Systems (CPSoS). Here, we present the TEACHING Platform, a microservice-based framework providing the technological advancements to represent humans and CPSoS as containerized software models that interact to mutually empower each other.

关键词： Human-centered computing Artificial Intelligence Software

来源：评论

学校读者我要写书评

暂无评论

CHIME: A Cache-Efficient and High-Performance Hybrid Index on Disaggregated Memory 24

CHIME: A Cache-Efficient and High-Performance Hybrid Index o...

引用

30th acm symposium on Operating Systems principles, SOSP 2024

作者： Luo, Xuchuan Shen, Jiacheng Zuo, Pengfei Wang, Xin Lyu, Michael R. Zhou, Yangfan National Key Laboratory of Parallel and Distributed Computing Changsha China School of Computer Science Fudan University Shanghai China Duke Kunshan University Kunshan China Huawei Cloud Shenzhen China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China The Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9798400712517

Disaggregated memory (DM) is a widely discussed datacenter architecture in academia and industry. It decouples computing and memory resources from monolithic servers into two network-connected resource pools. Range indexes are widely adopted by storage systems on DM to efficiently locate and query remote data. However, existing range indexes on DM suffer from either high computing-side cache consumption or high memory-side read amplifications. In this paper, we propose CHIME, a hybrid index combining B+ trees with hopscotch hashing, to achieve low cache consumption and low read amplifications simultaneously. There are three challenges in constructing CHIME on DM, i.e., the complicated optimistic synchronization, the extra metadata access, and the read amplifications introduced by hopscotch hashing. CHIME leverages 1) a three-level optimistic synchronization scheme to synchronize read and write operations with various granularities, 2) an access-aggregated metadata management technique to eliminate extra metadata accesses by piggybacking and replicating metadata, and 3) an effective hotness-aware speculative read mechanism to mitigate the read amplifications of hopscotch hashing. Experimental results show that CHIME outperforms the state-of-the-art range indexes on DM by up to 5.1× with the same cache size and achieves similar performance with up to 8.7× lower cache consumption. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

distributed Logical Timestamp Allocation for DBMS Concurrency Control on Many-core Machines 23

Distributed Logical Timestamp Allocation for DBMS Concurrenc...

引用

32nd International symposium on High-Performance Parallel and distributed computing (HPDC) part of the acm Federated computing Research Conference (FCRC)

作者： Zhang, Qingsheng Liang, Chen Xian Univ Posts & Telecommun Comp Sch Xian Shaanxi Peoples R China

ISBN: (纸本)9798400701559

We investigate the timestamp allocation scheme in classical concurrency controls of the database management systems (DBMS) on many-core machines. Then we discuss a distributed logical timestamp allocation scheme with uniqueness and fairness to improve the performance of DBMS concurrency control algorithms on many-core machines. Further, the proposed logical timestamp generator is free of bottlenecks such as accessing the system clock counter, calling for atomic add operation, and synchronization. Finally, we experiment with an optimistic concurrency control algorithm based on the proposed and other allocation schemes. The results show that the performance of an optimistic concurrency control algorithm based on the proposed timestamp allocation outperforms one based on other allocations. Furthermore, it has better linear scalability under heavy loads.

关键词： timestamp allocation concurrency control many-core machines

来源：评论

学校读者我要写书评

暂无评论

Grove: a Separation-Logic Library for Verifying distributed Systems 23

Grove: a Separation-Logic Library for Verifying Distributed ...

引用

29th acm symposium on Operating Systems principles (SOSP)

作者： Sharma, Upamanyu Jung, Ralf Tassarotti, Joseph Kaashoek, M. Frans Zeldovich, Nickolai MIT CSAIL Cambridge MA 02139 USA Swiss Fed Inst Technol Zurich Switzerland New York Univ New York NY USA

ISBN: (纸本)9798400702297

Grove is a concurrent separation logic library for verifying distributed systems. Grove is the first to handle time-based leases, including their interaction with reconfiguration, crash recovery, thread-level concurrency, and unreliable networks. This paper uses Grove to verify several distributed system components written in Go, including vKV, a realistic distributed multi-threaded key-value store. vKV supports reconfiguration, primary/backup replication, and crash recovery, and uses leases to execute read-only requests on any replica. vKV achieves high performance (67-73% of Redis on a single core), scales with more cores and more backup replicas (achieving about 2x the throughput when going from 1 to 3 servers), and can safely execute reads while reconfiguring.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

FileScale: Fast and Elastic Metadata Management for distributed File Systems 14

FileScale: Fast and Elastic Metadata Management for Distribu...

引用

14th Annual acm symposium on Cloud computing (SoCC)

作者： Liao, Gang Abadi, Daniel J. ByteDance Infrastruct Syst Lab San Jose CA 95050 USA Univ Maryland College Pk MD USA

ISBN: (纸本)9798400703874

File systems that store metadata on a single machine or via a shared-disk abstraction face scalability challenges, especially in contexts demanding the management of billions of files. Recent work has shown that employing shared-nothing, distributed database system (DDBMS) for metadata storage can alleviate these scalability challenges without compromising on high availability guarantees. However, for low-scale deployments - where metadata can fit in memory on a single machine - these DDBMS-based systems typically perform an order of magnitude worse than systems that store metadata in memory on a single machine. This has limited the impact of these distributed database approaches, since they are only currently applicable to file systems of extreme scale. This paper describes FileScale, a three-tier architecture that incorporates a DDBMS as part of a comprehensive approach to file system metadata management. In contrast to previous approaches, FileScale performs comparably to the single-machine architecture at a small scale, while enabling linear scalability as the file system metadata increases1.

关键词： distributed File System Metadata Management Elastic computing distributed Database

来源：评论

学校读者我要写书评

暂无评论

distributed Model Checking on Graphs of Bounded Treedepth 38

Distributed Model Checking on Graphs of Bounded Treedepth

引用

38th International symposium on distributed computing, DISC 2024

作者： Fomin, Fedor V. Fraigniaud, Pierre Montealegre, Pedro Rapaport, Ivan Todinca, Ioan University of Bergen Norway IRIF Université Paris Cité CNRS Paris France Universidad Adolfo Ibañez Santiago Chile Universidad de Chile Santiago Chile LIFO Université d’Orléans France INSA Centre-Val de Loire Orléans France

ISBN: (纸本)9783959773522

We establish that every monadic second-order logic (MSO) formula on graphs with bounded treedepth is decidable in a constant number of rounds within the CONGEST model. To our knowledge, this marks the first meta-theorem regarding distributed model-checking. Various optimization problems on graphs are expressible in MSO. Examples include determining whether a graph G has a clique of size k, whether it admits a coloring with k colors, whether it contains a graph H as a subgraph or minor, or whether terminal vertices in G could be connected via vertex-disjoint paths. Our meta-theorem significantly enhances the work of Bousquet et al. [PODC 2022], which was focused on distributed certification of MSO on graphs with bounded treedepth. Moreover, our results can be extended to solving optimization and counting problems expressible in MSO, in graphs of bounded treedepth. © Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, and Ioan Todinca.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Fault-Tolerant distributed Proper Coloring of Graphs 38

Asynchronous Fault-Tolerant Distributed Proper Coloring of G...

引用

38th International symposium on distributed computing, DISC 2024

作者： Balliu, Alkida Fraigniaud, Pierre Lambein-Monette, Patrick Olivetti, Dennis Rabie, Mikaël Gran Sasso Science Institute L’Aquila Italy IRIF CNRS Univ. Paris Cité France IRIF Université Paris Cité France

ISBN: (纸本)9783959773522

We revisit asynchronous computing in networks of crash-prone processes, under the asynchronous variant of the standard LOCAL model, recently introduced by Fraigniaud et al. [DISC 2022]. We focus on the vertex coloring problem, and our contributions concern both lower and upper bounds for this problem. On the upper bound side, we design an algorithm tolerating an arbitrarily large number of crash failures that computes an O(∆2)-coloring of any n-node graph of maximum degree ∆, in O(log★ n) rounds. This extends Linial’s seminal result from the (synchronous failure-free) LOCAL model to its asynchronous crash-prone variant. Then, by allowing a dependency on ∆ on the runtime, we show that we can reduce the colors to (12 (∆ + 1)(∆ + 2) - 1). For cycles (i.e., for ∆ = 2), our algorithm achieves a 5-coloring of any n-node cycle, in O(log★ n) rounds. This improves the known 6-coloring algorithm by Fraigniaud et al., and fixes a bug in their algorithm, which was erroneously claimed to produce a 5-coloring. On the lower bound side, we show that, for k © Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, and Mikaël Rabie.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：