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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,925 篇 会议
282 篇 期刊文献
26 册 图书
1 篇 科技报告

馆藏范围

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

日期分布

学科分类号

5,466 篇 工学
- 5,207 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 885 篇 电气工程
- 573 篇 信息与通信工程
- 252 篇 控制科学与工程
- 221 篇 电子科学与技术（可...
- 137 篇 网络空间安全
- 91 篇 机械工程
- 60 篇 生物工程
- 58 篇 动力工程及工程热...
- 52 篇 生物医学工程（可授...
- 46 篇 环境科学与工程（可...
- 45 篇 仪器科学与技术
- 41 篇 安全科学与工程
- 40 篇 建筑学
- 40 篇 测绘科学与技术
- 34 篇 化学工程与技术
- 33 篇 土木工程
- 32 篇 交通运输工程
1,033 篇 理学
- 813 篇 数学
- 121 篇 系统科学
- 116 篇 统计学（可授理学、...
- 83 篇 物理学
- 70 篇 生物学
- 48 篇 化学
- 41 篇 地球物理学
988 篇 管理学
- 843 篇 管理科学与工程(可...
- 285 篇 工商管理
- 176 篇 图书情报与档案管...
57 篇 经济学
- 54 篇 应用经济学
36 篇 法学
26 篇 医学
21 篇 农学
9 篇 教育学
6 篇 文学
3 篇 艺术学
2 篇 军事学

主题

1,705 篇 concurrent compu...
1,583 篇 distributed comp...
1,152 篇 parallel process...
986 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
725 篇 grid computing
598 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
456 篇 resource managem...
428 篇 scalability
399 篇 costs
395 篇 bandwidth
394 篇 runtime
383 篇 parallel program...
367 篇 peer to peer com...
356 篇 delay

机构

47 篇 college of compu...
40 篇 institute of com...
30 篇 oak ridge natl l...
29 篇 ibm thomas j. wa...
25 篇 institute of com...
23 篇 inria
23 篇 oak ridge nation...
22 篇 school of comput...
21 篇 mathematics and ...
18 篇 argonne natl lab...
18 篇 department of co...
18 篇 department of co...
18 篇 tokyo institute ...
17 篇 department of co...
17 篇 georgia inst tec...
17 篇 iit dept comp sc...
16 篇 univ chinese aca...
16 篇 lawrence berkele...
16 篇 department of co...
15 篇 department of co...

作者

32 篇 dongarra jack
30 篇 jack dongarra
23 篇 p. sadayappan
21 篇 a. choudhary
21 篇 david a. bader
20 篇 maciejewski anth...
19 篇 feng wu-chun
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
17 篇 panda dhabaleswa...
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 hai jin
14 篇 gopalakrishnan g...
14 篇 alexey lastovets...

语言

11,156 篇 英文
68 篇 其他
10 篇 中文

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

共 11234 条记录，以下是521-530 订阅

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

详细简洁

排序：

Real-Time Routing in Traffic Simulations: A distributed Event Processing Approach

Real-Time Routing in Traffic Simulations: A Distributed Even...

引用

international symposium on parallel and distributed computing

作者： Paul Heinrich Janek Laudan Kai Nagel Transport Systems Planning and Transport Telematics Technical University of Berlin Germany

ISBN: (数字)9798350369199

ISBN: (纸本)9798350369205

This paper explores the integration of distributed event processing in the context of real-time routing within a parallel transportation simulation framework for the Multi-Agent Transport Simulation (MATSim). A novel simulation prototype, utilizing Rust and MPI, demonstrates significant re-ductions in computation time by applying domain decomposition of the network and assigning each part to a separate process. However, sharing and processing events within this setup remains challenging. We present a proof of concept for integrating distributed event processing. Our evaluation has shown that realtime routing significantly increases simulation runtime because uneven distribution of routing requests increases load imbalances and makes speedups less efficient. Sharing event data between processes benefits from smaller subdomains. However, global synchronization for sharing data leads to waiting times introduced by load imbalances.

关键词： Runtime Transportation Prototypes Information sharing Routing Real-time systems Synchronization distributed computing

来源：评论

学校读者我要写书评

暂无评论

distributed-Memory Sparse Kernels for Machine Learning 36

Distributed-Memory Sparse Kernels for Machine Learning

引用

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

作者： Bharadwaj, Vivek Buluc, Aydin Demmel, James Univ Calif Berkeley EECS Dept Berkeley CA 94720 USA Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA USA

ISBN: (纸本)9781665481069

Sampled Dense Times Dense Matrix Multiplication (SDDMM) and Sparse Times Dense Matrix Multiplication (SpMM) appear in diverse settings, such as collaborative filtering, document clustering, and graph embedding. Frequently, the SDDMM output becomes the input sparse matrix for a subsequent SpMM operation. Existing work has focused on shared memory parallelization of these primitives. While there has been extensive analysis of communication-minimizing distributed 1.5D algorithms for SpMM, no such analysis exists for SDDMM or the back-to-back sequence of SDDMM and SpMM, termed FusedMM. We show that distributed memory 1.5D and 2.5D algorithms for SpMM can be converted to algorithms for SDDMM with identical communication costs and input / output data layouts. Further, we give two communication-eliding strategies to reduce costs further for FusedMM kernels: either reusing the replication of an input dense matrix for the SDDMM and SpMM in sequence, or fusing the local SDDMM and SpMM kernels. We benchmark FusedMM algorithms on Cori, a Cray XC40 at LBNL, using ***-Renyi random matrices and large real-world sparse matrices. On 256 nodes with 68 cores each, 1.5D FusedMM algorithms using either communication eliding approach can save at least 30% of time spent exclusively in communication compared to executing a distributed-memory SpMM and SDDMM kernel in sequence. Our 2.5D communication-eliding algorithms save 21% of communication time compared to the unoptimized sequence. On real-world matrices with hundreds of millions of edges, all of our algorithms exhibit at least a 10x speedup over the SpMM algorithm in PETSc. On these matrices, our communication-eliding techniques exhibit runtimes up to 1.6 times faster than an unoptimized sequence of SDDMM and SpMM. We embed and test the scaling of our algorithms in real-world applications, including collaborative filtering via alternating-least-squares and inference for attention-based graph neural networks.

关键词： SDDMM SpMM FusedMM Communication Avoiding Algorithms

来源：评论

学校读者我要写书评

暂无评论

Lifting and Dropping VMs to Dynamically Transition Between Time- and Space-sharing for Large-Scale HPC Systems 22

Lifting and Dropping VMs to Dynamically Transition Between T...

引用

31st international symposium on High-Performance parallel and distributed computing (HPDC)

作者： Gordon, Nicholas Lange, John R. Univ Pittsburgh Pittsburgh PA 15260 USA Oak Ridge Natl Lab Oak Ridge TN USA

ISBN: (纸本)9781450391993

As HPC environments increasingly integrate with edge based systems, system architectures will need to handle a broader class of workloads and scheduling requirements. One result of this shift will be the need to simultaneously support bulk-synchronous parallel (BSP) and on-demand service based applications on the same infrastructure. This in turn will require that future resource management approaches utilize both space-shared as well as time-shared resource scheduling strategies. In this work we introduce the concept of "VM-lifting" (and its inverse "VM-Dropping") which allows dynamically switching an HPC workload between space-shared and time-shared scheduling regimes. Our work targets co-kernel based HPC system software environments, in which multiple specialized OS kernels execute natively on dedicated physical resource partitions inside a single compute node. With VM-lifting, a native co-kernel can be migrated at runtime to and from locally hosted Virtual Machine Environments due to changing scheduling requirements of the node. This allows an HPC node to be dynamically (re-)configured as either a time-shared Infrastructure-as-a-Service (IaaS) resource or a dedicated space shared resource based on the current workload demands. We have implemented this approach in the context of the Hobbes Exascale System Software stack and have demonstrated that a node can be reconfigured with minimal impact on the running applications.

关键词： High Performance computing Operating Systems Virtualization

来源：评论

学校读者我要写书评

暂无评论

Efficient Real-time Earliest Deadline First based scheduling for Apache Spark 20

Efficient Real-time Earliest Deadline First based scheduling...

引用

20th international symposium on parallel and distributed computing (ISPDC)

作者： Neciu, Laurentiu-Florin Pop, Florin Apostol, Elena-Simona Truica, Ciprian-Octavian Univ Politehn Bucuresti Bucharest Romania Natl Inst Res & Dev Informat ICI Bucharest Bucharest Romania

ISBN: (纸本)9781665432818

Apache Spark is a distributed computing framework for fast in-memory data analysis, Machine Learning jobs, and SQL queries that employs Resilient distributed Dataset for distributing data and Directed Acyclic Graph for scheduling computations. Currently, Spark provides two scheduling policies for tasks pending execution: a First In First Out policy and a FAIR policy, providing no support for deadline-based real-time scheduling. In this paper, we present a new system designed to accept deadlines for heterogeneous Spark Jobs and perform a real-time scheduling policy based on Earliest Deadline First (EDF). To showcase the efficiency of our scheduling policy, we compare and analyze the performance of our solution with the current Spark execution policies in terms of job lateness. We empirically prove that our real-time policy provides much lower lateness given suitable

关键词： Real-time Scheduling Apache Spark Real-Time Earliest Deadline First Resilient distributed Dataset Directed Acyclic Graph

来源：评论

学校读者我要写书评

暂无评论

Keynote: Future Workloads Drive the Need for High Performant and Adaptive computing Hardware

Keynote: Future Workloads Drive the Need for High Performant...

引用

international symposium on parallel and distributed Processing (IPDPS)

Keynote.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Adaptive Fault-tolerant Routing Based on an Improved Local Security Information Model of the Exchanged Hypercube 21

The Adaptive Fault-tolerant Routing Based on an Improved Loc...

引用

21st IEEE international symposium on parallel and distributed Processing with Applications, 13th IEEE international Conference on Big Data and Cloud computing, 16th IEEE international Conference on Social computing and Networking and 13th international Conference on Sustainable computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Zhang, Yazhi Luo, Chuanwen Wang, Guijuan Zhang, Li Lv, Mengjie Yu, Jiguo Qilu University of Technology School of Computer Science and Technology Jinan China Beijing Forestry University School of Information Science and Technology Beijing China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Nanjing University of Posts and Telecommunications College of Computer Nanjing China Qilu University of Technology Shandong Academy of Sciences Big Data Research Institute Jinan China

ISBN: (纸本)9798350329223

With the increasing amount of computation in high-performance computing, the scale of interconnection networks is becoming larger and larger. It is inevitable that processors or links in the network become faulty. Therefore, it is very important for a processor to understand the security status of itself and neighbors, and then adaptively and reliably communicate. However, the existing security information models consider faulty processors or faulty links separately, and do not consider the situation where both processors and links fail simultaneously. The Exchanged Hypercube is an excellent interconnection network structure which achieves a balance between network functionality and hardware overhead while preserving many excellent properties of the Hypercube. In this paper, we propose an adaptive fault-tolerant routing algorithm of the Exchanged Hypercube based on an improved local security information model, which considers the faulty processors and faulty links simultaneously. This algorithm always can select suitable processors for routing based on the local security information and unsafe coefficients of processors, which greatly reduces the impact of the faulty of networks. The adaptive fault-tolerant routing algorithm of the Exchanged Hypercube network is not only suitable for regular networks but also for heterogeneous networks since the Exchanged Hypercube is a semi regular network. Sufficient experimental results show that the algorithm proposed in this paper has a lower packet loss rate, a higher success rate, and a shorter average path length. © 2023 IEEE.

关键词： Hypercube networks

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed Task-Based Kirchhoff Seismic Pre-Stack Depth Migration Application 20

Parallel and Distributed Task-Based Kirchhoff Seismic Pre-St...

引用

20th international symposium on parallel and distributed computing (ISPDC)

作者： Gurhem, Jerome Calandra, Henri Petiton, Serge G. Univ Lille UMR 9189 CRIStAL CNRS Lille France CNRS USR 3441 Maison Simulat Saclay France Total SA Pau France

ISBN: (纸本)9781665432818

Since the middle of the 1990s, message passing libraries are the most used technology to implement parallel and distributed scientific applications. However, they may not be a solution efficient enough on exascale machines since scalability issues will appear due to the increase in computing resources. Task-based programming models can be used to avoid collective communications like reductions, broadcast, or gather by transforming them into multiple operations on tasks. Then, these operations can be scheduled by the programming scheduler to place the data and computations in a way that optimizes and reduces the data communications. These properties could help to solve some MPI and exascale computing challenges. The oil and gas applications could also benefit from task-based programming properties. We developed a simplified version of the Kirchhoff seismic pre-stack depth migration, a subsurface exploration application, to experiment with HPX, a task-based programming model as well and MPI and MPI+OpenMP. Then, we perform strong scaling and weak scaling experiments on Pangea, Total supercomputer. We also study the variation of the number of OpenMP threads per MPI process. We show that the current task-based programming model schedulers lack the capability to completely manage the memory used and are not efficient enough to reduce the data migrations.

关键词： Kirchhoff Seismic Pre-Stack Depth Migration Task-Based Programming parallel and distributed Application

来源：评论

学校读者我要写书评

暂无评论

A Cholesky QR type algorithm for computing tall-skinny QR factorization with column pivoting

A Cholesky QR type algorithm for computing tall-skinny QR fa...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Takeshi Fukaya Yuji Nakatsukasa Yusaku Yamamoto Hokkaido University Sapporo Hokkaido Japan University of Oxford Oxford UK The University of Electro-Communications Chofu Tokyo Japan

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

We consider computing the QR factorization with column pivoting (QRCP) for a tall and skinny matrix, which has important applications including low-rank approximation and rank determination. Motivated by recent progresses of Cholesky QR type algorithms for tall-skinny QR factorization (without pivoting), we propose a new Cholesky QR type algorithm for tall-skinny QRCP, which we call Iterative Cholesky QR with Column Pivoting (Ite-CholQR-CP). Through performance evaluation, it is confirmed that Ite-CholQR-CP provides a solution as accurate as that by Householder QR with column pivoting (HQR-CP), which is a widely-used conventional algorithm. In addition, Ite-CholQR-CP outperforms HQR-CP in execution time in single node and distributed parallel computations: up to 45x (single node computation) and 27x (distributed parallel computation) speedup.

关键词： Performance evaluation distributed processing Accuracy High performance computing Approximation algorithms Iterative algorithms Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2020 IEEE 34th international parallel and distributed Processing symposium, IPDPS 2020

Proceedings - 2020 IEEE 34th International Parallel and Dist...

引用

34th IEEE international parallel and distributed Processing symposium, IPDPS 2020

ISBN: (纸本)9781728168760

The proceedings contain 110 papers. The topics discussed include: SSDKeeper: self-adapting channel allocation to improve the performance of SSD devices;a study of graph analytics for massive datasets on distributed multi-GPUs;DPF-ECC: accelerating elliptic curve cryptography with floating-point computing power of GPUs;inter-job scheduling of high-throughput material screening applications;learning an effective charging scheme for mobile devices;improving transactional code generation via variable annotation and barrier elision;solving the container explosion problem for distributed high throughput computing;CycLedger: a scalable and secure parallel protocol for distributed ledger via sharding;DAG-aware joint task scheduling and cache management in spark clusters;and understanding the interplay between hardware errors and user job characteristics on the Titan supercomputer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards End-to-End Compression in Lustre

Towards End-to-End Compression in Lustre

引用

international symposium on parallel and distributed computing

作者： Anna Fuchs Jannek Squar Michael Kuhn Universität Hamburg Hamburg Germany Otto von Guericke University of Magdeburg Magdeburg Germany

ISBN: (数字)9798350369199

ISBN: (纸本)9798350369205

Scientific applications generate massive amounts of data, posing storage limitations and network traffic challenges. While scientists struggle with the usage of application-side compression and parallel I/O, we design a transparent feature. Our Lustre-based prototype automatically applies lossless compression, offering flexibility in compression-related decisions to minimize computational costs and optimize application performance. We outline the challenges posed by our prototype and illustrate through a comprehensive assessment how integrating Lustre and ZFS as backend solutions provides the essential elements for performance and scalability: specifically, asynchronous operations and parallel processing of compression. In our evaluation, we illustrate the interaction of different buffer levels within a distributed system. Additionally, we showcase how the I/O pattern, hardware setup, and various system software optimizations can impact overall performance and influence the choice of compression strategy.

关键词： Prototypes Focusing Telecommunication traffic parallel processing Hardware System software Computational efficiency distributed computing Optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：