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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,982 篇 电气工程
- 1,383 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 535 篇 控制科学与工程
- 228 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 61 篇 安全科学与工程
1,973 篇 理学
- 1,505 篇 数学
- 245 篇 物理学
- 203 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,463 篇 管理学
- 1,205 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

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

共 16627 条记录，以下是221-230 订阅

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

详细简洁

排序：

Optimization of the parallel semi-Lagrangian scheme in the YHGSM based on the adaptive maximum wind speed 19

Optimization of the parallel semi-Lagrangian scheme in the Y...

引用

19th ieee international symposium on parallel and distributed processing with applications (ieee ISPA)

作者： Liu, Dazheng Wu, Jianping Jiang, Tao Wang, Yingjie Pan, Xiaotian Li, Penglun Natl Univ Def Technol Coll Meteorol & Oceanog Changsha Peoples R China Natl Univ Def Technol Coll Comp Sci & Technol Changsha Peoples R China

ISBN: (纸本)9781665435741

The Yin-He global spectral model (YHGSM), embodies a parallel semi-Lagrangian solver and has two schemes implemented: maximum wind speed scheme and on-demand communication scheme. Maximum wind speed communication adopts a single and fixed data structure, which has a large communication overhead. Although the overhead of on-demand communication is reduced, it is still pretty huge. In this paper, a novel adaptable approach is proposed in which a monthly maximum wind speed is used in the YHGSM. This approach reduces the difference between the actual wind speed and the maximum wind speed used in the model;in turn, the communication overhead in the trajectory computation is further reduced. Experiments show that in the maximum wind speed scheme and on-demand schemes, the communication overheads with the adaptive maximum wind speed are significantly reduced. In addition, in a ten-day forecast with the on-demand communication scheme, the total overhead for the semi-Lagrangian computing and the total parallel execution time are also both reduced, and the reduction ratio increases as the number of nodes increases.

关键词： numerical weather prediction parallel semi-Lagrangian scheme maximum wind speed communication overhead

来源：评论

学校读者我要写书评

暂无评论

Automatic Refinement of parallel applications Structure Detection

Automatic Refinement of Parallel Applications Structure Dete...

引用

26th ieee international parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Gonzalez, Juan Huck, Kevin Gimenez, Judit Labarta, Jesus Univ Politecn Catalunya Barcelona Tech Barcelona Supercomp Ctr Barcelona Spain ParaTools Inc Eugene OR USA

ISBN: (纸本)9780769546766

Analyzing parallel programs has become increasingly difficult due to the immense amount of information collected on large systems. In this scenario, cluster analysis has been proved to be a useful technique to reduce the amount of data to analyze. A good example is the use of the density-based cluster algorithm DBSCAN to identify similar single program multiple data (SPMD) computing phases in message-passing applications. This structure detection simplifies the analyst work as the whole information available is reduced to a small set of clusters. However, DBSCAN presents two major problems: it is very sensitive to its parametrization and is not capable of correctly detect clusters when the data set has different densities across the data space. In this paper, we introduce the Aggregative Cluster Refinement, an iterative algorithm that produces more accurate structure detections of SPMD phases than DBSCAN. In addition, it is able to detect clusters with different densities.

关键词： parallel applications performance analysis automatic analysis cluster analysis data mining

来源：评论

学校读者我要写书评

暂无评论

Solving the Container Explosion Problem for distributed High Throughput Computing 34

Solving the Container Explosion Problem for Distributed High...

引用

34th ieee international parallel and distributed processing symposium (IPDPS)

作者： Shaffer, Tim Hazekamp, Nicholas Blomer, Jakob Thain, Douglas Univ Notre Dame Notre Dame IN 46556 USA European Lab Particle Phys CERN Geneva Switzerland

ISBN: (纸本)9781728168760

Container technologies are seeing wider use at advanced computing facilities for managing highly complex applications that must execute at multiple sites. However, in a distributed high throughput computing setting, the unrestricted use of containers can result in the container explosion problem. If a new container image is generated for each variation of a job dispatched to a site, shared storage is soon exceeded. On the other hand, if a single large container image is used to meet multiple needs, the size of that container may become a problem for storage and transport. To address this problem, we observe that many containers have an internal structure generated by a structured package manager, and this information could be used to strategically combine and share container images. We develop LANDLORD to exploit this property and evaluate its performance through a combination of simulation studies and empirical measurement of high energy physics applications.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Extend PBFT Protocol with L-DAG 19

Extend PBFT Protocol with L-DAG

引用

19th ieee international symposium on parallel and distributed processing with applications (ieee ISPA)

作者： Song, Anping Dai, Yi Ji, Ruyi Song, Ziheng Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China Univ Illinois Coll Engn Champaign IL 61820 USA Univ Illinois Coll Engn Urbana IL 61820 USA

ISBN: (纸本)9781665435741

The linear structure of blockchain ensures data security and credibility. But at the same time, it has become the performance bottleneck of the entire system, limiting the growth of the transaction processing rate. The inherent concurrency of directed acyclic graph (DAG) technology solves these problems, but it also brings new problems: blocks total order and ledger consistency. In this paper, we propose a Layer-based DAG (L-DAG) blockchain, which avoids the complex total ordering algorithms by keeping blocks in order between and within layers during the generation process. And we introduce the proportional-integral-derivative (PID) controller to dynamically control the width of layers by using in-degree and out-degree of blocks to achieve the consistency of ledger. We extend Practical Byzantine Fault Tolerance (PBFT) protocol in parallel based on the L-DAG structure and successfully apply it to consortium blockchain scenarios. The L-DAG blockchain structure is implemented through Hyperledger Fabric. Experimental results show that as the number of consensus threads increases, the TPS of L-DAG-based PBFT can grow with near-linear efficiency.

关键词： L-DAG Width control In/Out-degree parallel consensus Proportional-integral-derivative controller

来源：评论

学校读者我要写书评

暂无评论

Grouping Synchronous to Eliminate Stragglers with Edge Computing in distributed Deep Learning 19

Grouping Synchronous to Eliminate Stragglers with Edge Compu...

引用

19th ieee international symposium on parallel and distributed processing with applications (ieee ISPA)

作者： Gui, Zhiyi Yang, Xiang Yang, Hao Li, Wei Zhang, Lei Qi, Qi Wang, Jingyu Sun, Haifeng Liao, Jianxin Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Huawei Beijing Peoples R China

ISBN: (纸本)9781665435741

With the development of artificial intelligence(AI) applications, a large number of data are generated from mobile or IoT devices at the edge of the network. Deep learning tasks are executed to obtain effective information in the user data. However, the edge nodes are heterogeneous and the network bandwidth is limited in this case, which will cause general distributed deep learning to be inefficient. In this paper, we propose Group Synchronous parallel (GSP), which uses a density-based algorithm to group edge nodes with similar training speeds together. In order to eliminate stragglers, group parameter servers are responsible for coordinating communication of nodes in the group with Stale Synchronous parallel and aggregating the gradients of these nodes. And a global parameter server is responsible for aggregating the gradients from the group parameter servers to update the global model. To save network bandwidth, we further propose Grouping Dynamic Sparsification (GDS). It adjusts the gradient sparsification rate of nodes dynamically based on GSP so as to differentiates the communication volume and makes the training speed of all nodes tend to be the same. We evaluate GSP and GDS's performance on LeNet-5, ResNet, VGG, and Seq2Seq with Attention. The experimental results show that GSP speedups the training by 45% similar to 120% with 16 nodes. GDS on top of GSP can make up for some test accuracy loss, up to 0.82% for LeNet-5.

关键词： distributed deep training gradient compression parameter server gradient sparsification

来源：评论

学校读者我要写书评

暂无评论

A Predictable Servant-based Execution Model for Safety-critical Systems 15

A Predictable Servant-based Execution Model for Safety-criti...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Wan, Bo Li, Xi Hang, Bo Zhou, Kaiqi Luo, Haizhao Wang, Chao Chen, Xianglan Zhou, Xuehai USTC Dept Comp Sci & Technol Hefei Anhui Peoples R China

ISBN: (纸本)9781538637906

Real-time systems are commonly found in safety-critical fields requiring the system to be predictable to reduce validation overheads. However, the contradiction between the need for high throughput and predictability in these systems has become sharpening from the view of concurrent applications. In this paper, we propose a Predictable Servant-based Execution Model (PSEM) to regulate both communication and computation of tasks to be predictable in an efficient way. In PSEM, by extending the Logical Execution Time (LET) model with the Servant concept, periodic responsiveness is improved without the erosion on the foundation of predictability. Evaluation results on the implementation of the runtime system demonstrate that PSEM achieves a speedup of 7.2X compared to existing runtime, and can provide time-aware applications with more precise timing service.

关键词： Task analysis Timing Computational modeling Predictive models Semantics Switches Runtime

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning Control for Water-Efficient Agricultural Irrigation 15

Reinforcement Learning Control for Water-Efficient Agricultu...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Sun, Lijia Yang, Yanxiang Hu, Jiang Porter, Dana Marek, Thomas Hillyer, Charles Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA Texas A&M AgriLife Res Amarillo TX USA

ISBN: (纸本)9781538637906

Modern sensor technologies, internet and advanced irrigation equipment allow a relative precise control of agricultural irrigation that leads to high water-use efficiency. However, the core control algorithms that make use of these technologies have not been well studied. In this work, a reinforcement learning based irrigation control technique is investigated. The delayed reward of crop yield is handled by the temporal difference technique. The learning process can be based on both off-line simulation and real data from sensors and crop yield. Neural network based fast models for soil water level and crop yield are developed to improve the scalability of learning. Simulations for various geographic locations and crop types show that the proposed method can significantly increase net return considering both crop yield and water expense.

关键词： Irrigation Learning (artificial intelligence) Soil moisture Meteorology Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Author Influence Spreading Prediction Based on Co-citation Interest Similarity 15

Author Influence Spreading Prediction Based on Co-citation I...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Chang, Ning Huang, Fang Zhang, Yuchen Wang, Xiangqian Wan, Wencong Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China

ISBN: (纸本)9781538637906

In the previous research, the assessment of author's influence is mainly based on the historical information of literature, such as the number of author's publications and times cited, and the reference relationship. However, the author influence is not only reflected in the amount of static data, but also in the behavior that the author's point of view is noticed and communicated. Meanwhile, the influence spreads through the relational path of cooperation and citation between authors, on which the authors should have similar academic interests. Therefore, this paper proposed an influence spreading model with the author's co-citation interest similarity and the path of citation and cooperation. On the basis of this, a novel algorithm of influence spreading prediction is designed, and carried on the experiment verification using the public literature information resources. The results of AUC indicator show the effectiveness on the proposed method.

关键词： Influence Spreading Prediction Citation Network Co-citation Matrix Interest Similarity

来源：评论

学校读者我要写书评

暂无评论

A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem 15

A Greedy-Genetic Local-Search Heuristic for the Traveling Sa...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Rashid, Mohammad Harun Mosteiro, Miguel A. Pace Univ Seidenberg Sch CSIS New York NY 10038 USA Pace Univ Comp Sci Dept New York NY 10038 USA

ISBN: (纸本)9781538637906

The Travelling Salesman Problem (TSP) is one of the typical combinatorial optimization problems that is easy to describe but hard to solve. In this work, we present a novel solution that integrates a genetic algorithm, local-search heuristics, and a greedy algorithm. For the genetic algorithm we keep the evolutionary technique to generate children from parents, which uses operators like mutation, selection of the most fitted element, and crossover, but the latter is enhanced with a local-search heuristic. We also use the local search heuristic for its strong climbing ability, as well as to find local optima efficiently in the TSP space. The greedy algorithm is used to generate new greedy children from parents. The experimental evaluation shows that the optimization algorithm presented provides higher quality solutions for TSP with respect to previous genetic algorithms, within reasonable computational time.

关键词： travelling salesman problem TSP genetic algorithms local search tabu search

来源：评论

学校读者我要写书评

暂无评论

Hiding communication latency in data parallel applications 1

Hiding communication latency in data parallel applications

引用

1st Merged international parallel processing symposium/symposium on parallel and distributed processing (IPPS/SPDP 1998)

作者： Garg, V Schimmel, DE Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

ISBN: (纸本)0818684038

Interprocessor communication times can be a significant fraction of the overall execution time required for data parallel applications. Large communication to computation ratios of the tasks performed by these applications results in suboptimal performance when executed on data parallel architectures. We present an alternate architectural framework, referred to as concurrently communicating SIMD (CCSIMD), which maintains the SIMD execution model, while introducing a small degree of task parallelism to exploit the communication concurrency. We introduce three different implementations of our architectural framework, and illustrate their effect on a suite of data parallel applications. Results show that CCSIMD architectures can provide a cost-effective way to hide communication latency in data parallel applications that can result in an increase in the performance of these applications.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：