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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,437 篇 会议
109 篇 期刊文献
3 册 图书

馆藏范围

3,549 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,426 篇 工学
- 2,336 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 336 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,483 篇 英文
65 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3549 条记录，以下是1471-1480 订阅

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

详细简洁

排序：

A model of distributed-shared-memory on the SOME-bus architecture

A model of distributed-shared-memory on the SOME-bus archite...

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Katsinis, Constantine Electrical and Computer Engineering Drexel University Philadelphia PA 19104

ISBN: (纸本)0769521320

This paper examines the performance of distributed-shared-memory (DSM) systems based on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) using queuing network models and develops theoretical results which predict processor utilization, message latency and other useful measures. It also presents simulation results which compare the performance of the SOME-Bus, the crossbar and the torus using queuing-network models. The SOME-Bus is a broadcast-based, fiber-optic interconnection network which contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. The effect of collective communications due to cache coherence is examined. Results reveal that the performance of the SOME-Bus interconnection network is the least affected by large communication times, compared to the other two architectures considered here. Even in the presence of intense coherence traffic, processor utilization and message latency is much less affected than in the other architectures.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Cluster-based multiple task allocation in distributed computing system

Cluster-based multiple task allocation in distributed comput...

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Vidyarthi, Deo Prakash Tripathi, Anil Kumar Sarker, Biplab Kumer Dhawan, Abhishek Yang, Laurence Tianruo Department of Computer Science Faculty of Science Banaras Hindu University India Department of Computer Engineering I.T. Banaras Hindu University Varanasi-221005 India Department of Computer Engineering Kobe University Kobe 657-8501 Japan Department of Computer Applications Cochin University Cochin India St. Francise Xavier University Antigonish NS B2G 2W5 Canada

ISBN: (纸本)0769521320

Most of the task allocation models & algorithms in distributed Computing System (DCS) require a priori knowledge of its execution time on the processing nodes. Since the task assignment is not known in advance, this time is quite difficult to estimate. We propose a cluster-based dynamic allocation scheme, in a distributed computing system, which eliminate this time requirement. Further, as opposed to a single task allocation, generally proposed in most of the models, we consider multiple tasks. A fuzzy function is used for both the module clustering and processor clustering. Dynamic invocation of clustering and assignment is considered. Experimental results show the efficacy of the proposed model.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A flexible IO scheme for Grid Workflows

A flexible IO scheme for Grid Workflows

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Abramson, David Kommineni, Jagan Sch. of Comp. Sci. and Software Eng. Monash University Clayton 3800 Australia

ISBN: (纸本)0769521320

Computational Grids have been proposed as the next generation computing platform for solving large-scale problems in science, engineering, and commerce. There is an enormous amount of interest in applications, called Grid Workflows in which a number of otherwise independent programs are run in a "pipeline". In practice, there are a number of different mechanisms that can be used to couple the models, ranging from loosely coupled file based IO to tightly coupled message passing. In this paper we propose a flexible IO architecture that provides a wide range of mechanisms for building Grid Work/lows without the need for any source code modification and without the need to fix them at design time. Further, the architecture works with legacy applications. We evaluate the performance of our prototype system using a workflow in computational mechanics.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Improving data locality in parallel fast fourier transform algorithm for pricing financial derivatives

Improving data locality in parallel fast fourier transform a...

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Barua, Sajib Thulasiram, Ruppa K. Thulasiraman, Parimala Department of Computer Science 545 Machray Hall University of Manitoba Winnipeg Man. R3T 2N2 Canada

ISBN: (纸本)0769521320

Pricing of derivatives is one of the central problems in Computational Finance. Since the theory of derivative pricing is highly mathematical, numerical techniques such as binomial lattice, finite-differencing and fast Fourier transform (FFT) among others have been used for derivative or option pricing. Based on a recent work on FFT for VLSI circuits, we develop a parallel algorithm in the current work, which improves data locality and hence reduce communication overheads. Our main aim is to study the performance of this algorithm. Compared to the traditional butterfly network, the current algorithm with data swap network performs better by more than 15% for large data sizes.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

JIST: Just-in-time scheduling translation for parallel processors

JIST: Just-in-time scheduling translation for parallel proce...

引用

proceedings - ISPDC 2004: third International symposium on parallel and distributed Computing/HeteroPar '04: third International Workshop on Algorithms, Models and Tools for parallel Computing on Heterogeneous Networks

作者： Agosta, Giovanni Reghizzi, Stefano Crespi Falauto, Gerlando Sykora, Martino Politecnico di Milano Dipartimento di Elettronica e Informazione Piazza Leonardo da Vinci 32 20133 Milano Italy

ISBN: (纸本)0769522106

The application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bridge the gap between the two technologies, but special attention must be paid to software instruction scheduling, a must for the VLIW architectures. We have implemented JJST, a Virtual Machine and JIT compiler for Java Bytecode targeted to a VLIW processor. We show the impact of various optimizations on the performance of code compiled with JIST through the experimental study on a set of benchmark programs. We report significant speedups, and increments in the number of instructions issued per cycle up to 50% with respect to the non-scheduling version of the JIT compiler. Further optimizations are discussed. © 2004 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A poly-algorithmic approach applied for fast matrix multiplication on clusters

A poly-algorithmic approach applied for fast matrix multipli...

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Nasri, Wahid Trystram, Denis LIP2 Dept. des Sciences de l'Informatique Faculté des Sciences Tunis Tunisia ID-IMAG Grenoble France

ISBN: (纸本)0769521320

There is today an increasing diversity of parallel execution supports. Solving a target problem by using a single algorithm is not always efficient on any computational support. We present in this paper a polyalgorithmic approach for selecting the most suitable algorithm among various ones for given problem size and available resources. Our principal objective here is to illustrate such an approach on the well-known matrix multiplication problem which is one of the most important basic numerical kernels. More precisely, we propose a poly-algorithm which uses both advantages of standard and fast algorithms which is able to automatically choose the right and suitable algorithm for computing the matrix multiplication of any dimension on a particular parallel system. We target this approach on homogeneous clusters of PCs while providing some experiments.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient simulation based on sweep selection for 2-D and 3-D ising spin models on hierarchical clusters

Efficient simulation based on sweep selection for 2-D and 3-...

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Santos, Eunice E. Muthukrishnan, Gayathri Department of Computer Science Virginia Polytech. Inst./State Univ. Blacksburg VA

ISBN: (纸本)0769521320

In this paper, we design parallel Monte Carlo algorithms for the Ising spin model on a hierarchical cluster. A hierarchical cluster can be considered as a cluster of homogeneous nodes which are partitioned into multiple supernodes such that communication across homogenous clusters are represented by a supernode topological network. We consider different data layouts and provide equations for choosing the best data layout under such a network paradigm. We show that the data layouts designed for a homogeneous cluster will not yield as good results as layouts designed for a hierarchical cluster. We derive theoretical results of the performance of the algorithms on a modified version of the LogP model that represents such tiered networking, and present simulation results to analyze the utility of the theoretical design and analysis. Furthermore, we consider the 3-D Ising model and design parallel algorithms for sweep spin selection for them on both homogeneous and hierarchical clusters.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Compiler support for parallel code generation through kernel recognition

Compiler support for parallel code generation through kernel...

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Arenaz, Manuel Touriño, Juan Doallo, Ramón Department of Electronics University of A Coruña Spain

ISBN: (纸本)0769521320

The automatic parallelization of loops that contain complex computations is still a challenge for current parallelizing compilers. The main limitations are related to the analysis of expressions that contain subscripted subscripts, and the analysis of conditional statements that introduce complex control flows at run-time. We use the term complex loop to designate loops with such characteristics. In this paper, we focus on the generation of parallel code for sequential complex loop nests using a generic compiler framework (proposed in an earlier paper [3]) that accomplishes kernel recognition through the analysis of the Gated Single Assignment program representation. Specifically, we present an extension of this framework that enables its use as a powerful tool for gathering source code information that is relevant for the parallelization of each computational kernel. A set of example codes are analyzed in detail to illustrate the potential of our approach. Experimental results using a benchmark suite of complex loop nests are also presented.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of the treecode Ewald method

Parallel implementation of the treecode Ewald method

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Liu, Dongqing Duan, Zhong-Hui Krasny, Robert Zhu, Jianping Department of Computer Science University of Akron Akron OH 44325 United States Department of Mathematics University of Michigan Ann Arbor MI 48109 United States Dept. of Theor. and Appl. Math. University of Akron Akron OH 44325 United States

ISBN: (纸本)0769521320

In this paper, we discuss an efficient parallel implementation of the treecode Ewald method for fast evaluation of long-range Coulomb interactions in a periodic system for molecular dynamics simulations. The parallelization is based on an adaptive decomposition scheme using the Morton order of the particles. This decomposition scheme takes advantage of the data locality and involves minimum changes to the original sequential code. The Message Passing Interface (MPI) is used for inter-processor communications, making the code portable to a variety of parallel computing platforms. We also discuss communication and performance models for our parallel algorithm. The predicted communication time and parallel performance from these models match the measured results well. Timing results obtained using a system of water molecules on the IA32 Cluster at the Ohio Supercomputer Center demonstrate high speedup and efficiency of the parallel treecode Ewald method.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

SRUMMA: A matrix multiplication algorithm suitable for clusters and scalable shared memory systems

SRUMMA: A matrix multiplication algorithm suitable for clust...

引用

proceedings - 18th International parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Krishnan, Manojkumar Nieplocha, Jarek Compl. Sciences and Mathematics Pac. Northwest National Laboratory

ISBN: (纸本)0769521320

This paper describes a novel parallel algorithm that implements a dense matrix multiplication operation with algorithmic efficiency equivalent to that of Cannon's algorithm. It is suitable for clusters and scalable shared memory systems. The current approach differs from the other parallel matrix multiplication algorithms by the explicit use of shared memory and remote memory access (RMA) communication rather than message passing. The experimental results on clusters (IBM SP, Linux-Myrinet) and shared memory systems (SGI Altix, Cray X1) demonstrate consistent performance advantages over pdgemm from the ScaLAPACK/PBBLAS suite, the leading implementation of the parallel matrix multiplication algorithms used today. In the best case on the SGI Altix, the new algorithm performs 20 times better than pdgemm for a matrix size of 1000 on 128 processors. The impact of zero-copy nonblocking RMA communications and shared memory communication on matrix multiplication performance on clusters are investigated.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 144 145 146 147 148 149 150 151 152 153 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：