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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

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

共 3536 条记录，以下是3481-3490 订阅

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

详细简洁

排序：

the quadratic sieve factoring algorithm on distributed memory multiprocessors 5

The quadratic sieve factoring algorithm on distributed memor...

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Cosnard, M. Philippe, J. Laboratoire de l'Informatique du Parallelisme - IMAG Ecole Normale Supérieure de Lyon 46 allée d'talie LYON Caex 0769364 France

ISBN: (纸本)0818621133

the quadratic sieve algorithm is a powerful method for factoring large integers up to 100 digits. In this paper, we study in detail each step of the algorithm, in order to derive efJicient parallel implementations on distributed memory multiprocessors. Our aim is to prove, taking the quadratic sieve algorithm as a revealer, that very efficient programming methodologies could be derived in order to take the most out of the target architecture. We describe an implementation of the quadratic sieve algorithm on the FPS T40 hypercube. We evaluute the solution through the results we obtain, and particularly the superlinear speedup. We try to explain these speedups. From these experimental considerations, we derive more eficient implementations, including totally equidistributed tasks among the processors. Some other refinements may be added to the algorithm. © 1990 ieee.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient serial and parallel subcube recognition in hypercubes 5

Efficient serial and parallel subcube recognition in hypercu...

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Al-Bassam, S. El-Rewini, H. Bose, B. Lewis, T. Department of Computer Science Oregon State University CorvallisOR97331 United States Department of Math and Computer Science University of Nebraska at Omaha OmahaNE68182 United States

ISBN: (纸本)0818621133

We develop an efficient subcube recognition algorithm that recognizes all the possible subcubes. the algorithm is based on exploiting more subcubes at different levels of the buddy tree. In exploiting the different levels, the algorithm checks any subcube at most once. Moreover, many unavailable subcubes are not considered as candidates and hence not checked for availability. this makes the algorithm fast in recognizing the subcubes. the number of recognized subcubes, for different subcube sizes, can be easily adjusted by restricting the search level down the buddy tree. the previous known algorithms become a special case of this general approach. When one level is searched, this algorithm perfoms as the original buddy system. When two levels are searched, it will recognized the Same subcubes as the ones in [4] with a faster speed. When all the levels are searched, a complete subcube recognition is obtained. In a multi-processing system, each processor can execute this algorithm on a different tree. Using a given number of processors in a multi-processing system, we give a method of constructing the trees that maximizes the overall number of recognized subcubes. Finally, we introduce an allocation method "best fit" that reduces hypercube fragmentation. Simulation results and performance comparisons between this method and the traditional "first fit" are presented. © 1990 ieee.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

An approach to compiling single-point iterative programs for distributed memory computers 5

An approach to compiling single-point iterative programs for...

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Socha, David G. Department of Computer Science and Engineering FR-35 University of Washington SeattleWA98195 United States

ISBN: (纸本)0818621133

this paper proposes a scheme for compiling an important class of iterative algorithms into efficient code for distributed memory computers. the programmer provides a description of the problem in Spot: a data parallel SIMD language that uses iterations as the unit of synchronization and is based on grids of data points. the data parallel description is in terms of a single point of the data space, with implicit communication semantics, and a set of numerical boundary conditions. the compiler eliminates the need for multi-tasking by "expanding" the single-point code into multiplepoint code that executes over rectangular regions of points. Using rectangle intersection and difference operations on these regions allows the compiler to automatically insert the required communication calls and to hide communication latency by overlapping computation and communication. the multiple-point code may be specialized, at compile-time, to the size and shape of different allocations, or it may use table-driven for-loops to adapt, at run-time, to the shape and size of the allocations. We show how to generalize this strategy to produce code for the near-rectangular shaped allocations required for balanced partitionings of rectangular arrays. © 1990 ieee.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Experiences with bilingual parallel programming 5

Experiences with bilingual parallel programming

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Foster, Ian Overbeek, Ross Mathematics and Computer Science Division Argonne National Laboratory ArgonneIL60439 United States

ISBN: (纸本)0818621133

parallel programming requires tools that simplify the expression of complex algorithms, provide portability across different classes of machine, and allow reuse of existing sequential code. We have previously proposed bilingual programming as a basis for such tools. In particular, we have proposed the use of a high-level concurrent programming language such as Strand1) to construct parallel programs from (possibly pre-existing) sequential components. We report here on an applications study intended to evaluate the effectiveness of this approach. We describe experiences developing both new codes and parallel versioi s of existing codes in computational biology, weather modeling, and automated reasoning. We find that the bilingual approach encourages the development of parallel programs that perform well, are portable, and are easy to maintain. ©1990 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Deterministic load balancing in computer networks 2

Deterministic load balancing in computer networks

引用

2nd ieee symposium on parallel and distributed processing, SPDP 1990

作者： Deng, Xiaotie Liu, Hai-Ning Xiao, Bing School of Computing Sci. Simon Fraser Univ. BurnabyBCV5A 1S6 Canada Dept. of Computer Sci San DiegoCA92093 United States Dept. of Math. San DiegoCA92093 United States

ISBN: (纸本)0818620870

the paper presents theoretical analysis of the deterministic complexity of the load balancing problem (LBP). Because of difficulty of the general problem, research in the area mostly restricts itself to probabilistic or approximation algorithms, or to the average behavior of a network. the paper provides deterministic analysis of the problem for general networks. It focuses on the worst-case complexity analysis of the problem. It shows certain cases of the LBP to be NP-complete. the paper also discusses situations closely related to computer networks, where there is a global view of load distribution in the network;it provides a polynomial algorithm for solving the load balancing problem in this *** paper focuses on the worst case complexity analysis of the problem. We show certain cases of the LBP to be NP-complete. We also discuss situations closely related to computer networks, where we have global view of load distribution in the network;we provide a polynomial algorithm for solving the load balancing problem in this network. We feel this is an important step toward solving the more general LBP problems. the problem of distributed and decentralized decision making is difficult to formulate and solve. However, for several interesting special cases, we can overcome these difficulties. © 1990 ieee.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Random number generation in the parallel environment 5

Random number generation in the parallel environment

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Sharp, H.F. Still, C.H. Parallel Supercomputer Initiative University of South Carolina ColumbiaSC29208 United States

ISBN: (纸本)0818621133

By randomly seeding individual processors in a parallel environment with unique random number generators it is possible to take full advantage of the economies of scale present in the parallel environment to achieve more accurate simulations. While a single random number generator is sufficient for a serial computer, the same is not true for a parallel computer. Multiple copies of the same generator do not improve the quality of the simulation as the period may be insufficient to prevent exhaustion or 'banding' of the variates. Our approach is to provide each processor with its own unique random number generator and use a common seed value. this ensures each simulation is unique as each generator is different due to random assignment by the front-end computer. the linear congruential method was chosen due to widespread familiarity and acceptance of the technique. By using a sequence of random numbers generated on the front-end computer, prime numbers are selected from a predefined array of 2048 primes and assigned to processors. To provide maximum possible period to the generators, all 2048 primes in the array are six digits in size. this gives the researcher the ability to run simulations involving up to a million random numbers with a high degree of certainty that each processor is running a different simulation. By taking advantage of the large periods, the economies of scale available on a parallel machine can then be expolited to run large scale simulations involving millions of numbers which would be prohibitive on a serial machine. © 1990 ieee.

关键词： Random number generation

来源：评论

学校读者我要写书评

暂无评论

An algorithm producing balanced partitionings of data arrays 5

An algorithm producing balanced partitionings of data arrays

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Snyder, Lawrence Socha, David G. Department of Computer Science and Engineering FR-35 University of Washington SeattleWA98195 United States

ISBN: (纸本)0818621133

We present a new polynomial time algorithm for allocating array elements to the processor memories of parallel computers. the algorithm produces, for sufficiently large arrays, partitionings that are balanced, near-rectangular and near-bulky. Balanced means each allocation is assigned the minimal number of elements. Near-rectangularmeans that each allocation is at most two off from the optimal aspect ratio in each dimension and has at most two jogs along each edge. A jog is where the boundary deviates from a straight line. Near-bulky means that each allocation has a near maximal ratio of interior/exterior points. For an I × J array of points and a K × K array of processors the algorithm produces balanced nearbulky partitionings when I,J≥ 4K and produces balanced, near-bulky and near-rectangular allocations when I,J≥ 8K. these bounds are not tight. A variant of the algorithm produces allocations with at most six neighbors per allocation for arbitrary stencils. Using these near-rectangular allocations incurs little additional cost for compilers for distributed memory parallel computers, and the extra run-time cost usually is offset by the advantage of balanced allocations. ©1990 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

CORRECTING EXECUTION OF distributed QUERIES 90

引用

2ND INTERNATIONAL SYMP ON DATABASES IN parallel AND distributed SYSTEMS ( DPDS 90 )

作者： BODORIK, P PYRA, J RIORDON, JS School of Computer Science Technical University of Nova Scotia P.O. Box 1000 Halifax Nova Scotia B3J 2X4 Canada Dept. of Systems and Computer Engineering Carleton University Ottawa Ontario K1S 5B6 Canada

ISBN: (纸本)0818620528

Algorithms for processing distributed queries require a priori estimates of the size of intermediate relations. Most such algorithms take a “static” approach in which the algorithm is completely determined before processing begins. If size estimates are found to be inaccurate at some intermediate stage, there is no opportunity to re-schedule, and the result may be far from optimal. Adaptive query execution may be used to alleviate the problem. Care is necessary, though, to ensure that the delay associated with re-scheduling does not exceed the time saved through the use of a more efficient strategy. this paper presents a low overhead delay method to decide when to correct a strategy. Sampling is used to estimate the size of relations, and alternative heuristic strategies prepared in a background mode are used to decide when to correct. Correction is made only if lower overall delay is achieved, including correction time. Evaluation using a model of a distributed data base indicates that the heuristic strategies are near optimal. Moreover, it also suggests that it is usually correct to abort creation of an intermediate relation which is much larger than predicted.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Basic matrix subprograms for distributed memory systems 5

Basic matrix subprograms for distributed memory systems

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Elster, A.C. Cornell University School of Electrical Engineering IthacaNY14853 United States

ISBN: (纸本)0818621133

parallel systems are in general complicated to utilize eficiently. As they evolve in complexity, it hence becomes increasingly more important to provide libraries and language features that can spare the users from the knowledge of low-level system details. Our effort in this direction is to develop a set of basic matrix algorithms for distributed memory systems such as the hypercube. the goal is to be able to provide for distributed memory systems an environment similar to that which the Level-3 Basic Linear Algebra Subprograms (BLAS3) provide for the sequential and shared memory environments. these subprograms facilitate the development of eficient and portable algorithms that are rich in matrix-matrix multiplication, on which major software eflorts such as LAPACK have been built. To demonstrate the concept, some of these Level-3 algorithms are being developed on the Intel iPSC/2 hypercube. Central to this effort is the General Matrix-Matrix Multiplication routine PGEMM. the symmetric and triangular multiplications as well as, rank-tk updates (symmetric case), and the solution of triangular systems with multiple right hand sides, are also discussed. © 1990 ieee.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Hierarchical domain decomposition with unitary load balancing for electromagnetic particle-in-cell codes 5

Hierarchical domain decomposition with unitary load balancin...

引用

5th distributed Memory Computing Conference, DMCC 1990

作者： Campbell, Philip M. Carmona, Edward A. Walker, David W. Mission Research Corporation 1720 Randolph Road SE AlbuquerqueNM87106 United States Parallel Computing Research Group Weapons Laboratory Kirtland AFBNM87117 United States Department of Mathematics University of South Carolina ColumbiaSC29208 United States

ISBN: (纸本)0818621133

this paper presents a new approach to parallelizing particle-in-cell (PIC) algorithms used in the numerical simulation of three-dimensional plasmas on MIMD multicomputers. Two new concepts are introduced: unitary load balance and hierarchical decomposition. the combined load for particle and field calculations over the time step is balanced together to form a single spatial decomposition. the unitary load scheme permits the load to be approximately balanced while requiring less communication. Decomposition and dynamic balancing is performed in each of the coordinate directions independently (hierarchical), and is particularly efficient when load imbalance propagates preferentially in a given direction. the hierarchical decomposition also minimizes the amount of particles that cross boundary regions, thereby decreasing communication. A local load balancing method is also introduced which allows rows or columns of processors to perform dynamic load balancing locally and in parallel. ©1990 ieee.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 345 346 347 348 349 350 351 352 353 354 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：