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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,814 篇 会议
176 篇 期刊文献
83 册 图书

馆藏范围

4,073 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,086 篇 工学
- 1,904 篇 计算机科学与技术...
- 1,023 篇 软件工程
- 367 篇 电气工程
- 150 篇 信息与通信工程
- 137 篇 电子科学与技术（可...
- 75 篇 控制科学与工程
- 30 篇 机械工程
- 30 篇 生物工程
- 24 篇 材料科学与工程（可...
- 24 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 20 篇 光学工程
- 19 篇 建筑学
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 13 篇 动力工程及工程热...
- 12 篇 农业工程
524 篇 理学
- 417 篇 数学
- 50 篇 物理学
- 39 篇 系统科学
- 33 篇 生物学
- 30 篇 统计学（可授理学、...
- 16 篇 化学
- 16 篇 地球物理学
207 篇 管理学
- 154 篇 管理科学与工程(可...
- 61 篇 工商管理
- 54 篇 图书情报与档案管...
19 篇 农学
- 14 篇 作物学
18 篇 法学
- 18 篇 社会学
15 篇 经济学
- 15 篇 应用经济学
13 篇 医学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学
1 篇 哲学

主题

647 篇 parallel process...
544 篇 parallel program...
527 篇 computer archite...
461 篇 parallel archite...
448 篇 concurrent compu...
358 篇 parallel algorit...
320 篇 programming
312 篇 hardware
282 篇 computer science
275 篇 algorithm design...
263 篇 computational mo...
214 篇 programming prof...
167 篇 dynamic programm...
166 篇 parallel process...
154 篇 application soft...
139 篇 program processo...
138 篇 costs
138 篇 distributed comp...
136 篇 libraries
134 篇 graphics process...

机构

9 篇 stanford univ st...
9 篇 intel corporatio...
8 篇 barcelona superc...
8 篇 oak ridge natl l...
8 篇 univ calif berke...
7 篇 school of comput...
7 篇 oak ridge nation...
7 篇 carnegie mellon ...
7 篇 college of compu...
7 篇 oak ridge nation...
7 篇 univ texas austi...
6 篇 school of comput...
6 篇 sandia national ...
6 篇 department of co...
6 篇 department of co...
6 篇 department of co...
5 篇 department of co...
5 篇 nvidia corporati...
5 篇 pacific northwes...
5 篇 georgia institut...

作者

15 篇 jack dongarra
12 篇 dongarra jack
10 篇 hoefler torsten
10 篇 hong shen
9 篇 zhong cheng
9 篇 olukotun kunle
9 篇 gu yan
8 篇 chapman barbara
7 篇 garcia i.
7 篇 forsell martti
7 篇 sun yihan
7 篇 jigang wu
7 篇 nakano koji
7 篇 danelutto marco
6 篇 cheng zhong
6 篇 v.k. prasanna
6 篇 blelloch guy e.
6 篇 h.j. siegel
6 篇 lumsdaine andrew
6 篇 tsigas philippas

语言

4,030 篇 英文
35 篇 其他
13 篇 中文

检索条件"任意字段=International Symposium on Parallel Architectures, Algorithms, and Programming"

共 4073 条记录，以下是3071-3080 订阅

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

详细简洁

排序：

A parallel algorithm with embedded load balancing for autocorrelation matrix computation

A parallel algorithm with embedded load balancing for autoco...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： S.R. Subramanya Dept. of Electr. Eng. & Comput. Sci. George Washington Univ. Washington DC USA

The computation of autocorrelation matrix is used heavily in several areas including signal and image processing, where parallel and application-specific architectures are also being increasingly used. Therefore, an efficient scheme to compute autocorrelation matrix on parallel architectures has tremendous benefits. In this paper, a parallel algorithm for the computation of autocorrelation matrix on 2-D mesh, is presented. The computation requirements for the elements of the autocorrelation matrix is highly skewed and the proposed algorithm attempts to balance the computation load, without requiring an external load balancing algorithm or processor. In this sense, the load balancing is embedded within the algorithm. The exact number of computation steps are derived. The time complexity of the proposed algorithm is shown to be within twice the optimal (or lower bound). It is also shown to have twice the speedup of a straight-forward parallel algorithm.

关键词： parallel algorithms Autocorrelation Concurrent computing Embedded computing Autoregressive processes Load management Arithmetic parallel architectures Signal processing Image processing

来源：评论

学校读者我要写书评

暂无评论

An adaptive processor allocation strategy for mesh-connected systems

An adaptive processor allocation strategy for mesh-connected...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Kyung-Hee Seo Sung-Chun Kim Department of Computer Science Sogang University Seoul South Korea

ISBN: (纸本)0818682596

We propose an adaptive processor allocation strategy based on shape manipulations of required submesh for large mesh-connected systems. When an incoming job requests a rectangular submesh, our strategy first tries to allocate the conventional rectangular submeshes including 90-degree rotation and folding techniques. If it fails, our strategy further tries to allocate more flexible and robust L-shaped submeshes instead of signaling the allocation failure. Thus, our strategy accommodates incoming job earlier than conventional strategies. Simulation results indicate that our strategy performs more efficiently than other strategies in terms of the external fragmentation, the job response time, and the system utilization. Our strategy is transparent to application programmers and does not require additional hardware supports. Moreover, with our L-shaped submesh allocation strategy, application programmers using the mesh-connected system may no longer limit their request to rectangular submeshes. They can request the L-shaped submesh with the number of processors much closer to the exactly needed value to execute their job.

关键词： Shape Delay Computer science Robustness Hardware programming profession Topology Very large scale integration Prototypes Hypercubes

来源：评论

学校读者我要写书评

暂无评论

Determination of an optimal processor allocation in the design of massively parallel processor arrays

Determination of an optimal processor allocation in the desi...

引用

IEEE international Conference on algorithms and architectures for parallel Processing (ICAP)

作者： D. Fimmel R. Merker Department of Electrical Engineering Dresden University of Technology Germany

In this paper we consider the determination of allocation functions as a part of the design of massively parallel processor arrays for algorithms which can be represented as systems of uniform recurrence equations. The objective is to find allocation functions minimizing the necessary chip area for a hardware implementation of the processor array. We propose an algorithm approximately minimizing the number of processors under consideration of the necessary chip area needed to implement the processors of the processor array. The arising optimization problems can be solved using integer linear programming.

关键词： Difference equations Signal processing algorithms Hardware Algorithm design and analysis Processor scheduling Scheduling algorithm Integer linear programming Systolic arrays Array signal processing Signal synthesis

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for the planar mincut linear arrangement problem for trees

An efficient parallel algorithm for the planar mincut linear...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Sung Kwon Kim Department of Computer Science and Engineering Chung Ang University Seoul South Korea

ISBN: (纸本)0818682596

The MINCUT problem for graphs is to find a linear arrangement with minimum cut. The problem is NP-complete for general graphs while polynomial-time solvable for trees. The PLANAR MINCUT problem does not allow edge crossings in arrangements. We present a parallel algorithm for the PLANAR MINCUT problem for trees with n vertices, which takes O(log/sup 2/ n) time and O(n) processors in the EREW PRAM.

关键词： parallel algorithms Tree graphs Phase change random access memory Polynomials Ear Vegetation mapping Computer science Joining processes

来源：评论

学校读者我要写书评

暂无评论

Modular parallel programming in mpC for distributed memory machines

Modular parallel programming in mpC for distributed memory m...

引用

Aizu international symposium on parallel algorithms/Architecture Synthesis

作者： D. Arapov V. Ivannikov A. Kalinov A. Lastovetsky I. Ledovskih T. Lewis Institute for System Programming Russian Academy of Science Moscow Russia Naval Postgraduate School Monterrey CA USA

The mpC language is an ANSI C superset supporting modular parallel programming for distributed memory machines. It allows the user to specify dynamically an application topology, and the mpC programming environment uses this information in run time to provide the most efficient execution of the program on any particular distributed memory machine. The paper describes the features of mpC and its programming environment which allow to use them for developing libraries of parallel programs.

关键词： parallel programming programming environments Libraries Dynamic programming parallel processing Network topology Distributed computing Functional programming parallel algorithms Computer networks

来源：评论

学校读者我要写书评

暂无评论

New partitioning schemes for parallel modified Gram-Schmidt orthogonalization

New partitioning schemes for parallel modified Gram-Schmidt ...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： S. Oliveria T. Soma Dept. of Comput. Sci. Texas A&M Univ. College Station TX USA Department of Computer Science Texas A and M University College Station TX USA

In this paper we are concerned with parallel implementation of row-oriented Gram-Schmidt orthogonalization. For the data partitioning four types of columnwise partitioning schemes were considered: column (1-col), block, cyclic and block-cyclic (b-c) partitioning. Analytical models for parallel execution time required by these implementations are derived and compared with numerical results. The best partitioning scheme is shown theoretically and by numerical results.

关键词： Partitioning algorithms Analytical models Vectors Computer science Linear algebra Scientific computing Stability IEEE members parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Dycos-a customizable kernel architecture supporting distributed operating environments

Dycos-a customizable kernel architecture supporting distribu...

引用

IEEE international Conference on algorithms and architectures for parallel Processing (ICAP)

作者： C.B. Czech Department of Computer Science Technische Universitat Munchen Munich Germany

Techniques of customizing and extending operating systems (OSs) have a growing impact on system architectures in the field of distributed computing and parallel programming. Even if traditional methods of adaption have been limited to the user-level, modern OSs cannot do without kernel support. Hence concepts and structures of microkernel architectures must be redefined to meet the requirements of today's and future applications. We propose a new customizable low-level OS architecture-the Dycos kernel. We discuss customization demands on microkernels and describe the basic kernel concept. Dycos is an object-based approach providing a toolbox of operations to build user-definable compositions of kernel structures. The Dycos approach has been evaluated on a Solaris 2.5.1 platform.

关键词： Kernel Computer architecture Resource management Software architecture Computer science Electronic mail Operating systems Distributed computing parallel programming Solar power generation

来源：评论

学校读者我要写书评

暂无评论

Comparing high-level and low-level implementations of a molecular dynamics algorithm

Comparing high-level and low-level implementations of a mole...

引用

international Workshop on High-Level parallel programming Models and Supportive Environments

作者： G. Travieso Departamento de Física e Informdtica IFSC/USP Brazil

The author addresses through a specific example the question about the overhead incurred with the use of higher abstraction levels for parallel programming. He develops a simple molecular dynamics application in ALWAN... 详细信息

关键词： Heuristic algorithms Topology programming profession parallel processing Quantum computing Dynamic programming parallel programming parallel architectures parallel algorithms Wide area networks

来源：评论

学校读者我要写书评

暂无评论

An evolutionary approach for scheduling in parallel processor systems

An evolutionary approach for scheduling in parallel processo...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： A.Y. Zomaya C. Ward B. Macey Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Nedlands WA Australia University of Western Australia Perth WA AU

Task scheduling is essential for the proper functioning of parallel processor systems. Scheduling of tasks onto networks of parallel processors is an interesting problem that is well-defined and documented in the literature. However, most of the available techniques are based on heuristics that solve certain instances of the scheduling problem very efficiently and in reasonable amounts of time. This paper investigates an alternative paradigm, based on genetic algorithms, that can be used to efficiently solve the scheduling problem without the need to apply any restricted assumptions that are problem-specific, such as is the case when using heuristics. The conditions under which a genetic algorithm performs best will also be highlighted. This will be accompanied by a number of examples and case studies.

关键词： Processor scheduling Job shop scheduling Routing parallel processing Genetic algorithms Delay estimation Laboratories Manufacturing processes Process control Operations research

来源：评论

学校读者我要写书评

暂无评论

algorithms and lower bounds for p-gossiping in circulant networks

Algorithms and lower bounds for p-gossiping in circulant net...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： E.A. Monakhova Computing Center Sibirian Division Russian Academy of Science Novosibirsk Russia

In this paper we consider the broadcast and gossiping problems in circulant networks. The circulant graphs are studied extensively as reliable interconnection networks for the multiprocessor systems. We consider gossiping in the store-and-forward, full-duplex and shouting model for the case when communicating nodes can exchange up to a fixed number p of packets at each round of gossiping (p-gossiping). A general method for evaluation of the lower bounds for p-gossiping in circulant graphs is established. The parallel decentralized node-invariant broadcast and p-gossiping algorithms are proposed which provide a minimum execution time and a minimum of message loading of a network during message-passing.

关键词： Intelligent networks Broadcasting Computer networks Concurrent computing Network topology Electronic mail parallel algorithms Partial differential equations Protocols Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共408页 << < 304 305 306 307 308 309 310 311 312 313 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：