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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

SARXARRAY AND STMTOOLS: OPEN-SOURCE PYTHON LIBRARIES FOR INSAR DATA processing AND ANALYSIS

SARXARRAY AND STMTOOLS: OPEN-SOURCE PYTHON LIBRARIES FOR INS...

引用

IEEE international Geoscience and Remote Sensing symposium (IGARSS)

作者： Ku, O. Alidoost, F. Chandramouli, P. van Lankveld, T. Nattino, F. Grootes, M. W. van Leijen, F. J. Hanssen, R. F. Netherlands eSci Ctr Amsterdam Netherlands Delft Univ Technol Dept Geosci & Remote Sensing Delft Netherlands

ISBN: (纸本)9798350360332;9798350360325

We introduce SARXarray and STMtools, two python libraries designed to support the exploitation of modern Interferometric Synthetic Aperture Radar (InSAR) data by enabling handling of larger-than memory datasets and the incorporation and fusion with relevant contextual information. The libraries are developed upon two innovative and well- established open-source Python libraries: Xarray [5] and Dask [ 6]. They are implemented as Xarray extensions. SARXarray is designed to manipulate and operate on larger-than-memory coregistered raster stacks such as Single-look Complex images (SLC) or interferograms, performing scatterer selection and producing STM objects. STMtools leverage the Space- Time Matrix (STM) concept [3,4] and provides functionalities to process STM and perform enrichment/data fusion with other data sources. Both libraries are built on the Xarray library, providing support for a wide range of data formats, and utilize Dask for parallel computation, making them scalable for distributed computation infrastructures. By enabling InSAR data analysis incorporating contextual information, the two libraries enhance the potential to uncover underlying mechanisms driving deformation phenomena.

关键词： InSAR PSI distributed Computation Python Xarray Dask

来源：评论

学校读者我要写书评

暂无评论

parallel Minimum Spanning Tree Algorithms via Lattice Linear Predicate Detection 36

Parallel Minimum Spanning Tree Algorithms via Lattice Linear...

引用

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

作者： Alves, David R. Garg, Vijay K. Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

ISBN: (纸本)9781665497473

We show that the problem of computing the minimum spanning tree can be formulated as special case of detecting Lattice Linear Predicate (LLP). In general, formulating problems as LLP presents two main advantages: 1) Different problems are formulated under a single, general framework, which defines the problem in terms of simple local predicates that must hold for the all the elements of a lattice, making the problem (and the solution) compact and easy to understand. 2) improvements on one set of problems can be transferable to other sets of problems;3) since the problems are stated as a set of local predicates, which can be often tested with little or no synchronization it is often the case that new opportunities for parallelism present themselves. In this paper we introduce two parallel algorithms LLP-Prim and LLP-Boruvka that improve on the non-LLP counterparts in several ways. LLP-Prim reduces the number of heap operations required by Prim by allowing edges to be selected without entering the heap thus allowing for parallelism. LLP-Boruvka improves on Boruvka by reducing synchronization and thus once more improving parallelism opportunities. Our experimental evaluation shows that LLP-Prim is faster than Prim's algorithm in both single threaded and multithreaded scenarios and that it provides a good tradeoff between parallelism and efficiency at low core counts. For higher core count scenarios we show how LLP-Boruvka improves on an efficient implementation of a parallel version of Boruvka.

关键词： Minimum Spanning Tree parallel Algorithms

来源：评论

学校读者我要写书评

暂无评论

Qualitative QoS-aware Scheduling of Moldable parallel Jobs on HPC Clusters 22

Qualitative QoS-aware Scheduling of Moldable Parallel Jobs o...

引用

22nd IEEE international symposium on parallel and distributed processing with Applications, ISPA 2024

作者： Hou, Zhengxiong Liu, Yubing Shen, Hong Liu, Jiyuan Gu, Jianhua Northwestern Polytechnical University School of Computer Science Xi'an China

ISBN: (纸本)9798331509712

In service oriented high-performance computing (HPC) clusters, end users have various Quality of Service (QoS) requirements. Most of the existing research work focuses on quantitative QoS requirements, such as deadlines, for rigid jobs. While, in many cases, it is more convenient for users to qualitatively state QoS requirements (such as performance-sensitive) at the submission of their jobs. Almost all kinds of QoS requirements will be greatly impacted by job scheduling, which determine the degree of job parallelism, execution time and waiting time, etc. Most modern parallel applications are moldable in the sense that they can choose a resource allocation before execution. Traditional sequential job scheduling mechanism with fixed resource allocation appears to be an obstacle to improve QoS for end users. To address this issue, we propose a novel qualitative QoS-aware sub-queue simultaneous scheduling method for moldable parallel jobs (with variable resource allocation) on HPC Clusters. We first define the qualitative QoS models for end users, then present our sub-queue simultaneous scheduling method, including job sequencing and resource allocation algorithms for a set of moldable parallel jobs on multi-core clusters. Our method can efficiently sequence queuing jobs and allocate appropriate resources for simultaneously running some performance-sensitive jobs in a sub-queue rather than running them one by one. Experimental results demonstrate the effectiveness of our method to improving QoS for end users. © 2024 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

The Universal Gossip Fighter 36

The Universal Gossip Fighter

引用

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

作者： Gorbunova, Anastasiia Guerraoui, Rachid Kermarrec, Anne-Marie Kucherenko, Anastasiia Pinot, Rafael Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781665481069

The notion of adversary is a staple of distributed computing. An adversary typically models "hostile" assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attacker that can hack machines. So far, the goal of distributed computing researchers has mainly been to develop a distributed algorithm that can face a given adversary, the abstraction characterizing worst-case scenarios. This paper initiates the study of the somehow opposite approach. Given a distributed algorithm, the adversary is the abstraction we seek to implement. More specifically, we consider the problem of controlling the spread of messages in a large-scale system, conveying the practical motivation of limiting the dissemination of fake news or viruses. Essentially, we assume a general class of gossip protocols, called all-to-all gossip protocols, and devise a practical method to hinder the dissemination. We present the Universal Gossip Fighter (UGF). Just like classical adversaries in distributed computing, UGF can observe the status of a dissemination and decide to stop some processes or delay some messages. The originality of UGF lies in the fact that it is universal, i.e., it applies to any all-to-all gossip protocol. We show that any gossip protocol attacked by UGF ends up exhibiting a quadratic message complexity (in the total number of processes) if it achieves sublinear time of dissemination. We also show that if a gossip protocol aims to achieve a message complexity ff times smaller than quadratic, then the time complexity rises exponentially in relation to ff. We convey the practical relevance of our theoretical findings by implementing UGF and conducting a set of empirical experiments that confirm some of our results.

关键词： distributed Computing Gossip Protocols Adaptive Adversaries

来源：评论

学校读者我要写书评

暂无评论

Integration Framework for Online Thread Throttling with Thread and Page Mapping on NUMA Systems

Integration Framework for Online Thread Throttling with Thre...

引用

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

作者： Schwarzrock, Janaina Lorenzon, Arthur E. de Souza, Samuel Xavier Beck, Antonio Carlos S. Univ Fed Rio Grande do Sul Porto Alegre RS Brazil Univ Fed Rio Grande do Norte Natal RN Brazil

ISBN: (纸本)9798350364613;9798350364606

Non-Uniform Memory Access (NUMA) systems are preva-lent in HPC, where optimal thread and page placement are crucial for enhancing performance and minimizing energy us-age [1]-[3]. Moreover, considering that NUMA systems have hardware support for a large number of hardware threads and many parallel applications have limited scalability, throttling the number of active threads may bring further improvements [4]-[6]. However, the optimal configuration (thread mapping, page mapping, number of threads) for energy and performance, quantified by the Energy-Delay Product (EDP), varies with the system hardware, application, input set, and even during execution [1], [4], [6], [7]. Only online optimization approaches can easily adapt to these changes. © 2024 IEEE.

关键词： parallel applications NUMA systems dynamic concurrency throttling thread mapping page mapping

来源：评论

学校读者我要写书评

暂无评论

Alias-Chain: Improving Blockchain Scalability via Exploring Content Locality among Transactions 36

Alias-Chain: Improving Blockchain Scalability via Exploring ...

引用

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

作者： Liu, Jintong Wan, Shenggang He, Xubin Huazhong Univ Sci & Technol Wuhan Peoples R China Temple Univ Philadelphia PA 19122 USA

ISBN: (纸本)9781665481069

A Blockchain is a promising infrastructure but it has serious scalability problems, i.e., long block synchronization time and high storage cost. Conventional coarse-grained data deduplication schemes (block or file level) are proved to be ineffective on this problem. Based on comprehensive analysis on typical blockchain workloads, we are the first to propose two new locality concepts: economic and argument locality. To further explore these new localities, we propose a novel fine-grained data deduplication scheme (transaction level) named Alias-Chain to improve the scalability of blockchains. Specifically, Alias-Chain replaces frequently used data, e.g., smart contract arguments, with much shorter aliases to reduce the block size. During propagation and preservation of blocks, smaller blocks result in both shorter synchronization time and lower storage cost. Simulation results show the average transfer and SC-call transaction sizes can be reduced by up to 11.23% and 43.23% in native Ethereum, and up to 61.95% and 77.54% in Ethereum optimized by state-ofthe-art techniques, respectively. Prototyping-based experiments are further conducted on a testbed consisting of up to 3200 miners. The results demonstrate the effectiveness and efficiency of Alias-Chain on reducing block synchronization time and storage cost under typical real-world workloads.

关键词： distributed processing Costs Scalability Simulation Smart contracts Blockchains Synchronization

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient Cluster Scalable Genomics Data processing Using Apache Arrow Flight 21

Communication-Efficient Cluster Scalable Genomics Data Proce...

引用

21st IEEE international symposium on parallel and distributed Computing (ISPDC)

作者： Ahmad, Tanveer Ma, Chengxin Al-Ars, Zaid Hofstee, H. Peter Delft Univ Technol Delft Netherlands

ISBN: (数字)9781665488020

ISBN: (纸本)9781665488020

Current cluster scaled genomics data processing solutions rely on big data frameworks like Apache Spark, Hadoop and HDFS for data scheduling, processing and storage. These frameworks come with additional computation and memory overheads by default. It has been observed that scaling genomics dataset processing beyond 32 nodes is not efficient on such frameworks. To overcome the inefficiencies of big data frameworks for processing genomics data on clusters, we introduce a low-overhead and highly scalable solution on a SLURM based HPC batch system. This solution uses Apache Arrow as in-memory columnar data format to store genomics data efficiently and Arrow Flight as a network protocol to move and schedule this data across the HPC nodes with low communication overhead. As a use case, we use NGS short reads DNA sequencing data for pre-processing and variant calling applications. This solution outperforms existing Apache Spark based big data solutions in term of both computation time (2x) and lower communication overhead (more than 20-60% depending on cluster size). Our solution has similar performance to MPI-based HPC solutions, with the added advantage of easy programmability and transparent big data scalability. The whole solution is Python and shell script based, which makes it flexible to update and integrate alternative variant callers. Our solution is publicly available on GitHub at https://***/abs-tudelft/time-to-flyhigh/tree/main/genomics

关键词： Genomics Whole Genome/Exome Sequencing Big Data Apache Arrow In-Memory Plasma Object Store parallel processing

来源：评论

学校读者我要写书评

暂无评论

"Smarter" NICs for faster molecular dynamics: a case study 36

"Smarter" NICs for faster molecular dynamics: a case study

引用

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

作者： Karamati, Sara Hughes, Clayton Hemmert, K. Scott Grant, Ryan E. Schonbein, W. Whit Levy, Scott Conte, Thomas M. Young, Jeffrey Vuduc, Richard W. Georgia Inst Technol Atlanta GA 30332 USA Sandia Natl Labs POB 5800 Albuquerque NM 87185 USA Queens Univ Kingston ON Canada

ISBN: (纸本)9781665481069

This work evaluates the benefits of using a "smart" network interface card (SmartNIC) as a compute accelerator for the example of the MiniMD molecular dynamics proxy application. The accelerator is NVIDIA's BlueField-2 card, which includes an 8-core Arm processor along with a small amount of DRAM and storage. We test the networking and data movement performance of these cards compared to a standard Intel server host using microbenchmarks and MiniMD. In MiniMD, we identify two distinct classes of computation, namely core computation and maintenance computation, which are executed in sequence. We restructure the algorithm and code to weaken this dependence and increase task parallelism, thereby making it possible to increase utilization of the BlueField-2 concurrently with the host. We evaluate our implementation on a cluster consisting of 16 dual-socket Intel Broadwell host nodes with one BlueField-2 per host-node. Our results show that while the overall compute performance of BlueField-2 is limited, using them with a modified MiniMD algorithm allows for up to 20% speedup over the host CPU baseline with no loss in simulation accuracy.

关键词： distributed processing Heuristic algorithms Clustering algorithms Random access memory parallel processing Maintenance engineering Servers

来源：评论

学校读者我要写书评

暂无评论

Accuracy vs. Cost in parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices 36

Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Appro...

引用

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

作者： Ernstbrunner, Robert Mayer, Viktoria Gansterer, Wilfried Univ Vienna Fac Comp Sci Vienna Austria

ISBN: (纸本)9781665481069

We study a randomized and a deterministic algorithm for the fixed-precision low-rank approximation problem of large sparse matrices. The Randomized QB Factorization (RandQB_EI) constructs a reduced and dense representation of the originally sparse matrix based on randomization. The representation resulting from the deterministic Truncated LU Factorization with Column and Row Tournament Pivoting (LU_CRTP) is sparse, but fill-in introduced in the factorization process can affect sparsity and performance. We therefore attempt to mitigate fill-in with an incomplete LU_CRTP variant with thresholding (ILUT_CRTP). We analyze this approach and identify potential problems that may arise in practice. We design parallel implementations of RandQB_EI, LU_CRTP and ILUT_CRTP. We experimentally evaluate strong scaling properties for different problems and the runtime required for achieving a given approximation quality. Our results show that LU_CRTP tends to be particularly competitive for low approximation quality. However, when a lot of fill-in occurs, LU_CRTP is outperformed by RandQB_EI especially for higher approximation quality. ILUT_CRTP outperforms both LU_CRTP and RandQB_EI and can achieve speedups up to 40 over LU_CRTP, depending on the amount of fill-in.

关键词： Randomized low-rank approximations Deterministic low-rank approximations Randomized QB Factorization Truncated LU Factorization with Tournament Pivoting

来源：评论

学校读者我要写书评

暂无评论

Degree-Aware Kernels for Computing Jaccard Weights on GPUs 36

Degree-Aware Kernels for Computing Jaccard Weights on GPUs

引用

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

作者： Aljundi, Amro Alabsi Akyildiz, Taha Atahan Kaya, Kamer Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

ISBN: (纸本)9781665481069

Graphs provide the ability to extract valuable metrics from the structural properties of the underlying data they represent. One such metric is the Jaccard Weight of an edge, which is the ratio of the number of common neighbors of the edge's endpoints to the union of the endpoints' neighborhood. A naive implementation of Jaccard Weights computation has a complexity that scales with the number of edges in the graph times the square of the maximum degree. Recently, GPU-based parallel algorithms have been proposed for this problem. However, these algorithms cannot overcome the structural variance within a graph, i.e., the sparsity pattern and degree imbalance, which directly translates to unbalanced work distribution across threads. In this work, we propose an optimized GPU-based algorithm with an ML-based work distribution model that mitigates the unbalanced work distribution. Our algorithm is shown to be up to 35x and on average 12x faster than the state of the art in practice while using less memory. In fact, we show that by manually tweaking the load distribution, a state-of-the-art implementation can be 5x faster. In addition, we propose a multi-core, shared-memory algorithm that applies a traditional but effective technique to improve the computation asymptotically and perform comparably to the GPU algorithms. Our code is available at https://***/SU- HPC/Jaccard-ML

关键词： Jaccard Weights parallel graph algorithms GPU work distribution

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：