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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

175 篇 会议
32 篇 期刊文献

馆藏范围

207 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

181 篇 工学
- 155 篇 计算机科学与技术...
- 142 篇 软件工程
- 10 篇 电子科学与技术（可...
- 7 篇 信息与通信工程
- 6 篇 生物工程
- 4 篇 控制科学与工程
- 2 篇 机械工程
- 2 篇 电气工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
39 篇 理学
- 36 篇 数学
- 6 篇 生物学
- 4 篇 统计学（可授理学、...
- 2 篇 系统科学
- 1 篇 化学
7 篇 管理学
- 5 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
2 篇 法学
- 2 篇 社会学
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学

主题

39 篇 performance
28 篇 parallel process...
21 篇 languages
20 篇 design
19 篇 algorithms
14 篇 gpu
13 篇 parallel program...
9 篇 parallel algorit...
8 篇 parallel computi...
8 篇 high performance...
7 篇 experimentation
7 篇 measurement
6 篇 reliability
6 篇 graphics process...
5 篇 mpi
5 篇 machine learning
5 篇 distributed comp...
5 篇 cloud computing
4 篇 graph algorithms
4 篇 concurrent data ...

机构

4 篇 georgia inst tec...
4 篇 carnegie mellon ...
3 篇 univ chinese aca...
3 篇 state key labora...
3 篇 n carolina state...
2 篇 louisiana tech u...
2 篇 department of co...
2 篇 univ wisconsin d...
2 篇 microsoft corp r...
2 篇 shanghai key lab...
2 篇 oak ridge natl l...
2 篇 tsinghua univ de...
2 篇 kyoto univ grad ...
2 篇 massachusetts in...
2 篇 technion haifa
2 篇 indiana univ blo...
2 篇 washington univ ...
2 篇 univ alberta dep...
2 篇 ohio state univ ...
2 篇 iit madras

作者

4 篇 mueller frank
4 篇 tan guangming
4 篇 shun julian
3 篇 hoefler torsten
3 篇 blelloch guy e.
3 篇 bader david a.
3 篇 vandierendonck h...
3 篇 zhang yunquan
3 篇 ostrouchov georg...
3 篇 wang zheng
3 篇 amato nancy m.
2 篇 guan haibing
2 篇 pingali k
2 篇 umatani seiji
2 篇 li peng
2 篇 guangming tan
2 篇 gunnels john
2 篇 doerfert johanne...
2 篇 brokenshire dani...
2 篇 tan k

语言

196 篇 英文
11 篇 其他

检索条件"任意字段=8th ACM SIGPLAN Symposium on the Principles and Practice of Parallel Computing"

共 207 条记录，以下是1-10 订阅

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

详细简洁

排序：

WaterWise: Co-optimizing Carbon- and Water-Footprint Toward Environmentally Sustainable Cloud computing 25

WaterWise: Co-optimizing Carbon- and Water-Footprint Toward ...

引用

30th symposium on principles and practice of parallel Programming

作者： Jiang, Yankai Roy, Rohan Basu Kanakagiri, Raghavendra Tiwari, Devesh Northeastern Univ Boston MA 02115 USA Univ Utah Salt Lake City UT USA IIT Tirupati Tirupati Andhra Pradesh India

ISBN: (纸本)9798400714436

the carbon and water footprint of large-scale computing systems poses serious environmental sustainability risks. In this study, we discover that, unfortunately, carbon and water sustainability are at odds with each other - and, optimizing one alone hurts the other. Toward that goal, we introduce, WaterWise, a novel job scheduler for parallel workloads that intelligently co-optimizes carbon and water footprint to improve the sustainability of geographically distributed data centers.

关键词： Cloud computing Sustainability Geospatial Shifting

来源：评论

学校读者我要写书评

暂无评论

POSTER: FastBWA: Practical and Cost-Efficient Genome Sequence Alignment Pipeline 30

POSTER: FastBWA: Practical and Cost-Efficient Genome Sequenc...

引用

30th symposium on principles and practice of parallel Programming

作者： Zhang, Zhonghai Li, Yewen Meng, Ke Zhang, Chunming Tan, Guangming Chinese Acad Sci Inst Comp Technol State Key Lab Processors Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China

ISBN: (纸本)9798400714436

Sequence alignment is a fundamental and often time-consuming step in genomic data analysis. Typically, it adheres to the seed-and-extension paradigm and numerous accelerator-based approaches have been proposed to optimize either of the kernels. However, these approaches often increase costs and contribute minimally to the overall alignment process. To address this, we have designed an optimized full pipeline, FastBWA, which seeks to enhance performance while keeping costs low and explores the potential of CPU computing resources. Our implementation demonstrates that FastBWA achieves up to 2.5x and 1.8x in end-to-end alignment throughput compared to BWA-MEM and its newer version, BWA-MEM2.

关键词： Genome Sequence Alignment BWA-MEM Acceleration parallel Application

来源：评论

学校读者我要写书评

暂无评论

Jigsaw: Toward Conflict-free Vectorized Stencil Computation by Tessellating Swizzled Registers 25

Jigsaw: Toward Conflict-free Vectorized Stencil Computation ...

引用

30th symposium on principles and practice of parallel Programming

作者： Zhang, Yiwei Li, Kun Yuan, Liang Han, Haozhi Zhang, Yunquan Cao, Ting Yang, Mao Univ Chinese Acad Sci Beijing Peoples R China Microsoft Res Beijing Peoples R China Chinese Acad Sci Beijing Peoples R China Peking Univ Beijing Peoples R China

ISBN: (纸本)9798400714436

Stencil computation plays a pivotal role in numerous scientific and engineering applications. Previous studies have extensively investigated vectorization techniques to enhance in-core parallelism;however, the performance bottleneck caused by data alignment conflicts (DAC) has not been effectively resolved in all dimensions. this paper proposes Jigsaw, a conflict-free vectorization method to reduce DAC across all dimensions by tessellating swizzled finest-grained lanes. Jigsaw comprises three key components: Lane-based Butterfly Vectorization, SVD-based Dimension Flattening, and Iteration-based Temporal Merging. these components effectively address DAC across spatial and temporal dimensions. Experimental results on different machines demonstrate that Jigsaw could achieve a significant improvement compared to the state-of-the-art techniques, with an average speedup of 2.31x on various stencil kernels.

关键词： Stencil Computation High Performance computing Vectorization Data Alignment Conflict

来源：评论

学校读者我要写书评

暂无评论

DORADD: Deterministic parallel Execution in the Era of Microsecond-Scale computing 25

DORADD: Deterministic Parallel Execution in the Era of Micro...

引用

30th symposium on principles and practice of parallel Programming

作者： Liu, Zhengqing Unal, Musa Parkinson, Matthew J. Kogias, Marios Imperial Coll London London England Ecole Polytech Fed Lausanne Lausanne Switzerland Azure Res Austin TX USA

ISBN: (纸本)9798400714436

Deterministic parallelism is a key building block for distributed and fault-tolerant systems that offers substantial performance benefits while guaranteeing determinism. By studying existing deterministically parallel systems (DPS), we identify certain design pitfalls, such as batched execution and inefficient runtime synchronization, that preclude them from meeting the demands of mu s-scale and high-throughput distributed systems deployed in modern datacenters. We present DORADD, a deterministically parallel runtime with low latency and high throughput, designed for modern datacenter services. DORADD introduces a hybrid scheduling scheme that effectively decouples request dispatching from execution. It employs a single dispatcher to deterministically construct a dynamic dependency graph of incoming requests and worker pools that can independently execute requests in a work-conserving and synchronization-free manner. Furthermore, DORADD overcomes the single-dispatcher throughput bottleneck based on core pipelining. We use DORADD to build an in-memory database and compare it with Caracal, the current state-of-the-art deterministic database, via the YCSB and TPC-C benchmarks. Our evaluation shows up to 2.5x better throughput and more than 150x and 300x better tail latency in non-contended and contended cases, respectively. We also compare DO-RADD with Caladan, the state-of-the-art non-deterministic remote procedure call (RPC) scheduler, and demonstrate that determinism in DORADD does not incur any performance overhead.

关键词： parallel execution determinism runtime scheduling

来源：评论

学校读者我要写书评

暂无评论

Effectively Virtual Page Prefetching via Spatial-Temporal Patterns for Memory-intensive Cloud Applications 25

Effectively Virtual Page Prefetching via Spatial-Temporal Pa...

引用

30th symposium on principles and practice of parallel Programming

作者： Wang, Yun Chen, Liang Deng, Tianmai Luo, Ben Shen, Yibin Wei, Zhixiang Xu, Yixiao Huang, Minglang Qi, Zhengwei Shanghai Jiao Tong Univ Shanghai Peoples R China Alibaba Grp Hangzhou Peoples R China

ISBN: (纸本)9798400714436

In today's data-driven era, the explosive growth of global data volume has led to an increasing consumption of computing and storage resources. Effective management of virtual machines (VMs) memory usage is critical for cloud vendors to optimize system performance and resource utilization. Existing memory prefetching methods often slow down system performance, creating a difficult balance between maintaining service quality and optimizing resource use. For instance, Leap, which primarily utilizes address information, performs poorly in VM environments. the main issue is the performance drop caused by the reuse of memory resources in virtualized environments, a common situation in public clouds. To tackle this, we introduce vPrefetcher, a page prefetching system designed specifically for VMs. vPrefetcher monitors how VMs access memory that is not currently in use and prepares that memory in advance. Our unique Trend algorithm uses the spatial and temporal patterns to improve how memory is prefetched, reduce the overhead of memory reclamation. By applying vPrefetcher in tests with typical data center applications under memory reuse conditions, we have noticed a significant improvement. Our system reduces the performance loss in VMs by up to 45%, which is a considerable improvement over existing solutions. [GRAPHICS] .

关键词： Cloud computing Virtualization Memory Prefetching

来源：评论

学校读者我要写书评

暂无评论

Crystality: A Programming Model for Smart Contracts on parallel EVMs 25

Crystality: A Programming Model for Smart Contracts on Paral...

引用

30th symposium on principles and practice of parallel Programming

作者： Wang, Hao Pan, Minghao Wang, Jiaping Int Digital Econ Acad Beijing Peoples R China Hong Kong Univ Sci & Technol Guangzhou Guangzhou Peoples R China

ISBN: (纸本)9798400714436

Scaling blockchain performance through parallel smart contract execution has gained significant attention, as traditional methods remain constrained by the performance of a single virtual machine (VM), even in multi-chain or Layer-2 systems. parallel VMs offer a compelling solution by enabling concurrent transaction execution within a single smart contract, using multiple CPU cores. However, Ethereum's sequential, shared-everything model limits the efficiency of existing parallel mechanisms, resulting in frequent rollbacks with optimistic methods and high overhead with pessimistic methods due to state dependency analysis and locking. this paper introduces Crystality, a programming model for smart contracts on parallel Ethereum Virtual Machines (EVMs) that enables developers to express and leverage the parallelism inherent in smart contracts. Crystality introduces Programmable Contract Scopes to partition contract states into non-overlapping, parallelizable segments and decompose a smart contract function into finer-grained components. Crystality also features Asynchronous Functional Relay to manage execution flow across EVMs. these features simplify parallelism expression and enable asynchronous execution for commutative contract operations. Crystality extends Solidity with directives, transpiling Crystality code into standard Solidity code for EVM compatibility. the system supports two execution modes: an asynchronous mode for transactions involving commutative operations and an optimistic-based fallback to ensure blockdefined transaction order. Our experiments demonstrated Crystality's superior performance compared to Ethereum, Aptos, and Sui on a 64-core machine.

关键词： Blockchain Smart Contract parallel Execution Concurrency Control parallel EVMs

来源：评论

学校读者我要写书评

暂无评论

Adaptive parallel Training for Graph Neural Networks 25

Adaptive Parallel Training for Graph Neural Networks

引用

30th symposium on principles and practice of parallel Programming

作者： Ma, Kaihao Liu, Renjie Yan, Xiao Cai, Zhenkun Song, Xiang Wang, Minjie Li, Yichao Cheng, James Chinese Univ Hong Kong Hong Kong Peoples R China Southern Univ Sci & Technol Shenzhen Peoples R China Ctr Perceptual & Interact Intelligence Hong Kong Peoples R China Amazon Seattle WA USA AWS Shanghai AI Lab Shanghai Peoples R China

ISBN: (纸本)9798400714436

there are several strategies to parallelize graph neural network (GNN) training over multiple GPUs. We observe that there is no consistent winner (i.e., with the shortest running time), and the optimal strategy depends on the graph dataset, GNN model, training algorithm, and hardware configurations. As such, we design the APT system to automatically select efficient parallelization strategies for GNN training tasks. To this end, we analyze the trade-offs of the strategies and design simple yet effective cost models to compare their execution time and facilitate strategy selection. Moreover, we also propose a general abstraction of the strategies, which allows to implement a unified execution engine that can be configured to run different strategies. Our experiments show that APT usually chooses the optimal or a close to optimal strategy, and the training time can be reduced by over 2x compared with always using a single strategy. APT is open-source at https://***/kaihaoma/APT.

关键词： Graph Neural Networks Distributed and parallel Training Network Communication

来源：评论

学校读者我要写书评

暂无评论

SBMGT: Scaling Bayesian Multinomial Group Testing 25

SBMGT: Scaling Bayesian Multinomial Group Testing

引用

30th symposium on principles and practice of parallel Programming

作者： Chen, Weicong Qi, Hao Tatsuoka, Curtis Lu, Xiaoyi Univ Calif Merced Merced CA 95343 USA Univ Pittsburgh Pittsburgh PA 15260 USA

ISBN: (纸本)9798400714436

Group testing is a widely used binary classification method that efficiently distinguishes between samples with and without a binary-classifiable attribute by pooling and testing subsets of a group. Bayesian Group Testing (BGT) is the state-of-the-art approach, which integrates prior risk information into a Bayesian Boolean Lattice framework to minimize test counts and reduce false classifications. However, BGT, like other existing group testing techniques, struggles with multinomial group testing, where samples have multiple binary-classifiable attributes that can be individually distinguished simultaneously. We address this need by proposing Bayesian Multinomial Group Testing (BMGT), which includes a new Bayesian-based model and supporting theorems for an efficient and precise multinomial pooling strategy. We further design and develop SBMGT, a high-performance and scalable framework to tackle BMGT's computational challenges by proposing three key innovations: 1) a parallel binaryencoded product lattice model with up to 99.8% efficiency;2) the Bayesian Balanced Partitioning Algorithm (BBPA), a multinomial pooling strategy optimized for parallel computation with up to 97.7% scaling efficiency on 4096 cores;and 3) a scalable multinomial group testing analytics framework, demonstrated in a real-world disease surveillance case study using AIDS and STDs datasets from Uganda, where SBMGT reduced tests by up to 54% and lowered false classification rates by 92% compared to BGT.

关键词： Multinomial group testing Bayesian methods parallel algorithms Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

POSTER: Minimizing speculation overhead in a parallel recognizer for regular texts 30

POSTER: Minimizing speculation overhead in a parallel recogn...

引用

30th symposium on principles and practice of parallel Programming

作者： Borsotti, Angelo Breveglieri, Luca Morzenti, Angelo Reghizzi, Stefano Crespi Politecn Milan Milan Italy CNR IEIIT Milan Italy

ISBN: (纸本)9798400714436

Speculative data-parallel algorithms for language recognition have been widely experimented for various types of finite-state automata (FA), deterministic (DFA) and nondeterministic (NFA), often derived from regular expressions (RE). Such an algorithm cuts the input string into chunks, independently recognizes each chunk in parallel by means of identical FAs, and at last joins the chunk results and checks the overall consistency. In chunk recognition, it is necessary to speculatively start the FAs in any state, thus causing an overhead that reduces the speedup over a serial algorithm. the existing data-parallel DFA-based recognizers suffer from an excessive number of starting states, and the NFA-based ones suffer from the number of nondeterministic transitions. Our data-parallel algorithm is based on the new FA type called reduced-interface DFA (RI-DFA), which minimizes the speculation overhead without incurring in the penalty of nondeterministic transitions or of impractically enlarged DFA machines. the algorithm is theoretically efficient, because it combines the state-reduction of an NFA with the speed of deterministic transitions, thus improving on both DFA-based and NFA-based existing implementations. the practical applicability of the RI-DFA approach is confirmed by a quantitative comparison of the number of starting states for a large public benchmark of complex FAs. On multi-core computing architectures, the RI-DFA recognizer is considerably faster than the NFA-based one on all benchmarks, while it matches the DFA-based one on some benchmarks and performs much better on some others. the extra time needed to construct RI-DFA vs DFA is moderate and is compatible with a practical use. the full paper with all details is in [4]. © 2025 Copyright held by the owner/author(s).

关键词： regular language recognition data-parallel recognition algorithm minimal speculation speedup onmulti-core architecture multi-entry DFA reduced-interface DFA

来源：评论

学校读者我要写书评

暂无评论

MARLIN: Mixed-Precision Auto-Regressive parallel Inference on Large Language Models 25

MARLIN: Mixed-Precision Auto-Regressive Parallel Inference o...

引用

30th symposium on principles and practice of parallel Programming

作者： Frantar, Elias Castro, Roberto L. Chen, Jiale Hoefler, Torsten Alistarh, Dan IST Austria Klosterneuburg Austria Univ A Coruna CITIC La Coruna Spain Swiss Fed Inst Technol Zurich Switzerland Neural Mag Inc Somerville NJ USA

ISBN: (纸本)9798400714436

As inference on Large Language Models (LLMs) emerges as an important workload in machine learning applications, model weight quantization has become a standard technique for efficient GPU deployment. Quantization not only reduces model size, but has also been shown to yield substantial speedups for single-user inference, due to reduced memory movement, with low accuracy impact. Yet, it remains a key open question whether speedups are achievable also in batched settings with multiple parallel clients, which are highly relevant for practical serving. It is unclear whether GPU kernels can be designed to remain practically memory-bound, while supporting the substantially increased compute requirements of batched workloads. In this paper, we resolve this question positively by introducing a new design for Mixed-precision Auto-Regressive LINear kernels, called MARLIN. Concretely, given a model whose weights are compressed via quantization to, e.g., 4 bits per element, MARLIN shows that batchsizes up to 16-32 can be practically supported with close to maximum (4x) quantization speedup, and larger batchsizes up to 64-128 with gradually decreasing, but still significant, acceleration. MARLIN accomplishes this via a combination of techniques, such as asynchronous memory access, complex task scheduling and pipelining, and bespoke quantization support. Our experiments show that MARLIN's near-optimal performance on individual LLM layers across different scenarios can also lead to significant end-to-end LLM inference speedups (of up to 2.8x) when integrated with the popular vLLM opensource serving engine. Finally, we show that MARLIN is extensible to further compression techniques, like NVIDIA 2:4 sparsity, leading to additional speedups.

关键词： Large language model (LLM) inference GPU programming Batch parallelism

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：