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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU 24

PowerInfer: Fast Large Language Model Serving with a Consume...

引用

30th acm symposium on Operating Systems principles, SOSP 2024

作者： Song, Yixin Mi, Zeyu Xie, Haotong Chen, Haibo Institute of Parallel and Distributed Systems Seiee Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9798400712517

This paper introduces PowerInfer, a high-speed Large Language Model (LLM) inference engine on a personal computer (PC) equipped with a single consumer-grade GPU. The key principle underlying the design of PowerInfer is exploiting the high locality inherent in LLM inference, characterized by a power-law distribution in neuron activation. This distribution indicates that a small subset of neurons, termed hot neurons, are consistently activated across inputs, while the majority, cold neurons, vary based on specific inputs. PowerInfer exploits such an insight to design a GPU-CPU hybrid inference engine: hot-activated neurons are preloaded onto the GPU for fast access, while cold-activated neurons are computed on the CPU, thus significantly reducing GPU memory demands and CPU-GPU data transfers. PowerInfer further integrates adaptive predictors and neuron-aware sparse operators, optimizing the efficiency of neuron activation and computational sparsity. The evaluation shows that PowerInfer significantly outperforms *** by up to 11.69× while retaining model accuracy across various LLMs (including OPT-175B) on a single NVIDIA RTX 4090 GPU. For the OPT-30B model, PowerInfer achieves performance comparable to that of a high-end server-grade A100 GPU, reaching 82% of its token generation rate on a single consumer-grade RTX 4090 GPU. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

Reducing carbon emissions of distributed systems: a multi-objective approach 24

Reducing carbon emissions of distributed systems: a multi-ob...

引用

20th Brazilian symposium on Informations Systems (SBSI) - Perspectives and Trends in Information Systems in Digital Agriculture

作者： Almeida, Guilherme do O, Marcelo T. Francesquini, Emilio Cordeiro, Daniel Univ Sao Paulo Escola Artes Ciencias & Humanidades Sao Paulo SP Brazil Univ Fed ABC Ctr Matemat Comp & Cognicao Santo Andre SP Brazil

ISBN: (纸本)9798400709968

Context The growing usage of platforms for distributed computing and their workloads are requiring more energy to power data centers, and the current consumption is already high. The increasing availability of green energy sources brings opportunities to reduce carbon emissions. Problem It is hard to create software aiming for both performance (makespan) and low brown energy usage. To reduce carbon emissions on distributed platforms, developers need an easy way to program efficiently applications and achieve these objectives. Solution Using OpenMP is an easy way to create and run distributed applications. This paper proposes the use of OpenMP with a new energy-aware scheduling algorithm that aims to minimize brown energy consumption and makespan. IS theory Our multiobjective algorithm (G-MOHEFT) deals with Complexity theory to leverage the Dynamic capabilities of modern distributed platforms. The algorithm implements a heuristic for adapting and redistributing workloads accordingly to different scenarios. Method Containers were used to simulate a distributed OpenMP Cluster (OMPC) platform. Different simulations using previously measured data were used to distribute workloads in different combinations of green energy availability. Summary of Results We study the solution tradeoffs obtained using G-MOHEFT, which varies from saving none to some brown energy consumption by keeping the same or increasing the makespan in exchange. Depending on the scenario, it could even reduce the brown energy consumption to zero. Contributions and impacts to IS Developers can use our algorithm to easily develop distributed software with a reduced carbon footprint using OpenMP in OMPC.

关键词： Tasks scheduling Green energy distributed computing Parallel computing OpenMP

来源：评论

学校读者我要写书评

暂无评论

Improving Network Resource Utilization for distributed Wireless Sensing Applications 24

Improving Network Resource Utilization for Distributed Wirel...

引用

2024 International symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile computing, MobiHoc 2024

作者： Gayen, Snehadeep Shankar, Yamini Chakraborty, Ayon SENSE Lab IIT Madras India

ISBN: (纸本)9798400705212

Edge-assisted wireless sensing is increasingly popular, where complex neural network models perform inference tasks on wireless channel state information (CSI) data streamed from IoT devices. However large volumes of CSI data sent across the network for inference can significantly impact network bandwidth and reduce the Quality of Experience. This paper tackles the challenge of optimizing network resource utilization in wireless sensing systems by compressing and subsampling CSI streams. We evaluate methods that quantize and selectively subsample CSI data before transmission to the edge server, which is then fed to the inference models. Such approach reduces bandwidth and computational load, improving data transmission and processing efficiency. Experiments conducted in two real testbeds (indoors as well as outdoors) show how CSI compression preserves sensing information integrity while enhancing system performance in terms of latency, energy efficiency, and throughput. By integrating quantization and subsampling with edge computing, this work enhances wireless sensing systems, making them more scalable and efficient in utilizing network resources. © 2024 Copyright held by the owner/author(s).

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Integrating Parallel, Tensor-Based computing in Agent-Based Simulators 27

Integrating Parallel, Tensor-Based Computing in Agent-Based ...

引用

27th IEEE/acm International symposium on distributed Simulation and Real Time Applications, DS-RT 2023

作者： Sgouros, Nikitas M. University of Piraeus Department of Digital Systems Piraeus Greece

ISBN: (纸本)9798350337846

The rise of deep learning methods has ignited interest in efficient hardware and software systems for tensor-based computing. A question worth investigating is whether other areas in computing can benefit as well from the power and increasing availability of such systems. To this end, we study the integration of tensor-based techniques in agent-based simulators. In particular, we describe methods for the representation as vectors of agent and edge attributes in agent networks and the compilation of rules governing agent behavior and their edge-based interactions into functions that can process and compute such attribute vectors in parallel. We describe a proof of concept implementation of such an idea in Politika, our Elixir-based web framework for concurrent, agent-based simulation. We discuss various simulation scenarios for our implementation and provide directions for future optimizations and integration pathways with concurrent simulation environments. © 2023 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

DAG Scheduling for Clustered Many-Core Processor Considering Execution-Time-Reduction Effectiveness 27

DAG Scheduling for Clustered Many-Core Processor Considering...

引用

27th IEEE/acm International symposium on distributed Simulation and Real Time Applications, DS-RT 2023

作者： Nozaki, Yutaro Azumi, Takuya Graduate School of Science and Engineering Saitama University Japan

ISBN: (纸本)9798350337846

In recent years, there has been a surge in research on autonomous systems such as unmanned aerial vehicles and autonomous-driving systems. These systems require high computing power with low power consumption and strict real-time requirements. Correspondingly, clustered many-core processors are attracting attention as a solution to these requirements. In this study, we propose a core allocation method for DAG scheduling using clustered many-core processors. Specifically, we propose two methods for selecting nodes to be allocated based on the execution-time-reduction effectiveness, assuming that each node in the DAG can perform intra-node processing in parallel. In addition, we compared the response times obtained from scheduling using each of the two methods to determine which method is superior. © 2023 IEEE.

关键词： computing power

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults 21

Brief Announcement: Making Synchronous BFT Protocols Secure ...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Kim, Justin Mehta, Vandan Nayak, Kartik Shrestha, Nibesh Montgomery High Sch Santa Rosa CA 95405 USA Rutgers State Univ New Brunswick NJ USA Duke Univ Durham NC 27706 USA Rochester Inst Technol Rochester NY 14623 USA

ISBN: (纸本)9781450385480

BFT protocols in the synchronous setting rely on a strong assumption: every message sent by a party will arrive at its destination within a known bounded time. To allow some degree of asynchrony while still tolerating a minority corruption, recently, in Crypto'19, a weaker synchrony assumption called mobile sluggish faults was introduced. In this work, we investigate the support for mobile sluggish faults in existing synchronous protocols such as Dfinity, Streamlet, Sync HotStuff, OptSync and the optimal latency BFT protocol. We identify key principles that can be used to "compile" these synchronous protocols to tolerate mobile sluggish faults.

关键词： distributed computing Byzantine Fault Tolerance Weak Synchrony

来源：评论

学校读者我要写书评

暂无评论

Local distributed Rounding Generalized to MIS, Matching, Set Cover, and Beyond 34

Local Distributed Rounding Generalized to MIS, Matching, Set...

引用

34th acm-SIAM Annual symposium on Discrete Algorithms (SODA)

作者： Faour, Salwa Ghaffari, Mohsen Grunau, Christoph Kuhn, Fabian Rozhon, Vaclav Univ Freiburg Freiburg Germany MIT Cambridge MA USA Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781611977554

We develop a general deterministic distributed method for locally rounding fractional solutions of graph problems for which the analysis can be broken down into analyzing pairs of vertices. Roughly speaking, the method can transform fractional/probabilistic label assignments of the vertices into integral/deterministic label assignments for the vertices, while approximately preserving a potential function that is a linear combination of functions, each of which depends on at most two vertices (subject to some conditions usually satisfied in pairwise analyses). The method unifies and significantly generalizes prior work on deterministic local rounding techniques [Ghaffari, Kuhn FOCS'21;Harris FOCS'19;Fischer, Ghaffari, Kuhn FOCS'17;Fischer DISC'17] to obtain polylogarithmic-time deterministic distributed solutions for combinatorial graph problems. Our general rounding result enables us to locally and efficiently derandomize a range of distributed algorithms for local graph problems, including maximal independent set (MIS), maximum-weight independent set approximation, and minimum-cost set cover approximation. As highlights, we in particular obtain the following results. We obtain a deterministic O(log(2)Delta center dot log n)-round algorithm for computing an MIS in the LOCAL model and an almost as efficient O(log(2)Delta center dot log log Delta center dot log n)-round deterministic MIS algorithm in the CONGEST model. As a result, the best known deterministic distributed time complexity of the four most widely studied distributed symmetry breaking problems (MIS, maximal matching, (Delta + 1)-vertex coloring, and (2 Delta - 1)-edge coloring) is now O(log(2)Delta center dot log n). Our new MIS algorithm is also the first direct polylogarithmic-time deterministic distributed MIS algorithm, which is not based on network decomposition. We obtain efficient deterministic distributed algorithms for rounding fractional solutions for maximum (weighted) independent set and mini

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Differentially Private distributed Online Convex Optimization Towards Low Regret and Communication Cost 23

Differentially Private Distributed Online Convex Optimizatio...

引用

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

作者： Liu, Jiandong Zhang, Lan Yu, Xiaojing Li, Xiang-Yang Univ Sci & Technol China Hefei Peoples R China

ISBN: (纸本)9781450399265

distributed online convex optimization (DOCO) has emerged as a promising approach in scenarios where multiple learners collaboratively serve sequential (possibly untrusted) clients using AI models. However, ensuring clients' privacy and minimizing regret while keeping the communication cost reasonable poses a significant challenge. To address this issue, we propose private DOCO algorithms, termed PDOM, for both oblivious and stochastic settings. Our approach involves a mini-batch strategy that optimally balances the effects of slower model updates and differential privacy (DP) perturbation. Our theoretical analysis shows that compared to state-of-the-art algorithms, PDOM reduces the regret bounds and communication cost by an O(d/epsilon) factor for the oblivious setting. For the stochastic setting, the impact of DP perturbation becomes negligible if the learning time T = Omega(d(4)/(n epsilon(4))) provided that the loss functions are Lipschitz, convex, and smooth, where d is the model dimension, n is the number of learners, and epsilon is the privacy budget. Our evaluations validate these results, demonstrating that PDOM can reduce classification error rates of the state-of-the-art methods by up to 20% in distributed online logistic regression tasks while achieving communication savings of above 90%.

关键词： distributed online convex optimization differential privacy

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes 21

Brief Announcement: Variants of Approximate Agreement on Gra...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Ledent, Jeremy Univ Strathclyde MSP Grp Glasgow Lanark Scotland

ISBN: (纸本)9781450385480

Approximate agreement is a weaker version of consensus where two or more processes must agree on a real number within a distance e of each other. Many variants of this task have been considered in the literature: continuous or discrete ones;multi-dimensional ones;as well as agreement on graphs and other spaces. We focus on two variants of approximate agreement on graphs, edge agreement and clique agreement. We show that both tasks arise as special cases of a more general, higher-dimensional, approximate agreement task, where the processes must agree on the vertices of a simplex in a given simplicial complex. This new point of view gives rise to a novel topological perspective on the solvability of clique agreement.

关键词： distributed computing approximate agreement simplicial complex

来源：评论

学校读者我要写书评

暂无评论

Quantum Communication Advantage for Leader Election and Agreement 25

Quantum Communication Advantage for Leader Election and Agre...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Fabien Dufoulon Frédéric Magniez Gopal Pandurangan School of Computing and Communications Lancaster University Lancaster United Kingdom Université Paris Cité CNRS IRIF Paris France Department of Computer Science University of Houston Houston Texas USA

ISBN: (纸本)9798400718854

This work focuses on understanding the quantum message complexity of two central problems in distributed computing, namely, leader election and agreement in synchronous message-passing communication networks. We show that quantum communication gives an advantage for both problems by presenting quantum distributed algorithms that significantly outperform their respective classical counterparts under various network *** prior works have studied and analyzed quantum distributed algorithms in the context of (improving) round complexity, a key conceptual contribution of our work is positing a framework to design and analyze the message complexity of quantum distributed algorithms. We present and demonstrate how quantum algorithmic techniques, such as Grover search, quantum counting, and quantum walks, can significantly enhance the message efficiency of distributed *** particular, our leader election protocol for diameter-2 networks uses quantum walks to achieve the improved message complexity. To the best of our knowledge, this is the first such application of quantum walks in distributed computing.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：