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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

280 篇 会议
3 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

198 篇 工学
- 183 篇 计算机科学与技术...
- 74 篇 软件工程
- 24 篇 信息与通信工程
- 22 篇 电气工程
- 9 篇 电子科学与技术（可...
- 9 篇 生物医学工程（可授...
- 8 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 力学（可授工学、理...
- 4 篇 建筑学
- 3 篇 机械工程
- 3 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 航空宇航科学与技...
69 篇 理学
- 49 篇 数学
- 10 篇 物理学
- 9 篇 系统科学
- 7 篇 生物学
- 7 篇 统计学（可授理学、...
- 5 篇 化学
22 篇 管理学
- 18 篇 管理科学与工程(可...
- 10 篇 工商管理
- 7 篇 图书情报与档案管...
7 篇 法学
- 4 篇 社会学
- 3 篇 法学
4 篇 教育学
- 4 篇 教育学
2 篇 经济学
- 2 篇 应用经济学
2 篇 农学
2 篇 医学
1 篇 文学
1 篇 军事学

主题

19 篇 memory architect...
17 篇 cloud computing
13 篇 distributed comp...
9 篇 computer archite...
9 篇 computational mo...
8 篇 memory managemen...
8 篇 long short-term ...
8 篇 servers
7 篇 scalability
7 篇 distributed data...
6 篇 message passing
6 篇 hadoop
6 篇 big data
6 篇 memory
5 篇 computer science
5 篇 transputers
5 篇 machine learning
5 篇 parallel computi...
5 篇 spark
5 篇 training

机构

2 篇 vienna universit...
2 篇 austin tx united...
2 篇 tu münchen garch...
2 篇 ibm israel haifa
2 篇 seacom engineeri...
2 篇 department of co...
2 篇 university of pi...
2 篇 isislab - dipart...
2 篇 tennessee tech u...
2 篇 beijing univ pos...
2 篇 rwth aachen univ...
2 篇 texas a&m univ c...
2 篇 universitat poli...
2 篇 vilnius universi...
2 篇 kongu engineerin...
2 篇 netaji subhash e...
2 篇 cracs/inesc-tec ...
2 篇 universidad carl...
2 篇 department of in...
2 篇 department of co...

作者

3 篇 trystram d.
2 篇 miller r.
2 篇 michael alexande...
2 篇 roberto g. casce...
2 篇 talmage edward
2 篇 alexandru costan
2 篇 luís lopes
2 篇 emmanuel jeannot
2 篇 vittorio scarano
2 篇 stephen l. scott
2 篇 hiraga kohei
2 篇 christian lengau...
2 篇 teague k.a.
2 篇 gabor kecskemeti
2 篇 liu yujie
2 篇 salvador petit
2 篇 josé gracia
2 篇 mario cannataro
2 篇 siegfried benkne...
2 篇 tatebe osamu

语言

282 篇 英文
1 篇 俄文
1 篇 其他
1 篇 中文

检索条件"任意字段=5th Distributed Memory Computing Conference, DMCC 1990"

共 285 条记录，以下是51-60 订阅

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

详细简洁

排序：

Fixed time, tiered memory, and superlinear speedup 5

Fixed time, tiered memory, and superlinear speedup

引用

5th distributed memory computing conference, dmcc 1990

作者： Gustafson, John L. Ames Laboratory-USDOE AmesIA50011 United States

ISBN: (纸本)0818621133

In the problem size-ensemble size plane, fixed-sized and scaled-sized paradigms have been the subsets of primary interest to the parallel processing community. A problem with the newer scaled-sized model is that execution time increases for problems where operation complexity grows faster than storage complexity. the fixed time model is introduced, which, unlike the scaled model, implies the need to reduce problem size per processor. this reduction causes uniprocessor speed to vary. Historical ensemble models hold uniprocessor performance flat as problem size varies, even beyond physical memory size. However, tiered memory can make performance increase instead of decrease as problem size per processor shrinks, and workload can shift to routines with higher speed as the problem is scaled. Superlinear speedup results in such cases. Superlinear speedup, far from being an anomaly, becomes commonplace when the performance model makes realistic assumptions about memory speed and problem scaling. ©1990 IEEE.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for multi-channel broadcast networks 5

Distributed algorithms for multi-channel broadcast networks

引用

5th distributed memory computing conference, dmcc 1990

作者： Guan, Xiaojun Langston, Michael A. Department of Computer Science Washington State University PullmanWA99164-1210 United States Department of Computer Science University of Tennessee KnoxvilleTN37996-1301 United States

ISBN: (纸本)0818621133

A distributed algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space when the number of processors is fixed. In this brief paper, we outline a distributed algorithm for merging that, given a multi-channel broadcast network with k processors, merges two sorted lists of total length n in O(n/k+logk) time and O(k) extra space, and are thus time-space optimal for any fixed value of k that satisfies n ≥ k log k. ©1990 IEEE.

关键词： Broadcasting

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Parallel processor memory reference analysis and its application to interconnect architecture 5

Parallel processor memory reference analysis and its applica...

引用

5th distributed memory computing conference, dmcc 1990

作者： Pinkston, Timothy M. Flynn, Michael J. Electrical Engineering Deptartment Stanford University StanfordCA94305-4055 United States

ISBN: (纸本)0818621133

Hierarchical interconnect architectures can capitalize on multiprocessor locality via clustering. Clustering is the forming of localities such that processing elements (PEs) and memory blocks having highest affinity are grouped together within the same locality or cluster. While much is known about memory reference patterns in uniprocessors, less is known about multiprocessor memory reference behavior, let alone proven effective ways of exploiting it. A case study of parallel processor memory reference behavior was performed on a simulated a 64-node shared memory multiprocessor. the study consisted of analyzing the memory references of benchmark parallel scientific/engineering applications, particularly shared data references, using entire program traces. Our objectives were to determine the locality behavior of PE references to shared data blocks statically and dynamically throughout execution. Locality phenomenon useful for clustering in a hierarchical optical interconnect strategy is analyzed. ©1990 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Transputer modelling of be star circumstellar discs 5

Transputer modelling of be star circumstellar discs

引用

5th distributed memory computing conference, dmcc 1990

作者： Gorrod, M.J. Kastner, J. Coe, M.J. High Energy Astrophysics Group Department of Physics University of Southampton SouthamptonSO9 5NH United Kingdom Department of Astronomy University of California Los AngelesCA990024 United States

ISBN: (纸本)0818621133

A model for the infra-red emission from the circumstellar disc of a Be star is presented. the structure and other physical parameters of this disc can be adjusted to investigate the infro,-red and optical lane emission from such an envelope. the model presently under investigation i s based on the early work of Drnke and has been computed on a p VAXII and a Meiko computing Surface. the parallel implementation of this model allows a more complex and realistic structure t o be modelled in a reasonable timescale. Both an algorithmic and event decomposition of the code have been investigated and the two methods are compared. the model has been applied to several Be stars with good agreement with observational data. © 1990 IEEE.

关键词： Transputers

来源：评论

学校读者我要写书评

暂无评论

A method for evaluating message communication in faulty hypercubes 5

A method for evaluating message communication in faulty hype...

引用

5th distributed memory computing conference, dmcc 1990

作者： Peercy, Michael Barterjee, Prithviraj Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois at Urbana-Champaign United States

ISBN: (纸本)0818621133

In this paper we present an evaluation of communication in the network of a faulty hypercube using an approximate analytical model and a detailed simulation model. We assume the hypercube has a deterministic routing strategy. Consequently, we are able to use simple models to derive the traffic on each link. Additionally, we develop a theory with which we find the message delay not only in packet-switched hypercube networks, but in the more current circuit-switched networks as well. thus we can examine the degradation from ideal communication performance due to different fault patterns and different reroute strategies we may use to compensate for faults. We next describe a program, EASY, which implements our approximate analysis along with simulation for detailed evaluation of message communication. We include a comparison of our theoretical evaluation with simulation. We also include a brief comparison of reroute techniques for faulty hypercubes. © 1990 IEEE.

关键词： Hypercube networks

来源：评论

学校读者我要写书评

暂无评论

Task grapher: A tool for scheduling parallel program tasks 5

Task grapher: A tool for scheduling parallel program tasks

引用

5th distributed memory computing conference, dmcc 1990

作者： Lewis, T.G. El-Rewini, H. Chu, J. Fortner, P. Su, W. Oregon Advanced Computing Institute Computer Science Department Oregon State University CorvallisOR97331-3902 United States Department of Math and Computer Science University of Nebraska at Omaha OmahaNE68182-0243 United States Computer Science Department Oregon State University CorvallisOR97331-3902 United States

ISBN: (纸本)0818621133

Task Grapher is a tool for studying optimal parallel program task scheduling on arbitrarily intercor iected parallel processors. Given a parallel program represented as a precedence-constrained task graph, and an interconnect topology of a target machine Task Grapher produces the following displays: 1) Gantt Chart Schedule, 2) Speed-up Line Graph, 3) Critical Path In Task Graph, 4) Processor Utilization Clart, 5) Processor Efficiency Chart, 6) Dynamic Activity Display. Task Grapher currently incorporates seven scheduling heuristics which consider variable task execution times, variable communication lelays between processors, and target machine intercom ection topology. Task duplication heuristics allow trade-off between space and time when running the parallel program. ©1990 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Path planning on a distributed memory computer 5

Path planning on a distributed memory computer

引用

5th distributed memory computing conference, dmcc 1990

作者： Miguet, S. Robert, Y. Laboratoire de l'Lnformatique du Parallélisme LIP-IMAG Ecole Normale Supérieure de Lyon 46 allée d'Italie Lyon Cedex 0769364 France

ISBN: (纸本)0818621133

In this paper, we discuss the implementation of Bitz and Kungs path planning algorithm on a ring of generalpurpose processors. We show that Bitz and Kung's algorithm, originally designed for the Warp machine, is not efficient in this context, due to the intensive interprocessor communications that it requires. We design a modified version that performs much better. the new version updates a segment of k positions within a step and allocates blocks of r consecutive rows of the map to the processors in a wraparound fashion. Bitz and Kung's algorithm corresponds to the situation (k,r) = (I ,I). We analytically determine the optimal values of the parameters (k,r) which minimize the parallel execution time as a function of the problem size n and of the number of processors p. the theoretical results are nicely corroborated by numerical experiments on a ring of 32 Transputers. © 1990 IEEE.

关键词： Transputers

来源：评论

学校读者我要写书评

暂无评论

Load sharing in hypercube multicomputer in the presence of node failures 5

Load sharing in hypercube multicomputer in the presence of n...

引用

5th distributed memory computing conference, dmcc 1990

作者： Chang, Yi-Chieh Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818621133

this paper discusses and analyzes two load sharing (LS) issues: adjusting preferred lists and implementing a fault-tolerant mechanism in the presence of node failures. In an early paper, we have proposed to order the nodes in each node's proximity into a preferred list for the purpose of load sharing in distributed real-time systems. the preferred list of each node is constructed in such a way that each node will be selected as the kth preferred node by one and only one other node. Such lists are proven to allow the tasks to be evenly distributed in a system. However, the presence of faulty nodes will destroy the original structure of a preferred list if the faulty nodes are simply skipped in the preferred list. An algorithm is therefore proposed to modify each preferred list to retain its original features regardless of the number of faulty nodes in the system. the communication overhead introduced by this algorithm is shown to be minimal. Based on the modified preferred lists, a simple fault-tolerant mechanism is implemented. Each node is equipped with a backup queue which stores and updates the arriving/completing tasks at its most preferred node. Whenever a node becomes faulty, its most preferred node will treat the tasks in the ba,ckup queue as externally arriving tasks. Our simulation results show that this approach, despite of the simplicity, can reduce the number of task losses dramatically, as compared to the approaches without any faulttolerant mechanism. © 1990 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：