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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

638 篇 会议
29 册 图书
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

322 篇 工学
- 307 篇 计算机科学与技术...
- 162 篇 软件工程
- 40 篇 信息与通信工程
- 29 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 电子科学与技术（可...
- 8 篇 力学（可授工学、理...
- 8 篇 机械工程
- 8 篇 航空宇航科学与技...
- 7 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 5 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 生物工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 交通运输工程
116 篇 理学
- 83 篇 数学
- 28 篇 物理学
- 10 篇 系统科学
- 7 篇 生物学
- 7 篇 统计学（可授理学、...
- 5 篇 化学
- 3 篇 大气科学
39 篇 管理学
- 26 篇 管理科学与工程(可...
- 16 篇 工商管理
- 14 篇 图书情报与档案管...
11 篇 医学
- 7 篇 临床医学
- 5 篇 基础医学(可授医学...
4 篇 经济学
- 4 篇 应用经济学
2 篇 教育学
1 篇 法学
1 篇 农学
1 篇 艺术学

主题

153 篇 concurrent compu...
131 篇 distributed comp...
86 篇 parallel process...
57 篇 application soft...
56 篇 computer science
52 篇 parallel algorit...
50 篇 computer network...
48 篇 computer archite...
42 篇 parallel process...
38 篇 workstations
38 篇 hardware
34 篇 computational mo...
34 篇 costs
31 篇 message passing
30 篇 high performance...
27 篇 parallel program...
26 篇 delay
24 篇 processor schedu...
22 篇 programming prof...
20 篇 bandwidth

机构

5 篇 department of co...
3 篇 polytechnic univ...
3 篇 harbin institute...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 université jean ...
2 篇 enea headquarter...
2 篇 leibniz universi...
2 篇 department of co...
2 篇 georgia inst tec...
2 篇 syracuse univ sy...
2 篇 ruhr university ...
2 篇 unicredit milan
2 篇 northwestern uni...
2 篇 mcgill universit...
2 篇 upc barcelonatec...
2 篇 warsaw universit...
2 篇 ibm canada softw...
2 篇 university of an...

作者

4 篇 a. choudhary
4 篇 yongqiang sun
3 篇 priya unnikrishn...
3 篇 babik marian
3 篇 kit barton
3 篇 hluchy ladislav
3 篇 sun yq
3 篇 tae-geun kim
3 篇 xinda lu
3 篇 choudhary a
3 篇 m. sato
2 篇 davies a.j.
2 篇 ercan mf
2 篇 ibéria medeiros
2 篇 holger fröning
2 篇 to-yat cheung
2 篇 pascal welke
2 篇 linara adilova
2 篇 schwan k
2 篇 donato malerba

语言

684 篇 英文
3 篇 其他
3 篇 中文
1 篇 西班牙文

检索条件"任意字段=Proceedings of the 1997 Conference on Advances in Parallel and Distributed Computing"

共 691 条记录，以下是351-360 订阅

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

详细简洁

排序：

Techniques to provide run-time support for solving irregular problems

Techniques to provide run-time support for solving irregular...

引用

IEEE International conference on parallel and distributed Systems

作者： No, J Choudhary, A Syracuse Univ Syracuse NY 13244 USA

ISBN: (纸本)0818682272

In this paper we present a runtime library design based on the two-phase collective I/O technique for irregular applications. The design is motivated by the requirements of a large number of ASCI (Accelerated Strategic computing Initiative) applications, although the design and interface is general enough to be used from any irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O at the same time, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, SO that only one group performs I/O simultaneously, while the nest group performs communication to rearrange data, and this entire process is pipelined. This reduces the contention at the I/O nodes but requires more complicated scheduling and a possible degradation in communication performance. We obtained up to 40 MBytes/sec. application level performance on the Caltech's Intel Paragon (with 16 IO nodes, each containing one disk) which includes on-the-fly reordering costs. We observed up to 60 MBytes/sec on the ASCI/Red machine with only three I/O nodes (with RAIDS).

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A checkpointing strategy for scalable recovery on distributed parallel systems 97

A checkpointing strategy for scalable recovery on distribute...

引用

1997 ACM/IEEE conference on Supercomputing, SC 1997

作者： Naik, Vijay K. Midkiff, Samuel P. Moreira, Jose E. IBM T. J. Watson Research Center P. O. Box 218 Yorktown Heights NY 10598 United States

ISBN: (纸本)0897919858

In this paper, we describe a new scheme for checkpointing parallel applications on message-passing scalable distributed memory systems. The novelty of our scheme is that a checkpointed application can be restored, from its checkpointed state, in a reconfigured form. Thus, a parallel application may be checkpointed while executing with t1 tasks on p1 processors, and then restarted from the checkpointed state with t2 tasks on p2 processors. As a result, applications can recover from partial failures in the underlying system. Also, the reconfigurable checkpointed states can be migrated from one parallel system to another even if they do not have the same number of processors. We describe a new programming model for implementing a reconfigurable checkpointing scheme for parallel programs. This new model is derived from the DRMS programming model, developed in the context of run-time reconfiguration of parallel applications. A key component of our implementation is the distribution-independent representation of application array data structures in persistent storage. For further optimizing the performance of checkpoint/restart operations, we provide parallel array section streaming operations for such distributed arrays. We present performance data for the reconfigurable checkpointing and restarting of parallel applications and compare that with the performance of conventional forms of checkpointing. Our results demonstrate the advantages of the new scheme we describe. © 1997 ACM.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

parallel data cube construction for high performance on-line analytical processing

Parallel data cube construction for high performance on-line...

引用

4th International conference on High-Performance computing (HiPC 97)

作者： Goil, S Choudhary, A NORTHWESTERN UNIV DEPT ELECT & COMP ENGNEVANSTONIL 60201

ISBN: (纸本)0818680679

Decision support systems use On-Line Analytical Processing (OLAP) to analyze data by posing complex queries that require different views of data. Traditionally, a relational approach (ROLAP) has been taken to build such systems. More recently, multi-dimensional database techniques (MOLAP) have been applied to decision-support applications. Data is stored in multidimensional arrays which is a natural way to express the multi-dimensionality of the enterprise and is more suited for analysis. Precomputed aggregate calculations in a Data cube can provide efficient query processing for OLAP applications. In this paper we present algorithms and results for in-memory data cube construction on distributed memory machines.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Airline reservations systems - past, present and future challenges

Airline reservations systems - past, present and future chal...

引用

proceedings of the 1997 5th International conference on the Application of High-Performance Computers in Engineering, HPC

作者： Haramis, G.E. Karakatsanis, V. Univ of Macedonia Thessaloniki Greece

The aim of this paper is to present the results of our survey on the applications and problems arising from parallel processing in the area of Airlines Reservations Systems. We used the Reservation System of Olympic Airways as our basic model. We shall describe the systems, the problems which arise and finally we shall give our propositions and solutions.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of the boundary element method using PVM and HPF on a collection of networked workstations

Parallel implementation of the boundary element method using...

引用

proceedings of the 1997 5th International conference on the Application of High-Performance Computers in Engineering, HPC

作者： Mushtaq, J. Davies, A.J. Univ of Hertfordshire Hertfordshire United Kingdom

Solving large computationally intensive problems requires significant processing power and the current trend in achieving this power is not by increasing the throughput of individual processors, but to sub-divide the problem into co-operating tasks so that many processors may be used to solve the problem. Stand-alone workstations, such as the PC and the SUN machines, delivering tens of millions of operations per second are common place, but to achieve high parallel efficiency, distributed systems must support rapid communication between a large number of processors on a single coherent network. parallel programming packages have been developed to assist in parallel program development, such as the parallel Virtual Machine (PVM) and High Performance Fortran (HPF). In this paper we present an analysis of PVM and HPF within the context of the boundary element method. Domain decomposition is used to sub-divide and distribute a two-dimensional potential problem onto a collection of networked stand-alone workstations using PVM and HPF. We observe that the development of parallel applications using HPF is very efficient and straight forward when compared with PVM. However, PVM offers a better performance efficiency and a greater degree of freedom than HPF, since PVM allows both coarse and fine-grained parallelism. The performance of PVM and HPF are further compared with that of the 3L parallel Fortran on a T800 transputer network.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Finite element analysis of large nonlinear problems in solid mechanics by parallel computing

Finite element analysis of large nonlinear problems in solid...

引用

proceedings of the 1997 5th International conference on the Application of High-Performance Computers in Engineering, HPC

作者： Gabbert, U. Grochla, J. Koeppe, H. Otto-von-Guericke-Universitaet Magdeburg Magdeburg Germany

The present paper deals with the simulation of the nonlinear and time dependent behaviour of complex structures in engineering. To overcome the limiting factors of such computer simulations - the computer run time and the memory requirement - we use an dynamic-explicit time integration procedure for the solution of the semi-discrete equations of motion, which is very well suited for parallel processing. At first we give a brief review of the theoretical background of the mechanical modelling and the dynamic-explicit technique for the solution of the semi-discrete equations of motion. Then the concept of parallelisation is discussed.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Implementation of two-dimension FFT on massively parallel processing system DAWN1000

Implementation of two-dimension FFT on massively parallel pr...

引用

conference on parallel and distributed Methods for Image Processing

作者： Wang, YT Wang, ZS Institute of Electronics (China)

ISBN: (纸本)0819425885

Two-dimensional (2D) Discrete Fourier Transform (DFT) frequently needs to be performed in the digital image processing. Although the computing time of 2D DFT can be dramatically reduced by using 2D Fast Fourier Transform (FFT), the processing speed of a very large array is yet intolerable. The development of parallel processing system promotes the application of 2D FFT. In this paper, we present the implementation of 2D FFT as a general procedure by row-column method and vector-radix method based on a general-purpose massively parallel processing system-DAWN 1000 developed in China. Even though the 2D FFT has parallel characteristics in nature, the requirement of corner-turning and the existence of data communication make its implementation more complicated. We analyze the impact of the machine capacity and the computing complexity on the algorithm efficiency and evaluate the implementation in terms of the arithmetic operations as well as the data transfer. The comparison of the two methods shows the fact that each method has its own advantages and disadvantages. Combining their traits, we design a new implementation algorithm concerning its flexibility, the efficiency and the complexity of the communication. As an example, we fulfill the spaceborne SAR Image processing by using the new approach.

关键词： parallel processing MPP row-column algorithm vector-radix algorithm block algorithm two-dimensional FFT SAR image processing

来源：评论

学校读者我要写书评

暂无评论

Memory-optimized visualization system for limited-bandwidth multiprocessing environments

Memory-optimized visualization system for limited-bandwidth ...

引用

proceedings of the 1997 4th International conference on High Performance computing, HiPC

作者： Law, Asish Yagel, Roni Nichimen Graphics Inc Los Angeles 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 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 during animation on limited-bandwidth multiprocessing environments. We report results of the algorithm's implementation on several platforms like Cray T3D, Convex SPP and DEC-alpha cluster of workstations (COWs), and achieved higher efficiency and scalability than existing algorithms.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Load balancing using symmetric broadcast networks: A PVM-based comparative performance study

Load balancing using symmetric broadcast networks: A PVM-bas...

引用

proceedings of the 1997 4th International conference on High Performance computing, HiPC

作者： Prasad, Sushil K. Yang, Cui-Qing Li, Jizhou Das, Sajal K. Georgia State Univ Atlanta United States

In parallel and distributed systems, an important issue in managing a decentralized task queue is load balancing among multiple processors. In this paper, we propose a scheme for this problem by using a symmetric broadcast network (SBN) which provides an efficient and robust communication pattern between processors. We compare the performance of SBN-based load balancing algorithm with randomization-based algorithm, gradient algorithm, and extended gradient algorithm on a broad range of computing and communication platforms. All four algorithms were first implemented on an 8-processor Intel's iPSC-2, a hypercube-based multicomputer. Then, the programs were ported to parallel Virtual Machine (PVM). Using PVM, we compared all four algorithms on (i) an 8-processor bus-based Silicon Graphics multiprocessor (SGI), (ii) two DEC's Alpha workstations connected by a Local Area Network, and (iii) SGI and the two DEC Alpha's connected by Internet. We found that our SBN-based algorithm performed well over a wide range of workloads, and computer and communication configurations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

What computer architecture can learn from computational intelligence - and vice versa

What computer architecture can learn from computational inte...

引用

23rd Euromicro conference on New Frontiers of Information Technology

作者： Moore, R Klauer, B Waldschmidt, K J. W. Goethe-University Technische Informatik 60054 Frankfurt P.O. Box 111932 Germany

ISBN: (纸本)0818681306

This paper considers whether the seemingly disparate fields of Computational Intelligence (CI) and computer architecture can profit from each others' principles, results and experience. In the process, we identify important common issues, such as parallelism, distribution of data and control, granularity and regularity. We present two novel computer architectures which have profited from principles found in CI, and identify two constraints on CI to eliminate the hidden influence of the von Neumann model of computation.

关键词： Memory systems and management Multithreaded Architecture Neuro-computing parallel and distributed Systems parallelizing compilers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共70页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：