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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

140 篇 会议
51 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

102 篇 工学
- 81 篇 计算机科学与技术...
- 45 篇 软件工程
- 15 篇 电子科学与技术（可...
- 9 篇 信息与通信工程
- 7 篇 电气工程
- 7 篇 控制科学与工程
- 7 篇 化学工程与技术
- 5 篇 机械工程
- 5 篇 动力工程及工程热...
- 3 篇 材料科学与工程（可...
- 3 篇 土木工程
- 3 篇 安全科学与工程
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 冶金工程
- 2 篇 交通运输工程
- 2 篇 环境科学与工程（可...
- 2 篇 生物工程
71 篇 理学
- 41 篇 数学
- 30 篇 物理学
- 22 篇 化学
- 19 篇 统计学（可授理学、...
- 10 篇 系统科学
- 2 篇 天文学
- 2 篇 生物学
20 篇 管理学
- 16 篇 管理科学与工程(可...
- 10 篇 工商管理
- 4 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学

主题

29 篇 parallel process...
22 篇 quality of servi...
15 篇 runtime
15 篇 grid computing
14 篇 resource managem...
13 篇 computer archite...
12 篇 hardware
11 篇 field programmab...
10 篇 concurrent compu...
10 篇 field programmab...
9 篇 fault tolerance
9 篇 processor schedu...
8 篇 electronic struc...
8 篇 risk management
7 篇 computational mo...
7 篇 high performance...
7 篇 business
6 篇 metacomputing
6 篇 kernel
6 篇 middleware

机构

16 篇 paderborn center...
16 篇 paderborn center...
10 篇 paderborn center...
10 篇 paderborn center...
9 篇 paderborn center...
7 篇 paderborn center...
6 篇 technische unive...
6 篇 paderborn center...
5 篇 department chemi...
5 篇 paderborn center...
5 篇 paderborn center...
4 篇 university of pa...
4 篇 department of co...
4 篇 paderborn center...
4 篇 computer enginee...
4 篇 paderborn univer...
3 篇 institut für the...
3 篇 institut für the...
3 篇 department für c...
3 篇 fakultät für phy...

作者

27 篇 christian plessl
27 篇 plessl christian
18 篇 kühne thomas d.
17 篇 brinkmann andré
11 篇 kenter tobias
10 篇 andre brinkmann
9 篇 schade robert
9 篇 lass michael
8 篇 kerstin voss
8 篇 shu hai-tao
8 篇 mazur lukas
8 篇 birkenheuer geor...
8 篇 tobias kenter
7 篇 axel keller
7 篇 altenkort luis
7 篇 odej kao
6 篇 wierum jens-mich...
6 篇 kaczmarek olaf
6 篇 krüger jens
6 篇 matthias hovesta...

语言

189 篇 英文
2 篇 其他

检索条件"机构=Paderborn Center for Parallel Computing"

共 191 条记录，以下是21-30 订阅

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

详细简洁

排序：

Reliability analysis of declustered-parity RAID 6 with disk scrubbing and considering Irrecoverable Read Errors

Reliability analysis of declustered-parity RAID 6 with disk ...

引用

5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010

作者： Gao, Yan Meister, Dirk Brinkmann, André University of Paderborn Paderborn Center for Parallel Computing Fuerstenallee 11 33102 Paderborn Germany

ISBN: (纸本)9780769541341

We investigate the impact of Irrecoverable Read Errors (IREs) on Mean Time To Data Loss (MTTDL) of declustered-parity RAID 6 systems. By extending the analytic model to study the reliability of RAID 5 systems from [1] we obtain the MTTDL which mainly takes into account two types of data loss: data loss caused by three independent disk failures, and data loss due to a detected IRE during the rebuild after two disks failed. Furthermore we improve the analysis by also considering disk scrubbing to reduce the probability of IREs via periodically reading the data stored on a disk. The results of our numerical analysis show that IREs have a large effect on the MTTDL. The countermeasure is to increase the disk scrubbing rate. As an example, the MTTDL of a system where each disk is scrubbed everyday increases by a factor of at least 27 compared to that of a system with a scrubbing rate of once a year. In addition, declustered-parity RAID 6 system improves the reliability of standard non-declustered RAID 6 systems. For example, a declustered-parity RAID 6 system without disk scrubbing improves the MTTDLs by a factor at least 150 compared to that of a standard system where each disk is scrubbed everyday. © 2010 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Comparing fault tolerance mechanisms for self-organizing resource management in grids

Comparing fault tolerance mechanisms for self-organizing res...

引用

3rd International Conference on Semantics, Knowledge, and Grid, SKG 2007

作者： Voss, Kerstin University of Paderborn Paderborn Center for Parallel Computing Fuerstenallee 11 33102 Paderborn Germany

ISBN: (纸本)0769530079

Grid users require the established usage of service level agreements (SLAs). To prevent SLA violations in the case of failures, current research focuses on the development of fault-tolerance (FT-) mechanisms like migration. My new approach integrates risk assessment into the Grid fabric in order to estimate the risk for resource failures. In systems with high workload the initiation of a FT-mechanism causes effects for other jobs. In order to find the most profitable solution, the different effects have to be estimated and compared. This paper presents an automatic process for the comparison and selection of a FT-mechanism in a riskaware, self-organizing resource management system which takes into account different resource stabilities. © 2007 IEEE.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Hierarchical video-on-demand servers for TV-anytime services 8

Hierarchical video-on-demand servers for TV-anytime services

引用

8th International Conference on Computer Communications and Networks, ICCCN 1999

作者： Lüling, Reinhard Paderborn Center for Parallel Computing - PC2 University of Paderborn Germany

ISBN: (纸本)0780357949

This paper presents algorithms and principles for the implementation of a novel broadband multimedia service called "TV-anytime". The basic idea of this service is to store broadcast media assets on media server systems and allow people to access this information at any time. Using a given user profile the recording of media assets can be personalized allowing the implementation of "personal TV" in this way. Within this paper we present the basic mechanisms for the implementation of TV-anytime services on an hierarchical network of media servers. The basic question of how to handle and manage the broadband media assets on such a hierarchical network of media servers is addressed in this paper. We present methods that take up concepts from a graph for the mangement of media assets and verify these methods using sample applications. The results show that the methods provide near to optimal performance in terms of the "quality of service" for the TV-daytime scenario. © 1999 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

The self-tuning dynP job-scheduler 16

The self-tuning dynP job-scheduler

引用

16th International parallel and Distributed Processing Symposium, IPDPS 2002

作者： Streit, A. PC2 - Paderborn Center for Parallel Computing Paderborn University Paderborn33102 Germany

ISBN: (纸本)0769515738

In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The performance of the used scheduling policies (e.g. FCFS, SJF, LJF) depends on the characteristics of the queued jobs. Hence we developed the dynP scheduler family. The basic idea was to change between different scheduling policies during runtime. The basic dynP scheduler uses the average estimated runtime of all queued jobs together with two input parameters to decide when a policy change may be benefical. A disadvantage is that the performance of the basic dynP scheduler strongly depends on the right setting of the two input parameters. Therefore we present the self-tuning dynP scheduler, which is totally independent from any parameter values. The basic concept is that the self-tuning dynP scheduler computes the full (virtual) schedule for each of the three policies in every scheduling step. Each computed schedule is rated by a criterion. Then the scheduler switches to that policy which generated the best schedule for the currently queued jobs. In this paper we are using simulations with trace based job sets to evaluate the performance of the scheduler. The achieved results are reasonably good compared to the parameterized dynP variant and the basic policies FCFS, SJF, and LJF. © 2002 IEEE.

关键词： evaluation HPC-cluster job-scheduling self-tuning simulation

来源：评论

学校读者我要写书评

暂无评论

Convey vector personalities - FPGA acceleration with an OpenMP-like programming effort?

Convey vector personalities - FPGA acceleration with an Open...

引用

22nd International Conference on Field Programmable Logic and Applications, FPL 2012

作者： Meyer, Björn Schumacher, Jörn Plessl, Christian Förstner, Jens Paderborn Center for Parallel Computing University of Paderborn Germany Department of Physics University of Paderborn Germany

ISBN: (纸本)9781467322560

Although the benefits of FPGAs for accelerating scientific codes are widely acknowledged, the use of FPGA accelerators in scientific computing is not widespread because reaping these benefits requires knowledge of hardware design methods and tools that is typically not available with domain scientists. A promising but hardly investigated approach is to develop tool flows that keep the common languages for scientific code (C,C++, and Fortran) and allow the developer to augment the source code with OpenMP-like directives for instructing the compiler which parts of the application shall be offloaded the FPGA accelerator. In this work we study whether the promise of effective FPGA acceleration with an OpenMP-like programming effort can actually be held. Our target system is the Convey HC-1 reconfigurable computer for which an OpenMP-like programming environment exists. As case study we use an application from computational nanophotonics. Our results show that a developer without previous FPGA experience could create an FPGA-accelerated application that is competitive to an optimized OpenMP-parallelized CPU version running on a two socket quad-core server. Finally, we discuss our experiences with this tool flow and the Convey HC-1 from a productivity and economic point of view. © 2012 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

parallel refinement of tetrahedral meshes on distributed-memory machines

Parallel refinement of tetrahedral meshes on distributed-mem...

引用

IASTED International Conference on parallel and Distributed computing and Networks, as part of the 23rd IASTED International Multi-Conference on Applied Informatics

作者： Blazy, Stephan Marquardt, Oliver Paderborn Center for Parallel Computing Paderborn University Fürstenallee 11 33102 Paderborn Germany

In this paper we present a scalable parallel refinement algorithm for tetrahedral meshes which is based on a regular refinement strategy with closure tetrahedra. This algorithm works efficiently on distributed-memory machines. We focus on the parallel implementation of the boundary updates of each mesh partition. Additionally we show that it is sufficient to exchange only boundary edge information between neighboring mesh partitions to obtain a conforming distributed three-dimensional tetrahedral mesh. The algorithm is implemented using the padfem2 framework.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Graph partitioning in scientific simulations: Multilevel schemes versus space-filling curves

引用

7th International Conference on parallel computing Technologies, PaCT 2003

作者： Schamberger, Stefan Wierum, Jens-Michael University of Paderborn Germany Paderborn Center for Parallel Computing Germany

ISBN: (纸本)3540406735

Using space-filling curves to partition unstructured finite element meshes is a widely applied strategy when it comes to distributing load among several computation nodes. Compared to more elaborated graph partitioning packages, this geometric approach is relatively easy to implement and very fast. However, results are not expected to be as good as those of the latter, but no detailed comparison has ever been published. In this paper we will present results of our experiments comparing the quality of partitionings computed with different types of space-filling curves to those generated with the graph partitioning package Metis. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Architecture-independent request-scheduling with tight waiting-time estimations 2nd

Architecture-independent request-scheduling with tight waiti...

引用

2nd Workshop on Job Scheduling Strategies for parallel Processing, IPPS 1996

作者： Gehring, Jörn Ramme, Friedhelm Paderborn Center for Parallel Computing University of Paderborn Fürstenallee 11 Paderborn33102 Germany

ISBN: (纸本)3540618643

In the course of the last few years, the user's interaction with parallel computer-systems has changed. A continuous growth in the number of interactive HPC-applications can be observed. When considering partitionable MPP-systems with exclusive usage of the physically separated regions, issues like the average waiting-time become more dominant for the users than the total system-throughput. In this paper, we focus on the problem of scheduling an arbitrary mixture of resource-requests for batch and interactive applications in an architecture-independent manner. To help users plan their daily work tight waiting-time estimations are indispensable. However, the resulting scheduling problem interferes with the problem of mapping requests onto certain MPP-architectures to reduce their internal fragmentations. We will show that this conflict can be alleviated by a distributed proververifier methodology. At first, we will introduce the distributed resourcemanagement software CCS with its architecture-independent scheduling method. The message-based approach presented is used to verify the pre-calculated schedules with help of the system-dependent mapping instances. Simulations with the accounting data of our center have shown that tight waiting-time estimations can be made while the architectureindependent scheduling approach is still preserved. We will show that by using this methodology the mean error-value of the predicted waitingtime can be reduced by 76 %. Finally, we will discuss the impact of such a distributed resource-management system on the metacomputing challenge. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

On job scheduling for HPC-clusters and the dynP scheduler 8th

引用

8th International Conference on High Performance computing, HiPC 2001

作者： Streit, Achim PC2- Paderborn Center for Parallel Computing Paderborn33102 Germany

ISBN: (纸本)3540430091

Efficient job-scheduling strategies are important to improve the performance and usability of HPC-clusters. In this paper we evaluate job-scheduling strategies (FCFS, SJF, and LJF) used in the resource management system CCS (computing center Software). As input for our simulations we use two job sets that are generated from trace files of CCS. Based on the evaluation we introduce the dynP scheduler which combines the three scheduling strategies and dynamically changes between them online. The average estimated runtime of jobs in the waiting queue and two bounds are used as the criterion whether or not dynP switches to a new policy. Obviously the performance of dynP depends on the setting of the two bounds. Diverse parameter pairs were evaluated, and with the proper setting dynP achieves an equal or even better (+9%) performance. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Introducing risk management into the grid

Introducing risk management into the grid

引用

e-Science 2006 - 2nd IEEE International Conference on e-Science and Grid computing

作者： Djemame, Karim Gourlay, Iain Padgett, James Birkenheuer, Georg Hovestadt, Matthias Kao, Odej Voß, Kerstin School of Computing University of Leeds United Kingdom Paderborn Center for Parallel Computing University of Paderborn Germany

ISBN: (纸本)0769527345

Service Level Agreements (SLAs) are explicit statements about all expectations and obligations in the business partnership between customers and providers. They have been introduced in Grid computing to overcome the best effort approach, making the Grid more interesting for commercial applications. However, decisions on negotiation and system management still rely on static approaches, not reflecting the risk linked with decisions. The EC-funded project "AssessGrid" aims at introducing risk assessment and management as a novel decision paradigm into Grid computing. This paper gives a general motivation for risk management and presents the envisaged architecture of a "risk-aware" Grid middleware and Grid fabric, highlighting its functionality by means of three showcase scenarios. © 2006 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：