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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,861 篇 会议
9 篇 期刊文献

馆藏范围

1,870 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,162 篇 工学
- 1,098 篇 计算机科学与技术...
- 479 篇 软件工程
- 285 篇 电气工程
- 138 篇 信息与通信工程
- 126 篇 电子科学与技术（可...
- 52 篇 控制科学与工程
- 33 篇 动力工程及工程热...
- 21 篇 机械工程
- 17 篇 生物医学工程（可授...
- 16 篇 仪器科学与技术
- 15 篇 生物工程
- 14 篇 网络空间安全
- 12 篇 环境科学与工程（可...
- 10 篇 光学工程
- 8 篇 力学（可授工学、理...
- 8 篇 建筑学
- 7 篇 化学工程与技术
218 篇 理学
- 161 篇 数学
- 33 篇 物理学
- 32 篇 系统科学
- 18 篇 生物学
- 17 篇 统计学（可授理学、...
- 9 篇 化学
- 9 篇 地球物理学
196 篇 管理学
- 156 篇 管理科学与工程(可...
- 79 篇 工商管理
- 44 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 9 篇 社会学
10 篇 医学
- 8 篇 基础医学(可授医学...
6 篇 农学
5 篇 教育学

主题

547 篇 computer archite...
187 篇 hardware
122 篇 high performance...
109 篇 field programmab...
108 篇 computational mo...
83 篇 grid computing
80 篇 cloud computing
73 篇 concurrent compu...
73 篇 application soft...
73 篇 distributed comp...
72 篇 computer science
71 篇 parallel process...
71 篇 resource managem...
71 篇 graphics process...
70 篇 kernel
63 篇 throughput
59 篇 bandwidth
59 篇 benchmark testin...
58 篇 optimization
56 篇 runtime

机构

8 篇 school of comput...
8 篇 intel corp santa...
7 篇 univ chicago dep...
7 篇 mathematics and ...
6 篇 georgia inst tec...
6 篇 university of ch...
6 篇 mathematics and ...
6 篇 college of compu...
5 篇 univ wisconsin m...
5 篇 barcelona superc...
5 篇 univ calif santa...
5 篇 northeastern uni...
5 篇 carnegie mellon ...
5 篇 intel corporatio...
5 篇 univ fed rio gra...
4 篇 univ politecn ca...
4 篇 univ toronto on
4 篇 univ illinois ur...
4 篇 georgia institut...
4 篇 oak ridge nation...

作者

11 篇 navaux philippe ...
8 篇 prasanna viktor ...
8 篇 mutlu onur
7 篇 borin edson
7 篇 chong frederic t...
7 篇 guedes dorgival
6 篇 dongarra jack
6 篇 patt yale n.
6 篇 xie yuan
6 篇 torrellas josep
6 篇 schwan karsten
6 篇 ferreira renato
6 篇 i. foster
5 篇 franca felipe m....
5 篇 hwu wen-mei
5 篇 nam sung kim
5 篇 martonosi margar...
5 篇 loh gabriel h.
5 篇 kim nam sung
5 篇 zhou huiyang

语言

1,842 篇 英文
16 篇 其他
11 篇 中文
1 篇 葡萄牙文

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

共 1870 条记录，以下是581-590 订阅

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

详细简洁

排序：

Achieving Safety for Power Shifting in Overprovisioned high performance computing Systems 30

Achieving Safety for Power Shifting in Overprovisioned High ...

引用

30th ieee international Parallel and Distributed Processing symposium (IPDPS)

作者： Moore, Shirley Univ Texas El Paso Dept Comp Sci El Paso TX 79968 USA

ISBN: (纸本)9781509036820

Future large-scale parallel computer systems, including exascale systems, will operate under an overall power bound. this bound will be enforced by having nodes adhere to local power caps, the sum of which cannot exceed the global power bound. To make efficient use of the available power, protocols have been developed to shift power between nodes, for example to compensate for load imbalance or system noise. the distributed power shifting protocol needs to provide a guarantee of safety that the global power bound will never be exceeded and it needs to have acceptably low overhead under normal operating conditions. We present a variant of the Paxos protocol that guarantees safety. We give an upper bound for the communication overhead of this protocol, along with suggestions for how the overhead can be lowered.

关键词： power consumption exascale power bound safety distributed agreement

来源：评论

学校读者我要写书评

暂无评论

Enhancing scalability and load balancing of Parallel Selected Inversion via tree-based asynchronous communication 30

Enhancing scalability and load balancing of Parallel Selecte...

引用

30th ieee international Parallel and Distributed Processing symposium (IPDPS)

作者： Jacquelin, Mathias Yang, Chao Lin, Lin Wichmann, Nathan Lawrence Berkeley Natl Lab Scalable Solvers Grp Berkeley CA 94720 USA Univ Calif Berkeley Dept Math Berkeley CA 94720 USA Lawrence Berkeley Natl Lab Berkeley CA 94720 USA Cray Inc Seattle WA USA

ISBN: (纸本)9781509021406

We develop a method for improving the parallel scalability of computations that involve asynchronous task execution. We apply this method to the recently developed parallel selected inversion algorithm [Jacquelin, Lin and Yang 2014], named PSelInv, on massively parallel distributed memory machines. In the PSelInv method, we compute selected elements of the inverse of a sparse matrix A that can be decomposed as A = LU, where L is lower triangular and U is upper triangular. computing these selected elements of A(-1) requires restricted collective communications among a subset of processors within each column or row communication group created by a block cyclic distribution of L and U. We describe how this type of restricted collective communication can be implemented using asynchronous point-to-point MPI communications combined with a binary tree based data propagation scheme. Because multiple restricted collective communications may take place at the same time, we need to use a heuristic to prevent processors participating in multiple collective communications from receiving too many messages. this heuristic allows us to reduce communication load imbalance and improve the overall scalability of the selected inversion algorithm. For instance, when 6, 400 processors are used, we observe that the use of this heuristic leads to over 5x speedup for a number of test matrices. It also mitigates the performance variability introduced by an inhomogeneous network topology.

关键词： selected inversion distributed memory parallel algorithm asynchronous data communication collective communication high performance computation load balancing

来源：评论

学校读者我要写书评

暂无评论

COMET: Client-Oriented METadata Service for highly Available Distributed File Systems 27

COMET: Client-Oriented METadata Service for Highly Available...

引用

ieee 27th international symposium on computer architecture and high performance computing

作者： Xue, Ruini Ao, Lixiang Guan, Zhongyang Univ Elect Sci & Technol China Sch Engn & Comp Sci Chengdu Peoples R China

ISBN: (纸本)9781467380119

highly available metadata services of distributed file systems are essential to cloud applications. However, existing highly available metadata designs lack client-oriented features that treat metadata discriminately, leading to a single metadata fault domain and low availability. After investigating the workload characteristics of Hadoop, we propose Client-Oriented METadata (COMET), a novel highly available metadata service design that divides and distributes metadata into independent regions in terms of clients. these regions are isolated fault domains inherently, and failures in one region will not break file operations in other regions. A prototype of COMET was implemented based on HDFS, and the experimental results show that COMET can significantly improve metadata availability of HDFS without obvious performance degradation. It can also deliver scalable performance and faster metadata recovery due to its decentralized architecture.

关键词： Distributed Storage File System Metadata high Availability Hadoop HDFS

来源：评论

学校读者我要写书评

暂无评论

Non-stationary simulation of computer systems and dynamic performance evaluation: a concern-based approach and case study on cloud computing 27

Non-stationary simulation of computer systems and dynamic pe...

引用

ieee 27th international symposium on computer architecture and high performance computing

作者： Pereira, Lourenco A., Jr. Mamani, Edwin L. C. Santana, Marcos J. Santana, Regina H. C. Nobile, Pedro Northon Monaco, Francisco Jose Univ Sao Paulo Dept Sistemas Comp Sao Carlos SP Brazil Inst Fed Sao Paulo Dept Informat Sao Carlos SP Brazil Univ Sao Paulo Dept Sist Comp Sao Carlos SP Brazil

ISBN: (纸本)9781467380119

this paper introduces an approach to the design of discrete event simulation experiments aimed at transient performance analysis. Specially in complex, multi-tier applications, the net effects of small delays introduced by buffers, IO operations, communication latency and averaged measurements, may result in significant inertia along the input-output path. In order to bring out these dynamic properties, the simulation experiment should excite the system with non-stationary workload under controlled conditions. the work discusses on the dynamic properties of large-scale distributed computer systems and how these may impact delivered performance. these rationales are explored to motivate a concern-based architecture which captures the elicited requirements. the design approach is systematic formulated and illustrated by a case study on extending a well-known cloud computing simulation framework to meet the aimed features. Experimental results of ongoing work are also addressed.

关键词： Cloud computing performance Evaluation Quality of Service

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS AND OPTIMIZATION OF ENGINES FOR DYNAMICALLY TYPED LANGUAGES 27

ANALYSIS AND OPTIMIZATION OF ENGINES FOR DYNAMICALLY TYPED L...

引用

ieee 27th international symposium on computer architecture and high performance computing

作者： Dot, Gem Martinez, Alejandro Gonzalez, Antonio Univ Politecn Cataluna Barcelona Spain ARM Cambridge England

ISBN: (纸本)9781467380119

Dynamically typed programming languages have become very popular in the recent years. these languages ease the task of the programmer but introduce significant overheads since assumptions about the types of variables have to be constantly validated at run time. JavaScript is a widely used dynamically typed language that has gained significant popularity in recent years. In this paper, we provide a detailed analysis of the two main sources of overhead in the JavaScript execution. the first one is the runtime overhead needed for dynamic compilation and housekeeping activities (i.e. garbage collector, compilation, etc.). the second one is the additional checks and guards introduced by the dynamic nature of JavaScript. then, we propose three new HW/SW optimizations that reduce this latter type of overhead. We show that these two types of overhead represent 35% and 25% respectively of the total execution time on average for a representative workload, and the proposed optimizations provide a 6% average speedup.

关键词： Dynamic typed languages Dynamic Compilation computer architecture

来源：评论

学校读者我要写书评

暂无评论

Quantum Virtual Machine: A scalable model to optimize energy savings and resource management 27

Quantum Virtual Machine: A scalable model to optimize energy...

引用

ieee 27th international symposium on computer architecture and high performance computing

作者： Monteiro, Andre Felipe Loques, Orlando Univ Fed Fluminense Inst Comp Programa Pos Grad Comp Niteroi RJ Brazil Ctr Fed Educ Tecnol Celso Suckow Fonseca CEFET RJ Petropolis Brazil

ISBN: (纸本)9781467380119

this work presents a model for managing Virtual Application Servers (VAS) on cluster-based web servers. In addition to providing energy savings, our model has linear scalability and defines a default processing virtual web server, known as Quantum Virtual Machine (QVM). A set of QVM performs a Logical Web Server (LWS), which operates in a flexible manner, changing its performance and power consumption depending on the workload of the applications. Concepts of agile VAS clone, co-allocation of VAS in the same core, and Dynamic Voltage and Frequency Scaling (DVFS) are used in the model, enabling rapid configuration actions and a fine-grained QoS control. the experiments evaluate the effectiveness of the proposed model by means of power consumption reduction and QoS violation as compared to the Linux CPU governors and state-of-the-art approaches based on optimization. the results show our model conserves up to 51.8% of the energy required by a cluster designed for peak workload scenario, with a negligible impact on the applications performance.

关键词： Power-aware computing Resource management Scalability Virtualization Web server clusters

来源：评论

学校读者我要写书评

暂无评论

Joint remote radio head selection and user association in cloud radio access networks

Joint remote radio head selection and user association in cl...

引用

ieee international symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Aini Li Yan Sun Xiaodong Xu Chunjing Yuan School of Electronic Engineering and Computer Science Queen Mary University of London London UK National Engineering Laboratory for Mobile Network Security Beijing University of Posts and Telecommunication Beijing China

ISBN: (纸本)9781509032556

the cloud radio access network (C-RAN) has been proposed recently as a promising network architecture to meet the explosive data traffic growth in 5G wireless communication systems. In C-RAN, all baseband signal processing is centralized at one Baseband Unit (BBU) pool powered by cloud computing technologies. Whilst the Remote Radio Heads (RRHs), left off on the cell sites, are connected to the BBU pool through fronthaul networks and can be densely deployed with low cost. However, a large number of active RRHs located close to each other may result in severer interference and inefficient energy consumption. To tackle above challenges, we formulate a network power consumption minimization (NPCM) problem, which selects a set of active RRHs and constructs the user association with the active RRHs. the capacity limitation of the fronthaul network is considered in the problem. Since the NPCM problem belongs to the integer programming problem and is NP-hard, we propose a low complexity approximation algorithm that yields the performance guarantees: joint RRH selection and user association (JRSUA) algorithm. A simulation platform is developed to evaluate the network power consumption in three fronthaul network scenarios: fiber, wireless and mixed. Simulation results show that the proposed JRSUA algorithm is able to provide near-optimal performance with reduced complexity and outperforms the other counterparts.

关键词： Power demand Cloud computing computer architecture Energy consumption Heuristic algorithms Bandwidth 5G mobile communication

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated high-speed Eye Pupil Tracking System 27

GPU-accelerated High-speed Eye Pupil Tracking System

引用

ieee 27th international symposium on computer architecture and high performance computing

作者： Mompean, Juan Aragon, Juan L. Prieto, Pedro Artal, Pablo Univ Murcia Dept Ingn & Tecnol Computadores Murcia Spain Univ Murcia LUiOyN Lab Opt Murcia Spain

ISBN: (纸本)9781467380119

Pupil tracking under infrared illumination is an important tool for many researchers in physiological visual optics and ophthalmology. It is also a relevant topic for gaze tracking which is used in psychological and medical research, marketing, human-computer interaction, virtual reality and other areas. A typical setup can be either a low-cost webcam with some infrared LEDs or glasses with mounted cameras and infrared illumination. In this work, we evaluate and parallelize several pupil tracking algorithms with the aim of estimating the pupil's position and size with high accuracy in order to develop a high-speed pupil tracking system. To achieve high processing speed the original non-parallel algorithms have been parallelized by using CUDA and OpenMP. Graphics cards are designed to process images at very high frequencies and resolutions, and CUDA enables them to be used for general purpose computing. Our experimental results show that pupil tracking can be efficiently performed at high speeds with high-resolution images (up to 530 Hz with images of 1280x1024 pixels) using a state-of-the-art GP-GPU.

关键词： Eye tracking

来源：评论

学校读者我要写书评

暂无评论

Many SVDs on GPU for Image Mosaic Assemble 27

Many SVDs on GPU for Image Mosaic Assemble

引用

ieee 27th international symposium on computer architecture and high performance computing

作者： Badolato, Irving de Paula, Luciano Farias, Ricardo Univ Fed Rio de Janeiro COPPE Syst Engn Ctr Technol Bldg HRoom 319 BR-21945970 Rio De Janeiro RJ Brazil

ISBN: (纸本)9781467386210

In this paper we present a homography algorithm to produce image mosaics using parallelism to solve a multiple Singular Value Decomposition (SVD) system. We analyse four state of art SVD methods and choose the one which better suites the expected size of the matrices derived from the datasets of interest. then we use cuda to accelerate the solution of the transformation homogeneous matrices.

关键词： Homography GPU computing SVD solver

来源：评论

学校读者我要写书评

暂无评论

Approximate Lock: Trading off Accuracy for performance by Skipping Critical Sections

Approximate Lock: Trading off Accuracy for Performance by Sk...

引用

international symposium on Software Reliability Engineering (ISSRE)

作者： Riad Akram Mohammad Mejbah Ul Alam Abdullah Muzahid University of Texas San Antonio University of Texas at San Antonio San Antonio TX US

ISBN: (纸本)9781467390033

Approximate computing is gaining a lot of traction due to its potential for improving performance and consequently, energy efficiency. this project explores the potential for approximating locks. We start out with the observation that many applications can tolerate occasional skipping of computations done inside a critical section protected by a lock. this means that for certain critical sections, when the enclosed computation is occasionally skipped, the application suffers from quality degradation in the final outcome but it never crashes/deadlocks. To exploit this opportunity, we propose Approximate Lock (ALock). the thread executing ALock checks if a certain condition (e.g., high contention, long waiting time) is met and if so, the thread returns without acquiring the lock. We modify some selected critical sections using ALock so that those sections are skipped when ALock returns without acquiring the lock. We experimented with 14 programs from PARSEC, SPLASH2, and STAMP benchmarks. We found a total of 37 locks that can be transformed into ALock. ALock provides performance improvement for 10 applications, ranging from 1.8% to 164.4%, with at least 80% accuracy.

关键词： Instruction sets computer crashes Runtime Benchmark testing Distance measurement Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共187页 << < 55 56 57 58 59 60 61 62 63 64 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：