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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

4,091 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,097 篇 工学
- 1,912 篇 计算机科学与技术...
- 1,024 篇 软件工程
- 369 篇 电气工程
- 153 篇 信息与通信工程
- 137 篇 电子科学与技术（可...
- 76 篇 控制科学与工程
- 30 篇 机械工程
- 30 篇 生物工程
- 24 篇 材料科学与工程（可...
- 24 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 20 篇 光学工程
- 19 篇 建筑学
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 13 篇 动力工程及工程热...
- 12 篇 农业工程
526 篇 理学
- 417 篇 数学
- 50 篇 物理学
- 39 篇 系统科学
- 33 篇 生物学
- 30 篇 统计学（可授理学、...
- 16 篇 化学
- 16 篇 地球物理学
207 篇 管理学
- 154 篇 管理科学与工程(可...
- 61 篇 工商管理
- 54 篇 图书情报与档案管...
19 篇 农学
- 14 篇 作物学
18 篇 法学
- 18 篇 社会学
15 篇 经济学
- 15 篇 应用经济学
13 篇 医学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学
1 篇 哲学

主题

653 篇 parallel process...
545 篇 parallel program...
530 篇 computer archite...
463 篇 parallel archite...
448 篇 concurrent compu...
360 篇 parallel algorit...
322 篇 programming
316 篇 hardware
285 篇 computer science
276 篇 algorithm design...
263 篇 computational mo...
214 篇 programming prof...
166 篇 parallel process...
165 篇 dynamic programm...
154 篇 application soft...
138 篇 program processo...
138 篇 costs
137 篇 distributed comp...
136 篇 libraries
133 篇 runtime

机构

9 篇 stanford univ st...
9 篇 intel corporatio...
8 篇 barcelona superc...
8 篇 oak ridge natl l...
8 篇 univ calif berke...
7 篇 school of comput...
7 篇 oak ridge nation...
7 篇 carnegie mellon ...
7 篇 college of compu...
7 篇 oak ridge nation...
7 篇 univ texas austi...
6 篇 school of comput...
6 篇 sandia national ...
6 篇 department of co...
6 篇 department of co...
6 篇 school of comput...
6 篇 department of co...
5 篇 department of co...
5 篇 nvidia corporati...
5 篇 pacific northwes...

作者

15 篇 jack dongarra
12 篇 dongarra jack
11 篇 hong shen
10 篇 hoefler torsten
9 篇 zhong cheng
9 篇 olukotun kunle
9 篇 gu yan
8 篇 chapman barbara
7 篇 garcia i.
7 篇 forsell martti
7 篇 sun yihan
7 篇 jigang wu
7 篇 nakano koji
7 篇 danelutto marco
6 篇 cheng zhong
6 篇 v.k. prasanna
6 篇 blelloch guy e.
6 篇 h.j. siegel
6 篇 lumsdaine andrew
6 篇 tsigas philippas

语言

4,038 篇 英文
45 篇 其他
13 篇 中文

检索条件"任意字段=International Symposium on Parallel Architectures, Algorithms, and Programming"

共 4091 条记录，以下是3661-3670 订阅

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

详细简洁

排序：

The TickerTAIP parallel RAID Architecture

The TickerTAIP Parallel RAID Architecture

引用

Annual international symposium on Computer Architecture, ISCA

作者： Pei Cao Swee Boon Lim S. Venkataraman J. Wilkes Department of Computer Science Princeton University Princeton NJ USA Department of Computer Science University of Illinois Urbana IL USA Department of Computer Science University of Wisconsin Madison WI USA Hewlett Packard Laboratories Palo Alto CA USA

来源：评论

学校读者我要写书评

暂无评论

Performance effects of synchronization in parallel processors

Performance effects of synchronization in parallel processor...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： R.D. Chamberlain M.A. Franklin Computer and Communications Research Center Washington University Saint Louis MO USA

We investigate synchronization activities in application executing on distributed-memory MIMD architectures. Three applications are used to quantify the performance impact of synchronization as the number of processors is increased. We also investigate the performance improvement possible when synchronization is supported in hardware. The results show that significant performance improvement can be achieved. The hardware support should include barrier synchronization, operate-and-broadcast, and operations over subsets of processors.< >

关键词： Hardware Application software Iterative algorithms Concurrent computing parallel processing parallel algorithms Bars Runtime Distributed computing Global communication

来源：评论

学校读者我要写书评

暂无评论

Representation of coherency classes for parallel systems

Representation of coherency classes for parallel systems

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： W. Hussak J.A. Keane Department of Computer Studies University of Technology Loughborough UK Centre for Novel Computing Department of Computer Science University of Manchester Institute of Science and Technology Manchester UK

Some parallel applications do not require a precise imitation of the behavior of the physically shared memory programming model. Consequently, certain parallel machine architectures have elected to emphasize different required coherency properties because of possible efficiency gains. This has led to various definitions of models of store coherency. These definitions have not been amenable to detailed analysis and, consequently, inconsistencies have resulted. In this paper a unified framework is proposed in which different models of store coherency are developed systematically by progressively relaxing the constraints that they have to satisfy. A demonstration is given of how formal reasoning can be carried out to compare different models. Some real-life systems are considered and a definition of a version of weak coherency is found to be incomplete.< >

关键词： Concurrent computing Physics computing parallel machines Hardware Application software parallel programming programming profession Scalability Distributed computing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

parallel dynamic storage allocation algorithms

Parallel dynamic storage allocation algorithms

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： A. Iyengar Hewlett Packard Company Chelmsford MA USA

A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are presented which outperform all previous algorithms we tested. The performances of the three algorithms differ when the percentage of requests for large blocks is high. Multiple free list fit I is the fastest algorithm when large blocks of many different sizes are requested. Multiple free list fit II is the fastest algorithm when large blocks of only a few different sizes are requested.< >

关键词： Heuristic algorithms Performance evaluation Testing Computer languages programming profession System performance parallel machines Aging Concurrency control Memory management

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel mappings of a dynamic programming algorithm: a summary of results

Efficient parallel mappings of a dynamic programming algorit...

引用

international symposium on parallel Processing

作者： G. Karypis V. Kumar Department of Computer Science University of Minnesota Minneapolis MN USA

The authors are concerned with dynamic programming (DP) algorithms whose solution is given by a recurrence relation similar to that for the matrix parenthesization problem. Guibas, Kung and Thompson (1979), presented a systolic array algorithm for this problem that uses O(n/sup 2/) processing cells and solves the problem in O(n) time. The authors present three different mappings of this systolic algorithm on a mesh connected parallel computer. The first two mappings use commonly known techniques for mapping systolic arrays to mesh computers. Both of them are able to obtain only a fraction of maximum possible performance. The primary reason for the poor performance of these formulations is that different nodes at different levels in the multistage graph in the DP formulation require different amounts of computation. Any adaptation has to take this into consideration and evenly distribute the work among the processors. The third mapping balances the work load among processors and thus is capable of providing efficiency approximately equal to 1 (i.e., speedup approximately equal to the number of processors) for any number of processors and sufficiently large problem. They experimentally evaluate these mappings on a mesh embedded onto a 256 processor nCUBE/2.< >

关键词： Dynamic programming Heuristic algorithms Concurrent computing Systolic arrays Military computing Equations Computer science Problem-solving Industrial engineering Contracts

来源：评论

学校读者我要写书评

暂无评论

Scheduling independent tasks on partitionable hypercube multiprocessors

Scheduling independent tasks on partitionable hypercube mult...

引用

international symposium on parallel Processing

作者： B. Narahari R. Krishnamurti Department of EE&CS George Washington University DC USA School of Computing Science Simon Fraser University Burnaby BC Canada

A partitionable hypercube allows simultaneous execution of multiple tasks, where each task can be executed on a choice of subcubes. This paper considers the problem of static nonpreemptive scheduling of w independent tasks on a n processor partitionable hypercube system to minimize the overall finishing time of the w tasks. Each task can be executed on subcubes of different sizes, with smaller execution times on larger subcubes. A schedule determines the size of the subcube to be assigned to each task and schedules these tasks on the processors in the hypercube system. The problem of finding the optimal schedule, with minimum finishing time, is known to be NP-hard. This paper presents a fast polynomial time approximation algorithm for the problem, and derives a tight worst-case performance bound of 2 for the algorithm.< >

关键词： Hypercubes Optimal scheduling Processor scheduling Partitioning algorithms Finishing Approximation algorithms Computer architecture parallel architectures parallel processing Polynomials

来源：评论

学校读者我要写书评

暂无评论

A tensor product formulation of Strassen's matrix multiplication algorithm with memory reduction

A tensor product formulation of Strassen's matrix multiplica...

引用

international symposium on parallel Processing

作者： B. Kumar C.-H. Huang R.W. Johnson P. Sadayappan Departmentof Computer and Information Science Ohio State Uinversity Columbus OH USA Departmentof Computer Science Cloud State University Saint Cloud MN USA

A programming methodology based on tensor products has been used for designing and implementing block recursive algorithms for parallel and vector multiprocessors. A previous tensor product formulation of Strassen's matrix multiplication algorithm requires working arrays of size O(7/sup n/) for multiplying 2/sup n/*2/sup n/ matrices. The authors present a modified tensor product formulation of Strassen's algorithm in which the size of working arrays can be reduced to O(4/sup n/). The modified formulation exhibits sufficient parallel and vector operations for efficient implementation. Performance results on the Cray Y-MP are presented.< >

关键词： Tensile stress parallel programming Computerized monitoring NIST Algorithm design and analysis Vectors Linear algebra parallel machines Cloud computing Information science

来源：评论

学校读者我要写书评

暂无评论

Total exchange on a reconfigurable parallel architecture

Total exchange on a reconfigurable parallel architecture

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Y.-D. Lyuu E. Schenfeld NEC Research Institute Inc. Princeton NJ USA

Total exchange is the densest parallel communication primitive and poses a severe test for the capability of any parallel architecture. This operation is very important and arises in many applications. We show that a reconfigurable parallel architecture called MICA can perform total exchange efficiently with simple algorithms. The mechanisms and structures of the reconfigurable switches, supporting simple total exchange algorithms, are presented. We introduce the basic operations the network supports as they are issued by the host to efficiently manage the network reconfiguration. Applications in linear algebra are briefly mentioned showing the way they can benefit from our architecture.< >

关键词： parallel architectures Network topology Switches Communication switching Testing Concurrent computing Computational efficiency National electric code Computer network management Application software

来源：评论

学校读者我要写书评

暂无评论

PARSA: A parallel Program Scheduling and Assessment Environment

PARSA: A Parallel Program Scheduling and Assessment Environm...

引用

international Conference on parallel Processing (ICPP)

作者： Behrooz Shirazi Krishna Kavi A.R. Hurson Prasenjit Biswas Department of Computer Science & Engineering University of Texas Arlington Arlington TX USA Department of Electrical and Computer Engineering Pennsylvania State University University Park PA USA Cyrix Corporation Richardson TX USA

Efficient partitioning and scheduling of parallel programs and the distribution of data among pmessing elements are very important issues in parallel and distributed systems. Existing tools fdl short in addressing the issues satisfactorily. On one hand, it is believed to k unreasonable to leave the burden of these complex tasks to the programmers. On the other hand, fully automated schedulers have ken shown to be d little practical significance, or suitable only for restricted cases. In this paper we address the issues and algorithms for efficient partitioning and scheduling d parallel programs, including the distribution of data, in dislributed-memory multiprocessor systems, using the PARSA parallel software development environment. PARSA consists of a set of visual, interactive, compiletime tools that will provide automated program partitions and schedules whenever possible, while permitting the user to exert conml over these operations for a htter performance. The support program assessment tool provides the users the opportunity b fine-tune the program and achieve their performance objectives.

关键词： Processor scheduling Delay estimation programming profession Multiprocessing systems Partitioning algorithms Scheduling algorithm parallel architectures Delay effects parallel processing parallel programming

来源：评论

学校读者我要写书评

暂无评论

Process Groups: a mechanism for the coordination of and communication among processes in the Venus collective communication library

Process Groups: a mechanism for the coordination of and comm...

引用

international symposium on parallel Processing

作者： V. Bala S. Kipnis Computer Sciences Department IBM Thomas J. Watson Research Center Yorktown Heights NY USA

In programming massively parallel computers, it is often necessary to have sets of processes cooperate in performing certain computations and communications. Most run-time libraries require that such sets of processes be explicitly specified in the program. In the Venus run-time communication library however, a Process Group abstraction is used to enable implicit coordination of and communication over dynamically determined sets of processes. The Process Groups mechanism in Venus offers an object-oriented approach for handling sets of processes and enhances the debugging and monitoring of programs. The authors describe the Process Groups mechanism in Venus, illustrate its use on the class of N-body problems, and outline some of the data structures and algorithms used to implement this mechanism in Venus.< >

关键词： Venus Concurrent computing Runtime library parallel programming Distributed computing Monitoring Application software Debugging Data structures Buildings

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共410页 << < 363 364 365 366 367 368 369 370 371 372 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：