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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

294 篇 会议
8 册 图书
4 篇 期刊文献

馆藏范围

306 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

192 篇 工学
- 176 篇 计算机科学与技术...
- 87 篇 软件工程
- 27 篇 电气工程
- 16 篇 电子科学与技术（可...
- 15 篇 信息与通信工程
- 9 篇 控制科学与工程
- 8 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 3 篇 机械工程
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
40 篇 理学
- 23 篇 数学
- 10 篇 系统科学
- 8 篇 生物学
- 5 篇 物理学
- 4 篇 统计学（可授理学、...
- 2 篇 大气科学
- 1 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
29 篇 管理学
- 22 篇 管理科学与工程(可...
- 16 篇 工商管理
- 10 篇 图书情报与档案管...
2 篇 农学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
- 2 篇 公共卫生与预防医...

主题

22 篇 parallel process...
17 篇 cloud computing
16 篇 distributed comp...
15 篇 computational mo...
13 篇 routing
12 篇 computer archite...
11 篇 scalability
11 篇 servers
10 篇 graphics process...
10 篇 peer-to-peer com...
9 篇 concurrent compu...
9 篇 resource managem...
9 篇 protocols
9 篇 hardware
9 篇 distributed comp...
8 篇 runtime
8 篇 monitoring
8 篇 real-time system...
8 篇 performance eval...
7 篇 computer science

机构

5 篇 institute of com...
3 篇 university of ch...
2 篇 school of scienc...
2 篇 vienna universit...
2 篇 shanghai key lab...
2 篇 guangdong provin...
2 篇 college of compu...
2 篇 department of co...
2 篇 tu münchen garch...
2 篇 school of comput...
2 篇 green univ bangl...
2 篇 univ chinese aca...
2 篇 school of cybers...
2 篇 school of comput...
2 篇 university of pi...
2 篇 isislab - dipart...
2 篇 department of co...
2 篇 institute of par...
2 篇 tennessee tech u...
2 篇 rwth aachen univ...

作者

3 篇 hai jin
3 篇 gonzalez teofilo...
2 篇 dan meng
2 篇 li cui
2 篇 roy palash
2 篇 chaudhary vipin
2 篇 haibin cai
2 篇 hassan mohammad ...
2 篇 michael alexande...
2 篇 liu yang
2 篇 roberto g. casce...
2 篇 shigeng zhang
2 篇 qiang li
2 篇 alexandru costan
2 篇 ammar reda a.
2 篇 luís lopes
2 篇 emmanuel jeannot
2 篇 vittorio scarano
2 篇 xiaofei liao
2 篇 stephen l. scott

语言

304 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=20th International Conference on Parallel and Distributed Computing Systems, PDCS 2007"

共 306 条记录，以下是101-110 订阅

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

详细简洁

排序：

SLA-Based Energy Aware Scheduling of Precedence-Constrained Applications on DVFS-Enabled Clusters 20

SLA-Based Energy Aware Scheduling of Precedence-Constrained ...

引用

20th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Chen, Xuedi Li, Kenli Liu, Chubo Li, Keqin Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA

ISBN: (纸本)9781479976157

the energy aware scheduling problem has been a critical issue in high-performance clusters owing to their high operation cost, environmental impact, and low reliability. An existing technique to reduce energy consumption of applications is dynamic voltage/frequency scaling (DVFS). In this paper, we develop an energy aware scheduling algorithm called EASLA for precedence-constrained applications in the context of Service Level Agreement (SLA) on DVFS-enabled cluster systems. Due to the dependencies among tasks and makespan extension, there may be some slacks under used. the main idea of the EASLA algorithm is to distribute each slack to a set of tasks and scale frequencies down to try to minimize energy consumption. Specifically, it first finds the maximum set of independent tasks for each task, and then iteratively allocates each slack to the maximum independent set whose total energy reduction is the maximal. Randomly generated graphs and two real-world applications are tested in our experiments. the experimental results show that our scheduling algorithm can save up to 22.68% and 12.01% energy consumption compared with GreedyDVS and EvenlyDVS algorithms, respectively.

关键词： Cluster computing Dynamic Voltage/Frequency Scaling DAG Energy Aware Scheduling Service Level Agreement

来源：评论

学校读者我要写书评

暂无评论

GPU Acceleration of Ciphertext-Policy Attribute-Based Encryption 20

GPU Acceleration of Ciphertext-Policy Attribute-Based Encryp...

引用

20th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD 2019)

作者： Fan, Kai Zhang, Chaoyu Shan, Ruiwen Yu, Hexuan Jiang, Hai Arkansas State Univ Dept Comp Sci State Univ AR 72467 USA

ISBN: (纸本)9781728116518

With the development of cloud computing, data security became popular in recent decades. However, traditional cryptography has some major limitations. For example, public key cryptography is not scalable in cases with many clients. Since Ciphertext-Policy Attribute-based encryption (CP-ABE) was developed in 2007, it has become as one of the major candidates to implement secure cloud storage. However, CP-ABE still cannot play a solid role due to its several limitations such as complexity of computation, lack efficiency revocation function, etc. this paper will review the CP-ABE and analyze the current CP-ABE toolkit. Major performance bottleneck will be identified and parallelized in CUDA. CP-ABE toolkit will be partially ported to GPU platform for acceleration. Some experiments have been conducted to demonstrate the effectiveness of the proposed approach.

关键词： GPU CP-ABE Security Performance parallel

来源：评论

学校读者我要写书评

暂无评论

Computation Results of the Riemann Zeta Search Project 20

Computation Results of the Riemann Zeta Search Project

引用

20th international Symposium on Symbolic and Numeric Algorithms for Scientific computing (SYNASC)

作者： Tihanyi, Norbert Kovacs, Attila Eotvos Lorand Univ Fac Informat Dept Comp Algebra Budapest Hungary

ISBN: (纸本)9781728106250

the paper summarizes the computation results of the Riemann Zeta Search Project. the aim of the project was to find extremely large values of the Riemann zeta function on the critical line. the computing method is based on the RS-PEAK algorithm which was presented in the 16th SYNASC conference in 2014. the computation environment was served by the SZTAKI Desktop Grid operated by the Laboratory of parallel and distributed systems at the Hungarian Academy of Sciences. Applying the RS-Peak algorithm 5597001 candidates were found where large values of the Riemann-Siegel Zfunction are expected. the largest known values are presented and published on the project website https://***.

关键词： Riemann zeta function distributed computing Large Z(t) values

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 20th Euromicro international conference on parallel, distributed and Network-Based Processing, PDP 2012

Proceedings - 20th Euromicro International Conference on Par...

引用

20th Euromicro international conference on parallel, distributed and Network-Based Processing, PDP 2012

ISBN: (纸本)9780769546339

the proceedings contain 87 papers. the topics discussed include: context map for navigating the physical world;robust and tuneable family of gossiping algorithms;efficiency-aware Jobs allocation for e-Science environments;performance evaluations of a BSP algorithm for state space construction of security protocols;a dynamic deadlock detection/resolution algorithm with linear message complexity;a dynamic distributed algorithm for read write locks;locality-aware dynamic mapping for multithreaded applications;interaction list compression in large parallel particle simulations on multicore systems;a federated data zone for the arts and humanities;bit rate reduction video transcoding with distributed computing;LAMBDA-the LSDF execution framework for data intensive applications;and dynamic serialization: improving energy consumption in eager-eager.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Physically Based parallel Ray Tracer for the Metropolis Light Transport Algorithm on the Tianhe-2 Supercomputer 20

Physically Based Parallel Ray Tracer for the Metropolis Ligh...

引用

20th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Wu, Changmao Zhang, Yunquan Yang, Congli Lu, Yutong Chinese Acad Sci Inst Software Lab Parallel Software & Computat Sci Beijing Peoples R China Chinese Acad Sci Inst Comp Technol State Key Lab Comp Architecture Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Natl Univ Def Technol Dept Comp Sci & Technol Changsha Hunan Peoples R China

ISBN: (纸本)9781479976157

Developing an efficient and highly scalable ray tracer for the Metropolis light transport algorithm is becoming increasingly important as the request for photorealistic images becomes a common trend. Although the Metropolis light transport algorithm has produced some of the most realistic images to date, it usually takes a great amount of time to render an image. the development of an efficient and highly scalable ray tracer for the Metropolis light transport algorithm is hard due in large part to the irregular memory access patterns, the imbalanced workload of light-carrying paths and the complicated mathematical model and complex physical processes. In this paper, we present a highly scalable physically based parallel ray tracer for the Metropolis light transport algorithm. Firstly, we present the idea of snapshot and sub-snapshot, then propose a novel assignment partitioning algorithm for compute nodes and CPU cores since the demand-driven assignment partitioning algorithms don't work. Secondly, we propose a physically based parallel ray racing framework for the Metropolis light transport algorithm, which is based on a master-worker architecture. Finally, we discuss the issue of granularity of the assignment partitioning and some optimization strategies for improving overall performance, then a hybrid scheduling strategy combining a static and dynamic scheduling strategy is described. Experiments show that our physically based ray tracer almost reaches linear speedup by using 26,400 CPU cores on the Tianhe-2 supercomputer.

关键词： physically based ray tracing bidirectional path tracing Metropolis light transport algorithm assignment partitioning hybrid scheduling distributed computing

来源：评论

学校读者我要写书评

暂无评论

Be a Good Neighbour: Characterizing Performance Interference of Virtual Machines Under Xen Virtualization Environments 20

Be a Good Neighbour: Characterizing Performance Interference...

引用

20th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Chi, Ruiqing Qian, Zhuzhong Lu, Sanglu Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China

ISBN: (纸本)9781479976157

With the rapid development of virtualization techniques, modern data centers move into a new era of cloud in recent years. Despite numerous advantages such as high resource utilization and rapid service scalability, current virtualization techniques don't guarantee perfect performance isolation among virtual machines sharing the physical machine, which may lead to unstable and unpredictable user-perceived application performance in clouds. therefore, understanding and modeling performance interference among collocated applications is of utmost importance. However, the hypervisor and guest OSes usually run independent resource schedulers and are invisible into each other, thereby making accurately characterizing performance interference a non-trivial work. In this paper, we first present a comprehensive experimental study on performance interference of different combinations of benchmarks, observing that virtual CPU floating overhead between multiple physical CPUs, and VMEXITs, i.e., the control transitions between the hypervisor and VMs, constitute the key source of performance interference. In order to characterize the performance interference effects, we measure both the application-level and VM-level characteristics from the collocated applications and then build a novel interference prediction framework based on kernel canonical correlation analysis. Our evaluations first show the practicability of KCCA in finding reliable correlation, and further confirm the high accuracy and great applicability of our interference model with a low prediction error of no more than 7.9%.

关键词： performance interference cloud computing Xen

来源：评论

学校读者我要写书评

暂无评论

On realistic divisible load scheduling in highly heterogeneous distributed systems

On realistic divisible load scheduling in highly heterogeneo...

引用

20th Euromicro international conference on parallel, distributed and Network-Based Processing, PDP 2012

作者： Ilic, Aleksandar Sousa, Leonel INESC-ID IST/UTLisbon Rua Alves Redol 9 1000-029 Lisbon Portugal

ISBN: (纸本)9780769546339

this paper investigates the problem of scheduling discretely divisible applications in highly heterogeneous distributed platforms which deploy modern desktop systems with limited memory as computing nodes. We propose an algorithm for hierarchical load balancing at both interand intra-node platform levels which relies on realistic performance models of computation and communication resources. An iterative procedure, based on the proposed algorithm, is also presented for building accurate performance models during the application run-time. the presented approach was evaluated for a 2D FFT batch application executed on a distributed system with four CPU+GPU nodes. the experimental results show the advantages of using the proposed approach by outperforming the "optimal" implementation by at least 4 times on GPU devices. © 2012 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

FPGA-accelerated delet ion-tolerant coding for reliable distributed storage

引用

20th international conference on Architecture of computing systems

作者： Sobe, Peter Hampel, Volker Univ Lubeck Inst Comp Engn Lubeck Germany

ISBN: (纸本)9783540712671

distributed storage systems often have to guarantee data availability despite of failures or temporal downtimes of storage nodes. For this purpose, a deletion-tolerant code is applied that allows to reconstruct missing parts in a codeword, i.e. to tolerate a distinct number of failures. the Reed/Solomon (R/S) code is the most general deletiontolerant code and can be adapted to a required number of tolerable failures. In terms of its least information overhead, R/S is optimal, but it consumes significantly more computation power than parity-based codes. Reconfigurable hardware can be employed for particular operations in finite fields for R/S coding by specialized arithmetics, so that the higher computation effort is compensated by faster and parallel operations. We present architectures for an application-specific acceleration by FPGAs. In this paper, strategies for an efficient communication with the accelerating FPGA and a performance comparison between a pure software-based solution and the accelerated system are provided.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

Accelerating HPCG on Tianhe-2: A Hybrid CPU-MIC Algorithm 20

Accelerating HPCG on Tianhe-2: A Hybrid CPU-MIC Algorithm

引用

20th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Liu, Yiqun Zhang, Xianyi Yang, Chao Liu, Fangfang Lu, Yutong Chinese Acad Sci Inst Software Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Chinese Acad Sci State Key Lab Comp Sci Beijing 100190 Peoples R China Natl Univ Def Technol Dept Comp Sci & Technol Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781479976157

In this paper, we propose a hybrid algorithm to enable and accelerate the High Performance Conjugate Gradient (HPCG) benchmark on a heterogeneous node with an arbitrary number of accelerators. In the hybrid algorithm, each subdomain is assigned to a node after a three-dimensional domain decomposition. the subdomain is further divided to several regular inner blocks and an outer part with a flexible inner-outer partitioning strategy. Each inner task is assigned to a MIC device and the size is adjustable to adapt the accelerator's computational power. the only outer part is assigned to CPU and the thickness of boundary size is also adjustable to maintain load balance between CPU and MICs. By properly fusing the computational kernels with preceding ones, we present an asynchronous data transfer scheme to better overlap local computation with the PCI-express data transfer. All basic HPCG kernels, especially the time-consuming sparse matrix-vector multiplication (SpMV) and the symmetric Gauss-Seidel relaxation (SymGS), are extensively optimized for both CPU and MIC, on both algorithmic and architectural levels. On a single node of Tianhe-2 which is composed of an Intel Xeon processor and three Intel Xeon Phi coprocessors, we successfully obtain an aggregated performance of 50.2 Gflops, which is around 1.5% of the peak performance.

关键词： HPCG Conjugate Gradient Multigrid V-cycle Red-black symmetric Gauss-Seidel Heterogeneous computing

来源：评论

学校读者我要写书评

暂无评论

ATLAS distributed computing Operation Shift Teams experience during the discovery year and beginning of the Long Shutdown 1

ATLAS Distributed Computing Operation Shift Teams experience...

引用

20th international conference on computing in High Energy and Nuclear Physics (CHEP)

作者： Sedov, Alexey Di Girolamo, Alessandro Negri, Guidone Sakamoto, Hiroshi Schovancova, Jaroslava Smirnov, Iouri Vartapetian, Armen Yu, Jaehoon Univ Autonoma Barcelona Port Informacio Cient Edifici D Bellaterra 08193 Barcelona Spain Univ Autonoma Barcelona Inst Fis Altes Energies IFAE Bellaterra 08193 Barcelona Spain CERN Geneva 23 Switzerland Univ Tokyo Int Ctr Elementary Particle Phys & Dept Phys Tokyo 1130033 Japan Brookhaven Natl Lab Phys Dept Upton NY 11973 USA Univ Texas Arlington Dept Phys Arlington TX 76019 USA

ATLAS distributed computing Operation Shifts evolve to meet new requirements. New monitoring tools as well as operational changes lead to modifications in organization of shifts. In this paper we describe the structure of shifts, the roles of different shifts in ATLAS computing grid operation, the influence of a Higgs-like particle discovery on shift operation, the achievements in monitoring and automation that allowed extra focus on the experiment priority tasks, and the influence of the Long Shutdown 1 and operational changes related to the no beam period.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：