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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,938 篇 会议
406 篇 期刊文献
28 册 图书

馆藏范围

11,372 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,442 篇 工学
- 5,213 篇 计算机科学与技术...
- 2,511 篇 软件工程
- 863 篇 电气工程
- 688 篇 信息与通信工程
- 350 篇 电子科学与技术（可...
- 328 篇 控制科学与工程
- 186 篇 网络空间安全
- 58 篇 机械工程
- 56 篇 生物医学工程（可授...
- 55 篇 动力工程及工程热...
- 49 篇 生物工程
- 48 篇 建筑学
- 43 篇 仪器科学与技术
- 39 篇 光学工程
- 38 篇 土木工程
- 37 篇 测绘科学与技术
- 33 篇 力学（可授工学、理...
- 32 篇 安全科学与工程
1,324 篇 理学
- 1,122 篇 数学
- 151 篇 统计学（可授理学、...
- 106 篇 物理学
- 104 篇 系统科学
- 63 篇 生物学
- 44 篇 化学
- 38 篇 地球物理学
996 篇 管理学
- 835 篇 管理科学与工程(可...
- 304 篇 工商管理
- 196 篇 图书情报与档案管...
64 篇 经济学
- 63 篇 应用经济学
34 篇 法学
- 33 篇 社会学
24 篇 医学
21 篇 农学
9 篇 教育学
4 篇 文学
1 篇 军事学

主题

1,684 篇 parallel process...
1,192 篇 concurrent compu...
1,134 篇 distributed comp...
1,041 篇 distributed proc...
996 篇 computer science
901 篇 computer archite...
823 篇 computational mo...
751 篇 application soft...
684 篇 hardware
521 篇 parallel algorit...
497 篇 parallel program...
475 篇 runtime
462 篇 algorithm design...
441 篇 processor schedu...
433 篇 graphics process...
426 篇 parallel process...
419 篇 conferences
419 篇 scalability
395 篇 libraries
366 篇 costs

机构

33 篇 ibm thomas j. wa...
31 篇 school of comput...
27 篇 college of compu...
25 篇 oak ridge nation...
23 篇 oak ridge natl l...
22 篇 pacific northwes...
22 篇 oak ridge nation...
20 篇 argonne national...
19 篇 department of co...
18 篇 georgia inst tec...
18 篇 pacific northwes...
17 篇 department of co...
17 篇 virginia tech de...
16 篇 department of co...
16 篇 department of co...
16 篇 department of co...
15 篇 school of comput...
15 篇 sandia national ...
15 篇 georgia institut...
14 篇 department of co...

作者

38 篇 jack dongarra
29 篇 dongarra jack
24 篇 bader david a.
21 篇 nakano koji
20 篇 a. choudhary
19 篇 feng wu-chun
19 篇 p. sadayappan
18 篇 zomaya albert y.
16 篇 hoefler torsten
16 篇 schulz martin
15 篇 ito yasuaki
15 篇 s.k. das
15 篇 azad ariful
15 篇 talbi el-ghazali
14 篇 gagan agrawal
14 篇 h.j. siegel
14 篇 prasad sushil k.
14 篇 david a. bader
13 篇 s. ranka
13 篇 kishore kothapal...

语言

11,324 篇 英文
31 篇 其他
17 篇 中文

检索条件"任意字段=International Parallel and Distributed Processing Symposium"

共 11372 条记录，以下是161-170 订阅

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

详细简洁

排序：

Efficient parallel PageRank Algorithm for Network Analysis 36

Efficient Parallel PageRank Algorithm for Network Analysis

引用

36th IEEE international parallel and distributed processing symposium (IEEE IPDPS)

作者： Vandromme, Maxence Petiton, Serge G. Univ Lille CNRS UMR CRIStAL 9189 Lille France

ISBN: (纸本)9781665497473

We propose an efficient version of the PageRank algorithm for adjacency matrices, that reduces the complexity by a factor two. This method computes the A(T)x operation on the transpose matrix A(T) without having to explicitly normalize and transpose the matrix. We implement the method using standard row-major and column-major matrix storage formats. We perform experiments with parallel implementations in OpenMP, on synthetic data as well as on matrices extracted from large-scale graphs. The experiments are done on two different Intel processors from recent generations. The column-major storage format version of our method shows good scaling and outperforms the standard PageRank in a majority of cases, even when not considering the preprocessing burden in the latter.

关键词： distributed processing Instruction sets Scalability Memory management Graphics processing units Network analyzers Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Accelerating BFT Database with Transaction Reconstruction

Accelerating BFT Database with Transaction Reconstruction

引用

1st international Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： Kida, Aoi Kawashima, Hideyuki Keio Univ Yokohama Kanagawa Japan

ISBN: (纸本)9798350364613;9798350364606

Data stores utilized in modern data-intensive applications are expected to demonstrate rapid read and write capabilities and robust fault tolerance. Byzantine fault-tolerant database (BFT database) can execute transactions concurrently and tolerate arbitrary faults (Byzantine fault). We consider cryptographic and communication processing as performance bottlenecks in the transaction processing of BFT databases. This paper presents a transaction reconstruction method, reconstructing a single transaction from multiple transactions to streamline cryptographic and communication processes. We evaluated the proposed method with Basil (state-of-the-art BFT database) in experiments. In an environment where nodes are geographically centralized, the proposed method demonstrates up to approximately 2.5 times higher throughput and reduces latency by up to about 30% than vanilla Basil. In an environment where nodes are geographically distributed, the proposed method demonstrates up to approximately 50 times higher throughput and reduces latency by up to about 75% than vanilla Basil.

关键词： Byzantine fault tolerance distributed database Transaction processing

来源：评论

学校读者我要写书评

暂无评论

Research on distributed Intelligent Node

Research on Distributed Intelligent Node

引用

Asia-Pacific international symposium on Aerospace Technology (APISAT)

作者： Yu, Ming Niu, Wei Zhao, Jianping AVIC Xian Aeronaut Comp Tech Res Inst Xian Peoples R China

ISBN: (纸本)9789819740000;9789819739981;9789819739974

The aero-engine distributed control system can overcome the problems of high complexity, long development cycle, poor maintainability, difficult iterative verification, low computing power, and excessive weight and volume of the centralized control system. It will become an important trend in the future engine control methods. The sensor intelligent node is a key node of the distributed control system, which can effectively improve the quality of signal processing, reduce the computing burden of the FADEC system, improve the maturity and maintainability of the system, and shorten the development cycle of the FADEC system. This paper proposes a general architecture of sensor intelligent nodes, based on switch matrix and SoC processor, which can adapt to different types and quantities of engine monitoring sensors. This architecture can complete the parallel high-speed acquisition and processing of multi-channel sensor signals. It can be connected to the distributed control system as a distributed bus node, and it can realize the fault diagnosis of signal conditioning and acquisition based on the surround BIT, and support the intelligent algorithm of sensor fault diagnosis. Based on multiple linear regression, neural network intelligent algorithm and embedded temperature sensor, the sensor intelligent node can perform temperature compensation and calibration for sensor signal acquisition. It can improve signal acquisition accuracy and anti-interference ability greatly, and provide a strong guarantee for the performance improvement of the control system.

关键词： distributed control FADEC Intelligent node Sensor

来源：评论

学校读者我要写书评

暂无评论

Interactive textbooks for parallel and distributed computing across the undergraduate CS curriculum

Interactive textbooks for parallel and distributed computing...

引用

1st international Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： Shoop, Elizabeth Brown, Richard Matthews, Suzanne J. Adams, Joel C. Macalester Coll St Paul MN 55105 USA St Olaf Coll Northfield MN 55057 USA US Mil Acad West Point NY 10996 USA Calvin Univ Grand Rapids MI USA

ISBN: (纸本)9798350364613;9798350364606

It has been a decade since the ACM/IEEE CS2013 Curriculum guidelines recommended that all CS students learn about parallel and distributed computing (PDC). But few textbooks for "core" CS courses especially first-year courses include coverage of PDC topics. To fill this gap, we have written free, online, beginner- and intermediate-level PDC textbooks, containing interactive C/C++ OpenMP, MPI, mpi4py, CUDA, and OpenACC code examples that students can run and modify directly in the browser. The books address a serious challenge to leaching PDC concepts, namely, easy access to the powerful hardware needed for observing patterns and scalability. This paper describes the content of these textbooks and the underlying infrastructure that make them possible. We believe the described textbooks fill a critical gap in PDC education and will be very useful for the community.

关键词： C C plus computing education interactive MPI OpenACC OpenMP parallel software textbook

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Log Understanding and Analysis 24

Semantic-Aware Log Understanding and Analysis

引用

33rd international symposium on High-Performance parallel and distributed Computing (HPDC)

作者： Huang, Shaohan Luan, Zhongzhi Beihang Univ Beijing Peoples R China

ISBN: (纸本)9798400704130

The exponential growth in system complexity and the corresponding surge in log data volume necessitate advanced log analysis techniques for efficient system management and anomaly detection. Traditional log understanding and analysis methods often fail to capture the rich semantic context inherent in log messages, leading to suboptimal monitoring and diagnostic capabilities. This paper aims to bridge the semantic gap by integrating cutting-edge semantic technologies into the log analysis pipeline. We leverage natural language processing, information retrieval, and large language models to enrich log data with semantic information, facilitating a deeper understanding of log messages. Our methodology enhances anomaly detection accuracy by utilizing hierarchical contextual information and pre-training technology, and refining log-based QA processes by log retrieval and log reader. Preliminary results demonstrate a significant improvement in identifying and diagnosing system anomalies, as well as in the automated answering log questions. This research not only presents a breakthrough in log data analysis but also sets the stage for future advancements in intelligent system monitoring and proactive fault resolution. Through this semantic-aware approach, we envision a new paradigm in log analysis that transcends traditional machine learning methods, offering a more robust and intuitive understanding of system behaviors and states.

关键词： Semantic-Aware Analysis Log Understanding Natural Language processing Anomaly Detection Log Parsing

来源：评论

学校读者我要写书评

暂无评论

Caching Support for CHFS Node-local Persistent Memory File System 36

Caching Support for CHFS Node-local Persistent Memory File S...

引用

36th IEEE international parallel and distributed processing symposium (IEEE IPDPS)

作者： Tatebe, Osamu Ohtsuji, Hiroki Univ Tsukuba Tsukuba Ibaraki Japan Fujitsu Ltd Kawasaki Kanagawa Japan

ISBN: (纸本)9781665497473

In this study, we designed a caching parallel file system for node-local persistent memory. The caching parallel file system improves access performance to the backend parallel file system in a way transparent to users. Although existing caching parallel file systems succeed in improving bandwidth, the performance of metadata is limited by that of the backend parallel file system. Based on the CHFS ad hoc parallel and distributed file system, our system maintains the high metadata performance of CHFS by relaxing the consistency with the backend system in easy-to-understand semantics. Upon implementation, our system's performance was evaluated using the 10500 benchmark, and was found to exhibit almost identical performance to that of the original CHFS. This shows that it is possible to realize a caching parallel file system without sacrificing metadata performance.

关键词： caching file system parallel file system persistent memory

来源：评论

学校读者我要写书评

暂无评论

Automated Calibration of parallel and distributed Computing Simulators: A Case Study

Automated Calibration of Parallel and Distributed Computing ...

引用

1st international Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： McDonald, Jesse Horzela, Maximilian Suter, Frederic Casanova, Henri Univ Hawaii Manoa Honolulu HI 96822 USA Karlsruhe Inst Technol Karlsruhe Germany Oak Ridge Natl Lab Oak Ridge TN USA

ISBN: (纸本)9798350364613;9798350364606

Many parallel and distributed computing research results are obtained in simulation, using simulators that mimic real-world executions on some target system. Each such simulator is configured by picking values for parameters that define the behavior of the underlying simulation models it implements. The main concern for a simulator is accuracy: simulated behaviors should be as close as possible to those observed in the real-world target system. This requires that values for each of the simulator's parameters be carefully picked, or "calibrated," based on ground truth real-world executions. Examining the current state of the art shows that simulator calibration, at least in the field of parallel and distributed computing, is often undocumented (and thus perhaps often not performed) and, when documented, is described as a labor-intensive, manual process. In this work we evaluate the benefit of automating simulation calibration using simple algorithms. Specifically, we use a real-world case study from the field of High Energy Physics and compare automated calibration to calibration performed by a domain scientist. Our main finding is that automated calibration is on par with or significantly outperforms the calibration performed by the domain scientist. Furthermore, automated calibration makes it straightforward to operate desirable trade-offs between simulation accuracy and simulation speed.

关键词： Simulation of distributed computing platforms and applications Simulation accuracy and scalability Simulation calibration

来源：评论

学校读者我要写书评

暂无评论

An Efficient parallel Implementation of a Perfect Hashing Method for Hypergraphs 36

An Efficient Parallel Implementation of a Perfect Hashing Me...

引用

36th IEEE international parallel and distributed processing symposium (IEEE IPDPS)

作者： Singh, Somesh Ucar, Bora Univ Lyon ENS Lyon INRIA Lyon France Univ Lyon ENS Lyon INRIA LIP CNRS Lyon France Univ Lyon ENS Lyon INRIA CNRS Lyon France

ISBN: (纸本)9781665497473

Querying the existence of an edge in a given graph or hypergraph is a building block in several algorithms. Hashing-based methods can be used for this purpose, where the given edges are stored in a hash table in a preprocessing step, and then the queries are answered using the lookup operations. While the general hashing methods have fast lookup times in the average case, the worst case run time is much higher. Perfect hashing methods take advantage of the fact that the items to be stored are all available and construct a collision free hash function for the given input, resulting in an optimal lookup time even in the worst case. We investigate an efficient shared-memory parallel implementation of a recently proposed perfect hashing method for hypergraphs. We experimentally compare the resulting parallel algorithms with the state-of-the-art and demonstrate better run time and scalability on a set of hypergraphs corresponding to real-life sparse tensors.

关键词： Hash functions distributed processing Tensors Scalability Conferences Sparse matrices parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication-efficient Massively distributed Connected Components 36

Communication-efficient Massively Distributed Connected Comp...

引用

36th IEEE international parallel and distributed processing symposium (IEEE IPDPS)

作者： Lamm, Sebastian Sanders, Peter Karlsruhe Inst Technol Inst Theoret Informat Karlsruhe Germany

ISBN: (纸本)9781665481069

Finding the connected components of an undirected graph is one of the most fundamental graph problems. Connected components are used in a wide spectrum of applications including VLSI design, machine learning and image analysis. Sequentially, one can easily find all connected components in linear time using breadth-first traversal. However, in a massively distributed setting, finding connected components in a scalable way becomes much harder due to data irregularities and the overhead associated with the increased need for communication. In this work, we present a communication-efficient distributed graph algorithm for finding connected components that scales to massively parallel machines. Our algorithm is based on a recent linear-work shared-memory parallel algorithm by Blelloch et al. [1] and refines it for a distributed memory setting. This includes a communication-efficient graph contraction procedure, as well as a distributed variant of the low diameter decomposition by Miller et al. [2]. We tackle the data irregularities introduced by high degree vertices by using an efficient procedure for distributing their incident edges. Our experimental evaluation on up to 16 384 cores indicates a good weak scaling behavior that outperforms current state-of-the-art algorithms.

关键词： graph algorithms distributed algorithms communication efficiency graph connectivity

来源：评论

学校读者我要写书评

暂无评论

Helping Faculty Teach Software Performance Engineering

Helping Faculty Teach Software Performance Engineering

引用

1st international Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： Owens, John D. Hoppe, Bruce Univ Calif Davis Dept Elect & Comp Engr Davis CA 95616 USA Connect Associates Arlington MA USA

ISBN: (纸本)9798350364613;9798350364606

Over the academic year 2022-23, we discussed the teaching of software performance engineering with more than a dozen faculty across North America and beyond. Our outreach was centered on research-focused faculty with an existing interest in this course material. These discussions revealed an enthusiasm for making software pertimmance engineering a more prominent part of a curriculum for computer scientists and engineers. Here, we discuss how MIT's longstanding efforts in this area may serve as a launching point for community development of a software performance engineering curriculum, challenges in and solutions for providing the necessary infrastructure to universities, and future directions.

关键词： Performance distributed parallel cluster computing data structures and algorithms software performance engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：