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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

160 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

87 篇 工学
- 66 篇 计算机科学与技术...
- 36 篇 软件工程
- 17 篇 电子科学与技术（可...
- 9 篇 电气工程
- 8 篇 信息与通信工程
- 4 篇 控制科学与工程
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 化学工程与技术
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
- 1 篇 网络空间安全
21 篇 理学
- 17 篇 数学
- 1 篇 化学
- 1 篇 地球物理学
- 1 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
4 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
- 1 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学

主题

40 篇 parallel process...
36 篇 concurrent compu...
31 篇 computer archite...
24 篇 parallel algorit...
21 篇 hardware
17 篇 algorithm design...
15 篇 computer science
15 篇 parallel program...
11 篇 parallel process...
11 篇 delay
10 篇 application soft...
10 篇 signal processin...
10 篇 field programmab...
8 篇 parallel archite...
8 篇 laboratories
8 篇 processor schedu...
7 篇 scalability
7 篇 hypercubes
7 篇 network topology
7 篇 performance anal...

机构

3 篇 univ of aizu fuk...
3 篇 hong kong polyte...
2 篇 university of ai...
2 篇 aizu daigaku aiz...
2 篇 wuhan univ sch c...
2 篇 school of comput...
2 篇 department of el...
2 篇 department of co...
2 篇 university of ai...
2 篇 wuhan univ state...
1 篇 faculty of mathe...
1 篇 department of in...
1 篇 osaka metropolit...
1 篇 school of applie...
1 篇 departmentcomput...
1 篇 the departments ...
1 篇 computer researc...
1 篇 department of co...
1 篇 fakultat fur mat...
1 篇 department of co...

作者

3 篇 t.l. kunii
3 篇 cao jn
3 篇 li xh
3 篇 kunii tosiyasu l...
3 篇 he yx
2 篇 v. varshavsky
2 篇 t. nakamura
2 篇 huang runhe
2 篇 t. ikedo
2 篇 ma jun
2 篇 iwama kazuo
2 篇 s. zimmermann
2 篇 a. marongiu
2 篇 cong jason
2 篇 a.p. vazhenin
2 篇 h. kobayashi
2 篇 k. iwama
2 篇 qian-ping gu
2 篇 p. palazzari
2 篇 y. wong

语言

161 篇 英文
1 篇 中文

检索条件"任意字段=Aizu International Symposium on Parallel Algorithms/Architecture Synthesis"

共 162 条记录，以下是91-100 订阅

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

详细简洁

排序：

Implementing higher-order Gamma on MasPar: a case study

Implementing higher-order Gamma on MasPar: a case study

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： Kam Wing Ng Lin Peng Huang Yong Qiang Sun Department of Computer Science Chinese University of Hong Kong New Territories Hong Kong China Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

ISBN: (纸本)081867038X

Gamma is a kernel programming language with an elegant chemical reaction metaphor in which programs are described in terms of multiset rewriting. The Gamma formalism allows one to describe an algorithm without introducing artificial sequentiality and leads to the derivation of a parallel solution to a given problem naturally. However, the difficulty of incorporating control strategies makes Gamma not only hard for one to define any sophisticated approaches but also impossible to reach a decent level of efficiency in any direct implementation. Recently, a higher-order multiset programming paradigm, named higher-order Gamma, is introduced by Metayer to alleviate these problems. In this paper, we investigate the possibility of implementing higher-order Gamma on MasPar, a massively data parallel computer. The results show that a program written in higher-order Gamma can be transformed naturally towards an efficient implementation on a real parallel machine.< >

关键词： Computer aided software engineering Chemical elements Computer science parallel machines Programming profession Data structures Kernel Computer languages Very large scale integration Computer architecture

来源：评论

学校读者我要写书评

暂无评论

parallel rendering techniques for massively parallel visualization

Parallel rendering techniques for massively parallel visuali...

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： C. Hansen M. Krogh J. Painter Advanced Computing Laboratory Los Alamos National Laboratory Los Alamos NM USA

As the resolution of simulation models increases, scientific visualization algorithms which take advantage of the large memory and parallelism of massively parallel processors (MPPs) are becoming increasingly important. For large applications, rendering on an MPP tends to be preferable to rendering on a graphics workstation, due to the MPP's abundant resources: memory, disk and numerous processors. The challenge is developing algorithms that can exploit these resources while minimizing overheads, typically communication costs. This paper describes recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. It presents rendering algorithms, developed for MPPs, for polygonal, spherical and volumetric data. The polygon algorithm uses a data-parallel approach, whereas the sphere and volume rendering use a MIMD approach. Implementations for these algorithms are presented for a Thinking Machines Corp. CM-5 and a Cray Research Inc. T3D.

关键词： Visualization Rendering (computer graphics) Geometry Concurrent computing Laboratories parallel processing Graphics Costs Computational modeling Vector processors

来源：评论

学校读者我要写书评

暂无评论

Design of high-performance massively parallel architectures under pin limitations and non-uniform propagation delay

Design of high-performance massively parallel architectures ...

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： Chi-Hsiang Yeh B. Parhami Department of Electrical and Computer Engineering University of California Santa Barbara CA USA

Intermodule bandwidth is one of the major constraints on the performance of current and future parallel systems. We propose and evaluate several high performance bus based parallel architectures, including bus based cyclic networks (BCNs) and quotient cyclic networks (BQCNs), which are particularly efficient in view of their respective intermodule communication patterns. The intercluster connection in a BCN is defined on a set of nodes whose addresses are cyclic shifts of one another. The node degree of a basic BCN is 3, while those of BQCNs and enhanced BCNs can vary from a small constant (e.g., 2) to as large as required, thus providing flexibility and effective tradeoff between cost and performance. A variety of algorithms can be performed efficiently on these networks, thus providing the versatility of BCNs and BQCNs.

关键词： parallel architectures Hypercubes Bandwidth Costs Propagation delay Scalability Fault tolerant systems Network topology Tin Pins

来源：评论

学校读者我要写书评

暂无评论

The architecture of massively parallel processor CP-PACS

The architecture of massively parallel processor CP-PACS

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： T. Boku H. Nakamura K. Nakazawa Y. Iwasaki Institute of Information Sciences and Electronics University of Tsukuba Japan Research Center for Advanced Science and Technology University of Tokyo Japan Department of Information Science Electro-Communications University Japan Center for Computational Physics University of Tsukuba Japan

CP-PACS (Computational Physics by parallel Array Computer System) is a massively parallel processor with 2048 processing units, built at the Center for Computational Physics, University of Tsukuba, Japan. The node processor of CP-PACS is a RISC microprocessor enhanced by pseudo vector processing, which can realize high performance vector processing. The interconnection network is the 3 dimensional Hyper-Crossbar Network, which has high flexibility and embeddability for various network topologies and communication patterns. The theoretical peak performance of the whole system is 614.4 GFLOPS. We present an overview of the CP-PACS architecture and several special architectural characteristics of it. A performance evaluation on the parallel LINPACK benchmark is also shown.

关键词： Physics computing Concurrent computing Switches Computer architecture Reduced instruction set computing Quantum computing Information science Microprocessors Network topology Computer science education

来源：评论

学校读者我要写书评

暂无评论

An architecture-independent workload characterization model for parallel computer architectures

An architecture-independent workload characterization model ...

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： A.I. Meajil T. El-Ghazawi T. Sterling Electrical Engineering & Computer Science Department George Washington University USA Center for Advanced Computing Research California Institute of Technology NASA Jet Propulsion Laboratory USA

A model is presented for representing and comparing workloads, based on the way they would exercise parallel machines. This workload characterization is derived from parallel instruction centroid and parallel workload similarity. The centroid is a simple measure that aggregates average parallelism instruction mix, and critical path length. When captured with abstracted information about communication requirements, the result is a powerful tool in understanding the requirements of workloads and their potential performance on target machines. The workload similarity is based on measuring the normalized Euclidean distance (ned) between workload centroids. It is shown that this workload representation method outperforms comparable ones in accuracy, as well as in time and space requirements. Analysis of the NAS parallel Benchmarks and their performance is presented to demonstrate some of the applications, such as performance prediction with good accuracy, and insight provided by this model.

关键词： Concurrent computing Computer architecture parallel processing Euclidean distance parallel architectures Design for experiments Benchmark testing Extraterrestrial measurements Multidimensional systems Propulsion

来源：评论

学校读者我要写书评

暂无评论

A distributed environment for hypercube computing

A distributed environment for hypercube computing

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： Jung-Sing Jwo Shi-Sen Chang Yi-Cheng Chen D.F. Hsu Department of Computer and Information Sciences Tunghai University Taichung Taiwan Graduate Program in Computer Science Fordham University New York NY USA

Proposes a distributed computing environment, called the Virtual Cube (VC), to support arbitrarily large binary hypercube computing on a cluster of homogeneous workstations that are interconnected by an Ethernet LAN. The embedding concept between binary hypercube parallel architectures is introduced, and the concept of a cluster of computers interconnected through a computer network. In VC, a SIMD parallel language called VCPL (VC parallel Language) is provided. The advantages of the VC system are that (a) it can be considered as a practical and economical binary hypercube machine, and (b) it brings parallel solutions on a binary hypercube directly into distributed applications. Currently, a VC prototype is implemented on NeXT workstations.

关键词： Hypercubes Distributed computing Virtual colonoscopy Workstations LAN interconnection Computer networks parallel languages Ethernet networks Local area networks parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Extraction and optimization of the implicit program parallelism by dynamic partial evaluation

Extraction and optimization of the implicit program parallel...

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： A. Tchernykh A. Stepanov A. Lupenko N. Tchernykh Comput. Sci. Dept. CICESE Ensenada Mexico Russian Academy of Science Moscow Russia

Much work has been done to implement declarative languages in parallel form. Most of them tend to resort to imperative features for some purposes, particularly for description of the parallelism. We propose parallel computation on associative networks, a machine independent parallel programming model, for automatic extraction of available inherent parallelism and optimization of declarative programs. Associative networks are used for representing program-like and data-like information. The computation follows the transformation style of information processing. All computational mechanisms are oriented reward the processing incomplete information and perform parallel partial evaluation. This partial evaluation is a base of the proposed technique for automatic transforming, optimizing, and parallelizing declarative programs.

关键词： parallel processing Computer networks Concurrent computing Data mining Runtime parallel programming Computational modeling High performance computing Computer science Information processing

来源：评论

学校读者我要写书评

暂无评论

The Sisal model of functional programming and its implementation

The Sisal model of functional programming and its implementa...

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： J.-L. Gaudiot W. Bohm W. Najjar T. DeBoni J. Feo P. Miller Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA Computer Science Department Colorado State University Fort Collins CO USA Computer Research Group Lawrence Livemore National Laboratory Livermore CA USA CaeSoft Development Tracy CA USA

Programming a massively-parallel machine is a daunting task for any human programmer, and parallelization may even be impossible for any compiler. Instead, the functional programming paradigm may prove to be an ideal solution by providing an implicitly parallel interface to the programmer. We describe the Sisal (Stream and Iteration in a Single Assignment Language) project. Its goal is to provide a general-purpose user interface for a wide range of parallel processing platforms.

关键词： Functional programming parallel programming Concurrent computing Programming profession Laboratories Program processors parallel processing Costs Computer science Humans

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for maximal acyclic sets

Parallel algorithms for maximal acyclic sets

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： Zhi-Zhong Chen Xin He Department of Mathematical Sciences Tokyo Denki University Hatoyama Saitama Japan Department of Computer Science State University of New York University at Buffalo Buffalo NY USA

ISBN: (纸本)081867038X

Given a graph G=(V, E), the classical spanning forest problem of G can be viewed as the problem of finding a maximal subset F of E inducing an acyclic subgraph. Although it is well known that this problem has efficient NC algorithms, its vertex counterpart, i.e., the problem of finding a maximal subset U of V inducing an acyclic subgraph, has not been shown to be in NC (or even in RNC) and is not believed to be parallelizable in general. We present NC algorithms for solving the latter problem for three special cases. The first algorithm solves the problem for planar graphs in O(log/sup 3/ n) time using O(n) processors on an EREW PRAM. The second algorithm solves the problem for K/sub 3,3/-free graphs in O(log/sup 4/ n) time using O(n) processors on an EREW PRAM. The third algorithm solves the problem for graphs without long induced paths in poly-logarithmic time using O(n/sup 2376/) processors on an EREW PRAM.< >

关键词： parallel algorithms Algorithm design and analysis Approximation algorithms Phase change random access memory Helium Computer science NP-hard problem Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Implementing a 3D multigrid algorithm on Fujitsu's vector parallel supercomputer

Implementing a 3D multigrid algorithm on Fujitsu's vector pa...

引用

aizu international symposium on parallel algorithms/architecture synthesis

作者： J. Wang H. Lung Y. Katsumata T. Ishigai Scientific and Engineering Applications Fujitsu Systenis Business of America Inc. Santa Clara CA USA Computational Engineering Applications Supercomputer Systems Department Science Systems Division Fujitsu Laboratories Limited Chiba Japan

Multigrid algorithms are well adopted by many engineering applications programs on the traditional sequential computers due to their good convergence behavior. In order to convert those existing resources to the field of parallel computing in a timely manner, an effective parallelization methodology should be set up to ease the conversion efforts and to take advantage of the power of parallel processing at the same time. We demonstrate how domain decomposition can be applied to the multigrid algorithm by means of a simple three-dimensional problem which is solved by a V-cycle scheme. The sequential code in FORTRAN provided by NASA NAS, known as the NAS multigrid parallel benchmark test, is being used in our current study. We have concluded that the parallelization methodology presented here would greatly reduce conversion efforts in the process of parallelization and would obtain very good performance and scalability on the Fujitsu's VPP500 computers.< >

关键词： parallel processing Power engineering and energy Application software Power engineering computing Convergence NASA Benchmark testing Sequential analysis Scalability Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：