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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,501 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,574 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,572 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2574 条记录，以下是2231-2240 订阅

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

详细简洁

排序：

Enforcing resource sharing agreements among distributed server clusters 16

Enforcing resource sharing agreements among distributed serv...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Zhao, Tao Karamcheti, V. Department of Computer Science Courant Institute of Mathematical Sciences New York University United States

ISBN: (纸本)0769515738

Future scalable, high throughput, and high performance applications are. likely to execute on platforms constructed by clustering multiple autonomous distributed servers, with resource access governed by agreements between the owners and users of these servers. Such systems raise several new resource management challenges, chief amongst which is the enforcement of agreements to ensure that, despite the distributed nature of both requests and resources, user requests only receive a predetermined share of the aggregate resource. Current solutions only enforce such agreements at a coarse granularity and in a centralized fashion, limiting their applicability. this paper presents an architecture for the distributed enforcement of resource sharing agreements. Our approach exploits a uniform application-independent representation of agreements, and combines it with efficient tune-window based coordinated queuing algorithms running on multiple nodes. We have successfully implemented this general strategy in two different network layers: a Layer-7 HTTP redirector and a Layer-4 IP packet redirector;which redirect connection requests from distributed clients to a cluster of distributed servers. Our measurements of both implementations verify that our approach is general and effective. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance characterization of a molecular dynamics code on PC clusters: Is there any easy parallelism in CHARMM? 16

Performance characterization of a molecular dynamics code on...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Taufer, M. Perathoner, E. Cavalli, A. Caflisch, A. Stricker, T. Department of Computer Science ETH Zurich Zentrum ZurichCH-8092 Switzerland Department of Biochemistry University of Zurich ZurichCH-8057 Switzerland Università degli Studi di Padova Dipartimento di Elettronica ed Informatica Via Gradenigo 6/a Padova Italy

ISBN: (纸本)0769515738

the molecular dynamics code CHARMM is a popular research tool for computational biology. An increasing number of researchers are currently looking for affordable and adequate platforms to execute CHARMM or similar codes. To address this need, we analyze the resource requirements of a CHARMM molecular dynamics simulation on PC clusters with a particle mesh Ewald (PME) treatment of long range electrostatics, and investigate the scalability of the short-range interactions and PME separately. We look at the workload characterization and the performance gain of CHARMM with different network technologies and different software infrastructures and show that the performance depends more on the software infrastructures than on the hardware components. In the present study, powerful communication systems like Myrinet deliver performance that comes close to the MPP supercomputers of the past decade, but improved scalability can also be achieved with better communication system software like SCore without the additional hardware cost. the experimental method of workload characterization presented can be easily applied to other codes. the detailed performance figures of the breakdown of the calculation into computation, communication and synchronization allow one to derive good estimates about the benefits of moving applications to novel computing platforms such as widely distributed computers (grid). © 2002 ieee.

关键词： cluster of PCs distributed computation distributed molecular dynamics message passing middleware performance optimization performance tuning

来源：评论

学校读者我要写书评

暂无评论

Treating a user-defined parallel library as a domain-specific language 16

Treating a user-defined parallel library as a domain-specifi...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Quinlan, D.J. Miller, B. Philip, B. Schordan, M. Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA United States

ISBN: (纸本)0769515738

the software crisis within scientific computing has been that application codes become larger and more complex. the only conceivable solution is to make application codes smaller and less complex. We know of no way to resolve this crisis, except to make each line of code mean more;this is the process of defining high-level abstractions. Achieving high-performance from high-level abstractions represents an essential key to simplifying scientific software. this paper presents several high-level abstractions used within scientific computing. these abstractions are part of multiple object-oriented libraries and represent complex and precise semantics. In each case the semantics of the abstraction is user-defined and ignored by the compilation process at a significant performance penalty for the application code. Our research work presents a mechanism to analyze and optimize the use of high-level abstractions within scientific applications. In this paper, we show that the high-level abstractions are not just significantly easier to use in the development of application code but can be made to perform equivalently to hand-coded C and Fortran. Our research work shows how to effectively treat any object-oriented library and its abstractions as if it where a domain-specific language with equivalent builtin types and specialized compile-time analysis and optimizations. With acceptable performance of high-level abstractions within scientific software, we expect that application codes can be made smaller and less complex;allowing much more complex applications to be built in the future. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parallel-object programming model for petaflops machines and blue gene/cyclops 16

A parallel-object programming model for petaflops machines a...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Zheng, Gengbin Kumar, A. Joshua, S. Unger, M. Kalé, L.V. Dept. of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave. UrbanaIL61801 United States

ISBN: (纸本)0769515738

One approach for building the next generation of parallel computers is based on large aggregates of multiprocessor chips with support for hardware multithreading. An initial design for IBM's Blue Gene/C project exemplifies this approach. Such a machine might consist of a million processors, and is characterized by a low memory-to-processor ratio. To study alternate programming models for such a machine before it is built, we have developed an emulator that allows million-processor programs to be run on conventional parallel machines with hundreds of processors. Here we present the implementation of a parallel object model based on Charm++ as a candidate programming model. Although the "ideal" programming model for such machines is a matter of continuing research, we believe that parallel objects represent a good starting point. this paper reviews the target architecture, presents the programming model, and describes the emulator implementation. Case studies of simple applications written using the emulator are also discussed. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the FAB predictor:: Using Fourier analysis to predict the outcome of conditional branches 8

引用

8th international symposium on High-Performance Computer Architecture

作者： Kampe, M Stenström, P Dubois, M Chalmers Dept Comp Engn S-41296 Gothenburg Sweden

ISBN: (纸本)0769515258

this paper proposes to transform the branch outcome history from the time domain to the frequency domain. With our proposed Fourier Analysis Branch (FAB) predictor, we can represent long periodic branch history patterns - as long as 2 13 bits - with a realistic number of bits (52 bits). We evaluate the potential gains of the FAB predictor by considering a hybrid branch predictor in which each branch is predicted using a static scheme, the 2-bit dynamic scheme, the PAp and GAp schemes, and our FAB predictor. By including our FAB predictor in the hybrid predictor it is possible to cut the misprediction rate of integer applications in the SPEC95 suite by between 5 and 50% with an average of 20%. Besides evaluating its performance, this paper shows some key properties of our FAB predictor and presents some possible implementation approaches.

关键词： Accuracy Data compression Fourier transforms Frequency domain analysis History parallel processing Pattern analysis Pipelines Runtime Time domain analysis

来源：评论

学校读者我要写书评

暂无评论

MANET: possible applications with PDA in wireless imaging environment

MANET: possible applications with PDA in wireless imaging en...

引用

ieee international symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： M. Guarnera M. Villari A. Zaia A. Puliafito STMicroelectronics AST Catania Lab Digital Still Camera & Multimedia Mobile Group Catania Italy Dipartimento di Matematica Contrada Papardo Università di Messina Messina Italy

Wireless communication systems are becoming the new enabling technology for accessing, sharing and processing data. It is easy to foresee that in the near future users will access the Internet through wireless PDA, while roaming from one place to another. Mobile ad-hoc networks (MANET) are peer-to-peer wireless networks that do not rely on the presence of a wired interconnection infrastructure. Apart from more traditional applications in the military field as well as in disaster recovery and emergency situations, MANET may represent an interesting possibility for personal communications and interaction among mobile users. We identify some possible fields of application for such wireless systems, identifying advantages and drawbacks. We also present a prototype application where MANETs are used in order to provide a distributed image processing service.

关键词： Mobile ad hoc networks Wireless communication Internet Roaming Ad hoc networks Peer to peer computing Wireless networks Military communication Prototypes Image processing

来源：评论

学校读者我要写书评

暂无评论

distributed rasterization using OpenGL

Distributed rasterization using OpenGL

引用

ieee international symposium on High Performance Computing Systems and applications (HPCS)

作者： D. Calvert D. thompson Department of Computing and Information Science University of Guelph Guelph ONT Canada School of Engineering University of Guelph ONT Canada

this work examines the facility of using a large distributed memory system for rasterization of computer graphics using the OpenGL and GLUT libraries. Issues examined include the performance increases achieved through... 详细信息

关键词： Rendering (computer graphics) Testing Layout throughput Computer graphics Libraries parallel processing Geometry distributed computing Information science

来源：评论

学校读者我要写书评

暂无评论

distributed electric field approximation

Distributed electric field approximation

引用

ieee international symposium on High Performance Computing Systems and applications (HPCS)

作者： D. Trybus Z. Kucerovsky A. Ieta T.E. Doyle University of Western Ontario ONT Canada

Grid or mesh techniques are frequently used to approximate continuous entities that behave in a wave or fluid-like fashion. Partial Differential Equations (PDEs) are usually involved in the description of such entities or processes. distributed parallel computation was used in various computer cluster configurations to calculate PDE solutions of electrostatic field. the study of the efficacy of the selected architecture using mesh techniques was intended. the match between the algorithm and the architecture in achieving maximum computational performance was also investigated. the developed architectures, algorithms, and findings are presented in the paper.

关键词： Grid computing Clustering algorithms Concurrent computing distributed computing Computer architecture Linux Partitioning algorithms Partial differential equations Electrostatics parallel processing

来源：评论

学校读者我要写书评

暂无评论

Efficient all-to-all broadcast schemes in distributed-memory parallel computers

Efficient all-to-all broadcast schemes in distributed-memory...

引用

ieee international symposium on High Performance Computing Systems and applications (HPCS)

作者： E. Oh I.A. Kanj Department of Computer Science Texas A and M University College Station TX USA School of Computer Science Telecommunications and Information Systems De Paul University Chicago IL USA

distributed-memory parallel computers refer to parallel computers in which each processor has its own private memory. In such a system, processors communicate information by exchanging messages via the interconnection network rather than storing it in shared memory. One of the important communication methods in such systems is data broadcasting. All-to-all broadcasting is the process in which each processor sends its message to all other processors, and receives messages from all other processors in the system. Two complexity elements are usually considered when measuring the performance of a distributed-memory parallel model: time complexity and message complexity. In this paper we develop an efficient communication scheme to reduce both the communication time and the message complexity in the star network model under the half-duplex and full-duplex communication capability. the complexity measures of our scheme are compared against known bounds to verify the efficiency of the suggested scheme.

关键词： Broadcasting Concurrent computing distributed computing parallel processing Telecommunication computing Costs Computer science Microprocessors Hypercubes Information systems

来源：评论

学校读者我要写书评

暂无评论

distributed computing with load-managed active storage

Distributed computing with load-managed active storage

引用

international symposium on High Performance distributed Computing

作者： R. Wickremesinghe J.S. Chase J.S. Vitter Department of Computer Science Duke University Durham NC USA

One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effective for a variety of problems. this paper explores opportunities to use active storage as a basis for exploiting asymmetric parallelism in applications using a streaming computation model on collections of fixed-size records. this model is the basis for much of the research in I/O-efficient algorithms, which deals with an important class of massive data problems not studied in previous work on active storage. We present an extension of a streaming computation model for an external memory toolkit to support a flexible mapping of computations to storage-based processors. Our approach enables load-managed active storage: it exposes parallelism, ordering constraints, and primitive computation units to the system, which can configure the application to balance load and make the best use of available processing power Emulation results from a sorting application demonstrate the potential of dynamic adaptation in load-managed active storage.

关键词： distributed computing parallel processing Power system modeling Computational modeling Concurrent computing Computer networks Large-scale systems Computer science Emulation Sorting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 220 221 222 223 224 225 226 227 228 229 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：