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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,931 篇 会议
279 篇 期刊文献
26 册 图书

馆藏范围

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

日期分布

学科分类号

5,464 篇 工学
- 5,205 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 884 篇 电气工程
- 572 篇 信息与通信工程
- 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,582 篇 distributed comp...
1,154 篇 parallel process...
987 篇 computer science
965 篇 computational mo...
872 篇 computer archite...
860 篇 application soft...
723 篇 grid computing
597 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
458 篇 resource managem...
429 篇 scalability
401 篇 costs
395 篇 runtime
395 篇 bandwidth
384 篇 parallel program...
367 篇 peer to peer com...
358 篇 cloud computing

机构

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,041 篇 英文
185 篇 其他
10 篇 中文

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

共 11236 条记录，以下是1131-1140 订阅

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

详细简洁

排序：

Litener: An Accelerator-Enabled Lightweight Container for Edge computing

Litener: An Accelerator-Enabled Lightweight Container for Ed...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Ryan Dyson Carlos Reañ o Queen&#x0027 s University Belfast United Kingdom Universitat de Val&#x00E9 ncia Spain

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

Containers supporting accelerators, such as Docker, include management tasks that require a significant amount of computing resources. While these resources are available in the Cloud, in other scenarios such as the Edge resources are more limited. An accelerator-enabled lightweight container would be desirable in such scenarios. In this paper, we analyse platforms to containerise applications using accelerators, including but not limited to Docker. After this analysis, we present a lightweight container, referred to as Litener, focused on using accelerators in scenarios with limited resources. Although the focus is on accelerators, many of the optimisations described can also be applied to scenarios that do not use accelerators. Experiments show a speedup of up to 7.78X when compared to other platforms.

关键词： Conferences Containers Task analysis Optimization Edge computing

来源：评论

学校读者我要写书评

暂无评论

Generating Minimal Nondeterministic Finite Automata Using a parallel Algorithm 19

Generating Minimal Nondeterministic Finite Automata Using a ...

引用

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

作者： Jastrzab, Tomasz Czech, Zbigniew J. Wieczorek, Wojciech Silesian Tech Univ Dept Algorithm & Software Gliwice Poland Silesia Univ Katowice Fac Sci & Technol Katowice Poland

ISBN: (纸本)9781728189468

The goal of this paper is to develop a parallel algorithm that, on input of a learning sample, identifies a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative examples. Given a sample, a minimal NFA or the range of possible sizes of such an NFA, that represents the target regular language is sought. We define the task of finding an NFA, which accepts all positive examples and rejects all negative ones, as a constraint satisfaction problem, and then propose a parallel algorithm to solve the problem. The results of computational experiments on the variety of test samples are reported.

关键词： parallel algorithm learning regular languages using nondeterministic finite automata constraint satisfaction and satisfiability problems grammatical inference

来源：评论

学校读者我要写书评

暂无评论

TianheStar: Orchestrating SSSP Applications on Tianhe Supercomputer

TianheStar: Orchestrating SSSP Applications on Tianhe Superc...

引用

IEEE/ACM international symposium on Cluster computing and the Grid (CCGRID)

作者： Xinbiao Gan Qian Tang Feng Xiong Shijie Li Bo Yang Tiejun Li School of Computer National University of Defense Technology

ISBN: (数字)9798350395662

ISBN: (纸本)9798350395679

computing single-source shortest paths (SSSP) is one of the fundamental problems in graph theory and is also essential for data-intensive applications. As the potential of artificial intelligence (AI) continues to be explored, and with the advent of exascale supercomputing, there is a growing need for an extremely fast graph engine for SSSP applications. Current distributed SSSP engines for large-scale graph applications, unfortunately, often exhibit poor efficiency when running on supercomputers. In this paper, we introduce TianheStar, an ultra-fast SSSP engine designed specifically for graph search on the Tianhe supercomputer. TianheStar effectively minimizes communication costs and establishes a new balance between computation and communication. The key idea of TianheStar is to leverage network topology information for performing topology-aware message aggregation and architecture-aware group communication. These two techniques effectively reduce the number of messages and the average number of communication hops, respectively. We validate TianheStar using Graph500, a widely adopted benchmark for graph search on supercomputers. Extensive evaluation demonstrates that, compared to the state-of-the-art solutions, TianheStar achieves a remarkable performance improvement. We have deployed TianheStar on the latest Tianhe supercomputer and secured the top position in the latest Graph500. We achieved an outstanding performance of 23,021 GTEPS (Giga Traversed Edges Per Second) for SSSP using 4096 nodes. Furthermore, we have delved into real-world graphs representing the USA road networks and conducted computations to determine the shortest paths between vertices. Our experimental results demonstrate that TianheStar can traverse the USA road network, comprising over 58,333,344 edges, in less than 0.1 second on the Tianhe supercomputer. This performance represents a speedup of over a thousand times compared to parallel shortest-path graph computations on the Aziz supercompu

关键词： Cloud computing Costs Network topology Roads High performance computing Benchmark testing Supercomputers Graph theory Artificial intelligence Engines

来源：评论

学校读者我要写书评

暂无评论

Load Balancing Run-Times and Space Usage for computing the Power Set 34

Load Balancing Run-Times and Space Usage for Computing the P...

引用

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

作者： Goodwin, Roger L. Frontiernet Dot Net Summit Point WV 25446 USA

ISBN: (纸本)9781728174457

This paper discusses load balancing the number of sets on multiple processors to compute the power set. The algorithm complexity measures (e.g. run-time and space usage) are merely functions of the load balance. This paper presents two approaches to computing the power set in a parallel environment. Both approaches use different round robin load balancing algorithms. Because of the load balance assignments, both approaches have different production algorithms for computing the power set. This paper covers both the run-time analyses and the space usage analyses of the parallel algorithms. We present mathematical formulas for the space usage analyses. We present a third, non-parallel algorithm for benchmark purposes. The purpose of the algorithm is to give the total amount of space needed to save the power set. The non-parallel algorithm also gives some idea of the maximum run-time an algorithm should take to find any of the sub-sets to the power set on any given processor in a parallel environment.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

“Crosscutting Themes in Computer Science: Where Does PDC Education Fit?”

“Crosscutting Themes in Computer Science: Where Does PDC Ed...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Rajendra K. Raj Rochester Institute of Technology

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

Since 1968, ACM and IEEE Computer Society have jointly led the development of curricular guidelines in various computing disciplines, starting with Computer Science (CS). The last major release of the undergraduate CS Curriculum Guidelines (CS2013) recognized 18 knowledge areas underpinning the discipline; the next decennial release is also likely to have the same number of knowledge areas. Viewing these knowledge areas as distinct silos does disservice to their interconnected nature, especially as crosscutting or recurring themes run across them and help to unify fundamental concepts in the CS discipline. In this talk, I will discuss crosscutting themes as providing an orthogonal view of the CS discipline, a view girded by knowledge and experience gained over the past 50 years. Providing explicit instruction in the presence and variety of crosscutting themes in CS will help students see each area not just in a silo of insular ideas, but also as part of the ethos of the discipline. I will use examples from the different knowledge areas to show where parallel and distributed computing could fit into CS.

关键词： Computer science Accreditation Guidelines Computer security distributed processing Data science Conferences

来源：评论

学校读者我要写书评

暂无评论

A System for High Performance Mining on GDELT Data 34

A System for High Performance Mining on GDELT Data

引用

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

作者： Pogorelov, Konstantin Schroeder, Daniel Thilo Filkukova, Petra Langguth, Johannes Simula Res Lab Fornebu Norway Simula Metropolitan Ctr Digital Engn Oslo Norway Tech Univ Berlin Berlin Germany

ISBN: (纸本)9781728174457

We design a system for efficient in-memory analysis of data from the GDELT database of news events. The specialization of the system allows us to avoid the inefficiencies of existing alternatives, and make full use of modern parallel high-performance computing hardware. We then present a series of experiments showcasing the system's ability to analyze correlations in the entire GDELT 2.0 database containing more than a billion news items. The results reveal large scale trends in the world of today's online news.

关键词： GDELT Data mining High Performance computing Misinformation Publishing

来源：评论

学校读者我要写书评

暂无评论

Considerations for a distributed GraphBLAS API 34

Considerations for a Distributed GraphBLAS API

引用

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

作者： Brock, Benjamin Buluc, Aydin Mattson, Timothy G. McMillan, Scott Moreira, Jose E. Pearce, Roger Selvitopi, Oguz Steil, Trevor Univ Calif Berkeley EECS Dept Berkeley CA 94720 USA Lawrence Berkeley Natl Lab Computat Res Dept Berkeley CA USA Intel Parallel Comp Labs Hillsboro OR USA Carnegie Mellon Univ Software Engn Inst Pittsburgh PA 15213 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY USA Lawrence Livermore Natl Lab Ctr Appl Sci Comp Livermore CA 94550 USA Univ Minnesota Sch Math Minneapolis MN 55455 USA

ISBN: (纸本)9781728174457

The GraphBLAS emerged from an international effort to standardize linear-algebraic building blocks for computing on graphs and graph-structured data. The GraphBLAS is expressed as a C API and has paved the way for multiple implementations. The GraphBLAS C API, however, does not define how distributed-memory parallelism should be handled. This paper reviews various approaches for a GraphBLAS API for distributed computing. This work is guided by our experience with existing distributed memory libraries. Our goal for this paper is to highlight the pros and cons of different approaches rather than to advocate for one particular choice.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Anonymous distributed Localisation via Spatial Population Protocols 4

Brief Announcement: Anonymous Distributed Localisation via S...

引用

4th symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025

作者： Gąsieniec, Leszek Kuszner, Lukasz Latif, Ehsan Parasuraman, Ramviyas Spirakis, Paul Stachowiak, Grzegorz Department of Computer Science University of Liverpool United Kingdom Faculty of Mathematics Physics and Informatics University of Gdańsk Poland School of Computing Department of Mathematics Science and Social Studies Education University of Georgia AthensGA United States School of Computing University of Georgia AthensGA United States Institute of Computer Science University of Wroclaw Poland

ISBN: (纸本)9783959773683

In the distributed localization problem (DLP), n anonymous robots (agents) A0, . . . ,An-1 begin at arbitrary positions p0, . . ., pn-1 ∈ S, where S is a Euclidean space. Initially, each agent Ai operates within its own coordinate system in S, which may be inconsistent with those of other agents. The primary goal in DLP is for agents to reach a consensus on a unified coordinate system that accurately reflects the relative positions of all points, p0, . . ., pn-1, in S. Extensive research on DLP has primarily focused on the feasibility and complexity of achieving consensus when agents have limited access to inter-agent distances, often due to missing or imprecise data. In this paper, however, we examine a minimalist, computationally efficient model of distributed computing in which agents have access to all pairwise distances, if needed. Specifically, we introduce a novel variant of population protocols, referred to as the spatial population protocols model. In this variant each agent can memorise one or a fixed number of coordinates, and when agents Ai and Aj interact, they can not only exchange their current knowledge but also either determine the distance dij between them in S (distance query model) or obtain the vector →/vij spanning points pi and pj (vector query model). We present here a leader-based localisation protocol with distance queries. © Leszek Gąsieniec, Lukasz Kuszner, Ehsan Latif, Ramviyas Parasuraman, Paul Spirakis, and Grzegorz Stachowiak.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Colza: Enabling Elastic In Situ Visualization for High-performance computing Simulations

Colza: Enabling Elastic In Situ Visualization for High-perfo...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Matthieu Dorier Zhe Wang Utkarsh Ayachit Shane Snyder Rob Ross Manish Parashar Argonne National Laboratory LemontIllinois60439 Rutgers University New Jersey Kitware Inc. University of Utah Salt Lake City Utah

In situ analysis and visualization have grown increasingly popular for enabling direct access to data from high-performance computing (HPC) simulations. As a simulation progresses and interesting physical phenomena emerge, however, the data produced may become increasingly complex, and users may need to dynamically change the type and scale of in situ analysis tasks being carried out and consequently adapt the amount of resources allocated to such tasks. To date, none of the production in situ analysis frameworks offer such an elasticity feature, and for good reason: the assumption that the number of processes could vary during run time would force developers to rethink software and algorithms at every level of the in situ analysis stack. In this paper we present Colza, a data staging service with elastic in situ visualization capabilities. Colza relies on the widely used ParaView Catalyst in situ visualization framework and enables elasticity by replacing MPI with a custom collective communication library based on the Mochi suite of libraries. To the best of our knowledge, this work is the first to enable elastic in situ visualization capabilities for HPC applications on top of existing production analysis tools.

关键词： Analytical models Adaptation models Computational modeling High performance computing Data visualization Production Elasticity

来源：评论

学校读者我要写书评

暂无评论

On-the-fly Optimization of parallel Computation of Symbolic Symplectic Invariants 19

On-the-fly Optimization of Parallel Computation of Symbolic ...

引用

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

作者： Ben Geloun, Joseph Coti, Camille Malony, Allen D. Univ Sorbonne Paris Nord LIPN CNRS UMR7030 F-93430 Villetaneuse France Univ Oregon Eugene OR 97403 USA

ISBN: (纸本)9781728189468

Group invariants are used in high energy physics to define quantum field theory interactions. In this paper, we present the parallel algebraic computation of special invariants called symplectic and focus on one particular invariant that finds recent interest in physics. Our results will export to other invariants. The cost of performing basic computations on the multivariate polynomials evolves during the computation, as the polynomials get larger and/or have increasing numbers of terms. Interestingly, in some cases, they stay small. Traditionally, high-performance software is optimized by running experiments with sample data sets in order to profile and optimize expected behavior of workloads in practice. Since the (communication and computation) costs depend on the changing behavior of the symplectic invariant calculations, the standard optimization approach is insufficient. Thus, it is necessary to implement online performance tuning methods that can track the algorithm's progress and state, evaluate performance data in situ, and control the parallel resources during execution.

关键词： High energy physics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 110 111 112 113 114 115 116 117 118 119 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：