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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

GPU-Enabled Asynchronous Multi-level Checkpoint Caching and Prefetching 23

GPU-Enabled Asynchronous Multi-level Checkpoint Caching and ...

引用

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

作者： Maurya, Avinash Rafique, M. Mustafa Tonellot, Thierry AlSalem, Hussain J. Cappello, Franck Nicolae, Bogdan Rochester Inst Technol Rochester NY 14623 USA Saudi Aramco Explorat & Petr Engn Adv Res Ctr Dhahran Saudi Arabia Argonne Natl Lab Lemont IL USA

ISBN: (纸本)9798400701559

Checkpointing is an I/O intensive operation increasingly used by High-Performance computing (HPC) applications to revisit previous intermediate datasets at scale. Unlike the case of resilience, where only the last checkpoint is needed for application restart and rarely accessed to recover from failures, in this scenario, it is important to optimize frequent reads and writes of an entire history of checkpoints. State-of-the-art checkpointing approaches often rely on asynchronous multi-level techniques to hide I/O overheads by writing to fast local tiers (e.g. an SSD) and asynchronously flushing to slower, potentially remote tiers (e.g. a parallel file system) in the background, while the application keeps running. However, such approaches have two limitations. First, despite the fact that HPC infrastructures routinely rely on accelerators (e.g. GPUs), and therefore a majority of the checkpoints involve GPU memory, efficient asynchronous data movement between the GPU memory and host memory is lagging behind. Second, revisiting previous data often involves predictable access patterns, which are not exploited to accelerate read operations. In this paper, we address these limitations by proposing a scalable and asynchronous multi-level checkpointing approach optimized for both reading and writing of an arbitrarily long history of checkpoints. Our approach exploits GPU memory as a first-class citizen in the multi-level storage hierarchy to enable informed caching and prefetching of checkpoints by leveraging foreknowledge about the access order passed by the application as hints. Our evaluation using a variety of scenarios under I/O concurrency shows up to 74x faster checkpoint and restore throughput as compared to the state-of-art runtime and optimized unified virtual memory (UVM) based prefetching strategies and at least 2x shorter I/O wait time for the application across various workloads and configurations.

关键词： High-Performance computing (HPC) Graphics Processing Unit (GPU) asynchronous multi-level checkpointing hierarchical cache management prefetching

来源：评论

学校读者我要写书评

暂无评论

Fast Symmetric Eigenvalue Decomposition via WY Representation on Tensor Core 23

Fast Symmetric Eigenvalue Decomposition via WY Representatio...

引用

28th acm SIGPLAN Annual symposium on principles and Practice of Parallel Programming, PPoPP 2023

作者： Zhang, Shaoshuai Shah, Ruchi Ootomo, Hiroyuki Yokota, Rio Wu, Panruo Department of Computer Science University of Houston TX United States Global Scientific Information and Computing Center Tokyo Institute of Technology Tokyo Japan

ISBN: (纸本)9798400700156

Symmetric eigenvalue decomposition (EVD) is a fundamental analytic and numerical tool used in many scientific areas. The state-of-the-art algorithm in terms of performance is typically the two-stage tridiagonalization method. The first stage in the two-stage tridiagonalization is called successive band reduction (SBR), which reduces a symmetric matrix to a band form, and its computational cost usually dominates. When Tensor Core (specialized matrix computational accelerator) is used to accelerate the expensive EVD, the conventional ZY-representation-based method results in suboptimal performance due to unfavorable shapes of the matrix computations. In this paper, we propose a new method that uses WY representation instead of ZY representation (see Section 3.2 for details), which can provide a better combination of locality and parallelism so as to perform better on Tensor Cores. Experimentally, the proposed method can bring up to 3.7x speedup in SBR and 2.3x in the entire EVD compared to state-of-the-art implementations. © 2023 acm.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

SURE: Secure Unikernels Make Serverless computing Rapid and Efficient 15

SURE: Secure Unikernels Make Serverless Computing Rapid and ...

引用

15th Annual acm symposium on Cloud computing, SoCC 2024

作者： Parola, Federico Qi, Shixiong Narappa, Anvaya B. Ramakrishnan, K.K. Risso, Fulvio Politecnico di Torino Italy University of California Riverside United States University of Kentucky United States

ISBN: (纸本)9798400712869

Current serverless platforms introduce non-trivial overheads when chaining and orchestrating loosely-coupled microservices. Containerized function runtimes are also constrained by insufficient isolation and excessive startup time. This motivates our exploration of a more efficient, secure, and rapid serverless design. We describe SURE, a unikernel-based serverless framework for fast function startup, equipped with a high-performance and secure data plane. SURE's data plane supports distributed zero-copy communication via the seamless interaction between zero-copy protocol stack (Z-stack) and local shared memory processing. To establish a lightweight service mesh, SURE uses library-based sidecars instead of individual userspace sidecars. We leverage Intel's Memory Protection Keys (MPK) as a lightweight capability to ensure safe access to the shared memory data plane. It also isolates the Trusted computing Base (TCB) components in SURE's function runtime (e.g., library-based sidecar, scheduler, etc) from untrusted user code, while preserving the efficient single-address-space nature of unikernels. In particular, SURE prevents unintended privilege escalation involving MPK with an enhanced TCB. These combined efforts create a more secure and robust data plane while improving throughput up to 79X over Knative, a representative open-source serverless platform. © 2024 Owner/Author.

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

Fast distributed Vertex Splitting with Applications 36

Fast Distributed Vertex Splitting with Applications

引用

36th International symposium on distributed computing, DISC 2022

作者： Halldórsson, Magnús M. Maus, Yannic Nolin, Alexandre Reykjavik University Iceland TU Graz Austria CISPA Saarbrücken Germany

ISBN: (纸本)9783959772556

We present poly log log n-round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into k parts such that a node of degree d(u) has ≈ d(u)/k neighbors in each part. Our techniques can be seen as the first progress towards general poly log log n-round algorithms for the Lovász Local Lemma. As the main application of our result, we obtain a randomized poly log log n-round CONGEST algorithm for (1 + Ε)∆-edge coloring n-node graphs of sufficiently large constant maximum degree ∆, for any Ε > 0. Further, our results improve the computation of defective colorings and certain tight list coloring problems. All the results improve the state-of-the-art round complexity exponentially, even in the LOCAL model. © Magnús M. Halldórsson, Yannic Maus, and Alexandre Nolin.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Stream Processing with Dependency-Guided Synchronization 22

Stream Processing with Dependency-Guided Synchronization

引用

27th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Kallas, Konstantinos Niksic, Filip Stanford, Caleb Alur, Rajeev Univ Pennsylvania Philadelphia PA USA

ISBN: (纸本)9781450392044

Real-time data processing applications with low latency requirements have led to the increasing popularity of stream processing systems. While such systems offer convenient APIs that can be used to achieve data parallelism automatically, they offer limited support for computations that require synchronization between parallel nodes. In this paper, we propose dependency-guided synchronization (DGS), an alternative programming model for stateful streaming computations with complex synchronization requirements. In the proposed model, the input is viewed as partially ordered, and the program consists of a set of parallelization constructs which are applied to decompose the partial order and process events independently. Our programming model maps to an execution model called synchronization plans which supports synchronization between parallel nodes. Our evaluation shows that APIs offered by two widely used systems-Flink and Timely Dataflow-cannot suitably expose parallelism in some representative applications. In contrast, DGS enables implementations with scalable performance, the resulting synchronization plans offer throughput improvements when implemented manually in existing systems, and the programming overhead is small compared to writing sequential code.

关键词： data parallelism sharding synchronization distributed stream processing

来源：评论

学校读者我要写书评

暂无评论

27th International Database Engineered Applications symposium, IDEAS 2023

27th International Database Engineered Applications Symposiu...

引用

27th International Database Engineered Applications symposium, IDEAS 2023

ISBN: (纸本)9798400707445

The proceedings contain 26 papers. The topics discussed include: discovery of patent influence with directed acyclic graph network analysis;FedShare: secure aggregation based on additive secret sharing in federated learning;enhancing declarative temporal model mining in relational databases: a preliminary study;condensed nearest neighbor rules for multi-label datasets;challenges of spatio-temporal trajectory data use: focus group findings from the 1st International Summer School on Data Science for Mobility;BIOCHAIN: towards a platform for securely sharing microbiological data;very fast variations of training set size reduction algorithms for instance-based classification;bitcoin price prediction considering sentiment analysis on Twitter and Google News;approach considering collective intelligence for interactive web services composition;information visualization for industrial process monitoring;and AdapterEM: pre-trained language model adaptation for generalized entity matching using adapter-tuning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How Do You Know if They Don't Know? The Design of Pre-Tests in computing Education Research 2022

How Do You Know if They Don't Know? The Design of Pre-Tests ...

引用

53rd Annual acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Parker, Miranda C. Kao, Yvonne S. Univ Calif Irvine Irvine CA 92717 USA WestEd Redwood City CA USA

ISBN: (纸本)9781450390705

As computing education expands to "all" students, so too must the assessment of computational learning. However, there are many challenges to designing and using computing assessments in a valid and reliable way. This is especially true with respect to pre-tests, or assessments given at the beginning of an intervention, course, or study. For elementary and middle school interventions, it is still likely that many students in any given study sample will have had no prior experience with computing. For high school interventions, students may have a wide range of prior experiences. How do you design or select a pre-test for these situations? In this poster, we discuss the design of pre-tests for the computing education research community. We outline the fundamental principles of pretests and the different purposes they serve in research studies. We complement these principles with examples of pre-tests used in current computing education research. This poster aims to provide guidance on how to intentionally develop and use pre-tests to strengthen the validity of our research findings and better inform on student learning outcomes.

关键词： assessment pre-test measures

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds on the State Complexity of Population Protocols 21

Lower Bounds on the State Complexity of Population Protocols

引用

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

作者： Czerner, Philipp Esparza, Javier Tech Univ Munich Munich Germany

ISBN: (纸本)9781450385480

Population protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stable consensus whether their initial global configuration satisfies a given property, specified as a predicate on the set of configurations. The state complexity of a predicate is the number of states of a smallest protocol that computes it. Previous work by Blondin et al. has shown that the counting predicates x >= eta have state complexity O(log eta) for leaderless protocols and O(log log eta) for protocols with leaders. We obtain the first non-trivial lower bounds: the state complexity of x >= eta is Omega(log log log eta) for leaderless protocols, and the inverse of a non-elementary function for protocols with leaders.

关键词： distributed computing population protocols state complexity

来源：评论

学校读者我要写书评

暂无评论

Provably Good Randomized Strategies for Data Placement in distributed Key-Value Stores 23

Provably Good Randomized Strategies for Data Placement in Di...

引用

28th acm SIGPLAN Annual symposium on principles and Practice of Parallel Programming, PPoPP 2023

作者： Wang, Zhe Zhao, Jinhao Agrawal, Kunal Liu, He Xu, Meng Li, Jing Washington University St. Louis United States FoundationDB New Jersey Institute of Technology United States

ISBN: (纸本)9798400700156

distributed storage systems are used widely in clouds, databases, and file systems. These systems store a large amount of data across multiple servers. When a request to access data comes in, it is routed to the appropriate server, queued, and eventually processed. If the server's queue is full, then requests may be rejected. Thus, one important challenge when designing the algorithm for allocating data to servers is the fact that the request pattern may be unbalanced, unpredictable, and may change over time. If some servers get a large fraction of the requests, they are overloaded, leading to many rejects. In this paper, we analyze this problem theoretically under adversarial assumptions. In particular, we assume that the request sequence is generated by an adversarial process to maximize the number of rejects and analyze the performance of various algorithmic strategies in terms of the fraction of the requests rejected. We show that no deterministic strategy can perform well. On the other hand, a simple randomized strategy guarantees that at most a constant fraction of requests are rejected in expectation. We also show that moving data to load balance is essential if we want to reject a very small fraction (1/m where m is the number of servers) of requests. We design a strategy with randomization and data transfer to achieve this performance with speed augmentation. Finally, we conduct experiments and show that our algorithms perform well in practice. © 2023 Owner/Author.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

PROV-IO: An I/O-Centric Provenance Framework for Scientific Data on HPC Systems 22

PROV-IO: An I/O-Centric Provenance Framework for Scientific ...

引用

31st International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Han, Runzhou Byna, Suren Tang, Houjun Dong, Bin Zheng, Mai Iowa State Univ Ames IA 50011 USA Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)9781450391993

Data provenance, or data lineage, describes the life cycle of data. In scientific workflows on HPC systems, scientists often seek diverse provenance (e.g., origins of data products, usage patterns of datasets). Unfortunately, existing provenance solutions cannot address the challenges due to their incompatible provenance models and/or system implementations. In this paper, we analyze three representative scientific workflows in collaboration with the domain scientists to identify concrete provenance needs. Based on the first-hand analysis, we propose a provenance framework called PROV-IO, which includes an I/O-centric provenance model for describing scientific data and the associated I/O operations and environments precisely. Moreover, we build a prototype of PROV-IO to enable end-to-end provenance support on real HPC systems with little manual effort. The PROV-IO framework provides flexibility in selecting various classes of provenance. Our experiments with realistic workflows show that PROV-IO can address the provenance needs of the domain scientists effectively with reasonable performance (e.g., less than 3.5% tracking overhead for most experiments). Moreover, PROV-IO outperforms a state-of-the-art system (i.e., ProvLake) in our experiments.

关键词： Data Provenance Lineage Scientific Data Workflows High Performance computing FAIR principles Explainability Trustworthiness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：