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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

83 篇 会议
9 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

60 篇 工学
- 52 篇 计算机科学与技术...
- 35 篇 软件工程
- 20 篇 电气工程
- 19 篇 信息与通信工程
- 8 篇 网络空间安全
- 7 篇 控制科学与工程
- 3 篇 电子科学与技术（可...
- 2 篇 材料科学与工程（可...
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
23 篇 理学
- 19 篇 数学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
8 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 工商管理
- 3 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学

主题

14 篇 parallel process...
11 篇 concurrent compu...
11 篇 parallel process...
10 篇 distributed comp...
7 篇 workstations
5 篇 computer science
5 篇 parallel archite...
5 篇 supercomputers
5 篇 parallel program...
5 篇 costs
5 篇 load management
5 篇 computer network...
4 篇 scalability
4 篇 application soft...
4 篇 processor schedu...
4 篇 high performance...
4 篇 delay
3 篇 file systems
3 篇 computer archite...
3 篇 big data

机构

2 篇 department of co...
2 篇 univ of stuttgar...
2 篇 swiss fed inst t...
2 篇 swiss fed inst t...
2 篇 national laborat...
1 篇 inria
1 篇 department of in...
1 篇 aiken computatio...
1 篇 computer science...
1 篇 mit lab for comp...
1 篇 information and ...
1 篇 hong kong polyte...
1 篇 university of mi...
1 篇 department of el...
1 篇 univ adelaide sc...
1 篇 high performance...
1 篇 university of ca...
1 篇 german aerospace...
1 篇 supercomputer ed...
1 篇 integrated intel...

作者

2 篇 loukopoulos than...
2 篇 skillicorn david...
2 篇 zaki mohammed j.
2 篇 fang liang
2 篇 kumar vipin
2 篇 wattenhofer roge...
2 篇 chi yaqing
2 篇 khanchandani pan...
1 篇 pan yi
1 篇 g. ka-keung chan
1 篇 m. hamdi
1 篇 thazhuthaveetil ...
1 篇 a. rau-chaplin
1 篇 banerjee d.
1 篇 falsafi babak
1 篇 li peng
1 篇 attila reményi
1 篇 sano k
1 篇 lalis spyros
1 篇 a. calderon

语言

92 篇 英文

检索条件"任意字段=3rd IEEE Symposium on Parallel and Distributed Processing, PDPS 1991"

共 92 条记录，以下是71-80 订阅

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

详细简洁

排序：

Automatic generation of parallel programs with dynamic load balancing

Automatic generation of parallel programs with dynamic load ...

引用

International symposium on High Performance distributed Computing

作者： B.S. Siegell P. Steenkiste Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA School of Computer Science Carnegie Mellon University Pittsburgh PA USA

Existing parallelizing compilers are targeted towards parallel architectures where all processors are dedicated to a single application. However a new type of parallel system has become available in the form of high performance workstations connected by high speed networks. Such systems pose new problems for compilers because the available processing power on each workstation may change with time due to other tasks competing for resources. We argue that it is possible for a parallelizing compiler to generate code that can dynamically shift portions of the application's workload between processors to improve performance. We have implemented a run-time system that supports automatically generated programs with dynamic load balancing. We describe this system and present performance measurements. We also describe the compiler functionality needed to generate parallel programs with dynamic load balancing.< >

关键词： Load management Workstations Program processors parallel languages Dynamic scheduling parallel architectures Application software High-speed networks Power generation Marine vehicles

来源：评论

学校读者我要写书评

暂无评论

parallel computations on the CHARM heterogeneous workstation cluster

Parallel computations on the CHARM heterogeneous workstation...

引用

International symposium on High Performance distributed Computing

作者： V.A. Saletore J. Jacob M. Padala Department of Computer Science Oregon State University Corvallis OR USA

In recent years parallel computing on a fast network of high performance and low cost workstations has become a viable and an economic option, compared to that on an expensive high performance parallel supercomputer for solving large Grand Challenge scientific problems. This paper focuses on how to efficiently exploit the computing resources of a set of heterogeneous Unix workstations. We have further developed the CHARM parallel programming environment to allow programs written in the CHARM language execute adjacently on such a cluster. We have also developed a new scheme to schedule tasks statically and balance the load dynamically to achieve high effective utilization. Performance results for several applications programs including ray-tracing, all-pairs shortest path, and matrix multiply on a heterogeneous cluster of Sun Sparcs, IBM RS/6000s and HP-PA 7100s show a significant improvement in execution time over sequential execution.< >

关键词： Concurrent computing Workstations parallel processing Costs Environmental economics Supercomputers parallel programming Processor scheduling Dynamic scheduling Ray tracing

来源：评论

学校读者我要写书评

暂无评论

Program analysis and transformations for fast data sharing

Program analysis and transformations for fast data sharing

引用

International symposium on High Performance distributed Computing

作者： Ai Li G. Hermannsson L. Wittie Computer Science University of Victoria Victoria BC Canada Renaissance Technologies Corporation Stony Brook NY USA Computer Science SUNY Stony Brook NY USA

distributed Shared Memory (DSM) systems have been proposed to combine the programmability of traditional shared memory and the scalability of message-passing systems. Eager DSM systems can greatly reduce access latencies for remote data by keeping copies of shared values in local memory and updating them immediately whenever a shared datum changes. However, sharing all changes globally can limit the system performance. It is usually possible to transform a program into an equivalent form that generates much less traffic, and therefore executes much more efficiently. This paper describes a compile-time analysis model for transforming simple shared memory programs with parallelized loop structures into programs that are optimized for efficient execution on eager DSM systems.< >

关键词： Computer science Delay Prefetching Hardware Scalability System performance parallel programming parallel processing Superconducting logic circuits Contracts

来源：评论

学校读者我要写书评

暂无评论

Generalized multiprocessor scheduling for directed acyclic graphs

Generalized multiprocessor scheduling for directed acyclic g...

引用

Supercomputing Conference

作者： G.N. Srinivasa Prasanna B.R. Musicus AT and T Bell Laboratories Inc. Murray Hill NJ USA Bolt Beranek and Newman 슠Inc. Cambridge MA USA

In the 3rd Annual ACM symposium on parallel Algorithms and Architectures, pp. 216-228 (JuIy 1991), we presented several new results in the theory of homogeneous multiprocessor scheduling. A directed acyclic graph (DAG) of tasks was to be scheduled. Tasks were assumed to be parallelizable-as more processors are applied to a task, the time taken to compute it decreases, yielding some speedup. Because of communication, synchronization and task scheduling overheads, this speedup increases less than linearly with the number of processors applied. The optimal scheduling problem is to determine the number of processors assigned to each task, and to the task sequencing, to minimise the finishing time. Using optimal control theory, in the special case where the speedup function of each task is p/sup /spl alpha// (where p is the amount of processing power applied to the task), a closed form solution for task graphs formed from parallel and series connections was derived. This paper considerably extends these techniques for arbitrary DAGs and applies them to matrix arithmetic compilation. The optimality conditions impose nonlinear constraints on the flow of processing power from predecessors to successors, and on the finishing times of siblings. This paper presents a fast algorithm for determining and solving these nonlinear equations. The algorithm utilizes the structure of the finishing time equations to efficiently run a conjugate gradient minimization leading to the optimal solution. The algorithm has been tested on a variety of DAGs. The results presented show that it is superior to alternative heuristic approaches.< >

关键词： Processor scheduling Optimal scheduling Finishing Nonlinear equations parallel algorithms Computer architecture Concurrent computing Optimal control Closed-form solution Arithmetic

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 3rd ieee symposium on parallel and distributed processing 1991

Proceedings of the 3rd IEEE Symposium on Parallel and Distri...

引用

3rd ieee symposium on parallel and distributed processing, pdps 1991

ISBN: (纸本)0818623101

The proceedings contain 118 papers. The topics discussed include: an optimal parallel matching algorithm for cographs;parallel matching on expanders;a group of permutations with edge-disjoint paths on hypercubes;the complexity of readiness and failure equivalences for processes;towards a complexity hierarchy of wait-free concurrent objects;distributed computing on anonymous hypercube networks;debugging concurrent programs using static analysis and run-time hardware monitoring;a parallel system for test pattern generation;test generation in a distributed environment;and detection of strong predicates in distributed programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimization of distributed communication in multiprotocol Tuple Space 3

Optimization of distributed communication in multiprotocol T...

引用

3rd ieee symposium on parallel and distributed processing, pdps 1991

作者： Chiba, S. Kato, K. Masuda, T. Department of Information Science University of Tokyo Japan

ISBN: (纸本)0818623101

Tuple Space provides primitives convenient for description of data-sharing and interprocess communication, but its implementation on distributed systems is less efficient than that on shared memory machines. Multiprotocol Tuple Space improves the implementation on distributed systems. That provides three replication-consistency protocols that are weakened to different degrees. By selecting these protocols according to communication patterns, communication through Tuple Space can be optimized. © 1991 ieee.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

An efficient protocol for ordering broadcast messages in distributed systems 3

An efficient protocol for ordering broadcast messages in dis...

引用

3rd ieee symposium on parallel and distributed processing, pdps 1991

作者： Acharya, A. Badrinath, B.R. Dept. of Computer Science Rutgers University New BrunswickNJ08903 United States

ISBN: (纸本)0818623101

Presents an efficient protocol to totally order the delivery of broadcast messages in a distributed system with N sites. The protocol exploits a symmetric communication scheme based on finite projective planes and requires N+2 N messages to create a total order to broadcast messages, that is consistent across all sites. © 1991 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A practical hierarchical model of parallel computation 3

A practical hierarchical model of parallel computation

引用

3rd ieee symposium on parallel and distributed processing, pdps 1991

作者： Heywood, T. Ranka, S. School of Computer and Information Science Syracuse University SyracuseNY13244 United States

ISBN: (纸本)0818623101

A model of parallel computation is introduced which employs the PRAM as a sub-model, while simultaneously being more reflective of realistic parallel architectures by accounting for and providing abstract control over communication and synchronization costs. Cost control is achieved via the representation of general degrees of locality ('neighborhoods' of activity). The model organizes 'control asynchrony' via an implicit hierarchy relation, and restricts 'communication asynchrony' in order to obtain determinate algorithms. © 1991 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers 3

A divide-and-conquer method of solving tridiagonal systems o...

引用

3rd ieee symposium on parallel and distributed processing, pdps 1991

作者： Wang, Xiaojing Mou, Z.G. Computer Science Department Brandeis University WalthamMA02254 United States

ISBN: (纸本)0818623101

The authors present a new parallel algorithm, based on the divide-and-conquer (DC) strategy, for solving tridiagonal systems. Through a comparative study between their DC method and other well known tridiagonal solvers: Cyclic odd-even reduction (CR), recursive doubling (rd), and the partition method, they show that for the binary hypercube architecture, the communication complexity of their DC method is the lowest among all, and therefore the most efficient tridiagonal solver for communication-expensive massively parallel hypercube computers. © 1991 ieee.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Test generation in a distributed environment 3

Test generation in a distributed environment

引用

3rd ieee symposium on parallel and distributed processing, pdps 1991

作者： Calia, E. Lioy, A. Politecnico di Torino Dip. Autornatica e Informatica C.so Duca degli Abruzzi 24 Torino10129 Italy

ISBN: (纸本)0818623101

This paper describes a distributed test generation system for combinational circuits. It is made up of modules running on computers connected via a local area network. Issues in parallelizing the tasks between the various modules are discussed, with comparison to previous work in the field. The concepts of independent faults, independent fault sets, and fault partitioning are shown to be the key points in performing useful parallel computations. Experimental results with a heterogeneous computer network prove that a satisfactory speedup can be obtained, although saturation occurs at a point depending on the circuit's characteristics. © 1991 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：