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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是3851-3860 订阅

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

详细简洁

排序：

architecture requirements for commercializing Grid resources

Architecture requirements for commercializing Grid resources

引用

International symposium on high performance Distributed computing

作者： C. Kenyon G. Cheliotis IBM Zurich Research Laboratory Switzerland

Contemporary computing systems, especially large-scale systems such as Grids promise ultra-fast ubiquitous utility computing, always available at the flip of a switch. A major unresolved issue is the organization and efficient usage of such infrastructure in a commercial context where several entities compete for shared resources. this has long been resolved for conventional utility resources such as gas and electricity through commoditization, a variety of market designs, customization, and decision support for the resulting portfolios of assets and commitments. the paper reviews the state of Grid commercialization and compares it to the commercialization of conventional resources. We draw specific lessons for commercialized Grids and detail them as architecture requirements at each level of the architecture stack. We provide an example to illustrate the benefits of commercialized resources in terms of the financial clarity it brings to decisions for different user groups, namely application users and IT managers.

关键词： Commercialization Grid computing Pervasive computing Switches computer architecture Distributed computing Power grids Portfolios computer network management Financial management

来源：评论

学校读者我要写书评

暂无评论

Overview: an integrated framework for performance engineering and resource-aware compilation

Overview: an integrated framework for performance engineerin...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： W.H. Sanders C. Polychronopoulos T. Huang T. Courtney D. Daly D. Deavours S. Derisavi Coordinated Science Laboratory Beckman Institute for Advanced Science and Technology and Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign Urbana-Champaign IL USA

来源：评论

学校读者我要写书评

暂无评论

Exploiting loop-level parallelism with the Shift architecture

Exploiting loop-level parallelism with the Shift Architectur...

引用

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

作者： C.D. Lima T. Nakamura Computer Architecture Laboratory Graduate School of Information Sciences University of Tohoku Sendai Miyagi Japan

the limited amount of instruction-level parallelism inherent in applications is a limiting factor for improving the performance of most conventional microprocessors. A promising solution to overcome this problem is to exploit coarser granularities of parallelism. In this paper, we propose exploiting loop-level parallelism in a multithreaded fashion. We use the Shift architecture as a baseline architecture, with improved compiler support and register file. the compiler converts iterations of a loop into threads, to be executed by multiple processing elements. the hardware provides a selective register shifting mechanism in order to allow the execution of loops containing loop-carried data dependences, which are very difficult to execute by using conventional architectures. In this paper, we simulate and discuss the parameters of major importance for the implementation of this architectural approach. Our initial results show that, on two simple numerical benchmarks, a considerable amount of iteration overlapping can be potentially achieved by an implementation of the Shift architecture, in comparison with a multiprocessor machine.

关键词： Parallel processing computer architecture Microprocessors Laboratories Application software Yarn Hardware Continuous improvement Delay Proposals

来源：评论

学校读者我要写书评

暂无评论

An evaluation of processor co-allocation for different system configurations and job structures

An evaluation of processor co-allocation for different syste...

引用

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

作者： A.I.D. Bucur D.H.J. Epema Faculty of Information Technology and Systems Delft University of Technnology Delft Netherlands

In systems consisting of multiple clusters of processors such as our Distributed ASCI Supercomputer (DAS), jobs may request co-allocation, i.e., the simultaneous allocation of processors in different clusters. We simulate such systems ignoring communication among the tasks of jobs, and determine the response times for different types and sizes of job requests, and for different numbers and sizes of clusters. In many cases we also compute or approximate the maximum utilization. We find that the numbers and sizes of the clusters and of the job components have a strong impact on performance, and that in many cases co-allocation is a viable choice.

关键词： Delay Processor scheduling Information technology Postal services Grid computing Application software Dispersion Concurrent computing Acceleration Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Resource-aware real-time CORBA in multi-server distributed environment

Resource-aware real-time CORBA in multi-server distributed e...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： M. Ravirala S. Sivasubramanian S. Kothari Department of Electrical & Computer Engineering Iowa State University Ames IA USA

the emerging distributed applications require end-to-end support for various quality-of-service (QoS) aspects, including bandwidth, latency, jitter, and dependability. the Common Object Request Broker architecture (CORBA) is an open distributed object computing infrastructure, standardized by the Object Management Group (OMG). Its goal is to minimize the effort required to develop high-quality systems by composing applications using reusable software components. However, CORBA is not sufficient to provide QoS guarantees in a distributed environment as it lacks capabilities to specify and enforce QoS constraints. For enforcing these constraints, OMG came up with Real-Time CORBA (RTCORBA) specification that can guarantee end-to-end predictability in a complex realtime system. Currently, RTCORBA specification addresses the location transparency, but does not address the resource monitoring and management issues critical for meeting the QoS constraints in a multi-server distributed processing environment. In this paper, we identify the functionalities that are required to ensure predictability in such an environment and propose a resource management framework for RTCORBA. We present its design, a prototype implementation using ORBit ORB, and an example to illustrate its use.

关键词： Resource management Application software Scheduling Real time systems Distributed computing computer architecture Network servers Software reusability Distributed processing Operating systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling parallel loops with variable iterate execution times 16

Dynamic scheduling parallel loops with variable iterate exec...

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Cariño, R.L. Banicescu, I. MSU-NSF Engineering Research Center Mississippi State University United States Institute of Computer Science University of the Philippines Los Baños Philippines Department of Computer Science Mississippi State University United States

ISBN: (纸本)0769515738

To improve performance of scientific applications in parallel and distributed environments, dynamic scheduling algorithms for parallel loops have been proposed. Such algorithms address performance degradations due to load imbalance caused by predictable phenomena like nonuniform data distribution or algorithmic variance, and unpredictable phenomena such as data access latency or operating system interference. In particular, algorithms such as factoring, weighted factoring, adaptive weighted factoring, and adaptive factoring have been developed based on a probabilistic analysis of parallel loop iterates with variable running times. these algorithms execute the iterates in variable size chunks, where the sizes are determined such that the chunks complete before the optimal time with a high probability. these algorithms have successfully been implemented in a number of scientific applications such as: N-Body and Monte Carlo simulations, CFD, and radar signal processing. this paper presents a comparative study of the performance of various loop scheduling algorithms in a message-passing environment. the algorithms have been integrated into a tool for executing parallel loops, and the tool applied in profiling quadrature routines that are often used in scientific computations such as finite element methods, particle physics, and multivariate statistics. Experimental results reveal the effectiveness and robustness of the latest developed scheduling algorithms over the previous ones on loops with irregular iterate execution times. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis on the significant information to update the tables on occupation of resources by using a peer-to-peer protocol

Analysis on the significant information to update the tables...

引用

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

作者： R.F. de Mello M.S.V. Paiva L.C. Trevelin A. Gonzaga Engineering School of São Carlos University of São Paulo Brazil Federal University of São Carlos Brazil

the adequate occupation of the computing resources can influence, in a decisive way, the global performance of the system. therefore, in order to achieve a high performance, it is mandatory to know all the computing resources involved and their respective occupation level in a certain moment. With the objective of improving the system performance, the paper presents the OpenTella model to update the information related to the occupation of resources and the respective analysis of this occupation so that the migration of processes among computers of a same cluster can be completed. With the objective of increasing the scale level in the system and decreasing the number of messages among the computers, this peer-to-peer protocol defines sub-nets, which are clusters that make up a more comprehensive cluster. thus, groups are defined to interchange information and update the occupation of resources, in order to minimize the communication and to achieve a calculation to balance the load and meet the system needs, resulting in the migration of processes.

关键词： Information analysis Peer to peer computing Electronic mail Protocols high performance computing performance analysis Hard disks System performance Resource management Application software

来源：评论

学校读者我要写书评

暂无评论

Bandwidth efficient tamper detection for distributed Java systems

Bandwidth efficient tamper detection for distributed Java sy...

引用

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

作者： M. Jochen L. Marvel L.L. Pollock University of Delaware USA U.S Army Research Laboratory USA

the benefits of distributed computation present complex security considerations beyond those associated with the traditional computing paradigm. this paper describes a bandwidth efficient approach to authenticate distributed Java code. Our system utilizes steganographic techniques to embed a cryptographic checksum as a tamper detection mark into Java class files. the properties of this mark make our system desirable in applications where low bandwidth utilization is a requirement (e.g., wireless networks and low power devices). We implemented our system in Java and evaluated its performance through an empirical study. the analysis indicates that our system detects any degree of alteration to a marked Java class file and can do so within a reasonable amount of time.

关键词： Bandwidth Java Security Steganography Distributed computing Time division multiplexing Military computing Cryptography Wireless networks Collaboration

来源：评论

学校读者我要写书评

暂无评论

Implementing declarative parallel bottom-avoiding choice

Implementing declarative parallel bottom-avoiding choice

引用

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

作者： A. Rauber Du Bois R. Pointon H.-W. Loidl P. Trinder Department of Computing and Electrical Engineering Heriot-Watt University Edinburgh UK

Non-deterministic choice supports efficient parallel speculation, but unrestricted non-determinism destroys the referential transparency of purely-declarative languages by removing unfoldability and it bears the danger of wasting resources on unnecessary computations. While numerous choice mechanisms have been proposed that preserve unfoldability, and some concurrent implementations exist, we believe that no compiled parallel implementation has previously been constructed this paper presents the design, semantics, implementation and use of a family of bottom-avoiding choice operators for Glasgow parallel Haskell. the subtle semantic properties of our choice operations are described, including a careful classification using an existing framework, together with a discussion of operational semantics issues and the pragmatics of distributed memory implementation. the expressiveness of our choice operators is demonstrated by constructing a branch and bound search, a merge and a speculative conditional. their effectiveness is demonstrated by comparing the parallel performance of the speculative search with naive and 'perfect' implementations. their efficiency is assessed by measuring runtime overhead and heap consumption.

关键词： Yarn Neodymium Concurrent computing Runtime Control systems Proposals computer architecture high performance computing Data structures Skeleton

来源：评论

学校读者我要写书评

暂无评论

Memory-intensive benchmarks: IRAM vs. cache-based machines 16

Memory-intensive benchmarks: IRAM vs. cache-based machines

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Gaeke, B.R. Husbands, P. Li, X.S. Oliker, L. Yelick, K.A. Biswas, R. Computer Science Division University of California BerkeleyCA94720 United States NERSC Lawrence Berkeley National Laboratory BerkeleyCA94720 United States NAS Division NASA Ames Research Center Moffett FieldCA94035 United States

ISBN: (纸本)0769515738

the increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive benchmarks to evaluate a mixed logic and DRAM processor called VIRAM as a building block for scientific computing. For each benchmark, we explore the fundamental hardware requirements of the problem as well as alternative algorithms and data structures that can help expose fine-grained parallelism or simplify memory access patterns. Results indicate that VIRAM is significantly faster than conventional cache-based machines for problems that are truly limited by the memory system and that it has a significant power advantage across all the benchmarks. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：