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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,908 篇 会议
230 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

11,314 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

6,677 篇 工学
- 6,107 篇 计算机科学与技术...
- 2,911 篇 软件工程
- 1,184 篇 电气工程
- 1,070 篇 信息与通信工程
- 483 篇 电子科学与技术（可...
- 361 篇 控制科学与工程
- 176 篇 仪器科学与技术
- 153 篇 机械工程
- 117 篇 动力工程及工程热...
- 113 篇 生物医学工程（可授...
- 101 篇 生物工程
- 87 篇 光学工程
- 86 篇 建筑学
- 70 篇 网络空间安全
- 68 篇 土木工程
- 65 篇 化学工程与技术
- 61 篇 材料科学与工程（可...
- 59 篇 安全科学与工程
1,468 篇 理学
- 976 篇 数学
- 311 篇 物理学
- 156 篇 系统科学
- 140 篇 统计学（可授理学、...
- 136 篇 生物学
- 83 篇 化学
898 篇 管理学
- 648 篇 管理科学与工程(可...
- 306 篇 图书情报与档案管...
- 289 篇 工商管理
145 篇 医学
- 120 篇 临床医学
- 62 篇 基础医学(可授医学...
62 篇 经济学
- 62 篇 应用经济学
56 篇 法学
34 篇 农学
26 篇 教育学
18 篇 文学
11 篇 军事学

主题

1,463 篇 parallel process...
584 篇 computer archite...
555 篇 distributed comp...
534 篇 application soft...
529 篇 computational mo...
528 篇 concurrent compu...
342 篇 hardware
319 篇 graphics process...
308 篇 scalability
307 篇 parallel program...
304 篇 computer science
304 篇 graphics process...
285 篇 runtime
263 篇 big data
261 篇 optimization
249 篇 parallel process...
226 篇 throughput
225 篇 processor schedu...
214 篇 resource managem...
209 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
17 篇 school of comput...
17 篇 institute of com...
16 篇 school of comput...
15 篇 college of compu...
15 篇 georgia inst tec...
15 篇 barcelona superc...
15 篇 intel corporatio...
14 篇 school of comput...
14 篇 chinese acad sci...
14 篇 department of co...
13 篇 tsinghua univ de...
13 篇 ibm thomas j. wa...
13 篇 cent s univ sch ...
13 篇 college of compu...
13 篇 ohio state univ ...

作者

22 篇 jack dongarra
16 篇 badia rosa m.
16 篇 liu jie
15 篇 wang guojun
15 篇 yijie wang
15 篇 a. choudhary
14 篇 anon
14 篇 kurt rothermel
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
12 篇 fahringer thomas
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fernandes luiz g...
11 篇 guangwen yang

语言

11,184 篇 英文
96 篇 其他
36 篇 中文
2 篇 俄文
2 篇 土耳其文
1 篇 德文

检索条件"任意字段=International Conference on Parallel and Distributed Processing Techniques and Applications"

共 11314 条记录，以下是651-660 订阅

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

详细简洁

排序：

A distributed Infomap Algorithm for Scalable and High-Quality Community Detection 18

A Distributed Infomap Algorithm for Scalable and High-Qualit...

引用

47th international conference on parallel processing (ICPP)

作者： Zeng, Jianping Yu, Hongfeng Univ Nebraska Lincoln NE 68583 USA

ISBN: (纸本)9781450365109

Community detection is essential to various graph analysis applications. Infomap is a graph clustering algorithm capable of achieving high-quality communities. However, it remains a very challenging problem to effectively apply Infomap on large graphs. By analyzing communication and workload patterns of Infomap and leveraging a distributed delegate partitioning and distribution method, we develop a new heuristic strategy to carefully coordinate the community constitution from the vertices of a graph in a distributed environment, and achieve the convergence of the distributed clustering algorithm. We have implemented our optimized algorithm using MPI (Message Passing Interface), which can be easily employed or extended to massively distributed computing systems. We analyze the correctness of our algorithm, and conduct an intensive experimental study to investigate the communication and computation cost of our distributed algorithm, which has not shown in previous work. The results demonstrate the scalability and the correctness of our distributed Infomap algorithm with large-scale real-world datasets.

关键词： Community detection Infomap scalability accuracy large graphs

来源：评论

学校读者我要写书评

暂无评论

Combining the synchronous protocol with the optimistic time management algorithm (TMA) to improve the latency and the processor idle time

Combining the synchronous protocol with the optimistic time ...

引用

2008 international conference on parallel and distributed processing techniques and applications, PDPTA 2008

作者： Rizvi, Syed S. Riasat, Aasia Computer Science and Engineering Department University of Bridgeport Bridgeport CT United States Department of Computer Science Institute of Business Management Karachi Pakistan

ISBN: (纸本)1601320841

The concept of Global virtual time (GVT) has become an essential element of optimistic time management algorithms (TMA) that provide synchronization in a parallel and distributed computing environment. The performance of this optimistic TMA is optimal since it gives accurate GVT approximation. However, this accurate GVT approximation comes at the expense of slower execution rate which results a high GVT latency. Since this resultant GVT latency is not only high but also widely varied, the multiple processors involve in communication remain idle during that period of time. This paper examines the potential use of tress and butterflies barriers with the Mattern's optimistic TMA [1] using a ring structure. Our Simulation and numerical results verify that the use of tree barriers with the Mattern's GVT structure can significantly improve the latency time and thus increase the overall throughput of the parallel and scalable distributed simulation systems.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Clustering Boundary Cutting for Packet Classification based on Distribution Density 15

Clustering Boundary Cutting for Packet Classification based ...

引用

15th IEEE international Symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international conference on Ubiquitous Computing and Communications (IUCC)

作者： Bi, Xia-an Zhou, Yanwen Yu, Jianping Hunan Nounal Univ Coll Math & Comp Sci Changsha 410081 Hunan Peoples R China

ISBN: (纸本)9781538637906

In this paper, we present the clustering boundary cutting trie algorithm in order to solve the problem of huge time consumption in existing trie based algorithms. In the proposed solution, there are two stages. The first stage is the density-based rule clustering process. The rules are represented as a range between 0 and 1 according to the prefixes of the packet fields. When the number of the rules in a range reaches to a certain density, the corresponding rules are formed in a cluster. The second stage is the trie construction process based on these clusters. Compared with traditional packet classification algorithms, the searching time of our algorithm increases by 47.05% -73.76% and keep the high accuracy of 69.83%-93.17%. The experiment demonstrates that our algorithm can effectively keep high accuracy as well as keeping stable high-throughput, and it is suitable for actual deployment.

关键词： Packet Classification Density-Based Clustering Trie

来源：评论

学校读者我要写书评

暂无评论

Profiling hemodynamic application for parallel computing in the cloud 27

Profiling hemodynamic application for parallel computing in ...

引用

27th Euromicro international conference on parallel, distributed and Network-Based processing (PDP)

作者： Ferretti, Marco Santangelo, Luigi Univ Pavia Dept Elect Comp & Biomed Engn Pavia Italy

ISBN: (纸本)9781728116440

Porting to the cloud large scientific applications designed and optimized for a standard HPC facility does not always pay off, mainly because of the implied communication pattern. By profiling the applications, researchers can build a performance model, which is able to give insights about how the application will perform on the cloud. To validate this approach, we use a hemodynamic application that embeds both heavy computations and extensive communications with several collective operations to exchange data across all processes. We expect that this case instance is a model for other applications. Our approach is based on profiling and modeling, and builds an analytical model for the communication pattern of the chosen hemodynamic application. We collect data both on an on-premise HPC system and on the Google Cloud infrastructure, and assess the prediction based on the analytic model. The outcome suggests that the prediction consistently underestimates the actual execution time, but correctly guess the scalability, thus allowing to strike a good balance between performance and costs. Finally, we introduce a figure of merit to assess cost vs performance between cloud and on-premise implementation, and validate a first version of such a model.

关键词： Cloud Computing HPC Marconi Google Performance Prediction Hemodynamic applications pLogP model Cost modeling

来源：评论

学校读者我要写书评

暂无评论

The 4th international Workshop on Autonomic Solutions for parallel and distributed Data Stream processing (Auto-DaSP 2021) 21

The 4th International Workshop on Autonomic Solutions for Pa...

引用

ACM/SPEC international conference on Performance Engineering (ICPE)

作者： Cardellini, Valeria Mencagli, Gabriele Torquati, Massimo Univ Roma Tor Vergata Rome Italy Univ Pisa Pisa Italy

The organizers of the 4th international Workshop on Autonomic Solutions for parallel and distributed Data Stream processing (Auto-DaSP 2021) are delighted to welcome you to the workshop proceedings as part of the ICPE... 详细信息

ISBN: (纸本)9781450381949

关键词： run-time adaptation mechanisms and techniques data stream processing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Routing information in distributed knowledge environments with reactive mobile agents

Routing information in distributed knowledge environments wi...

引用

international conference on parallel and distributed processing techniques and applications

作者： El Falou, S Bourdon, F Dillenseger, B Univ Caen GREYC Dept Comp F-14032 Caen France

ISBN: (纸本)1892512459

Static routing, is an optimization problem, which can be solved when the network topology has been defined. Large scale networks, like Internet, have to face unpredictable behaviours: trafic conditions are constantly changing, the structure of the network itself may fluctuate (switching stations or connections can fail),... In that context, dynamic routing systems seem to be a good approach. Some of them can be seen as quasistatic, others are highly dynamic, most of them are centralized, which increases the bandwidth according to information exchange for the network control, We propose a decentralized routing protocol with mobile reactive agents for network control, based on ant algorithms, where, at the beginning, clients and servers know neither the form of the network, nor the place of others agents on the network. We introduce a capacity model for information evaporation through the network, and a Time To Live (TTL) parameter which indicates how long a packet should be allowed to survive before it is discarded. We discuss the roles of those parameters in the self-organizing process, making the search of way on the network as best as possible (with regard to QoS) during time.

关键词： Data communication systems

来源：评论

学校读者我要写书评

暂无评论

Preliminary Research on Grid-based Remote Sensing Image distributed processing

<bold>Preliminary Research on Grid-based Remote Sensing Imag...

引用

IFIP international conference on Network and parallel Computing

作者： Tang, Jiakui Zhang, Aijun Li, Shengyang Peking Univ Inst Remote Sensing & Geog Informat Syst Beijing 100871 Peoples R China Beijing Univ Chem Technol Sch Mech & Elect Engn Beijing 100029 Peoples R China Chinese Acad Sci Acad Opto Elect Beijing 100864 Peoples R China

ISBN: (纸本)9780769529431

Massive remote sensing image fast processing is one of the important tasks for remote sensing image applications, it is not only data intensive but also computation intensive, which arises our interest in distributed parallel processing by grid computing., The novel grid computing technology seeks to aggregate computing resources which are geographically distributed or heterogeneous for computational intensive applications. In this paper, a grid-based image processing testbed is established for remote sensing image distributed processing, and middleware is developed, which was applied to remote sensing image distributed deblurring processing. Preliminary experimental results show the processing efficiency is greatly improved, which demonstrate the promising potential of grid computing technology on remote sensing image distributed processing.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

An evaluation of data-parallel compiler support for line-sweep applications

An evaluation of data-parallel compiler support for line-swe...

引用

international conference on parallel Architectures and Compilation techniques

作者： Chavarría-Miranda, D Mellor-Crummey, J Rice Univ Dept Comp Sci Houston TX 77251 USA

ISBN: (纸本)0769516203

Data parallel compilers have long aimed to equal the performance of carefully hand-optimized parallel codes. For tightly-coupled applications based on line sweeps, this goal has been particularly elusive. In the Rice dHPF compiler, we have developed a wide spectrum of optimizations that enable us to closely approach hand-coded performance for tightly-coupled line sweep applications including the NAS SP and BT benchmark codes. From lightly-modified copies of standard serial versions of these benchmarks, dHPF generates MPI-based parallel code that is within 4% of the performance of the hand-crafted MPI implementations of these codes for a 102(3) problem size (Class 13) on 64 processors. We describe and quantitatively evaluate the impact of partitioning, communication and memory hierarchy optimizations implemented by dHPF that enable us to approach hand-coded performance with compiler-generated parallel code.

关键词： Application software Code standards Communication system control Computer science Contracts distributed computing Optimizing compilers parallel programming Program processors Programming profession

来源：评论

学校读者我要写书评

暂无评论

An election protocol in asynchronous distributed systems with practical specifications

An election protocol in asynchronous distributed systems wit...

引用

2005 international conference on parallel and distributed processing techniques and applications, PDPTA'05

作者： Park, Sung-Hoon Yang, Seung-II Lee, Shinsook School of Electrical and Computer Engineering Chungbuk Natioanal University Korea Republic of Dept. of English and Literature Hoseo University Cheonan Chung-Nam Korea Republic of

ISBN: (纸本)1932415602

A Leader is a Coordinator that supports a set of processes to cooperate a given task. This concept is used in several domains such as distributed systems, parallelism and cooperative support for cooperative work. In completely asynchronous systems, there is no solution for the election problem satisfying both of safety and liveness properties in asynchronous distributed systems. Therefore, to solve the election problem in those systems, one property should be weaker than the other property. If an election algorithm strengthens the safety property in sacrifice of liveness property, it would never progress. But on the contrary, an election algorithm strengthening the liveness property in sacrifice of the safety property would have the high probability of violating the safety property. In this paper, we presents a safety strengthened Leader Election protocol with an unreliable failure detector and analyses it in terms of safety and liveness properties in asynchronous distributed systems.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 62 63 64 65 66 67 68 69 70 71 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：