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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

416 篇 会议
20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

306 篇 工学
- 299 篇 计算机科学与技术...
- 192 篇 软件工程
- 31 篇 电气工程
- 27 篇 信息与通信工程
- 20 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 4 篇 农业工程
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
172 篇 理学
- 165 篇 数学
- 25 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 1 篇 化学
16 篇 管理学
- 13 篇 管理科学与工程(可...
- 11 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

92 篇 parallel algorit...
81 篇 parallel process...
14 篇 parallel program...
13 篇 computer program...
10 篇 computer archite...
10 篇 scheduling
8 篇 computer systems...
8 篇 pram
7 篇 parallel process...
6 篇 parallel archite...
5 篇 graph algorithms
5 篇 multithreading
4 篇 performance
4 篇 approximation al...
4 篇 computational ge...
4 篇 bandwidth
4 篇 processor schedu...
4 篇 pipeline process...
4 篇 transactional me...
4 篇 concurrency

机构

11 篇 carnegie mellon ...
4 篇 univ maryland de...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 carnegie mellon ...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 dipartimento di ...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 ibm t.j. watson ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...

作者

12 篇 blelloch guy e.
12 篇 gibbons phillip ...
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 muthukrishnan s.
5 篇 goodrich michael...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 ramachandran vij...
4 篇 tangwongsan kana...
4 篇 vitter jeffrey s...
4 篇 simhadri harsha ...
4 篇 gu yan
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 tarjan robert e.
3 篇 cormen thomas h.
3 篇 dhulipala laxman
3 篇 deng xiaotie
3 篇 monien burkhard

语言

420 篇 英文
16 篇 其他

检索条件"任意字段=Proceedings of the second annual ACM symposium on Parallel algorithms and architectures"

共 436 条记录，以下是21-30 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

The All Nearest Smaller Values Problem Revisited in Practice, parallel and External Memory 24

The All Nearest Smaller Values Problem Revisited in Practice...

引用

36th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Sitchinava, Nodari Svenning, Rolf Univ Hawaii Manoa Honolulu HI 96822 USA Aarhus Univ Aarhus Denmark

ISBN: (纸本)9798400704161

We present a thorough investigation of the All Nearest Smaller Values (ANSV) problem from a practical perspective. The ANSV problem is defined as follows: given an array A consisting of n values, for each entry A(i) compute the largest index l < i and the smallest index r > i such that A(i) > A(l) and A(i) > A(r), i.e., the indices of the nearest smaller values to the left and to the right of A(i). The ANSV problem was solved by Berkman, Schieber, and Vishkin [J. algorithms, 1993] in the PRAM model. Their solution in the CREW PRAM model, which we will refer to as the BSV algorithm, achieves optimal O(n) work and O(log n) span. Until now, the BSV algorithm has been perceived as too complicated for practical use, and we are not aware of any publicly available implementations. Instead, the best existing practical solution to the ANSV problem is the implementation by Shun and Zhao presented at DCC'13. They implemented a simpler O(n log n)-work algorithm with an additional heuristic first proposed by Blelloch and Shun at ALENEX'11. We refer to this implementation as the BSZ algorithm. In this paper, we implement the original BSV algorithm and demonstrate its practical efficiency. Despite its perceived complexity, our results show that its performance is comparable to the BSZ algorithm. We also present the first theoretical analysis of the heuristic implemented in the BSZ algorithm and show that it provides a tunable trade-off between optimal work and optimal span. In particular, we show that it achieves O(n(1 + log n/k)) work and O(k(1 + log n/k)) span, for any integer parameter 1 <= k <= n. Thus, for k = Theta(log n), the BSZ algorithm can be made to be work-optimal, albeit at the expense of increased span compared to BSV. Our discussion includes a detailed examination of different input types, particularly highlighting that for random inputs, the low expected distance between values and their nearest smaller values renders simple algorithms efficient. Finally, we analy

关键词： Algorithm analysis parallel algorithms external memory PRAM algorithm engineering all nearest smaller values problem ANSV

来源：评论

学校读者我要写书评

暂无评论

SPAA 2023 - proceedings of the 35th acm symposium on parallelism in algorithms and architectures

SPAA 2023 - Proceedings of the 35th ACM Symposium on Paralle...

引用

35th acm symposium on parallelism in algorithms and architectures, SPAA 2023

ISBN: (纸本)9781450395458

The proceedings contain 47 papers. The topics discussed include: Quancurrent: a concurrent quantiles sketch;an efficient scheduler for task-parallel interactive applications;efficient synchronization-light work stealing;balanced allocations in batches: the tower of two choices;massively parallel tree embeddings for high dimensional spaces;deterministic massively parallel symmetry breaking for sparse graphs;an associativity threshold phenomenon in set-associative caches;increment - and - freeze: every cache, everywhere, all of the time;multidimensional approximate agreement with asynchronous fallback;a tight characterization of fast failover routing: resiliency to two link failures is possible;releasing memory with optimistic access: a hybrid approach to memory reclamation and allocation in lock-free programs;transactional composition of nonblocking data structures;applying hazard pointers to more concurrent data structures;and nearly optimal parallel algorithms for longest increasing subsequence.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC 24

Brief Announcement: Upper and Lower Bounds for Edit Distance...

引用

36th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Das, Debarati Gilbert, Jacob Hajiaghayi, MohammadTaghi Kociumaka, Tomasz Saha, Barna Penn State Univ State Coll PA 16802 USA Univ Maryland College Pk MD USA Max Planck Inst Informat Saarland Informat Campus Saarbrucken Germany Univ Calif San Diego San Diego CA USA

ISBN: (纸本)9798400704161

In the Massively parallel Computation (MPC) model, data is distributed across multiple processors, and we call an algorithm space-efficient if each machine has n(1-epsilon+o(1)) memory with a machine count of Omega(n(epsilon)). In this paper, we study the string edit distance problem in the MPC model, presenting both a new algorithm and lower-bound results. A space-efficient MPC algorithm computing the exact edit distance using O(n(epsilon)) communication rounds is known by updating the algorithm of Chowdhury and Ramachandran (SPAA 2008). A key contribution of our work is the introduction of the first space-efficient MPC algorithm, which uses subpolynomial number of rounds and provides an n(o(1))-approximation of edit distance, where.. denotes the length of the input strings. Further, we complement this algorithm with new lower-bound results. The Orthogonal Vector (O.V.) conjecture states that no truly subquadratic time algorithm exists for the Orthogonal Vector problem, and it follows directly from the Strong Exponential Time Hypothesis (SETH). Drawing inspiration from this, we propose the Strong O.V. Conjecture that posits that there is no space-efficient MPC algorithm capable of solving O.V. using n(epsilon-Omega(1)) communication rounds. The Strong O.V. conjecture has far-reaching consequences, yielding the first (or strengthened) lower bounds for a myriad of problems in the MPC model including graph diameter estimation, computing Frechet distance, longest common subsequence, and dynamic time warping. Via an MPC reduction from O.V. to edit distance, we give the first conditional lower bound for string edit distance in the MPC model showing that there does not exist any space-efficient, n(epsilon-Omega(1))-round MPC exact edit distance algorithm.

关键词： Massively parallel Computations Edit Distance Approximation Hardness

来源：评论

学校读者我要写书评

暂无评论

sNPU: Trusted Execution Environments on Integrated NPUs 51

sNPU: Trusted Execution Environments on Integrated NPUs

引用

acm/IEEE 51st annual International symposium on Computer Architecture (ISCA)

作者： Feng, Erhu Feng, Dahu Du, Dong Xia, Yubin Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst SEIEE Shanghai Peoples R China Tsinghua Univ Dept Precis Instrument Beijing Peoples R China Minist Educ Engn Res Ctr Domain Specif Operating Syst Beijing Peoples R China Chinese Acad Sci Key Lab Syst Software Beijing Peoples R China

ISBN: (纸本)9798350326598;9798350326581

Trusted execution environment (TEE) promises strong security guarantee with hardware extensions for security-sensitive tasks. Due to its numerous benefits, TEE has gained widespread adoption, and extended from CPU-only TEEs to FPGA and GPU TEE systems. However, existing TEE systems exhibit inadequate and inefficient support for an emerging (and significant) processing unit, NPU. For instance, commercial TEE systems resort to coarse-grained and static protection approaches for NPUs, resulting in notable performance degradation (10%-20%), limited (or no) multitasking capabilities, and suboptimal resource utilization. In this paper, we present a secure NPU architecture, known as sNPU, which aims to mitigate vulnerabilities inherent to the design of NPU architectures. First, sNPU proposes NPU Guarder to enhance the NPU's access control. second, sNPU defines new attack surfaces leveraging in-NPU structures like scratchpad and NoC, and designs NPU Isolator to guarantee the isolation of scratchpad and NoC routing. Third, our system introduces a trusted software module called NPU Monitor to minimize the software TCB. Our prototype, evaluated on FPGA, demonstrates that sNPU significantly mitigates the runtime costs associated with security checking (from upto 20% to 0%) while incurring less than 1% resource costs.

关键词： Accelerator Machine learning Security

来源：评论

学校读者我要写书评

暂无评论

Deterministic algorithms for the Lov′asz Local Lemma: simpler, more general, and more parallel 33

Deterministic algorithms for the Lov′asz Local Lemma: simpl...

引用

annual acm-SIAM symposium on Discrete algorithms (SODA)

作者： Harris, David G. Univ Maryland Dept Comp Sci College Pk MD 20742 USA

ISBN: (纸本)9781611977073

The Lov ' asz Local Lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection B of "bad" events which are mostly independent and have low probability. In its simplest "symmetric" form, it asserts that whenever a bad-event has probability p and affects at most d bad-events, and epd < 1, then a configuration avoiding all B exists. A seminal algorithm of Moser & Tardos (2010) (which we call the MT algorithm) gives nearly-automatic randomized algorithms for most constructions based on the LLL. However, deterministic algorithms have lagged behind. We address three specific shortcomings of the prior deterministic algorithms. First, our algorithm applies to the LLL criterion of Shearer (1985);this is more powerful than alternate LLL criteria and also removes a number of nuisance parameters and leads to cleaner and more legible bounds. second, we provide parallel algorithms with much greater flexibility in the functional form of the bad-events. Third, we provide a derandomized version of the MT-distribution, that is, the distribution of the variables at the termination of the MT algorithm. We show applications to non-repetitive vertex coloring, independent transversals, strong coloring, and other problems. These give deterministic algorithms which essentially match the best previous randomized sequential and parallel algorithms.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

SPAA 2022 - proceedings of the 34th acm symposium on parallelism in algorithms and architectures

SPAA 2022 - Proceedings of the 34th ACM Symposium on Paralle...

引用

34th acm symposium on parallelism in algorithms and architectures, SPAA 2022

ISBN: (纸本)9781450391467

The proceedings contain 44 papers. The topics discussed include: deterministic distributed sparse and ultra-sparse spanners and connectivity certificates;fully polynomial-time distributed computation in low-treewidth graphs;adaptive massively parallel algorithms for cut problems;preparing for disaster: leveraging precomputation to efficiently repair graph structures upon failures;the energy complexity of Las Vegas leader election;a fully-distributed peer-to-peer protocol for byzantine-resilient distributed hash tables;brief announcement: the (limited) power of multiple identities: asynchronous byzantine reliable broadcast with improved resilience through collusion;brief announcement: composable dynamic secure emulation;and robust and optimal contention resolution without collision detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering 22

Parallel Batch-Dynamic Minimum Spanning Forest and the Effic...

引用

34th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Tseng, Tom Dhulipala, Laxman Shun, Julian MIT CSAIL Cambridge MA 02139 USA Univ Maryland College Pk MD USA

ISBN: (纸本)9781450391467

Hierarchical agglomerative clustering (HAC) is a popular algorithm for clustering data, but despite its importance, no dynamic algorithms for HAC with good theoretical guarantees exist. In this paper, we study dynamic HAC on edge-weighted graphs. As single-linkage HAC reduces to computing a minimum spanning forest (MSF), our first result is a parallel batch-dynamic algorithm for maintaining MSFs. On a batch of k edge insertions or deletions, our batch-dynamic MSF algorithm runs in O(k log(6) n) expected amortized work and O(log(4) n) span with high probability. It is the first fully dynamic MSF algorithm handling batches of edge updates with polylogarithmic work per update and polylogarithmic span. Using our MSF algorithm, we obtain a parallel batch-dynamic algorithm that can answer queries about single-linkage graph HAC clusters. Our second result is that dynamic graph HAC is significantly harder for other common linkage functions. For example, assuming the strong exponential time hypothesis, dynamic graph HAC requires Omega(n(1-o(1))) work per update or query on a graph with n vertices for complete linkage, weighted average linkage, and average linkage. For complete linkage and weighted average linkage, the bound still holds even for incremental or decremental algorithms and even if we allow poly(n)-approximation. For average linkage, the bound weakens to Omega(n(1/2-o(1))) for incremental and decremental algorithms, and the bounds still hold when allowing n(o(1))-approximation.

关键词： parallel algorithms Dynamic algorithms Graph Clustering

来源：评论

学校读者我要写书评

暂无评论

SPAA 2021 - proceedings of the 33rd acm symposium on parallelism in algorithms and architectures

SPAA 2021 - Proceedings of the 33rd ACM Symposium on Paralle...

引用

33rd acm symposium on parallelism in algorithms and architectures, SPAA 2021

ISBN: (纸本)9781450380706

The proceedings contain 49 papers. The topics discussed include: fast stencil computations using fast Fourier transforms;low-span parallel algorithms for the binary-forking model;provable advantages for graph algorithms in spiking neural networks;algorithms for right-sizing heterogeneous data centers;efficient parallel self-adjusting computation;speed scaling with explorable uncertainty;efficient online weighted multi-level paging;paging and the address-translation problem;massively parallel algorithms for distance approximation and spanners;efficient load-balancing through distributed token dropping;finding subgraphs in highly dynamic networks;near-optimal time-energy trade-offs for deterministic leader election;and efficient stepping algorithms and implementations for parallel shortest paths.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Dataflow Abstract Machine Simulator Framework

The Dataflow Abstract Machine Simulator Framework

引用

annual International symposium on Computer Architecture, ISCA

作者： Nathan Zhang Rubens Lacouture Gina Sohn Paul Mure Qizheng Zhang Fredrik Kjolstad Kunle Olukotun Stanford University Stanford USA MIT Cambridge USA

ISBN: (数字)9798350326581

ISBN: (纸本)9798350326598

The growing interest in novel dataflow architectures and streaming execution paradigms has created the need for a simulator optimized for modeling dataflow systems. To fill this need, we present three new techniques that make it feasible to simulate complex systems consisting of thousands of components. First, we introduce an interface based on Communicating Sequential Processes which allows users to simultaneously describe functional and timing characteristics. second, we introduce a scalable point-to-point synchronization scheme that avoids global synchronization. Finally, we demonstrate a technique to exploit slack in the simulated system, such as FIFOs, to increase simulation parallelism. We implement these techniques in the Dataflow Machine (DAM), a parallel simulator framework for dataflow systems. We demonstrate the benefits of using DAM by highlighting three case studies using the framework. First, we use DAM directly as an exploration tool for streaming algorithms on dataflow hardware. We simulate two different implementations of the attention algorithm used in large language models, and use DAM to show that the second implementation only requires a constant amount of local memory. second, we re-implement a simulator for a sparse tensor algebra accelerator, resulting in $57 \%$ less code and a simulation speedup of up to four orders of magnitude. Finally, we demonstrate a general technique for time-multiplexing real hardware to simulate multiple virtual copies of the hardware using DAM.

关键词： Tensors Machine learning algorithms Dams Large language models Memory management Machine learning parallel processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：