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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

256 篇 会议
26 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

225 篇 工学
- 215 篇 软件工程
- 164 篇 计算机科学与技术...
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 材料科学与工程（可...
- 1 篇 电气工程
41 篇 理学
- 38 篇 数学
- 4 篇 系统科学
- 3 篇 统计学（可授理学、...
13 篇 管理学
- 7 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
- 4 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学

主题

83 篇 languages
43 篇 performance
29 篇 computer program...
24 篇 algorithms
24 篇 verification
23 篇 design
19 篇 theory
18 篇 parallel program...
10 篇 functional progr...
8 篇 logic programmin...
7 篇 experimentation
7 篇 semantics
6 篇 reliability
6 篇 mpi
6 篇 dependent types
6 篇 transactional me...
5 篇 abstract interpr...
4 篇 object oriented ...
4 篇 static analysis
4 篇 atomicity

机构

4 篇 carnegie mellon ...
3 篇 univ texas austi...
3 篇 univ of tokyo
3 篇 tohoku univ send...
3 篇 imdea software i...
3 篇 microsoft resear...
3 篇 univ texas austi...
2 篇 epfl
2 篇 univ wisconsin d...
2 篇 univ wisconsin m...
2 篇 xerox parc
2 篇 univ illinois ur...
2 篇 department of co...
2 篇 swiss fed inst t...
2 篇 univ lugano usi ...
2 篇 natl inst inform...
2 篇 mcgill univ mont...
2 篇 northeastern uni...
2 篇 univ calif santa...
2 篇 microsoft resear...

作者

4 篇 pingali keshav
4 篇 burtscher martin
3 篇 taura kenjiro
3 篇 yonezawa akinori
3 篇 flanagan cormac
3 篇 walker david
3 篇 abadi martin
3 篇 kobayashi naoki
2 篇 hoefler torsten
2 篇 saraswat vijay
2 篇 wand mitchell
2 篇 huelsbergen lore...
2 篇 grossman dan
2 篇 stulova nataliia
2 篇 palsberg jens
2 篇 donaldson alasta...
2 篇 yoshida nobuko
2 篇 kim jungwon
2 篇 gay simon j.
2 篇 welc adam

语言

282 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"

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

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

详细简洁

排序：

proceedings of the 25th International symposium on principles and Practice of Declarative programming, PPDP 2023 - As part of the acm sigplan conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH 2023, including LOPSTR 2023

Proceedings of the 25th International Symposium on Principle...

引用

25th International symposium on principles and Practice of Declarative programming, PPDP 2023 - As part of the acm sigplan conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH 2023, including LOPSTR 2023

ISBN: (纸本)9798400708121

the proceedings contain 13 papers. the topics discussed include: a calculus of delayed reductions;multicompatibility for multiparty-session composition;termination in concurrency, revisited;typed equivalence of labeled effect handlers and labeled delimited control operators;type-directed program transformation for constant-time enforcement;comprehending queries over finite maps;intuitionistic metric temporal logic;strongly-typed multi-view stack-based computations;and polymorphic typestate for session types;additive cellular automata graded-monadically.

关键词：

来源：评论

学校读者我要写书评

暂无评论

25th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2024 was co-located with 51st acm sigplan symposium on principles of programming languages, POPL 2024

25th International Conference on Verification, Model Checkin...

引用

25th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2024 was co-located with 51st acm sigplan symposium on principles of programming languages, POPL 2024

ISBN: (纸本)9783031505232

the proceedings contain 30 papers. the special focus in this conference is on Verification, Model Checking, and Abstract Interpretation. the topics include: Interpolation and Quantifiers in Ortholattices;function Synthesis for Maximizing Model Counting;boosting Constrained Horn Solving by Unsat Core Learning;on the Verification of the Correctness of a Subgraph Construction Algorithm;efficient Local Search for Nonlinear Real Arithmetic;abstract Interpretation-Based Feature Importance for Support Vector Machines;generation of Violation Witnesses by Under-Approximating Abstract Interpretation;correctness Witness Validation by Abstract Interpretation;project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability;parameterized Verification of Disjunctive Timed Networks;Resilience and Home-Space for WSTS;Generic Model Checking for Modal Fixpoint Logics in COOL-MC;Model-Guided Synthesis for LTL over Finite Traces.

关键词：

来源：评论

学校读者我要写书评

暂无评论

25th International Conference on Verification, Model Checkin...

引用

25th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2024 was co-located with 51st acm sigplan symposium on principles of programming languages, POPL 2024

ISBN: (纸本)9783031505201

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PPoPP 2024 - proceedings of the 29th acm sigplan Annual symposium on principles and Practice of Parallel programming

PPoPP 2024 - Proceedings of the 29th ACM SIGPLAN Annual Symp...

引用

29th acm sigplan Annual symposium on principles and Practice of Parallel programming, PPoPP 2024

ISBN: (纸本)9798400704352

the proceedings contain 44 papers. the topics discussed include: FastFold: optimizing AlphaFold training and inference on GPU clusters;liger: interleaving intra- and inter-operator parallelism for distributed large model inference;optimizing collective communications with error-bounded lossy compression for GPU clusters;OsirisBFT: say no to task replication for scalable byzantine fault tolerant analytics;RELAX: durable data structures with swift recovery;a row decomposition-based approach for sparse matrix multiplication on GPUs;Tetris: accelerating sparse convolution by exploiting memory reuse on GPU;scaling up transactions with slower clocks;towards scalable unstructured mesh computations on shared memory many-cores;AGAthA: fast and efficient GPU acceleration of guided sequence alignment for long read mapping;and shared memory-contention-aware concurrent DNN execution for diversely heterogeneous system-on-chips.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Closure Conversion in Little Pieces 23

Closure Conversion in Little Pieces

引用

25th International symposium on principles and Practice of Declarative programming (PPDP) As part of the acm sigplan Conference on Systems, programming, languages, and Applications - Software for Humanity (SPLASH)

作者： Sullivan, Zachary J. Downen, Paul Ariola, Zena M. Univ Oregon Eugene OR 97403 USA Univ Massachesetts Lowell MA USA

ISBN: (纸本)9798400708121

Closure conversion, an essential step in compiling functional programs, is traditionally presented as a global transformation from a language with higher-order functions to one without. Optimizing this transformation can be done at any of its three stages with various tradeoffs. After conversion, optimizations will be in the target language at the cost of a weaker equational theory. During conversion, optimizations may be embedded into the transformation itself at the cost of increasing its complexity and correctness. And before conversion, optimizations may be planned and anticipated in a specialized intermediate language (IL) where all the properties of the source program are still known, with the hope that they will survive the rest of the compilation process. By building on the notion of abstract closures, we blur the distinctions between these three approaches to closure conversion and optimizations thereof, by combining all of their strengths and avoiding their weaknesses. Specifically, we develop an IL that includes closures alongside unclosed higher-order code, even inhabiting the same type. the IL comes equipped with an equational theory that is shown sound and complete with respect to an environment abstract machine. thereby, a baseline closure conversion and common optimizations become provable equalities and thus are correct by construction. Moreover, the transformation and its correctness proof are broken down into little steps-as instances of the beta and eta axioms-instead of being expressed in terms of a recursive procedure. Our proposed IL is based on call-by-push-value which we extend with sharing in order to capture closure conversion for both strict and lazy languages.

关键词： closures closure conversion compiler intermediate languages

来源：评论

学校读者我要写书评

暂无评论

stableKanren: Integrating Stable Model Semantics with miniKanren 23

stableKanren: Integrating Stable Model Semantics with miniKa...

引用

作者： Guo, Xiangyu Smith, James Bansal, Ajay Arizona State Univ Tempe AZ 85287 USA

ISBN: (纸本)9798400708121

this paper presents stableKanren, a miniKanren extension with normal logic programming support under stable model semantics. MiniKanren is a relational programming solver implemented atop Scheme via shallow embedding, which means the predicate in each rule is encoded as a goal function directly. the solver utilizes the pattern matching macro in Scheme to transform the input goal function and form a static search stream through continuations to achieve the essential features, resolution and unification, in Prolog. However, the static stream only works on monotonic reasoning. Even though the core miniKanren is designed to be easily modified and extended with new features, none of the existing extensions support solving normal logic programs. Also, no normal logic program solvers are based on a functional programming language. We identify and categorize the roles of resolution and unification in top-down solving. And we realize that a dynamic search stream is needed to support non-monotonic reasoning. So we evolve both resolution and unification with new roles, and we exploit the advantages of using macros and continuations further to weave the information generated during runtime into future streams dynamically. We create multiple innovative macros to compile the normal logic program into a program with its complement form, obtain the domain of a variable under different contexts, and generate the new search stream during solving. And we use the coinductive resolution to handle the loop in the normal logic program. In future work, we plan to apply bottom-up optimization to improve our top-down system performance and support various input rules.

关键词： functional programming miniKanren stable model semantics normal logic program solver

来源：评论

学校读者我要写书评

暂无评论

Parallel Block-Delayed Sequences 22

Parallel Block-Delayed Sequences

引用

27th acm sigplan symposium on principles and Practice of Parallel programming (PPoPP)

作者： Westrick, Sam Rainey, Mike Anderson, Daniel Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450392044

programming languages using functions on collections of values, such as map, reduce, scan and filter, have been used for over fifty years. Such collections have proven to be particularly useful in the context of parallelism because such functions are naturally parallel. However, if implemented naively they lead to the generation of temporary intermediate collections that can significantly increase memory usage and runtime. To avoid this pitfall, many approaches use "fusion" to combine operations and avoid temporary results. However, most of these approaches involve significant changes to a compiler and are limited to a small set of functions, such as maps and reduces. In this paper we present a library-based approach that fuses widely used operations such as scans, filters, and flattens. In conjunction with existing techniques, this covers most of the common operations on collections. Our approach is based on a novel technique which parallelizes over blocks, with streams within each block. We demonstrate the approach by implementing libraries targeting multicore parallelism in two languages: Parallel ML and C++, which have very different semantics and compilers. To help users understand when to use the approach, we define a cost semantics that indicates when fusion occurs and how it reduces memory allocations. We present experimental results for a dozen benchmarks that demonstrate significant reductions in both time and space. In most cases the approach generates code that is near optimal for the machines it is running on.

关键词： parallel programming fusion collections functional programming

来源：评论

学校读者我要写书评

暂无评论

CuPBoP: A Framework to Make CUDA Portable 23

CuPBoP: A Framework to Make CUDA Portable

引用

proceedings of the 28th acm sigplan Annual symposium on principles and Practice of Parallel programming

作者： Ruobing Han Jun Chen Bhanu Garg Jeffrey Young Jaewoong Sim Hyesoon Kim Georgia Institute of Technology Seoul National University

ISBN: (纸本)9798400700156

CUDA, as one of the most popular choices for GPU programming, can be executed only on NVIDIA GPUs. To execute CUDA on non-NVIDIA devices, researchers have proposed to translate CUDA to other programming languages. However, this approach cannot achieve high coverage due to the challenges in source-to-source *** propose a framework, CuPBoP, that executes CUDA programs on non-NVIDIA devices without relying on other programming languages. CuPBoP consists of two parts. the compilation part applies transformations on CUDA host/kernel IRs. the runtime part consists of the runtime libraries for CUDA built-in functions. For the CPU backends, compared with the existing frameworks, CuPBoP achieves the highest coverage on all CPUs that we evaluate (x86, aarch64, RISC-V).We make CuPBoP publicly available to inspire more works in this area 1.

关键词： AArch64 X86 portable programming CUDA RISC-V

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：