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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

835 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是171-180 订阅

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

详细简洁

排序：

NETEMBED:: A network resource mapping service for distributed applications

NETEMBED:: A network resource mapping service for distribute...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Londono, Jorge Bestavros, Azer Boston Univ Dept Comp Sci Boston MA 02215 USA

ISBN: (纸本)9781424416936

Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and network conditions. the distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on the resources they require. thus, a common problem facing the efficient deployment of distributed applications on these infrastructures is that of mapping application-level requirements onto the network it? such a manner that the requirements of the application are realized. We present two new techniques to tackle this combinatorially-hard problem that thanks to a number of heuristics, are able to find feasible solutions or determine the non-existence of a solution in most cases, where otherwise the problem would be intractable. these techniques are also false negative free, a common problem among other heuristics currently in use.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

the Fresh Breeze Project: A multi-core chip supporting composable parallel programming

The Fresh Breeze Project: A multi-core chip supporting compo...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Dennis, Jack B. MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9781424416936

the Fresh Breeze Project concerns the architecture and design of a multicore chip that can achieve superior performance while supporting composability of parallel programs. the requirements of composability imply that the management of processor allocation and memory management must be sufficiently flexible to permit reassignment of resources according to the current needs of computations. the Fresh Breeze Programming model combines the spawn/join threading model of Cilk[4] with a write-once memory model based on fixed-size chunks that are allocated and freed by efficient hardware mechanisms. this model supports computing jobs by many users, each consisting of a hierarchy of function activations. the model satisfies all six principles for supporting modular program construction[3]. Within this programming model, it is possible for any parallel program to be used, without change, as a component in building larger parallel programs.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Active-ray approach to rendering on distributed memory multiprocessors

Active-ray approach to rendering on distributed memory multi...

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Law, Asish Yagel, Roni Ohio State Univ United States

Object dataflow is a popular approach used in parallel rendering. the data representing the 3D scene is statically distributed among processors and objects are fetched and cached only on demand. Most previous object dataflow methods were implemented on shared memory architectures and exploited spatial coherency to reduce hardware cache misses. In this paper, we propose an efficient model for object dataflow parallel volume rendering on message passing machines. the `Active Ray Tracing' algorithm is introduced and its ray storage mechanism is used to support latency hiding by postponing computation on inactive rays. Memory usage is optimized by letting objects migrate and replicate at different processors rather than the common static assignments. Our cache-only-memory approach uses a distributed-directory scheme to trace the location of objects at other nodes. A mechanism to minimize network congestion was implemented which optimizes channel utilization. Unlike previous methods, our approach can benefit from temporal coherence and effectively minimizes communication costs in successive frames. We implemented a volume ray casting instance of the algorithm on the Cray T3D and achieved higher efficiency and scalability than existing algorithms. We achieve interactive frame rates of approximately 20 Hz for 1283 volume, and 4 Hz for 2563 volume on 128 processors.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Towards distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs 36

Towards Distributed 2-Approximation Steiner Minimal Trees in...

引用

36th ieee International parallel and distributed processing symposium (ieee IPDPS)

作者： Reza, Tahsin Sanders, Geoffrey Pearce, Roger Lawrence Livermore Natl Lab LLNL Ctr Appl Sci Comp CASC Livermore CA 94550 USA

ISBN: (纸本)9781665481069

Given an edge-weighted graph and a set of known seed vertices of interest, a network scientist often desires to understand the graph relationships to explain connections between the seed vertices. If the size of the seed set is 2, shortest path calculations are an attractive computational kernel to explore the connections between the two vertices. When the seed set is 3 or larger (say up to 1,000s) Steiner minimal tree - min-weight acyclic connected subgraph (of the input graph) that contains all the seed vertices - is an attractive generalization of shortest weighted paths. In general, computing a Steiner minimal tree is NP-hard, but decades ago several polynomial-time algorithms were designed and proven to yield Steiner trees whose total weight is bounded within 2 times the minimal Steiner tree. Despite its rich theoretical literature, works related to parallel Steiner minimal tree computation and their scalable implementations are rather scarce. In this paper, we present a parallel 2-approximation Steiner minimal tree algorithm (with theoretical guarantees) and its MPI-based distributed implementation. In place of distance computation between all pairs of seed vertices, an expensive phase in many approximation algorithms, the solution we employ, exploits Voronoi cell computation. Also, this approach has higher parallel efficiency than others that involve minimum spanning tree computation on the entire graph. Furthermore, our distributed design exploits asynchronous processing and a message prioritization scheme to accelerate convergence of distance computation, employs techniques to avoid inefficient distributed spanning tree computation on the entire graph, and harnesses a combination of vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance of our solution using real-world graphs with up to 128 billion edges and 512 compute nodes (8K processes), show the ability to find Steiner trees with up to 10K seed ver

关键词： Steiner trees distributed processing Scalability Approximation algorithms Computational efficiency Kernel Convergence

来源：评论

学校读者我要写书评

暂无评论

A parallel image fusion algorithm based on wavelet packet

A parallel image fusion algorithm based on wavelet packet

引用

8th International Conference on Signal processing

作者： Cheng, Yinglei Li, Ying Zhao, Ronochun AF Engn Univ Telecommun Engn Inst Xian 710077 Peoples R China Northwestern Polytech Univ Dept Comp Sci & Engn Xian 710072 Peoples R China

ISBN: (纸本)9780780397361

the wavelet packet provides an accurate method for image fusion. However, the computation and time cost will increase with the size of image. therefore it is difficult to achieve real-time fusion. After having analysed the wavelet packet based image fusion algorithm on the single computer, according to the time complexity and the parallel character of the wavelet packet algorithm, we propose a wavelet packet based parallel image fusion algorithm under the situation of distributed storage. Based on the data local property of wavelet packet transform, we achieve the algorithm on the MPI (Message Passing Interface) parallel computing platform, which is composed by Pentium PC and 1000 Mbps Ethernet. the efficiency of parallel computing is studied under different image size and different cluster size. the experimental result shows that the algorithm has good parallel computing property.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

On the Performance of parallel Neural Network Implementations on distributed Memory Architectures 08

On the Performance of Parallel Neural Network Implementation...

引用

8th ieee International symposium on Cluster Computing and the Grid

作者： Ganeshamoorthy, K. Ranasinghe, D. N. Univ Colombo Sch Comp Dept Computat & Intelligent Syst Colombo 07 Sri Lanka

ISBN: (纸本)9781424442379

In this paper, we study the impact of multi processor memory systems in particular, the distributed memory (I)M) and virtual shared memory (VSM), on the implementation of parallel backpropagation neural network algorithms. In the first instance, neural network is partitioned into sub neural networks by applying a hybrid partitioning scheme. In the second, each partitioned network is evaluated with matrix multiplication. three different sizes of neural networks are used and exchange rate prediction used as a reference problem. parallel implementations for each of the distributed memory and virtual shared memory scenarios is obtained. these algorithms are implemented on a high performance cluster, "Monolith" consisting of over 396 nodes. Programming is realized using Message Passing Interface (MPI) library and C-Linda. the partitioned, matrix multiplication has the fastest execution time, and DM/MPI implementation is always faster than the VSM/Linda equivalent. However in VSM/Linda it is possible to allow the parallel neural network to choose the optimum number of processors dynamically.

关键词： VSM DM Hybrid partition parallel neural network

来源：评论

学校读者我要写书评

暂无评论

parallel bidirectional heuristic search with dynamic process re-direction

Parallel bidirectional heuristic search with dynamic process...

引用

Proceedings of the 8th International parallel processing symposium

作者： Toptsis, Anestis A. York Univ Toronto Canada

ISBN: (纸本)0818656026

Non-wave shaping parallel bidirectional heuristic search algorithms have been reported to suffer of the bidirectional search anomaly. Although wave-shaping is considered as the most natural approach, parallel bidirectional wave-shaping algorithms are extremely scare. We introduce a wave-shaping algorithm for parallel bidirectional heuristic search in distributed memory environments. the method is inspired by the celebrated uniprocessor bidirectional wave-shaping algorithm of DeChampeaux-Sint. Our performance evaluation shows that the proposed method scales well, maintains good performance for increasing problem sizes, and attains close to linear speedup over the sequential DeChampeaux-Sint algorithm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Low-Cost parallel Algorithms for 2:1 Octree Balance

Low-Cost Parallel Algorithms for 2:1 Octree Balance

引用

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

作者： Isaac, Tobin Burstedde, Carsten Ghattas, Omar Univ Texas Austin Inst Computat Engn & Sci ICES Austin TX 78712 USA

ISBN: (纸本)9780769546759

the logical structure of a forest of octrees can be used to create scalable algorithms for parallel adaptive mesh refinement (AMR), which has recently been demonstrated for several petascale applications. Among various frequently used octree-based mesh operations, including refinement, coarsening, partitioning, and enumerating nodes, ensuring a 2:1 size balance between neighboring elements has historically been the most expensive in terms of CPU time and communication volume. the 2:1 balance operation is thus a primary target to optimize. One important component of a parallel balance algorithm is the ability to determine whether any two given octants have a consistent distance/size relation. Based on new logical concepts we propose fast algorithms for making this decision for all types of 2: 1 balance conditions in 2D and 3D. Since we are able to achieve this without constructing any parent nodes in the tree that would otherwise need to be sorted and communicated, we can significantly reduce the required memory and communication volume. In addition, we propose a lightweight collective algorithm for reversing the asymmetric communication pattern induced by non-local octant interactions. We have implemented our improvements as part of the open-source "p4est" software. Benchmarking this code with both synthetic and simulation-driven adapted meshes we are able to demonstrate much reduced runtime and excellent weak and strong scalability. On our largest benchmark problem with 5.13 x 10(11) octants the new 2:1 balance algorithm executes in less than 8 seconds on 112,128 CPU cores of the Jaguar Cray XT5 supercomputer.

关键词： Octrees Adaptive mesh refinement parallel algorithms Scientific computing High performance computing

来源：评论

学校读者我要写书评

暂无评论

To Review and Compare Evolutionary Algorithms in Optimization of distributed Database Query 8

To Review and Compare Evolutionary Algorithms in Optimizatio...

引用

8th International symposium on Digital Forensics and Security, ISDFS 2020

作者： Abdalla, Mohammed Hussein Karabatak, Murat University of Raparin Department of Computer Science Rania Iraq Firat University Department of Software Engineering Elazig Turkey

ISBN: (纸本)9781728169392

processing queries in distributed databases require the conversion and transmission of data from local and global sites. A query can be used to create a different executive plan of the query, which these plans are equal in size, meaning that they achieve the same result, but differ in the order in which the operators are executed and how they are executed, and therefore in their performance. the problem of query optimization in the distributed database is NP-hard in nature and difficult to solve. Exploring all the query plans in large search space is not feasible. the purpose and motivation of this paper are to examine the query challenges in the distributed databases and algorithms for the executive plan of the query. © 2020 ieee.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Adaptive parallel Distributive Join algorithm for skewed data

Adaptive parallel Distributive Join algorithm for skewed dat...

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Chung, SM Chatterjee, A Wright State Univ Dept Comp Sci & Engn Dayton OH 45435 USA

ISBN: (纸本)0769511538

In this paper, we present an adaptive version of the parallel Distributive Join (DJ) algorithm that we proposed in [1]. the adaptive parallel DJ algorithm can handle the data skew in operand relations efficiently. We implemented the original and adaptive parallel DJ algorithms on a network of Alpha workstations using the parallel Virtual Machine (PVM). We analyzed the performance of the algorithms, and compared it with that of the parallel Hybrid-Hash (KH) join algorithms. Our results show that the parallel DJ algorithms perform comparably with the parallel HH join algorithms over the entire range of the number of processors used and for different join selectivities. A significant advantage of the parallel DJ algorithms is that they can easily support non-equijoin operations.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：