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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

25 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

14 篇 工学
- 12 篇 计算机科学与技术...
- 6 篇 软件工程
- 2 篇 信息与通信工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 网络空间安全
6 篇 理学
- 4 篇 数学
- 2 篇 系统科学
- 1 篇 统计学（可授理学、...
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...

主题

8 篇 parallel process...
7 篇 grid computing
6 篇 quality of servi...
5 篇 resource managem...
3 篇 runtime
3 篇 computer archite...
3 篇 middleware
2 篇 application soft...
2 篇 metacomputing
2 篇 redundancy
2 篇 bandwidth
2 篇 energy consumpti...
2 篇 processor schedu...
2 篇 computational mo...
2 篇 context-aware se...
2 篇 distributed comp...
2 篇 virtual machinin...
2 篇 delay
1 篇 computer science
1 篇 probability dens...

机构

3 篇 paderborn center...
2 篇 heinz nixdorf in...
2 篇 paderborn center...
2 篇 paderborn center...
2 篇 faculty of compu...
2 篇 paderborn center...
1 篇 pc2-paderborn ce...
1 篇 paderborn center...
1 篇 wyant college of...
1 篇 paderborn center...
1 篇 department of co...
1 篇 department of co...
1 篇 sni - siemens ni...
1 篇 paderborn center...
1 篇 technische unive...
1 篇 paderborn center...
1 篇 pc2 - paderborn ...
1 篇 paderborn center...
1 篇 cnuce institute ...
1 篇 institute for ph...

作者

3 篇 o. kao
3 篇 wierum jens-mich...
3 篇 andre brinkmann
3 篇 simon jens
3 篇 m. hovestadt
2 篇 georg birkenheue...
2 篇 matthias grawink...
2 篇 brinkmann andré
2 篇 streit achim
2 篇 b. linnert
2 篇 l.-o. burchard
2 篇 a. streit
2 篇 a. keller
2 篇 odej kao
1 篇 michael sievers
1 篇 jan wingenbach
1 篇 matthias bolte
1 篇 axel keller
1 篇 baraglia r.
1 篇 markus pargmann

语言

27 篇 英文

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

共 27 条记录，以下是11-20 订阅

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

详细简洁

排序：

Fault Tolerance Mechanisms for SLA-aware Resource Management

Fault Tolerance Mechanisms for SLA-aware Resource Management

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： M. Hovestadt Paderborn Center for Parallel Computing (PC2) Universität Paderborn Germany

Future grid systems will demand for properties like runtime responsibility, predictability, and a guaranteed service quality level. In this context, service level agreements have central importance. Many ongoing research projects already focus on the realization of required mechanisms at grid middleware layer. However, only concentrating on grid middleware is not enough. Also the underlying resource management systems have to provide an increased QoS level, since they provide their resources to grid environments. The EU-funded project Hpc4U aims at realizing an SLA-aware resource management system. It allows the grid user to negotiate on SLAs, assuring the adherence with agreed SLAs by means of application-transparent checkpointing, snapshotting, and migration

关键词： Fault tolerance Resource management Middleware Quality of service Checkpointing Runtime Context-aware services Grid computing Business parallel processing

来源：评论

学校读者我要写书评

暂无评论

A quality-of-service architecture for future grid computing applications

A quality-of-service architecture for future grid computing ...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： L.-O. Burchard B. Linnert F. Heine M. Hovestadt O. Kao A. Keller Faculty of Computer Science and Electrical Engineering Technische Universität Berlin Germany Paderborn Center for Parallel Computing (PC2) Universität Paderborn Germany

The next generation grid applications demand grid middleware for a flexible negotiation mechanism supporting various ways of quality-of-service (QoS) guarantees. In this context, a QoS guarantee covers simultaneous allocations of various kinds of different resources, such as processor runtime, storage capacity, or network bandwidth, which are specified in the form of service level agreements (SLA). Currently, a gap exists between the capabilities of grid middleware and the underlying resource management systems concerning their support for QoS and SLA negotiation. In this paper we present an approach which closes this gap. Introducing the architecture of the virtual resource manager, we highlight its main QoS management features like run-time responsibility, co-allocation, and fault tolerance.

关键词： Quality of service Computer architecture Grid computing Middleware Resource management Application software Context-aware services Runtime Bandwidth Usability

来源：评论

学校读者我要写书评

暂无评论

Evaluation of an unfair decider mechanism for the self-tuning dynP job scheduler

Evaluation of an unfair decider mechanism for the self-tunin...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

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

Summary form only given. We present a new decider mechanism for the self-tuning dynP job scheduler for modern resource management systems. This scheduler switches the active scheduling policy dynamically during run time, in order to reject changing characteristics of waiting jobs. The new decider explicitly prefers a single scheduling policy instead of being fair to all available policies. We use discrete event simulations to evaluate the achieved slowdown and utilization and compare the results with the fair decider mechanism and the static basic scheduling policies. The evaluation shows that the self-tuning dynP scheduler in combination with the preferred decider achieves good results and that it is superior to common static scheduling approaches, which use only a single policy.

关键词： Processor scheduling Resource management Dynamic scheduling Delay parallel processing Switches Discrete event simulation High performance computing Costs Testing

来源：评论

学校读者我要写书评

暂无评论

The virtual resource manager: an architecture for SLA-aware resource management 04

The virtual resource manager: an architecture for SLA-aware ...

引用

IEEE/ACM International Symposium on Cluster computing and the Grid (CCGRID)

作者： L.-O. Burchard M. Hovestadt O. Kao A. Keller B. Linnert Faculty of Computer Science and Electrical Engineering Technische Universität Berlin Germany Paderbom Center of Parallel Computing (PC2) Universitat Paderborn Germany

ISBN: (纸本)9780780384309

The next generation Grid will demand the Grid middleware to provide flexibility, transparency, and reliability. This implies the appliance of service level agreements to guarantee a negotiated level of quality of service. These requirements also affect the local resource management systems providing resources for the Grid. At this a gap between these demands and the features of today's resource management systems becomes apparent. In this paper we present an approach which closes this gap. Introducing the architecture of the virtual resource manager we highlight its main features of runtime responsibility, resource virtualization, information hiding, autonomy provision, and smooth integration of existing resource management system installations.

关键词： Resource management Computer architecture Middleware Grid computing Resource virtualization Quality of service Computer network management Computer science parallel processing Home appliances

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On the quality of partitions based on space-filling curves

引用

International Conference on Computational Science, ICCS 2002

作者： Hungershöfer, Jan Wierum, Jens-Michael Paderborn Center for Parallel Computing PC2 Fürstenallee 11 Paderborn33102 Germany

ISBN: (纸本)3540435948

This paper presents bounds on the quality of partitions induced by space-filling curves. We compare the surface that surrounds an arbitrary index range with the optimal partition in the grid, i. e. the square. It is shown that partitions induced by Lebesgue and Hilbert curves behave about 1.85 times worse with respect to the length of the surface. The Lebesgue indexing gives better results than the Hilbert indexing in worst case analysis. Furthermore, the surface of partitions based on the Lebesgue indexing are at most (formula presented) times larger than the optimal in average case. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

On advantages of grid computing for parallel job scheduling

On advantages of grid computing for parallel job scheduling

引用

2nd IEEE/ACM International Symposium on Cluster computing and the Grid, CCGrid 2002

作者： Ernemann, Carsten Hamscher, Volker Schwiegelshohn, Uwe Yahyapour, Ramin Streit, Achim Computer Engineering Institute University Dortmund 44221 Dortmund Germany PC2 - Paderborn Center for Parallel Computing 33102 Paderborn Germany

ISBN: (纸本)0769515827

This paper addresses the potential benefit of sharing jobs between independent sites in a grid computing environment. Also the aspect of parallel multi-site job execution on different sites is discussed. To this end, various scheduling algorithms have been simulated for several machine configurations with different workloads which have been derived from real traces. The results showed that a significant improvement in terms of a smaller average response time is achievable. The usage of multi-site applications can additionally improve the results as long as the increase of the execution time due to communication overhead is limited to about 25%. © 2002 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

On Advantages of Grid computing for parallel Job Scheduling 02

On Advantages of Grid Computing for Parallel Job Scheduling

引用

IEEE/ACM International Symposium on Cluster computing and the Grid (CCGRID)

作者： C. Ernemann V. Hamscher U. Schwiegelshohn R. Yahyapour A. Streit Computer Engineering Institute University of Dortmund Dortmund Germany PC2-Paderborn Center for Parallel Computing Paderborn Germany

ISBN: (纸本)9780769515823

关键词： Grid computing Processor scheduling Delay Distributed computing Concurrent computing Electronic switching systems Computational modeling Application software Metacomputing parallel processing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Solving a media mapping problem in a hierarchical server network with parallel simulated annealing

Solving a media mapping problem in a hierarchical server net...

引用

International Conference on parallel Processing (ICPP)

作者： Xiaobo Zhou R. Luling Li Xie Paderborn Center for Parallel Computing (PC2) University of Paderborn Paderborn Germany Department of Computer Science Nanjing University Nanjing China

Advances in storage and high-speed broadband communication network technologies are making it feasible to design and implement distributed scalable video-on-demand server networks. In this paper a hierarchical structure for a server network is proposed to support a metropolitan TV-Anytime service. A key issue, how to map the media assets onto such a hierarchical server network, is addressed in this paper. The definition and heuristic methods for the solution of this new combinatorial optimization problem are presented. The mapping problem studied here addresses the management of media assets taking the storage capacity, communication bandwidth limitation and access pattern into account. The methods presented in this paper are based on parallel simulated annealing and are verified by the use of a set of benchmark instances. The results show that the methods provide a near to optimal performance in terms of the Quality of Service (QoS).

关键词： Intelligent networks Network servers Simulated annealing Streaming media Bandwidth Quality of service Computational modeling parallel processing Multimedia systems Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共3页 << < 1 2 3 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：