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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,559 篇 工学
- 2,365 篇 计算机科学与技术...
- 1,163 篇 软件工程
- 494 篇 电气工程
- 407 篇 信息与通信工程
- 212 篇 电子科学与技术（可...
- 212 篇 控制科学与工程
- 98 篇 网络空间安全
- 80 篇 动力工程及工程热...
- 80 篇 生物工程
- 68 篇 光学工程
- 65 篇 机械工程
- 56 篇 生物医学工程（可授...
- 36 篇 建筑学
- 30 篇 化学工程与技术
- 29 篇 环境科学与工程（可...
614 篇 理学
- 375 篇 数学
- 144 篇 物理学
- 93 篇 生物学
- 74 篇 系统科学
- 69 篇 统计学（可授理学、...
465 篇 管理学
- 346 篇 管理科学与工程(可...
- 134 篇 图书情报与档案管...
- 129 篇 工商管理
- 65 篇 公共管理
111 篇 法学
- 103 篇 社会学
104 篇 医学
- 73 篇 公共卫生与预防医...
- 31 篇 临床医学
- 29 篇 基础医学(可授医学...
65 篇 文学
- 65 篇 新闻传播学
39 篇 经济学
- 38 篇 应用经济学
17 篇 教育学
10 篇 农学
1 篇 艺术学

主题

1,194 篇 computer archite...
426 篇 hardware
344 篇 high performance...
295 篇 computational mo...
255 篇 concurrent compu...
236 篇 application soft...
214 篇 computer science
205 篇 parallel process...
179 篇 distributed comp...
178 篇 costs
171 篇 delay
170 篇 grid computing
168 篇 bandwidth
164 篇 field programmab...
154 篇 resource managem...
153 篇 cloud computing
144 篇 computer network...
142 篇 throughput
129 篇 processor schedu...
125 篇 scalability

机构

22 篇 institute of com...
16 篇 graphic era deem...
14 篇 chitkara univers...
13 篇 university of ch...
11 篇 college of compu...
10 篇 school of comput...
10 篇 computer science...
9 篇 georgia inst tec...
9 篇 computer systems...
9 篇 intel corp santa...
8 篇 department of co...
8 篇 department of el...
8 篇 ibm thomas j. wa...
8 篇 barcelona superc...
8 篇 mathematics and ...
8 篇 quantum universi...
8 篇 中国电子科技集团...
8 篇 mathematics and ...
8 篇 key laboratory o...
8 篇 univ fed rio gra...

作者

14 篇 navaux philippe ...
10 篇 satvik vats
9 篇 vats satvik
9 篇 i. foster
9 篇 d.k. panda
8 篇 dhabaleswar k. p...
8 篇 dongarra jack
8 篇 loh gabriel h.
8 篇 guedes dorgival
8 篇 viktor k. prasan...
8 篇 prasanna viktor ...
8 篇 mutlu onur
7 篇 shiva mehta
7 篇 borin edson
7 篇 chong frederic t...
7 篇 torrellas josep
7 篇 kim nam sung
7 篇 li chao
7 篇 zhou huiyang
7 篇 ferreira renato

语言

4,523 篇 英文
100 篇 其他
20 篇 中文
3 篇 葡萄牙文
1 篇 法文

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

共 4645 条记录，以下是4251-4260 订阅

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

详细简洁

排序：

Improving effective bandwidth through compiler enhancement of global cache reuse

Improving effective bandwidth through compiler enhancement o...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： C. Ding K. Kennedy Department of Computer Science University of Rochester Rochester NY USA Department of Computer Science Rice University Houston TX USA

ISBN: (纸本)0769509908

Reusing data in cache is critical to achieving high performance on modern machines because it reduces the impact of the latency and bandwidth limitations of direct memory access. To date, most studies of software memory hierarchy management have focused on the latency problem. However today's machines are increasingly limited by insufficient memory bandwidth-on these machines, latency-oriented techniques are inadequate because they do not seek to minimize the total memory traffic over the whole program. this paper explores the potential for addressing bandwidth limitations by increasing global cache reuse-that is, reusing data across whole program and over the entire data collection. To this end, the paper explores a two-step global strategy. the first step fuses computations on the same data to enable the caching of repeated accesses. the second step groups data used by the same computation to bring about contiguous access to memory. While the first step reduces the frequency of memory accesses, the second step improves their efficiency. the paper demonstrates the effectiveness of this strategy and shows how to automate it in a production compiler.

关键词： Bandwidth Delay computer science Fuses Memory management Frequency performance gain Prefetching

来源：评论

学校读者我要写书评

暂无评论

Improved table lookup algorithms for postscaled division

Improved table lookup algorithms for postscaled division

引用

computer Arithmetic (ARIth)

作者： D.W. Matula Department of Computer Science and Engineering Southern Methodist University Dallas TX USA

ISBN: (纸本)0769511503

Postscaled division is a non-iterative algorithm delivering a quotient of single precision accuracy by the three term product (xy/spl circ/)c and of double precision accuracy by the formula [(xy/spl circ/)c][2-(yy/spl circ/)c]. Here x is the dividend, y/spl circ/ is a low order part complemented form of the divisor y, and c is a table lookup value approximating a "reciprocal function" 1/(yy/spl circ/) to a precision of over 27 bits. Table lookup latency is hidden by performing the lookup in parallel with the first multiplication (xy/spl circ/), with the second multiplication the "postscaling" by the lookup function value. Our contribution is the description of two new lookup algorithms for approximating the reciprocal function 1/yy/spl circ/ to high accuracy in fewer cycles than a typical floating point multiply latency. Our indirect bipartite lookup procedure has a latency of two successive lookups followed by a small integer addition. this first algorithm generates a 27 bit approximation of 1/yy/spl circ/ with total table size about 5 Kbytes. Our second lookup algorithm generates a 34 bit approximation with latency determined by 11 and 12 bit table lookups and a 4-1 addition. this second approximation employs some 20 Kbytes of tables to allow for a double extended precision division result in the same number of cycles as a double precision result.

关键词： Table lookup Delay Approximation algorithms computer science Arithmetic Acceleration Indium tin oxide Interpolation Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Modulo schedule buffers

Modulo schedule buffers

引用

IEEE/ACM International symposium on Microarchitecture (MICRO)

作者： M.C. Merten W.-M.W. Hwu Center for Reliable and High Performance Computing University of Illinois Urbana IL USA

As VLIW/EPIC processors are increasingly used in realtime, signal-processing, and embedded applications, the importance of. minimizing code size and reducing power is growing. this paper describes a new architectural mechanism, called the Modulo Schedule Buffers, that provides an elegant interface for the execution of modulo scheduled loops. While the performance is similar to that of kernel-only modulo scheduling, this mechanism has a number of advantages, including minimal code expansion. Rather than generating fully-scheduled kernels, the compiler generates a sequential form of the modulo scheduled loop body. Using the sequential form, the hardware internally synthesizes the prologue, kernel, and epilogue. In addition, while loops can be scheduled with fewer constraints and fewer explicit prologues/epilogues than with existing mechanisms. Because the hardware controls loop execution, the burden of modulo schedule loop control is lifted from the predicate register file, allowing for a less rigorous predication implementation. Finally, hardware control limits the interrupt latency when using the EQ explicit latency model to the execution latency of one iteration, rather than the whole loop invocation.

关键词： Kernel Pipeline processing Processor scheduling Hardware Registers Delay computer architecture VLIW Application software Software maintenance

来源：评论

学校读者我要写书评

暂无评论

Parallel 2D Delaunay triangulations in HPP and MPI

Parallel 2D Delaunay triangulations in HPP and MPI

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： Min-Bin Chen Tyng-Ruey Chuang Jan-Jau Wu Institute of Information Science Academia Sinica Taipei Taiwan

ISBN: (纸本)0769509908

this paper reports on efficient parallel implementations of two-dimensional Delaunay triangulation in high performance Fortran (HPF) and in Message Passing Interface (MPI). Our parallelization algorithm performs subblock triangulation and boundary merge independently at the same time. the sub-block triangulation is by a divide & conquer Delaunay algorithm known for its sequential efficiency, and the boundary triangulation is by an incremental construction algorithm with low overhead. Compared to prior work, our parallelization method is both simple and efficient. In the paper we also describe a solution to the collinear points problem that usually arises in large data sets for divide & conquer algorithm. Our experiences with the HPF implementation show that with careful control of the data distribution, we are able to parallelize the program using HPF's standard directives and extrinsic procedures. Experimental results on several parallel platforms, including an IBM SP2 and a DEC Alpha farm, show that a parallel efficiency of 31%-59% can be achieved for an 8-node distributed memory system. We also compare efficiency of the HPF implementation to that of a similarly hand-coded MPI implementation.

关键词： Parallel algorithms Mesh generation Load management Information science Message passing Concurrent computing Parallel processing Merging

来源：评论

学校读者我要写书评

暂无评论

Competitive analysis of on-line randomized call control in cellular networks

Competitive analysis of on-line randomized call control in c...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： I. Caragiaannis C. Kaklamanis E. Papaioannou Comput. Technol. Inst. Patras Univ. Greece Computer Technology Institute and Department of Computer Engineeringand Informatics University of Patras Rio Greece

ISBN: (纸本)0769509908

In this paper we address an important communication issue arising in cellular (mobile) networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the same geographical region can communicate simultaneously with other users of the network using distinct frequencies. the spectrum of the available frequencies is limited; thus, efficient solutions to the call control problem are essential. the objective of the call control problem is, given a spectrum of available frequencies and users that wish to communicate, to maximize the number of users that communicate without signal interference. Using competitive analysis, we study the performance of algorithm p-RANDOM; an intuitive on-line randomized call control algorithm proposed previously for cellular networks. We give upper and lower bounds of its competitive ratio against oblivious adversaries as a function of the parameter p. Optimizing the upper bound function, we prove that there exists a 2.651-competitive randomized call control algorithm. In this way, we significantly improve the best known upper bound on the competitiveness of on-line randomized call control which was 2.934.

关键词： Intelligent networks Land mobile radio cellular systems Base stations Mobile communication Interference Communication system control Frequency division multiplexing Wireless communication high-speed networks Informatics

来源：评论

学校读者我要写书评

暂无评论

A rotate-tiling image composition method for parallel volume rendering on distributed memory multicomputers

A rotate-tiling image composition method for parallel volume...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： Chin-Feng Lin Don-Lin Yang Yeh-Ching Chung Department of Information Engineering Feng Chia University FCU Taichung Taiwan

ISBN: (纸本)0769509908

the binary-swap and the parallel-pipelined methods are two popular image composition methods for volume rendering on distributed memory multicomputers. However, these methods either restrict the number of processors to a power of two or require many steps to transform image data that results in high communication overheads. In this paper, we present an efficient image composition method, the rotate-tiling (RT), for parallel volume rendering on distributed memory multicomputers. the RT method can fully utilize all available processors and minimize the communication overheads. In addition, we provide data compression method, the template run-length encoding (TRLE), to further reduce the communication data size. To evaluate the performance of the RT method, we compare the proposed method with the binary-swap method and the parallel-pipelined method. Both theoretical analysis and experimental test are conducted. In the theoretical analysis, we analyze the best performance bound of the RT method in terms of the startup time, the data transmission time, the number of processors, and the number of initial block of a sub-image. In the experimental test, we have implemented these three methods on an SP2 parallel machine. three volume datasets are used as test samples. the experimental results show that our method outperforms the binary-swap and the parallel-pipelined methods for all test samples and match the results analyzed in the theoretical analysis. For the TRLE method, the experimental results show that the TRLE method can further reduce the composition time for these three methods.

关键词： Rendering (computer graphics) Testing Image analysis Electrical capacitance tomography Data compression performance analysis Visualization Data communication Parallel machines Image coding

来源：评论

学校读者我要写书评

暂无评论

Flexible high-performance access to distributed storage resources 9

Flexible high-performance access to distributed storage reso...

引用

9th IEEE International symposium on high performance Distributed computing

作者： Patten, CJ Hawick, KA Univ Adelaide Dept Comp Sci Distributed & High Performance Comp Grp Adelaide SA 5005 Australia

ISBN: (纸本)0769507840

We describe a software architecture for storage services in computational grid environments. Based upon a lightweight message-passing paradigm, the architecture enables the provision and composition of active, distributed storage services. these services can then cooperatively provide access to distributed storage in a manner potentially optimized for dataset and resource environments. We report on the design and implementation of a distributed file system and a dataset-specific satellite imagery service using the architecture. We discuss data movement and storage issues and implications for future work with the architecture.

关键词： computer architecture Distributed computing File servers File systems Grid computing Memory Network servers Peer to peer computing Prefetching Satellites

来源：评论

学校读者我要写书评

暂无评论

A distributed multi-storage resource architecture and I/O performance prediction for scientific computing 9

A distributed multi-storage resource architecture and I/O pe...

引用

9th IEEE International symposium on high performance Distributed computing

作者： Shen, XH Choudhary, A Northwestern Univ Dept Elect & Comp Engn Ctr Parallel & Distributed Comp Evanston IL 60208 USA

ISBN: (纸本)0769507840

I/O intensive applications have posed great challenges to computational scientists. A major problem of these ap plications is that users have to sacrifice performance requirement in order to satisfy storage capacity requirement bl a conventional computing environment. Further performance improvement is impeded by the physical nature of these storage media evert state-of-the-art I/O optimizations are employed. In this paper we present a distributed multi-storage resource architecture that carr satisfy both performance and capacity requirements by employing multiple storage resources. Compared to traditional single storage resource architecture, our architecture provides a more flexible and reliable computing environment. It can bring new opportunities for high performance computing as well as inherit state-of-the-art I/O optimization approaches that have already been developed. We also develop an Application Programming Interface (API) that provides transparent management and access to various storage resources in our computing environment. As I/O usually dominates the performance in I/O intensive applications, we establish an I/O performance prediction mechanism which consists of a performance database and a prediction algorithm to help users better evaluate and schedule their applications. A tool is also developed to help users automatically generate the performance database. the experiments show that our multi-storage resource architecture is a promising platform for high performance distributed computing.

关键词： computer architecture computer interfaces Databases Distributed computing Environmental management Impedance Prediction algorithms Processor scheduling Resource management Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

RAID-x: A new distributed disk array for I/O-centric cluster computing 9

RAID-x: A new distributed disk array for I/O-centric cluster...

引用

9th IEEE International symposium on high performance Distributed computing

作者： Hwang, K Jin, H Ho, R Univ So Calif Los Angeles CA 90089 USA

ISBN: (纸本)0769507832;0769507840

A new RAID-x (redundant array of inexpensive disks at level x) architecture is presented for distributed I/O processing on a serverless cluster of computers. the RAID-x architecture is based on a new concept of orthogonal striping and mirroring (OSM) across all distributed disks in the cluster. the primary advantages of this OSM approach lie in: (1) a significant improvement in parallel I/O bandwidth, (2) hiding disk mirroring overhead in the background, and (3) greatly enhanced scalability and reliability in cluster computing applications. All claimed advantages are substantiated with benchmark performance results on the Trojans cluster built at USC in 1999. throughout the paper, we discuss the issues of scalable I/O performance, enhanced system reliability, and striped checkpointing on distributed RAID-x in serverless cluster environment.

关键词： Bandwidth Checkpointing computer applications computer architecture Concurrent computing Distributed computing Linux Packaging Reliability Scalability

来源：评论

学校读者我要写书评

暂无评论

Development of web toolkits for computational science portals: the NPACI HotPage 9

Development of web toolkits for computational science portal...

引用

9th IEEE International symposium on high performance Distributed computing

作者： thomas, M Mock, S Boisseau, J San Diego Supercomp Ctr San Diego CA 92093 USA

ISBN: (纸本)0769507840

the NPACI HotPage is a user portal that provides views of a distributed set of HPC resources as either an integrated meta-system, or as individual machines. these web pages run on any web browser, regardless of system or geographical location and are supported by secure, encrypted login sessions where authenticated users can access their HPC system accounts and perform basic computational tasks. We describe the development of the Grid Portals Toolkit (GridPort), which is based on the architecture developed for the HotPage, and will provide computational scientists and application developers with a set of simple, modular services and tools that allow application level, customized science portals development and facilitates seamless web-based access to distributed complete resources and grid services.

关键词： Application software computer architecture computer interfaces Cryptography Distributed computing Grid computing high performance computing Portals Service oriented architecture Web pages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共465页 << < 422 423 424 425 426 427 428 429 430 431 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：