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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

FPBOXer: Efficient Input-Generation for Targeting Floating-Point Exceptions in GPU Programs 24

FPBOXer: Efficient Input-Generation for Targeting Floating-P...

引用

33rd International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Tran, Anh Laguna, Ignacio Gopalakrishnan, Ganesh Kahlert Sch Comp Salt Lake City UT 84112 USA Ctr Appl Sci Comp Livermore CA USA

ISBN: (纸本)9798400704130

Numerical programs that generate floating-point exceptions, such as NaNs, are inherently unreliable, as these programs can produce meaningless outputs or affect control flow. When these programs run on GPUs, one cannot rely on hardware traps to handle the exceptions, as most GPUs do not support them. Unfortunately, we must also employ black-box testing for many such GPU programs, as they are supplied as binary code only. While previous work has shown that black-box testing for triggering floating-point exceptions can be approached using Bayesian Optimization, their approach cannot handle programs with more than three inputs. We contribute a new tool, FPBOXer, which pushes up the capabilities of BO to handle over 20 inputs-this makes our contribution capable of handling realistic HPC program functions. In addition to delivering an overall 90x speedup over the previous methods, FPBOXer does not suffer from "self-inflicted" exceptions that are caused by the BO algorithm itself-something that previous tools did. This is achieved through parallel deployments of asynchronous BO searches, which has the beneficial side-effect of improving the GPU-utilization. By using FPBOXer, developers can, for the first time, find exception-causing inputs in realistic HPC programs, as we demonstrate when we apply FPBOXer to NAS, Lampps, CFD, ExaMiniMD, HPCCG, MiniFE, and BDCSVD.

关键词： Floating-point Arithmetic Exceptions Bayesian Optimization High-Performance computing

来源：评论

学校读者我要写书评

暂无评论

Design and Evaluation of GPU-FPX: A Low-Overhead tool for Floating-Point Exception Detection in NVIDIA GPUs 23

Design and Evaluation of GPU-FPX: A Low-Overhead tool for Fl...

引用

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

作者： Li, Xinyi Laguna, Ignacio Fang, Bo Swirydowicz, Katarzyna Li, Ang Gopalakrishnan, Ganesh Univ Utah Kahlert Sch Comp Salt Lake City UT 84112 USA Lawrence Livermore Natl Lab Livermore CA 94550 USA Pacific Northwest Natl Lab Richland WA 99354 USA

ISBN: (纸本)9798400701559

Floating-point exceptions occurring during numerical computations can be a serious threat to the validity of the computed results if they are not caught and diagnosed. Unfortunately, on NVIDIA GPUs-today's most widely used type and which do not have hardware exception traps-this task must be carried out in software. Given the prevalence of closed-source kernels, efficient binary-level exception tracking is essential. It is also important to know how exceptions flow through the code, whether they alter the code's behavior and additionally whether these exceptions can be detected at the program outputs or are killed inside program flow-paths. In this paper, we introduce GPU-FPX, a tool that has low overhead, allows for deep understanding of the origin and flow of exceptions, and also how exceptions are modified by code optimizations. We measure GPU-FPX's performance over 151 widely used GPU programs, detecting 26 serious exceptions that were previously not reported. Our results show that GPU-FPX is 16x faster with respect to the geometric-mean runtime in relation to the only comparable prior tool, while also helping debug a larger class of codes more effectively. GPU-FPX and its benchmarks have been released.

关键词： Floating-point exceptions GPUs High-performance computing Machine Learning Binary Instrumentation Numerical Programs

来源：评论

学校读者我要写书评

暂无评论

Equitable Student Persistence in computing Research Through distributed Career Mentorship 2023

Equitable Student Persistence in Computing Research Through ...

引用

54th Annual acm SIGCSE Technical symposium on Computer Science Education (SIGCSE TS)

作者： Davis, Sloan Rorrer, Audrey Grainger, Cori Moghadam, Sepi Hejazi Google Mountain View CA 94043 USA UNC Charlotte Charlotte NC USA

ISBN: (纸本)9781450394314

Google's CS Research Mentorship Program (CSRMP) cultivates pursuit and persistence in the computing research trajectory for students from historically marginalized groups through virtual career mentorship from industry professionals, a peer community, and just-in-time resources. Since 2018, 287 Google mentors have engaged 1,018 students from 247 institutions in the U.S. and Canada. The program employs socioemotional support and advocacy to navigate systemic barriers by validating students' intersectional identities in order to improve outcomes in core constructs for students: self-efficacy, sense of belonging, research skills, motivation to pursue graduate school and research careers, and intersectional capital. Evaluation outcomes from 400 matched respondents (68% response rate) indicate that CSRMP affects positive, statistically significant change in those constructs that largely persists across demographic subgroups. 80% aim to pursue computing research careers, and significantly fewer students are undecided about their future career. We were also able to identify disaggregated learnings: Black, Indigenous, and Latinx students are significantly less likely to submit to a research conference, and students from Historically Marginalized Groups (defined within) are significantly less likely to apply to a CS graduate program. We discuss key design elements of the program, how the findings are informing future iterations, and the potential for the model to scale.

关键词： computing research graduate school mentorship equity capital intersectionality

来源：评论

学校读者我要写书评

暂无评论

Application Level Fault Diagnosis in Organic computing Using Stress Hormone Propagation 8

Application Level Fault Diagnosis in Organic Computing Using...

引用

8th International symposium on Multidisciplinary Studies and Innovative Technologies, ISMSIT 2024

作者： Nahar, Sabikun Raj, Utkarsh Meckel, Simon Obermaisser, Roman Universität Siegen Siegen Germany

ISBN: (纸本)9798350354423

In the domain of Organic computing, the utilization of biological principles in technical systems has led to the development of decentralized mechanisms like the Artificial Hormone System (AHS). In distributed real-time embedded systems, the AHS serves as middleware, continuously monitoring and organizing task allocations among computing nodes. By introducing different types of artificial hormones for the tasks, task allocations are realized by constantly establishing hormone balances via distributed closed control loops. This process handles the increasing complexity of distributed control systems by enabling self-configuration, -adaptation, -improvement and - healing. However, the occurrence of faults within the artificial hormone system, such as incorrect hormone values, can lead to significant consequences, including adverse system behavior and potentially complete system failure. To mitigate these risks, this paper proposes the integration of stress hormones within the AHS framework, focusing on fault diagnosis at the application level. Utilizing example scenarios generated by the Stanford Network Analysis Platform (SNAP), the efficacy of the stress hormone algorithm has been evaluated. These preliminary findings suggest promising opportunities for improving system resilience and robustness through the integration of stress hormones within the AHS framework. © 2024 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

RAPIDS: Reconciling Availability, Accuracy, and Performance in Managing Geo-distributed Scientific Data 23

RAPIDS: Reconciling Availability, Accuracy, and Performance ...

引用

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

作者： Wan, Lipeng Chen, Jieyang Liang, Xin Gainaru, Ana Gong, Qian Liu, Qing Whitney, Ben Arulraj, Joy Liu, Zhengchun Foster, Ian Klasky, Scott Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Univ Alabama Birmingham Dept Comp Sci Birmingham AL USA Univ Kentucky Dept Comp Sci Lexington KY USA Oak Ridge Natl Lab Oak Ridge TN USA New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Georgia Inst Technol Sch Comp Sci Atlanta GA 30332 USA Argonne Natl Lab Lemont IL USA

ISBN: (纸本)9798400701559

In modern science, big data plays an increasingly important role. Many scientific applications, such as running simulations on supercomputers or conducting experiments on advanced instruments, produce huge amount of data at unprecedented speed. Analyzing and understanding such big data is the key for scientists to make scientific breakthroughs. However, data might become unavailable for scientists to access when outages or maintenance of the storage system occur, which severely hinders scientific discovery. To improve the data availability, data duplication and erasure coding (EC) are often used. But as the scientific data gets larger, using these two methods can cause considerable storage and network overhead. In this paper, we propose RAPIDS, a hybrid approach that combines the multigrid-based error-bounded lossy compression with erasure coding, to significantly reduce the storage and network overhead required for maintaining high data availability. Our experiments show that RAPIDS reduces the storage overhead by up to 7.5x and network overhead by up to 3x to achieve the same level of availability compared to the regular EC method. We improve RAPIDS by building two models to optimize the fault tolerance configurations and data gathering strategy. We demonstrate that RAPIDS significantly improves performance when running on many CPU cores in parallel or on GPUs.

关键词： scientific data Management data availability

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: An Improved distributed Approximate Single-Source Shortest Paths Algorithm 21

Brief Announcement: An Improved Distributed Approximate Sing...

引用

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

作者： Cao, Nairen Fineman, Jeremy T. Russell, Katina Georgetown Univ Washington DC 20007 USA

ISBN: (纸本)9781450385480

This brief announcement presents an algorithm for (1 + epsilon) approximate single-source shortest paths for directed graphs with non-negative real edge weights in the CONGEST model that runs in (O) over tilde (n(1/2) + D + n(2/5)(+o)((1)) D-2/5) log W/epsilon(2)) rounds, where W is the ratio between the largest and smallest non-zero edge weights.

关键词： distributed algorithm congest model shortest paths

来源：评论

学校读者我要写书评

暂无评论

CereSZ: Enabling and Scaling Error-bounded Lossy Compression on Cerebras CS-2 24

CereSZ: Enabling and Scaling Error-bounded Lossy Compression...

引用

33rd International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Song, Shihui Huang, Yafan Jiang, Peng Yu, Xiaodong Zheng, Weijian Di, Sheng Cao, Qinglei Feng, Yunhe Xie, Zhen Cappello, Franck Univ Iowa Iowa City IA USA Stevens Inst Technol Hoboken NJ USA Argonne Natl Lab Lemont IL USA St Louis Univ St Louis MO USA Univ North Texas Denton TX USA Binghamton Univ Binghamton NY USA

ISBN: (纸本)9798400704130

Today's scientific applications running on supercomputers produce large volumes of data, leading to critical data storage and communication challenges. To tackle the challenges, error-bounded lossy compression is commonly adopted since it can reduce data size drastically within a user-defined error threshold. Previous work has shown that compression techniques can significantly reduce the storage and I/O overhead while retaining good data quality. However, the existing compressors are mainly designed for CPU and GPU. As new AI chips are being incorporated into supercomputers and increasingly used for accelerating scientific computing, there is a growing demand for efficient data compression on the new architecture. In this paper, we propose an efficient lossy compressor, CereSZ, based on the Cerebras CS-2 system. The compression algorithm is mapped onto Cerebras using both data parallelism and pipeline parallelism. In order to achieve a balanced workload on each processing unit, we propose an algorithm to evenly distribute the pipeline stages. Our experiments with six scientific datasets demonstrate that CereSZ can achieve a throughput from 227.93 GB/s to 773.8 GB/s, 2.43x to 10.98x faster than existing GPU compressors.

关键词： Error-bounded Lossy Compression AI-Optimized Architecture Parallel computing Scientific Simulation High-speed Compressor

来源：评论

学校读者我要写书评

暂无评论

A distributed software architecture based on reactive microservices for the Smart Building context 23

A distributed software architecture based on reactive micros...

引用

12th Latin-American symposium on Dependable and Secure computing (LADC)

作者： Freire, Gustavo Mota Curasma, Herminio Paucar Estrella, Julio Cezar ICMC USP Sao Carlos SP Brazil

ISBN: (纸本)9798400708442

Given the increasing urbanization of the world's population, Smart Building (SB) technologies can improve living conditions and sustainability. This article investigates distributed Software Architecture (DSA) use in SBs, guided by the Reactive Manifesto (RM) principles and Cloud Patterns. The proposed DSA, offers scalability, lower latency, distributed processing, flexibility, and enhanced security, aims for adaptability, cost-effectiveness, and high performance. The research follows a two-phase development process involving scenario simulations and deployment at the Laboratory of distributed Systems and Concurrent Programming (LaSDPC) at ICMC-USP. The paper proposes a cloud-based system with low operational costs that caters to different use cases. By delivering a design in line with the latest distributed software engineering best practices for IoT applications, we aim to contribute to this field. The architecture will be tested in real-world settings at LaSDPC, with potential applications in smart homes and Industry 4.0.

关键词： reactive architecture software architecture reactive manifesto IoT

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal distributed Degree+1 Coloring 2022

Near-Optimal Distributed Degree+1 Coloring

引用

54th Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Halldorsson, Magnus M. Kuhn, Fabian Nolin, Alexandre Tonoyan, Tigran Reykjavik Univ Reykjavik Iceland Univ Freiburg Freiburg Germany Krisp Technol Inc Yerevan Armenia

ISBN: (纸本)9781450392648

We present a new approach to randomized distributed graph coloring that is simpler and more efficient than previous ones. In particular, it allows us to tackle the (deg +1)-list-coloring (D1LC) problem, where each node upsilon of degree dv is assigned a palette of d(upsilon)+ 1 colors, and the objective is to find a proper coloring using these palettes. While for (Delta+ 1)-coloring (where Delta is the maximum degree), there is a fast randomized distributed O(log(3) logn)-round algorithm due to Chang, Li, and Pettie, no o(logn)-round algorithms are known for the D1LC problem. We give a randomized distributed algorithm for D1LC that is optimal under plausible assumptions about the deterministic complexity of the problem. Using the recent deterministic algorithm of Ghaffari and Kuhn, our algorithm runs inO(log3 logn) time, matching the best bound known for (Lambda + 1)-coloring. A key contribution is a subroutine to generate slack for D1LC, which almost immediately leads to a palette sparsification theorem for D1LC when placed into the framework of works by Assadi, Chen, and Khanna and Alon and Assadi. That gives fast algorithms for D1LC in three different models: an O(1)-round algorithm in the MPC model with O(n) memory per machine;a single-pass semi-streaming algorithm in dynamic streams;and an O(n root n)-time query algorithm.

关键词： distributed randomized graph coloring palette size LOCAL model

来源：评论

学校读者我要写书评

暂无评论

TreeSLS: A Whole-system Persistent Microkernel with Tree-structured State Checkpoint on NVM 23

TreeSLS: A Whole-system Persistent Microkernel with Tree-str...

引用

29th acm symposium on Operating Systems principles (SOSP)

作者： Wu, Fangnuo Dong, Mingkai Mo, Gequan Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst SEIEE Shanghai Peoples R China Minist Educ Engn Res Ctr Domain Specif Operating Syst Beijing Peoples R China

ISBN: (纸本)9798400702297

Whole-system persistence promises simplified application deployment and near-instantaneous recovery. This can be implemented using single-level store (SLS) through periodic checkpointing of ephemeral state to persistent devices. However, traditional SLSs suffer from two main issues on checkpointing efficiency and external synchrony, which are critical for low-latency services with persistence need. In this paper, we note that the decentralized state of microkernel-based systems can be exploited to simplify and optimize state checkpointing. To this end, we propose TreeSLS, a whole-system persistent microkernel that simplifies the whole-system state maintenance to a capability tree and a failure-resilient checkpoint manager. TreeSLS further exploits the emerging non-volatile memory to minimize checkpointing pause time by eliminating the distinction between ephemeral and persistent devices. With efficient state maintenance, TreeSLS further proposes delayed external visibility to provide transparent external synchrony with little overhead. Evaluation on microbenchmarks and real-world applications (e.g., Memcached, Redis and RocksDB) show that TreeSLS can complete a whole-system persistence in around 100 mu s and even take a checkpoint every 1 ms with reasonable overhead to applications.

关键词： Single-Level Store Microkernel Non-volatile Memory Checkpoint/Restore Transparent Persistence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：