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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,474 篇 工学
- 2,297 篇 计算机科学与技术...
- 1,049 篇 软件工程
- 490 篇 电气工程
- 425 篇 信息与通信工程
- 187 篇 电子科学与技术（可...
- 118 篇 控制科学与工程
- 102 篇 网络空间安全
- 88 篇 动力工程及工程热...
- 73 篇 生物工程
- 48 篇 机械工程
- 46 篇 生物医学工程（可授...
- 41 篇 光学工程
- 34 篇 建筑学
- 30 篇 材料科学与工程（可...
- 22 篇 仪器科学与技术
- 22 篇 土木工程
- 22 篇 化学工程与技术
597 篇 理学
- 422 篇 数学
- 96 篇 物理学
- 83 篇 生物学
- 66 篇 系统科学
- 61 篇 统计学（可授理学、...
- 23 篇 化学
333 篇 管理学
- 248 篇 管理科学与工程(可...
- 136 篇 工商管理
- 99 篇 图书情报与档案管...
60 篇 医学
- 45 篇 临床医学
- 38 篇 基础医学(可授医学...
40 篇 经济学
- 40 篇 应用经济学
38 篇 法学
- 33 篇 社会学
11 篇 教育学
11 篇 农学
6 篇 文学
1 篇 艺术学

主题

1,181 篇 computer archite...
446 篇 hardware
378 篇 high performance...
287 篇 concurrent compu...
276 篇 computational mo...
237 篇 application soft...
229 篇 parallel process...
217 篇 computer science
213 篇 distributed comp...
187 篇 costs
186 篇 bandwidth
179 篇 field programmab...
173 篇 delay
164 篇 throughput
161 篇 cloud computing
157 篇 grid computing
140 篇 computer network...
137 篇 resource managem...
133 篇 laboratories
122 篇 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,393 篇 英文
13 篇 其他
7 篇 中文
2 篇 葡萄牙文
1 篇 法文

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

共 4415 条记录，以下是151-160 订阅

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

详细简洁

排序：

high performance FAULT TOLERANT REAL TIME computer architecture.

HIGH PERFORMANCE FAULT TOLERANT REAL TIME COMPUTER ARCHITECT...

引用

Digest of Papers - FTCS 16: 16th Annual International symposium on Fault-Tolerant computing Systems.

作者： Smith, T.Basil Hamilton Standard Digital Systems Inc USA Hamilton Standard Digital Systems Inc USA

ISBN: (纸本)0818607033

A fault tolerant computer architecture, FTCX, is an experimental computer architecture intended to serve as a general-purpose real-time computing system for fault sensitive supervisory and control applications. FTCX uses tightly synchronous triplex computation in its core to detect and mask all first faults. Synchronization, fault detection, and fault correction are all performed in the hardware. Novel to this architecture are the means by which interrupt requests and data are exchanged between the simplex local or remote industry standard bus (VMEbus) environments and the triplexed core environment. these exchanges are software transparent, yet fully implement all of the necessary algorithms to maintain data consistency and synchronization in the three channels of the core, even in the face of byzantine faults.

关键词： computer SYSTEMS, DIGITAL

来源：评论

学校读者我要写书评

暂无评论

performance Driven Cloud Resource Provisioning 16

Performance Driven Cloud Resource Provisioning

引用

16th IEEE Int Conf on high performance computing and Communications/11th IEEE Int Conf on Embedded Software and Systems\6th Int symposium on Cyberspace Safety and Security

作者： Kiruthika, Jay Khaddaj, Souheil Univ Kingston Kingston Upon Thames Surrey England

ISBN: (纸本)9781479961238

Cloud technology has made it easy to use infrastructure or software as a service to businesses, saving huge cost associated with acquisition and management of resources to run a data center or software licenses which is particularly vital for Small and Medium Enterprises. this has resulted in changing the dynamics of performance management by cloud service providers as the control of day-to-day business are passed to them. this paper focuses on addressing a number of related issues and discusses the break points or criteria to look for in performance management in applications, server and systems in cloud environment architecture. It recommends a semi-automated dynamic cloud resource management for both cloud clients and providers based on performance for small and medium enterprises.

关键词： Cloud computing Resource Provisioning performance Management Dynamic allocation for cloud resources

来源：评论

学校读者我要写书评

暂无评论

WORKS 2007 - Proceedings of the 2nd Workshop on Workflows in Support of Large-Scale Science - 16th International symposium on high performance Distributed computing, HPDC 2007

WORKS 2007 - Proceedings of the 2nd Workshop on Workflows in...

引用

2nd Workshop on Workflows in Support of Large-Scale Science, WORKS 2007

ISBN: (纸本)9781595937155

the proceedings contain 11 papers. the topics discussed include: integrating existing scientific workflow systems: the Kepler/Pegasus example;workflow adaptation as an autonomic computing problem;supporting large-scale science with workflows;on the black art of designing computational workflows;WS-VLAM: towards a scalable workflow system on the grid;a semantic workflow authoring tool for programming grids;a workflow approach to designed reservoir study;myExperiment: social networking for workflow-using e-scientists;GRIDCC: real-time workflow system;and cache for workflows.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cluster-based static scheduling: theory and practice 14

Cluster-based static scheduling: Theory and practice

引用

14th symposium on computer architecture and high performance computing

作者： Boeres, C Rebello, VEF Univ Fed Fluminense Inst Comp Niteroi RJ Brazil

ISBN: (纸本)0769517722

Task scheduling is a key element in achieving high performance from multicomputer systems. To be efficient, scheduling algorithms must be based on a cost model appropriate for computing systems in use. the optimal scheduling of tasks is NP-hard, and a large number of heuristic algorithms have been Proposed for a variety of scheduling conditions (graph types, granularities or cost models). this paper studies the problem of task scheduling under the LogP model and presents both theoretical and experimental results for a cluster-based, task duplication methodology.

关键词： Concurrent computing Costs Delay Grid computing high performance computing Optimal scheduling Parallel machines Parallel processing Processor scheduling Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

the case for flexible ISAs: unleashing hardware and software 29

The case for flexible ISAs: unleashing hardware and software

引用

29th International symposium on computer architecture and high performance computing SBAC-PAD

作者： Auler, Rafael Borin, Edson Univ Estadual Campinas UNICAMP Campinas SP Brazil

ISBN: (纸本)9781509012336

For a long time the Instruction Set architecture (ISA) has been the firm contract between software and hardware. this firm contract plays an important role by decoupling the development of software from hardware micro-architectural features, enabling both to evolve independently. Nonetheless, it also condemns the ISA to become larger, more cluttered and inefficient as new instructions are incorporated over the years and deprecated instructions are left untouched to keep legacy compatibility. In this work we propose OpenISA, a flexible ISA that enables both the software and the hardware to evolve independently and discuss how OpenISA 1.0 was designed to enable efficient OpenISA software emulation on alien ISAs, which is key to free the user from hardware lock-ins. Our results show that software compiled to OpenISA can be latter emulated on x86 and ARM processors with very little overhead achieving near native performance, under 10% for the majority of programs.

关键词： Emulation Program processors Payloads Hardware Recycling computer architecture

来源：评论

学校读者我要写书评

暂无评论

Register Caching for Stencil Computations on GPUs 16

引用

16th International symposium on Symbolic and Numeric Algorithms for Scientific computing (SYNASC)

作者： Falch, thomas L. Elster, Anne C. Norwegian Univ Sci & Technol Dept Comp & Informat Sci Trondheim Norway

ISBN: (纸本)9781479984480

For most applications, taking full advantage of the memory system is key to achieving good performance on GPUs. In this paper, we introduce register caching, a novel idea where registers of multiple threads are combined and used as a shared, last level, manually managed cache for the contributing threads. this method is enabled by the shuffle instruction recently introduced in Nvidia's Kepler GPU architecture, which allows threads in the same warp to exchange data directly, previously only possible by going through shared memory. We evaluate our proposal with a stencil computation benchmark, achieving speedups of up to 2.04, compared to using shared memory on a GTX680 GPU. Stencil computations form the core of many scientific applications, which can therefore benefit from our proposal. Furthermore, our method is not limited to stencil computations, but is applicable to any application with a predictable memory access pattern suitable for manual caching.

关键词： cache storage graphics processing units shared memory systems GTX680 GPU Nvidia Kepler GPU architecture data exchange graphics processing unit register caching shared memory system shuffle instruction stencil computation Benchmark testing computer architecture Graphics processing units Indexes Instruction sets Manuals Registers CUDA Caching GPU GPU computing Register Caching Stencil Computations Graphics Processing Unit shared memory systems Registers Cache memory instruction sets Benchmark testing cache storage computer architecture data exchange GRAPPER PICK UP shared memory thREADS Cache Memory System

来源：评论

学校读者我要写书评

暂无评论

On the implementation of SPMD applications using Haskell_# 15

On the implementation of SPMD applications using Haskell<sub...

引用

15th symposium on computer architecture and high performance computing

作者： de Carvalho, FH Lins, RD Quental, NC Univ Fed Pernambuco Escola Politecn Pernambuco Recife PE Brazil

ISBN: (纸本)0769520464

Commodities-built clusters, a low cost alternative for distributed parallel processing, brought high-performance computing to a wide range of users. However the existing widespread tools for distributed parallel programming, such as messaging passing libraries, does not attend new software engineering requirements that nave emerged due to increase in complexity of applications. Haskell(#) is a parallel programming language intending to reconcile higher abstraction and modularity with scalable performance. In this paper it is demonstrated the use of Haskell(#) in the programming of three SPMD benchmark programs, which have lower-level MPI implementations available.

关键词： Application software computer architecture Concurrent computing Costs Distributed computing Parallel processing Parallel programming Programming profession Software engineering Software libraries

来源：评论

学校读者我要写书评

暂无评论

Runtime system support for running applications with dynamic and. asynchronous task parallelism in software DSM systems

Runtime system support for running applications with dynamic...

引用

18th International symposium on computer architecture and high performance computing

作者： Mendes, Rafael Whately, Lauro de Castro, Maria Clicia Bentes, Cristiana Amorim, Claudio Luis Univ Fed Rio de Janeiro COPPE Rio de Janeiro Brazil Univ Estado Rio De Janeiro IME Rio De Janeiro Brazil Univ Estado Rio De Janeiro DESC Rio De Janeiro Brazil

ISBN: (纸本)0769527043

State-of-the-art software distributed shared-memory systems (SDSMs) provide a cost-effective solution to run single-program-multiple-data (SPMD) applications on clusters of distributed memory computers. However, SDSMs are unsuitable for running applications with dynamic, highly asynchronous task parallelism (ATP), such as graphics, simulators, and decision support systems. In ATP-based applications, the execution of tasks depends not only on the input data but also on the variable amount of data that each task produces at runtime, which generates high load imbalance and communication traffic that degrades performance of SDSM systems drastically. In this work, we propose a new load balancing (LB) mechanism to enable SDSM systems to support dynamic task scheduling as required by ATP applications. To evaluate the benefits of our LB mechanism, we developed Clik a new multithreaded SDSM system with automatic load balancing. Our preliminary performance results of Clik running on a 16-node Linux SMP cluster for five ATP applications showed that Clik attained significant speedups. For four of our five applications, the speedups varied from 7.2 up to 13.8 on 16 processors.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

16th Annual International symposium on high performance computing Systems and Applications

作者： Oh, ES Kanj, IA Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA

ISBN: (纸本)0769516262

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.

关键词： all-to-all broadcast distributed parallel computing systems inter-processor communication star network

来源：评论

学校读者我要写书评

暂无评论

Feedback-directed thread scheduling with memory considerations 07

Feedback-directed thread scheduling with memory consideratio...

引用

16th International symposium on high performance Distributed computing 2007, HPDC'07 and Co-Located Workshops

作者： Song, Fengguang Moore, Shirley Dongarra, Jack University of Tennessee Computer Science Department Knoxville TN University of Tennessee Oak Ridge National Laboratory Knoxville TN

ISBN: (纸本)1595936734

this paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. the approach relies upon a binary instrumentation tool to automatically acquire the memory sharingrelationship between user-level threads by analyzing their memory trace. We introduce the concept of Affinity Graph to model the relationship. Expensive I/O for large trace files is completely eliminated by using an online graph creation scheme. We apply the technique of hierarchical graph partitioning and thread reordering to the affinity graph to determine an optimal thread schedule. We have performed experiments on an SGI Altix system. the experimental results show that our approach is able to reduce the totalexecution time by 10% to 38% for a variety of applications through the maximization of the data reuse within a single processor, minimization of the data sharing between processors, and a good load balance. Copyright 2007 ACM.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共442页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：