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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,359 篇 会议
70 篇 期刊文献
14 册 图书

馆藏范围

4,443 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,496 篇 工学
- 2,311 篇 计算机科学与技术...
- 1,057 篇 软件工程
- 492 篇 电气工程
- 430 篇 信息与通信工程
- 194 篇 电子科学与技术（可...
- 122 篇 控制科学与工程
- 102 篇 网络空间安全
- 89 篇 动力工程及工程热...
- 73 篇 生物工程
- 48 篇 机械工程
- 47 篇 生物医学工程（可授...
- 42 篇 光学工程
- 34 篇 建筑学
- 30 篇 材料科学与工程（可...
- 22 篇 仪器科学与技术
- 22 篇 土木工程
- 22 篇 化学工程与技术
606 篇 理学
- 428 篇 数学
- 97 篇 物理学
- 83 篇 生物学
- 68 篇 系统科学
- 61 篇 统计学（可授理学、...
- 23 篇 化学
340 篇 管理学
- 254 篇 管理科学与工程(可...
- 140 篇 工商管理
- 100 篇 图书情报与档案管...
61 篇 医学
- 45 篇 临床医学
- 38 篇 基础医学(可授医学...
40 篇 经济学
- 40 篇 应用经济学
38 篇 法学
- 33 篇 社会学
11 篇 教育学
11 篇 农学
6 篇 文学
1 篇 艺术学

主题

1,187 篇 computer archite...
447 篇 hardware
376 篇 high performance...
287 篇 concurrent compu...
279 篇 computational mo...
237 篇 application soft...
231 篇 parallel process...
217 篇 computer science
213 篇 distributed comp...
187 篇 costs
186 篇 bandwidth
179 篇 field programmab...
173 篇 delay
166 篇 throughput
159 篇 cloud computing
157 篇 grid computing
140 篇 computer network...
138 篇 resource managem...
133 篇 laboratories
124 篇 scalability

机构

16 篇 university of ch...
12 篇 school of comput...
12 篇 institute of com...
8 篇 department of co...
8 篇 georgia inst tec...
8 篇 univ chicago dep...
8 篇 barcelona superc...
8 篇 school of comput...
8 篇 carnegie mellon ...
8 篇 mathematics and ...
8 篇 intel corporatio...
7 篇 department of el...
7 篇 college of compu...
7 篇 univ illinois ur...
7 篇 computer systems...
7 篇 department of co...
7 篇 mathematics and ...
7 篇 intel corp santa...
7 篇 univ fed rio gra...
6 篇 univ toronto on

作者

13 篇 navaux philippe ...
11 篇 d.k. panda
9 篇 viktor k. prasan...
9 篇 prasanna viktor ...
9 篇 mutlu onur
9 篇 i. foster
8 篇 dhabaleswar k. p...
8 篇 dongarra jack
8 篇 guedes dorgival
7 篇 borin edson
7 篇 cristal adrian
7 篇 chong frederic t...
7 篇 loh gabriel h.
7 篇 kim nam sung
7 篇 zhou huiyang
7 篇 panda dhabaleswa...
7 篇 magoules frederi...
7 篇 ferreira renato
7 篇 xiaowei li
7 篇 buyya rajkumar

语言

4,391 篇 英文
42 篇 其他
13 篇 中文
2 篇 葡萄牙文
1 篇 法文

检索条件"任意字段=16th Symposium on Computer Architecture and High Performance Computing"

共 4443 条记录，以下是3841-3850 订阅

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

详细简洁

排序：

Enforcing resource sharing agreements among distributed server clusters

Enforcing resource sharing agreements among distributed serv...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： Tao Zhao V. Karamcheti Department of Computer Science Courant Institute of Mathematical Science New York University USA

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.

关键词： Resource management Network servers Web server Costs Aggregates Peer to peer computing computer science Application software Clustering algorithms throughput

来源：评论

学校读者我要写书评

暂无评论

On the dynamic allocation of mobile agents by on-line task scheduling

On the dynamic allocation of mobile agents by on-line task s...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： Xinfeng Yang Weimin Ma J. You J. Liu School of Computing and Information Technology Griffith University QLD Australia Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

来源：评论

学校读者我要写书评

暂无评论

On the design of scalable pipelined broadcasting for mesh networks

On the design of scalable pipelined broadcasting for mesh ne...

引用

IEEE International symposium on high performance computing Systems and Applications (HPCS)

作者： A.Y. Al-Dubai M. Ould-Khaoua Department of Computing Science University of Glasgow Glasgow UK

Minimising the communication latency and achieving considerable scalability are of paramount importance when designing high performance broadcast algorithms. Many algorithms for wormhole-switched meshes have been widely reported in the literature. However, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. As a consequence, many parallel applications cannot be efficiently supported using existing algorithms. Motivated by these observations, this paper presents a new broadcast algorithm for the all-port mesh networks. the unique feature of the proposed algorithm is its capability of handling broadcast in only one message-passing step irrespective of the network size. Results from a comparative analysis and simulation reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.

关键词： Broadcasting Mesh networks Partitioning algorithms Delay Algorithm design and analysis high performance computing performance analysis Scalability Analytical models Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Simulating L3 caches in real time using hardware accelerated cache simulation (HACS): a case study with SPECint 2000

Simulating L3 caches in real time using hardware accelerated...

引用

International symposium on computer architecture and high performance computing (SBAC-PAD)

作者： M. Watson J.K. Flanagan Performance Evaluation Laboratory Computer Science Department Brigham Young University Provo UT USA

Trace-driven simulation is a commonly used tool to evaluate memory-hierarchy designs. Unfortunately, trace collection is very expensive, and storage requirements for traces are very large. In this paper, we introduce HACS (Hardware Accelerated Cache Simulator), and describe the validation methods we used to demonstrate functionality. We also present some initial cache simulation results from SPECint 2000. We then propose future directions for research with HACS.

关键词： Hardware Acceleration computer aided software engineering Computational modeling Probes Buffer storage computer simulation Field programmable gate arrays Laboratories computer science

来源：评论

学校读者我要写书评

暂无评论

Efficient gather operation in heterogeneous cluster systems

Efficient gather operation in heterogeneous cluster systems

引用

IEEE International symposium on high performance computing Systems and Applications (HPCS)

作者： F. Ooshita S. Matsumae T. Masuzawa Graduate School of Engineering Science Osaka University Toyonaka Japan Faculty of Environmental and Information Studies Tottori University of Environmental Studies Tottori Japan

A heterogeneous cluster system consisting of different types of workstations and communication links plays an important role in parallel computing. In many applications on the system, collective communication operations are commonly used as communication primitives. thus, design of the efficient collective communication operations is the key to achieve high-performance parallel computing. But the heterogeneity of the system complicates the design. In this paper, we consider design of an efficient gather operation, one of the most important collective operations. We show that an optimal gather schedule is found in O(n/sup 2k-1/) time for the heterogeneous cluster system with n processors of k distinct types, and that a nearly-optimal schedule is found in O(n) time if k = 2.

关键词： Broadcasting Workstations Clustering algorithms Parallel processing Processor scheduling Sufficient conditions Scheduling algorithm Optimal scheduling Computational modeling high performance computing

来源：评论

学校读者我要写书评

暂无评论

Improving the communication network of a cluster of PC's to solve implicit CFD problems

Improving the communication network of a cluster of PC's to ...

引用

International symposium on computer architecture and high performance computing (SBAC-PAD)

作者： R.S. Silva M.F.P. Rivello R. Amorim Computer Science Department Laboratório Nacional de Computação Científica Brazil Computer Science Department Universidade Católica de Petrópolis Brazil

In this work we investigate the feasibility of using a cluster of PCs built with mass market networks to deal with the necessities of the CFD community, in particular for unstructured implicit CFD solvers that require a very irregular pattern of communications. We report the initial findings from a series of experiments with some well known benchmarks to determine CFD application sensitivity to machine communication parameters. this is done by running these benchmarks on a cluster in which the communication network has been modified to allow an increase of the bandwidth by adding multiple channels and a reduction on the latency by using a lightweight protocol like the M-Via.

关键词： Communication networks Computational fluid dynamics Ethernet networks Protocols computer science Bandwidth Delay computer networks high performance computing Bonding

来源：评论

学校读者我要写书评

暂无评论

Static mapping heuristics for tasks with dependencies, priorities, deadlines, and multiple versions in heterogeneous environments 16

Static mapping heuristics for tasks with dependencies, prior...

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Braun, T.D. Siegel, H.J. Maciejewski, A.A. Noemix 1425 Russ Blvd. Ste. T-110 San DiegoCA92101-4717 United States Electrical and Computer Engineering Department Colorado State University Fort CollinsCO80523-1373 United States Computer Science Department Colorado State University Fort CollinsCO80523-1373 United States

ISBN: (纸本)0769515738

Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, diverse groups of tasks. the problem, of mapping (defined as matching and scheduling) these tasks onto the machines of a distributed HC environment. has been shown, in general, to be NP-complete. therefore;the development of heuristic techniques to find near-optimal solutions is required. In the HC environment investigated, tasks had deadlines, priorities, multiple versions, and may be composed of communicating subtasks. the best static (off-line) techniques from some previous studies were adapted and applied to this mapping problem: a genetic algorithm (GA), a GENITOR-style algorithm., and a greedy Min-min technique. Simulation studies compared the performance of these heuristics in several overloaded scenarios, i.e., not all tasks executed. the performance measure used was a sum of weighted priorities of tasks that completed before their deadline, adjusted based on the version of the task used. It is shown that for the cases studied here, the GENITOR technique found the best results, but the faster Min-min approach also performed very well. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MPI-IO on DAFs over VIA: Implementation and performance evaluation 16

MPI-IO on DAFs over VIA: Implementation and performance eval...

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Wu, Jiesheng Panda, D.K. Department of Computer and Information Science Ohio State University ColumbusOH43210 United States

ISBN: (纸本)0769515738

In this paper, we describe an implementation of MPI-IO on top of the Direct Access File System (DAFS) standard. the implementation is realized by porting ROMIO on top of DAFS. We identify one of the main mismatches between MPI-IO and DAFS is memory management. three different design alternatives for memory management are proposed, implemented, and evaluated. We find that memory management in the ADIO layer performs better in situations where the DAFS Provider uses Direct data transfer to handle I/O requests. For the other case of Inline data transfer, it may hurt performance. We propose that the DAFS Provider can expose such implementation information for applications to take full advantage of Inline and Direct data transfers and memory management. Comparative analysis of MPI-IO performance over DAFS, network file system (NFS) and local file system (LFS) shows that MPI-IO on DAFS over VIA on cLAN performs 1.6-5.6 times better than on NFS over UDP/IP on cLAN. the performance of MPI-IO on DAFS is found to be comparable to the performance on local file system. Additional experiments show that MPI-IO nonblocking I/O primitives implemented by DAFS nonblocking operations can completely overlap I/O and computation. these results show that MPI-IO on DAFS can take full advantage of DAFS features to achieve high performance I/O over VI architectures. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the characterization of parallel real-time optimization problems

The characterization of parallel real-time optimization prob...

引用

IEEE International symposium on high performance computing Systems and Applications (HPCS)

作者： S.D. Bruda S.G. Akl Department of Computing and Information Science Queen's University Kingston ONT Canada

We identify the class of optimization problem expressible as independence systems that can be solved in real time using a parallel machine with polynomially bounded resources as being exactly the class of matroid for which the size of the optimal solution can be computed in parallel real time. We also extend previous results, showing that the solution obtained by a parallel algorithm is arbitrarily better than the solution reported by a sequential one not only for the real-time minimum-weight spanning tree (as previously known). Indeed, we show that, for all practical purposes, such a property does in fact hold for any optimization problem that falls into the aforementioned class.

关键词： Real time systems Concurrent computing Parallel machines Polynomials Computational modeling Time factors Information science Parallel algorithms Distributed computing Complexity theory

来源：评论

学校读者我要写书评

暂无评论

A software design model for parallel applications on heterogeneous systems

A software design model for parallel applications on heterog...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： M. Dwivedula S. Hariri M. Parashar High Performance Distributed Computing (HPDC) Laboratory Department of Electrical and Computer Engineering University of Arizona Tucson Tucson AZ USA The Applied Software Sytems Laboratory (TASSL) Department of Electrical and Computer Engineering Caip Center-Rutgers University Piscataway NJ USA

Overlap of computations and communications is an effective mechanism to improve the performance of parallel/distributed applications significantly. this overlap can be achieved efficiently by using data partitioning and properly scheduling the data transfer. Various asynchronous communication primitives, that are provided by most message passing tools (e.g. PVM, MPI), can be used to implement the required. Here, we present a design model, the Distributed Software Design Model (DSDM) and show how it can be applied to optimize parallel/distributed applications. We show through several examples, the Master-Slave Merge Sorting Application and the astrophysical N-Body Problem, how the DSDM can be used to develop efficient and optimized implementations of parallel and distributed algorithms.

关键词： Software design Application software Distributed computing Concurrent computing Message passing Processor scheduling Hardware Laboratories Asynchronous communication Design optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共445页 << < 381 382 383 384 385 386 387 388 389 390 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：