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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

1,186 篇 computer archite...
446 篇 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
156 篇 grid computing
140 篇 computer network...
138 篇 resource managem...
133 篇 laboratories
123 篇 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,403 篇 英文
23 篇 其他
10 篇 中文
2 篇 葡萄牙文
1 篇 法文

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

共 4435 条记录，以下是4081-4090 订阅

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

详细简洁

排序：

A 64-bit, shared disk file system for Linux

A 64-bit, shared disk file system for Linux

引用

IEEE symposium on Mass Storage Systems

作者： K.W. Preslan A.P. Barry J.E. Brassow G.M. Erickson E. Nygaard C.J. Sabol S.R. Soltis D.C. Teigland M.T. O'Keefe Parallel Computer Systems Laboratory Department of Electrical and Computer Engineering University of Minnesota USA

In computer systems today, speed and responsiveness is often determined by network and storage subsystem performance. Faster, more scalable networking interfaces like Fibre Channel and Gigabit Ethernet provide the scaffolding from which higher performance implementations may be constructed, but new thinking is required about how machines interact with network-enabled storage devices. We have developed a Linux file system called GFS (the Global File System) that allows multiple Linux machines to access and share disk and tape devices on a Fibre Channel or SCSI storage network. We plan to extend GFS by transporting packetized SCSI commands over IP so that any GFS-enabled Linux machine can access shared network devices. GFS will perform well as a local file system, as a traditional network file system running over LP, and as a high-performance cluster file system running over storage networks like Fibre Channel. GFS device sharing provides a key cluster-enabling technology for Linux, helping to bring the availability, scalability, and load balancing benefits of clustering to Linux. Our goal is to develop a scalable, (in number of clients and devices, capacity, connectivity, and bandwidth) server-less file system that integrates IF-based network attached storage (NAS) and Fibre-Channel-based storage area networks (SAN). We call this new architecture Storage Area InterNetworking (SAINT). It exploits the speed and device scalability of SAN clusters, and provides the client scalability and network interoperability of NAS appliances. Our Linux port shows that the GFS architecture is portable across different platforms, and we are currently working on a port to NetBSD. the GFS code is open source (GPL) software freely available on the Internet at http://***.

关键词： File systems Linux Optical fiber devices Scalability Storage area networks computer networks Delay Ethernet networks Availability Load management

来源：评论

学校读者我要写书评

暂无评论

A software multilevel fault injection mechanism: case study evaluating the Virtual Interface architecture

A software multilevel fault injection mechanism: case study ...

引用

Reliable Distributed Systems

作者： Ting Liu Z. Kalbarczyk R.K. Iyer Center for Reliable and High-Performance Computing University of Illinois Urbana-Champaign Urbana IL USA

the characteristics of failures occurring in networked computing systems are still poorly understood. As a consequence, this is a rich area for exploration, especially with the arrival of new network interface standards, such as the Virtual Interface architecture (VIA) adopted by Microsoft, Intel and Compaq. the goal of VIA is to improve the performance of distributed applications by reducing the latency associated with the exchange of critical message between processes in Windows NT-based systems. In this paper, we propose the SMiFI (Software Multilevel Fault Injection) mechanism to evaluate the failure characteristics of networked systems, specifically VIA. the mechanism covers all software protocol layers of the host interface and corrupts both the messages and the computation engines that manipulate the messages.

关键词： computer aided software engineering computer architecture Application software computer interfaces computer networks Engines Hardware Kernel Telecommunication network reliability Logic programming

来源：评论

学校读者我要写书评

暂无评论

A resource description environment for distributed computing systems

A resource description environment for distributed computing...

引用

International symposium on high performance Distributed computing

作者： M. Brune A. Reinefeld J. Varnholt Konrad-Zuse-Zentrum Berlin Germany PC Paderborn Germany

RSD (Resource and Service Description) is a software architecture for specifying, registering and accessing resources and services in complex heterogeneous computing environments. It has three major components: a graphical resource editor, a compiler system for translating textual specifications, and an application programming interface. In this paper we focus on the language definition and the compiler system that generates portable data objects for registering and accessing distributed resources. We also present the mechanism used by RSD to maintain information on the status of dynamic resources such as CPU load or network bandwidth. RSD is a purely descriptive tool that provides up-to-date information on system resources. Other tools, like resource brokers, mappers or job migrators, build on it.

关键词： Distributed computing Metacomputing Middleware Application software Software agents computer science User interfaces Graphical user interfaces Software standards Parallel processing

来源：评论

学校读者我要写书评

暂无评论

A performance broker for CORBA

A performance broker for CORBA

引用

International symposium on high performance Distributed computing

作者： K. Butler M. Clement Q. Snell TMCB Brigham Young University Provo UT USA

CORBA applications can transparently use service instances running on the client's machine, on the local-area network, or across the Internet. Standard CORBA services help the application locate service instances, but do not provide a mechanism to identify service instances that will give good performance. the performanceBroker executes performance test suites on application service instances and selects service instances that will give superior application performance. the Broker weights performance test results according to client-specified criteria to choose the service instances that will provide the best application performance and allocates those service instances to clients. Tests with a distributed ray tracing application show that service instances chosen by the performanceBroker give better performance than service instances chosen by round-robin or random selection in local-area network and Internet environments.

关键词： Web and internet services Local area networks IP networks Testing Distributed computing computer architecture Delay Bandwidth Ray tracing Explosives

来源：评论

学校读者我要写书评

暂无评论

Prefix computations on symmetric multiprocessors

Prefix computations on symmetric multiprocessors

引用

International symposium on Parallel Processing

作者： D.R. Helman J. JaJa Institute for Advanced Computer Studies & Department of Electrical Engineering University of Maryland College Park MD USA

We introduce a new optimal prefix computation algorithm on linked lists which builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Moreover, whereas Reid-Miller and Blelloch (1996) targeted their algorithm for implementation on a vector multiprocessor architecture, we develop our algorithm for implementation on the symmetric multiprocessor architecture (SMP). these symmetric multiprocessors dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Our prefix computation algorithm was implemented in C using POSIX threads and run on four symmetric multiprocessors-the IBM SP-2 (high Node), the HP-Convex Exemplar (S-Class), the DEC AlphaServer; and the Silicon Graphics Power Challenge. We ran our code using a variety of benchmarks which we identified to examine the dependence of our algorithm on memory access patterns. For some problems, our algorithm actually matched or exceeded the performance of the standard sequential solution using only a single thread. Moreover, in spite of the fact that the processors must compete for access to main memory, our algorithm still achieved scalable performance with up to 16 processors, which was the largest platform available to us.

关键词： Yarn Educational institutions Silicon Graphics Radio access networks Tree graphs Tree data structures Concurrent computing computer architecture Costs

来源：评论

学校读者我要写书评

暂无评论

Commit-Reconcile and Fences (CRF): a new memory model for architects and compiler writers

Commit-Reconcile and Fences (CRF): a new memory model for ar...

引用

Annual International symposium on computer architecture, ISCA

作者： Xiaowei Shen L.R. Arvind Massachusetts Institute of Technology Cambridge MA US

We present a new mechanism-oriented memory model called Commit-Reconcile & Fences (CRF) and define it using algebraic rules. Many existing memory models can be described as restricted versions of CRF. the model has been designed so that it is both easy for architects to implement and stable enough to serve as a target machine interface for compilers of high-level languages. the CRF model exposes a semantic notion of caches (saches), and decomposes load and store instructions into finer-grain operations. We sketch how to integrate CRF into modern microprocessors and outline an adaptive coherence protocol to implement CRF in distributed shared-memory systems. CRF offers an upward compatible way to design next generation computer systems.

关键词： Program processors Programming profession Laboratories computer science Microprocessors computer aided instruction high performance computing computer languages Memory architecture Parallel programming

来源：评论

学校读者我要写书评

暂无评论

performance of image and video processing with general-purpose processors and media ISA extensions

Performance of image and video processing with general-purpo...

引用

Annual International symposium on computer architecture, ISCA

作者： P. Ranganathan S. Adve N.P. Jouppi Electrical and Computer Engineering Rice University USA Western Research Laboratory Compaq Computer Corporation USA

this paper aims to provide a quantitative understanding of the performance of image and video processing applications on general-purpose processors, without and with media ISA extensions. We use detailed simulation of 12 benchmarks to study the effectiveness of current architectural features and identify future challenges for these workloads. Our results show that conventional techniques in current processors to enhance instruction-level parallelism (ILP) provide a factor of 2.3 X to 4.2 X performance improvement. the Sun VIS media ISA extensions provide an additional 1.1 X to 4.2 X performance improvement. the ILP features and media ISA extensions significantly reduce the CPU component of execution time, making 5 of the image processing benchmarks memory-bound. the memory behavior of our benchmarks is characterized by large working sets and streaming data accesses. Increasing the cache size has no impact on 8 of the benchmarks. the remaining benchmarks require relatively large cache sizes (dependent on the display sizes) to exploit data reuse, but derive less than 1.2 X performance benefits with the larger caches. Software prefetching provides 1.4 X to 2.5 X performance improvement in the image processing benchmarks where memory is a significant problem. With the addition of software prefetching, all our benchmarks revert to being compute-bound.

关键词： Instruction sets Application software Image processing Decoding Auditory displays Teleconferencing Pervasive computing high performance computing Laboratories Sun

来源：评论

学校读者我要写书评

暂无评论

Data management for large-scale scientific computations in high performance distributed systems

Data management for large-scale scientific computations in h...

引用

International symposium on high performance Distributed computing

作者： A. Choudhary M. Kandemir H. Nagesh J. No X. Shen V. Taylor S. More R. thakur Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

With the increasing number of scientific applications manipulating huge amounts of data, effective data management is an increasingly important problem. Unfortunately, so far the solutions to this data management problem either require deep understanding of specific storage architectures and file layouts (as in high-performance file systems) or produce unsatisfactory I/O performance in exchange for ease-of-use and portability (as in relational DBMSs). In this paper we present a new environment which is built around an active meta-data management system (MDMS). the key components of our three-tiered architecture are user application, the MDMS, and a hierarchical storage system (HSS). Our environment overcomes the performance problems of pure database-oriented solutions, while maintaining their advantages in terms of ease-of-use and portability. the high levels of performance are achieved by the MDMS, with the aid of user-specified directives. Our environment supports a simple, easy-to-use yet powerful user interface, leaving the task of choosing appropriate I/O techniques to the MDMS. We discuss the importance of an active MDMS and show how the three components, namely application, the MDMS, and the HSS, fit together. We also report performance numbers from our initial implementation and illustrate that significant improvements are made possible without undue programming effort.

关键词： Large-scale systems Distributed computing high performance computing Data visualization Engineering management Concurrent computing Relational databases Art Data analysis Image analysis

来源：评论

学校读者我要写书评

暂无评论

Configuring and tuning archival storage systems

Configuring and tuning archival storage systems

引用

IEEE symposium on Mass Storage Systems

作者： R. Moore J. Lopez C. Lofton W. Schroeder G. Kremenek M. Gleicher San Diego Supercomputer Center USA Gleicher Enterprises Limited Liability Company

Archival storage systems must operate under stringent requirements, providing 100% availability while guaranteeing that data will not be lost. In this paper we explore the multiple interconnected subsystems that must be tuned to simultaneously provide high data transfer rates, high transaction rates, and guaranteed meta-data backup. We examine how resources must be allocated to the subsystems to keep the archive operational, while simultaneously allocating resources to support the user I/O demands. Based on practical experience gained running one of the largest high performance Storage Systems, we propose tuning guidelines that should be considered by any group that is seeking to improve the performance of an archival storage system.

关键词： Supercomputers Resource management Engines Availability Data analysis computer applications Production systems Scalability Delay Information retrieval

来源：评论

学校读者我要写书评

暂无评论

performance characterization of large and long fibre channel arbitrated loops

Performance characterization of large and long fibre channel...

引用

IEEE symposium on Mass Storage Systems

作者： T.M. Ruwart Laboratory for Computational Science and Engineering University of Minnesota USA

the bandwidth performance of a Fibre Channel Arbitrated Loop (FCAL) is roughly defined to be 100 MegaBytes (100 bytes) per second. Furthermore, FCAL is capable of a theoretical peak of 40,000 I/O operations (transactions) per second. these performance levels, however, are largely not realized by the applications that use Fibre Channel as an interface to disk subsystems. the bandwidth and transaction performance of an Arbitrated Loop is sensitive to both the number of devices on the loop as well as the physical length of the loop. this study focuses on the effects of these two factors on the observed performance of Fibre Channel Arbitrated Loop as the number of nodes is scaled from 2 to 97 devices and as the physical length of the loop is scaled from 50 meters to several kilometers in length. To summarize, this study shows that the performance decreases significantly for very long loops and explains how this can be partially avoided. Also, the loop propagation delay on loops with many devices has only a moderate affect on performance. Finally, the effects of length tend to dominate the effects of population for very long, highly populated loops.

关键词： Optical fiber devices Disk drives Bandwidth Propagation delay Laboratories high performance computing Optical fiber communication Supercomputers Application software System testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共444页 << < 405 406 407 408 409 410 411 412 413 414 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：